pith. sign in

arxiv: 2605.21570 · v1 · pith:NY3GUMWQnew · submitted 2026-05-20 · 🪐 quant-ph

Quantum Purity Amplification for Arbitrary Eigenstates and Multiple Outputs

Zhaoyi Li , Elias Theil , Aram W. Harrow , Isaac Chuang This is my paper

Pith reviewed 2026-05-22 09:31 UTC · model grok-4.3

classification 🪐 quant-ph
keywords quantum purity amplificationquantum channel optimizationsample complexityeigenstate purificationdimension-independent scalingYoung diagramsasymptotic regimes
4
0 comments X

The pith

Quantum purity amplification from n mixed copies to m high-fidelity eigenstate copies works with input count independent of local dimension when the target eigenvalue has a fixed gap.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper solves the general quantum purity amplification task of turning n copies of a mixed state into m high-fidelity copies of one chosen eigenstate. It gives the optimal channel and exact performance laws for all-site and one-site fidelity across different output numbers. When the chosen eigenvalue is separated by a constant gap from the rest of the spectrum, the number of input copies needed for small error scales only with m over that gap squared and stays independent of the local dimension. The same analysis identifies phase-like regimes when the ratio of outputs to inputs stays constant. Non-asymptotic bounds come from a new theory of generalized Young diagrams that supplies the first dimension-uniform sample-complexity guarantee.

Core claim

We solve QPA in the general setting of n input copies, m output copies, arbitrary target eigenstates, arbitrary local dimension d, and generic input spectra. We characterize the optimal channel and derive its all-site and one-site performance laws across output regimes. For the asymptotic analysis, we use a path-graph parametrization to show that, when the target eigenvalue has a constant spectral gap D_{k,min}, achieving all-site error ε requires a number of input copies independent of d and scaling as O(m/(ε D_{k,min}^2)). When m/n approaches a constant, the performance exhibits phase-like regimes, which we characterize explicitly. For the nonasymptotic analysis, we develop a theory of the

What carries the argument

The optimal quantum channel for QPA, characterized via path-graph parametrization for asymptotics and generalized Young diagrams for finite-copy bounds.

If this is right

  • All-site fidelity error falls as 1/n when m is fixed and the gap is constant.
  • When m scales linearly with n the protocol enters distinct performance phases that can be read off from the eigenvalue ordering.
  • The optimal channel admits asymptotically efficient implementations whose gate count grows only with the number of copies.
  • The dimension-uniform bound supplies the technical basis for separating coherent and incoherent information processing tasks.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same channel construction may apply to purifying states in many-body systems where local dimension is large but spectral gaps remain fixed.
  • Testing the phase boundaries experimentally would require preparing input spectra with controlled eigenvalue spacings and measuring output fidelity scaling.
  • If the generalized Young diagram bounds remain tight under realistic noise, QPA could serve as a primitive for coherent quantum error correction with modest overhead.

Load-bearing premise

The analysis assumes that the path-graph parametrization exactly captures the optimal channel for constant spectral gap and that the generalized Young diagrams give tight bounds without hidden implementation dependencies.

What would settle it

Compute the minimal number of input copies needed to reach all-site error 0.01 for a qubit mixed state with eigenvalue gap 0.1 and m=10 outputs; compare the measured scaling against the predicted O(m/(ε D^2)) independent of d=2.

Figures

Figures reproduced from arXiv: 2605.21570 by Aram W. Harrow, Elias Theil, Isaac Chuang, Zhaoyi Li.

