Journal article · 2026 · Open access

No-go theorems for sublinear-depth group designs

Maxwell West, Diego García-Martín, N. L. Diaz, M. Cerezo, Martin Larocca

Nature Communications, 17(1) · Published 2 November 2026 · DOI 10.1038/s41467-026-77778-5

Open PDFView at the publisherCite this paper

In brief

“No-go theorems for sublinear-depth group designs” is a 2026 journal article by Maxwell West and 4 co-authors, published in Nature Communications. OpenAlex counts 19 citations as of 17 November 2026, which puts it in the top 3% of works published in 2026 by citations. It is open access under a CC BY-NC-ND licence: the full text is free to read at Nature Communications.

Citations
19
Most cited in
2026 (14)
Field-weighted impact
19.53
References
72
Authors
5

Abstract

Constructing ensembles of circuits which efficiently approximate the Haar measure over various groups is a fundamental problem in quantum information theory, with breakthrough recent results showing that for the unitary group this can be achieved with depths scaling logarithmically in the system size. Here we prove that, for groups G possessing an invariant state $${G}^{\otimes k}\left\vert \Psi \right\rangle=\left\vert \Psi \right\rangle$$ satisfying certain conditions on its entanglement structure, no subset of G consisting of sublinear-depth one-dimensional circuits with constant-locality gates can form an approximate k-design over G. More generally, on a D-dimensional lattice of side-length n, our results imply that such group designs require depths scaling at least as n1/D. Among other examples, we show that there is a constant separation between the maximum depth and gate counts for which no circuit can approximate even the second moment of random matchgate circuits, and those required to implement the matchgate Haar distribution exactly. Finally, we relax the assumption of working with local gates, and prove the impossibility of obtaining approximate designs over G using any circuit comprised of a sublinear number of gates generated by Pauli strings. Significant effort has been spent to find low-depth constructions of random unitaries that appear Haar-random to a restricted observer, and earlier works showed logarithmic-depth approximate designs over the full unitary group using local random circuits. In this paper, the authors provide a general criterion ruling out shallow designs on a wide variety of groups.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

West, M., García-Martín, D., Diaz, N. L., Cerezo, M., & Larocca, M. (2026). No-go theorems for sublinear-depth group designs. Nature Communications, 17(1). https://doi.org/10.1038/s41467-026-77778-5

MLA 9

West, Maxwell, et al. “No-go theorems for sublinear-depth group designs.” Nature Communications, vol. 17, no. 1, 2026. https://doi.org/10.1038/s41467-026-77778-5.

Chicago

West, Maxwell, Diego García-Martín, N. L. Diaz, M. Cerezo, and Martin Larocca. 2026. “No-go theorems for sublinear-depth group designs.” Nature Communications 17 (1). https://doi.org/10.1038/s41467-026-77778-5.

Harvard

West, M. et al. (2026) ‘No-go theorems for sublinear-depth group designs’, Nature Communications, 17(1). doi:10.1038/s41467-026-77778-5.

IEEE

M. West, D. García-Martín, N. L. Diaz, M. Cerezo, and M. Larocca, “No-go theorems for sublinear-depth group designs,” Nature Communications, vol. 17, no. 1, 2026, doi: 10.1038/s41467-026-77778-5.

BibTeX

@article{west2026theorems,
  title     = {{No-go theorems for sublinear-depth group designs}},
  author    = {West, Maxwell and García-Martín, Diego and Diaz, N. L. and Cerezo, M. and Larocca, Martin},
  journal   = {Nature Communications},
  year      = {2026},
  volume    = {17},
  number    = {1},
  doi       = {10.1038/s41467-026-77778-5},
  url       = {https://doi.org/10.1038/s41467-026-77778-5}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture

  • Haar measure
  • no-go theorem
  • Pauli strings
  • entanglement structure
  • circuit depth lower bounds
  • quantum circuit design

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

West, M., García-Martín, D., Diaz, N. L., Cerezo, M., & Larocca, M. (2026). No-go theorems for sublinear-depth group designs. Nature Communications, 17(1). https://doi.org/10.1038/s41467-026-77778-5

How many times has this paper been cited?

19 times, according to OpenAlex on 17 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at Nature Communications: sign in and open the PDF from this page.

Who wrote this paper?

Maxwell West, Diego García-Martín, N. L. Diaz, M. Cerezo, Martin Larocca.

What is the DOI of this paper?

10.1038/s41467-026-77778-5, permanently at https://doi.org/10.1038/s41467-026-77778-5. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 17 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.