Figure 1
Figure 1. Figure 1: Illustration of the general QPA task for the [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Schematic diagram of the general QPA proto [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Illustration of the overhang removal rule. [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: (a) All-site QPA fidelities (Eq. (12)) for k = 1; (b) One-site QPA fidelities (Eq. (15)) for k = 1; (c) All-site QPA phase diagrams (Eq. (12)) for k = 2; (d) input spectrum p ˙=(p1, . . . , p4) used throughout panels (a)–(e); (e) one-site QPA phase diagram (Eq. (15)) for k = 2. Different colors correspond to different noise parameters λ. For (a), (b), (c), and (e), dashed separators indicate QPA phase boun… view at source ↗
Figure 5
Figure 5. Figure 5: Edge cases for the overhang removal rule. [PITH_FULL_IMAGE:figures/full_fig_p007_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Circuit diagrams for the general QPA protocol. [PITH_FULL_IMAGE:figures/full_fig_p007_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Example WT parametrization for d = 5, k = 2, and [ς] ˙=[7, 5, 3, 1, 0]. (a) The lowest-weight WT {lwσ}. (b) An arbitrary WT {w} together with its deviation variables ti,j . For an arbitrary WT {w}, we parametrize its devia￾tion from {lwσ}. Changing an entry i to an entry j con￾tributes the relative factor qj/qi . For 1 ≤ i < j ≤ d − 1 or 1 ≤ i < k, j = d we set ti,j := #j,i({w}), ri,j := qj qi . (36) The d… view at source ↗
Figure 8
Figure 8. Figure 8: Tensor network diagram illustrating the intertwiner connecting two sides of Eq. (59), F  [µ] [m − 1] [1] [ς − ei ] (1 · · · m) [ς]  I [ς] , where each split corresponds to an intertwining isometry. By Eq. (8), the marginal channel is obtained by first applying the intertwiners and then tracing out the factor W[µ] ⊗ W[m−1]. In this decomposition, that trace is equivalent to tracing out each W[ς−ei] compon… view at source ↗
Figure 9
Figure 9. Figure 9: Path-graph illustration for the GT-pattern [PITH_FULL_IMAGE:figures/full_fig_p012_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: gYDs and gWTs with constraints in the proof outline. (a) A gYD [ [PITH_FULL_IMAGE:figures/full_fig_p013_10.png] view at source ↗
read the original abstract

Quantum purity amplification (QPA) is the task of coherently transforming $n$ copies of a mixed state into high-fidelity copies of a chosen eigenstate. We solve QPA in the general setting of $n$ input copies, $m$ output copies, arbitrary target eigenstates, arbitrary local dimension $d$, and generic input spectra. We characterize the optimal channel and derive its all-site and one-site performance laws across output regimes. For the asymptotic analysis, we use a path-graph parametrization to show that, when the target eigenvalue has a constant spectral gap $D_{k,\mathrm{min}}$, achieving all-site error $\varepsilon$ requires a number of input copies independent of $d$ and scaling as $O(m/(\varepsilon D_{k,\mathrm{min}}^2))$. When $m/n$ approaches a constant, the performance exhibits phase-like regimes, which we characterize explicitly. For the nonasymptotic analysis, we develop a theory of generalized Young diagrams that yields tight sample complexity bounds and provides the first dimension-uniform guarantee for optimal QPA. We also provide asymptotically efficient implementations of the optimal protocol. Together, these results establish QPA as a rigorous example of coherent quantum information processing with dimension-uniform sample complexity, supplying the technical foundation for the coherent-incoherent separation developed in the companion work.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper solves quantum purity amplification (QPA) for n input copies to m output copies of an arbitrary target eigenstate, for arbitrary local dimension d and generic input spectra. It characterizes the optimal channel, derives all-site and one-site performance laws, and uses a path-graph parametrization to obtain the asymptotic input-copy scaling O(m/($ε$ D_{k,min}^2)) independent of d when the target eigenvalue has constant spectral gap. A theory of generalized Young diagrams is developed for non-asymptotic tight sample-complexity bounds that are dimension-uniform. Asymptotically efficient implementations are also provided.

Significance. If the central derivations hold, the work supplies the first dimension-uniform guarantee for optimal QPA and establishes it as a rigorous example of coherent quantum information processing whose sample complexity does not grow with d. The explicit performance laws across output regimes and the provision of efficient implementations are concrete strengths that would support the coherent-incoherent separation claimed in the companion manuscript.

major comments (2)
  1. [Asymptotic analysis section] Asymptotic analysis (path-graph parametrization): the claim that this parametrization exactly reproduces (or asymptotically matches) the optimal channel's all-site error for constant D_{k,min} is load-bearing for the dimension-independent O(m/(ε D_{k,min}^2)) scaling. The manuscript must supply either a proof that the parametrization captures all relevant modes without hidden d-dependent corrections or explicit numerical verification against the true optimal channel for generic spectra when m/n is order-1; otherwise the dimension-uniform guarantee does not follow.
  2. [Non-asymptotic analysis] Non-asymptotic bounds: the generalized Young-diagram theory is asserted to yield tight sample complexity without hidden physical-implementation dependencies. The explicit bounds, the proof of tightness, and the argument establishing dimension uniformity for arbitrary spectra should be stated in a dedicated subsection so that the non-asymptotic claim can be checked independently of the asymptotic parametrization.
minor comments (2)
  1. [Abstract] The abstract refers to 'phase-like regimes' when m/n approaches a constant; a one-sentence pointer to the relevant theorem or figure would improve readability.
  2. [Introduction] Notation for the spectral gap D_{k,min} and the all-site error ε should be defined at first use in the main text rather than only in the abstract.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful and constructive review of our manuscript. We address each major comment below and will revise the manuscript to strengthen the supporting arguments for both the asymptotic and non-asymptotic analyses.

read point-by-point responses

  1. Referee: [Asymptotic analysis section] Asymptotic analysis (path-graph parametrization): the claim that this parametrization exactly reproduces (or asymptotically matches) the optimal channel's all-site error for constant D_{k,min} is load-bearing for the dimension-independent O(m/(ε D_{k,min}^2)) scaling. The manuscript must supply either a proof that the parametrization captures all relevant modes without hidden d-dependent corrections or explicit numerical verification against the true optimal channel for generic spectra when m/n is order-1; otherwise the dimension-uniform guarantee does not follow.

    Authors: We appreciate the referee's emphasis on the load-bearing nature of this claim. The path-graph parametrization is constructed precisely to extract the leading-order contributions from the dominant modes when D_{k,min} is held constant, thereby yielding the stated dimension-independent scaling. To make this rigorous, we will add an explicit proof in the revised manuscript showing that the parametrization accounts for all relevant modes in the large-n asymptotic limit without residual d-dependent corrections. We will also include numerical benchmarks comparing the parametrization against the true optimal channel for generic spectra in the m/n = O(1) regime. revision: yes

  2. Referee: [Non-asymptotic analysis] Non-asymptotic bounds: the generalized Young-diagram theory is asserted to yield tight sample complexity without hidden physical-implementation dependencies. The explicit bounds, the proof of tightness, and the argument establishing dimension uniformity for arbitrary spectra should be stated in a dedicated subsection so that the non-asymptotic claim can be checked independently of the asymptotic parametrization.

    Authors: We agree that a dedicated subsection will improve clarity and allow independent verification. In the revision we will add a new subsection titled 'Non-Asymptotic Sample Complexity via Generalized Young Diagrams' that states the explicit bounds, supplies the full proof of tightness, and presents a self-contained argument establishing dimension uniformity for arbitrary spectra. This subsection will be independent of the asymptotic path-graph analysis. revision: yes

Circularity Check

0 steps flagged

Minor self-reference to companion work; central derivations use independent parametrization and diagram theory without reducing to fitted inputs or self-definitions.

full rationale

The paper directly characterizes the optimal channel for general n, m, d, and spectra, then applies a path-graph parametrization as an analysis tool for the asymptotic regime and develops generalized Young diagrams for non-asymptotic bounds. These steps do not define the performance laws in terms of themselves or rename fitted parameters as predictions. The abstract explicitly positions the work as supplying the foundation for a companion paper on coherent-incoherent separation rather than depending on prior self-citations for its core claims. No load-bearing equation reduces the O(m/(ε D_{k,min}^2)) scaling or dimension-uniform guarantee to a construction that assumes the target result. This qualifies as a normal self-contained derivation with only incidental self-reference.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The framework rests on standard quantum channel theory and representation theory; no free parameters or new physical entities are introduced in the abstract. The generalized Young diagrams constitute a new mathematical tool rather than an invented physical object.

axioms (1)
  • standard math Standard quantum mechanics and the theory of completely positive trace-preserving maps apply to the definition and optimization of the QPA channel.
    The entire task of characterizing optimal channels for state transformation is defined within quantum information theory.

pith-pipeline@v0.9.0 · 5769 in / 1333 out tokens · 57369 ms · 2026-05-22T09:31:29.521542+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

36 extracted references · 36 canonical work pages · 2 internal anchors

  1. [1]

    Gottesman ,\ https://doi.org/10.1103/PhysRevA.57.127 journal journal Phys

    author author D. Gottesman ,\ https://doi.org/10.1103/PhysRevA.57.127 journal journal Phys. Rev. A \ volume 57 ,\ pages 127 ( year 1998 ) NoStop

    work page doi:10.1103/physreva.57.127 1998

  2. [2]

    author author A. W. \ Cross , author D. P. \ Divincenzo ,\ and\ author B. M. \ Terhal ,\ https://doi.org/http://dx.doi.org/10.26421/QIC9.7-8-1 journal journal Quantum Info. Comput. \ volume 9 ,\ pages 541–572 ( year 2009 ) NoStop

    work page doi:10.26421/qic9.7-8-1 2009

  3. [3]

    Li , author I

    author author Z. Li , author I. Kim ,\ and\ author P. Hayden ,\ https://doi.org/10.22331/q-2023-08-22-1089 journal journal Quantum \ volume 7 ,\ pages 1089 ( year 2023 ) NoStop

    work page doi:10.22331/q-2023-08-22-1089 2023

  4. [4]

    Peres ,\ @noop journal journal International journal of theoretical physics \ volume 38 ,\ pages 799 ( year 1999 ) NoStop

    author author A. Peres ,\ @noop journal journal International journal of theoretical physics \ volume 38 ,\ pages 799 ( year 1999 ) NoStop

    work page 1999

  5. [5]

    Barenco , author A

    author author A. Barenco , author A. Berthiaume , author D. Deutsch , author A. Ekert , author R. Jozsa ,\ and\ author C. Macchiavello ,\ @noop journal journal SIAM Journal on Computing \ volume 26 ,\ pages 1541 ( year 1997 ) NoStop

    work page 1997

  6. [6]

    author author J. I. \ Cirac , author A. K. \ Ekert ,\ and\ author C. Macchiavello ,\ https://doi.org/10.1103/PhysRevLett.82.4344 journal journal Phys. Rev. Lett. \ volume 82 ,\ pages 4344 ( year 1999 ) NoStop

    work page doi:10.1103/physrevlett.82.4344 1999

  7. [7]

    Keyl \ and\ author R

    author author M. Keyl \ and\ author R. F. \ Werner ,\ @noop journal journal Journal of Mathematical Physics \ volume 40 ,\ pages 3283 ( year 1999 ) NoStop

    work page 1999

  8. [8]

    Fu ,\ title Quantum state purification ,\ @noop Master's thesis ,\ school University of Waterloo ( year 2016 ) NoStop

    author author H. Fu ,\ title Quantum state purification ,\ @noop Master's thesis ,\ school University of Waterloo ( year 2016 ) NoStop

    work page 2016

  9. [9]

    author author A. M. \ Childs , author H. Fu , author D. Leung , author Z. Li , author M. Ozols ,\ and\ author V. Vyas ,\ @noop journal journal arXiv preprint arXiv:2309.16387 \ ( year 2023 ) NoStop

    work page arXiv 2023

  10. [10]

    Yao , author Y.-A

    author author H. Yao , author Y.-A. \ Chen , author E. Huang , author K. Chen ,\ and\ author X. Wang ,\ journal journal arXiv preprint quant-ph/2404.01138 \ https://doi.org/10.48550/arXiv.2404.01138 10.48550/arXiv.2404.01138 ( year 2024 ) NoStop

    work page doi:10.48550/arxiv.2404.01138 2024

  11. [11]

    author author A. M. \ Dalzell , author A. Gily \'e n , author C. T. \ Hann , author S. McArdle , author G. Salton , author Q. T. \ Nguyen , author A. Kubica ,\ and\ author F. G. \ Brand \ a o ,\ @noop journal journal arXiv preprint arXiv:2505.20265 \ ( year 2025 ) NoStop

    work page arXiv 2025

  12. [12]

    Brahmachari , author A

    author author S. Brahmachari , author A. Hulse , author H. D. \ Pfister ,\ and\ author I. Marvian ,\ @noop journal journal arXiv preprint arXiv:2508.05046 \ ( year 2025 ) NoStop

    work page arXiv 2025

  13. [13]

    Kazi \ and\ author I

    author author S. Kazi \ and\ author I. Marvian ,\ @noop journal journal arXiv preprint arXiv:2510.08493 \ ( year 2025 ) NoStop

    work page arXiv 2025

  14. [14]

    Li , author H

    author author Z. Li , author H. Fu , author T. Isogawa ,\ and\ author I. Chuang ,\ https://arxiv.org/abs/2409.18167 title Optimal quantum purity amplification ( year 2024 ),\ https://arxiv.org/abs/2409.18167 arXiv:2409.18167 [quant-ph] NoStop

    work page arXiv 2024

  15. [15]

    Li , author E

    author author Z. Li , author E. Theil , author A. W. \ Harrow ,\ and\ author I. Chuang ( year 2026 ),\ note manuscript submitted NoStop

    work page 2026

  16. [16]

    author author A. N. \ Soklakov \ and\ author R. Schack ,\ @noop journal journal Physical Review A—Atomic, Molecular, and Optical Physics \ volume 73 ,\ pages 012307 ( year 2006 ) NoStop

    work page 2006

  17. [17]

    Babbush , author C

    author author R. Babbush , author C. Gidney , author D. W. \ Berry , author N. Wiebe , author J. McClean , author A. Paler , author A. Fowler ,\ and\ author H. Neven ,\ @noop journal journal Physical Review X \ volume 8 ,\ pages 041015 ( year 2018 ) NoStop

    work page 2018

  18. [18]

    author author A. W. \ Harrow , author A. Hassidim ,\ and\ author S. Lloyd ,\ journal journal Physical Review Letters \ volume 103 ,\ https://doi.org/10.1103/physrevlett.103.150502 10.1103/physrevlett.103.150502 ( year 2009 ) NoStop

    work page doi:10.1103/physrevlett.103.150502 2009

  19. [19]

    Lloyd , author M

    author author S. Lloyd , author M. Mohseni ,\ and\ author P. Rebentrost ,\ @noop journal journal Nature physics \ volume 10 ,\ pages 631 ( year 2014 ) NoStop

    work page 2014

  20. [20]

    Regev ,\ @noop journal journal Journal of the ACM \ volume 72 ,\ pages 1 ( year 2025 ) NoStop

    author author O. Regev ,\ @noop journal journal Journal of the ACM \ volume 72 ,\ pages 1 ( year 2025 ) NoStop

    work page 2025

  21. [21]

    Grier , author D

    author author D. Grier , author D. Leung , author Z. Li , author H. Pashayan ,\ and\ author L. Schaeffer ,\ @noop journal journal arXiv preprint arXiv:2503.22644 \ ( year 2025 ) NoStop

    work page arXiv 2025

  22. [22]

    author author S. M. \ Hossain \ and\ author S. Bhattacharjee ,\ @noop journal journal arXiv preprint arXiv:2603.13441 \ ( year 2026 ) NoStop

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  23. [23]

    Mootz , author T

    author author M. Mootz , author T. Iadecola ,\ and\ author Y.-X. \ Yao ,\ @noop journal journal arXiv preprint arXiv:2407.01313 \ ( year 2024 ) NoStop

    work page arXiv 2024

  24. [25]

    author author A. J. \ Baldwin \ and\ author J. A. \ Jones ,\ @noop journal journal Physical Review A \ volume 107 ,\ pages 012427 ( year 2023 ) NoStop

    work page 2023

  25. [26]

    Mančinska \ and\ author E

    author author L. Mančinska \ and\ author E. Theil ,\ https://arxiv.org/abs/2510.08154 title Classification and implementation of unitary-equivariant and permutation-invariant quantum channels ( year 2025 ),\ https://arxiv.org/abs/2510.08154 arXiv:2510.08154 [quant-ph] NoStop

    work page arXiv 2025

  26. [27]

    Keyl \ and\ author R

    author author M. Keyl \ and\ author R. F. \ Werner ,\ in\ @noop booktitle Annales Henri Poincare ,\ Vol. volume 2 \ ( organization Springer ,\ year 2001 )\ pp.\ pages 1--26 NoStop

    work page 2001

  27. [28]

    author author R. F. \ Werner ,\ @noop journal journal Physical Review A \ volume 58 ,\ pages 1827 ( year 1998 ) NoStop

    work page 1998

  28. [29]

    High-dimensional quantum Schur transforms, September 2025

    author author A. Burchardt , author J. Fei , author D. Grinko , author M. Larocca , author M. Ozols , author S. Timmerman ,\ and\ author V. Visnevskyi ,\ https://arxiv.org/abs/2509.22640 title High-dimensional quantum schur transforms ( year 2025 ),\ https://arxiv.org/abs/2509.22640 arXiv:2509.22640 [quant-ph] NoStop

    work page arXiv 2025

  29. [30]

    O'Donnell \ and\ author J

    author author R. O'Donnell \ and\ author J. Wright ,\ in\ @noop booktitle Proceedings of the forty-seventh annual ACM symposium on Theory of computing \ ( year 2015 )\ pp.\ pages 529--538 NoStop

    work page 2015

  30. [31]

    O’Donnell \ and\ author J

    author author R. O’Donnell \ and\ author J. Wright ,\ in\ https://doi.org/10.1145/3055399.3055454 booktitle Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing ,\ series and number STOC ’17 \ ( publisher ACM ,\ year 2017 )\ p.\ pages 962–974 NoStop

    work page doi:10.1145/3055399.3055454 2017

  31. [32]

    Klimyk \ and\ author N

    author author A. Klimyk \ and\ author N. Y. \ Vilenkin ,\ in\ @noop booktitle Representation Theory and Noncommutative Harmonic Analysis II: Homogeneous Spaces, Representations and Special Functions \ ( publisher Springer ,\ year 1995 )\ pp.\ pages 137--259 NoStop

    work page 1995

  32. [33]

    Schur positivity and Schur log-concavity

    author author T. Lam , author A. Postnikov ,\ and\ author P. Pylyavskyy ,\ https://arxiv.org/abs/math/0502446 title Schur positivity and schur log-concavity ( year 2005 ),\ https://arxiv.org/abs/math/0502446 arXiv:math/0502446 [math.CO] NoStop

    work page internal anchor Pith review Pith/arXiv arXiv 2005

  33. [34]

    Khare \ and\ author T

    author author A. Khare \ and\ author T. Tao ,\ @noop journal journal American Journal of Mathematics \ volume 143 ,\ pages 1863 ( year 2021 ) NoStop

    work page 2021

  34. [35]

    Semidefinite Progr ams on Sparse Random Graphs and /T_heir Application to Community Detection

    author author R. O'Donnell \ and\ author J. Wright ,\ in\ https://doi.org/10.1145/2897518.2897544 booktitle Proceedings of the forty-eighth annual ACM symposium on Theory of Computing ,\ series and number STOC '16 \ ( publisher ACM ,\ year 2016 )\ pp.\ pages 899--912 NoStop

    work page doi:10.1145/2897518.2897544 2016

  35. [36]

    Cervero-Martín , author L

    author author E. Cervero-Martín , author L. Mančinska ,\ and\ author E. Theil ,\ https://arxiv.org/abs/2410.15793 title A memory and gate efficient algorithm for unitary mixed schur sampling ( year 2024 ),\ https://arxiv.org/abs/2410.15793 arXiv:2410.15793 [quant-ph] NoStop

    work page arXiv 2024

  36. [37]

    author author G. Kuperberg ,\ https://arxiv.org/abs/2306.13158 title Breaking the cubic barrier in the solovay-kitaev algorithm ( year 2025 ),\ https://arxiv.org/abs/2306.13158 arXiv:2306.13158 [quant-ph] NoStop

    work page arXiv 2025