Pith. sign in

REVIEW 3 major objections 4 minor 1 cited by

A simpler Gaussian state-preparation

T0 review · 3 major / 4 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read An $n$-qubit Gaussian state can be prepared with $n-1$ rotations, $(n-1)(n-2)/2$ controlled rotations, and $\lfloor (n-1)/2\rfloor$ ancilla.

desk verdict Strong resource claim, but the abstract's gate counts look mathematically obstructed for n≥3 and the full text is unreadable. read the letter →

arxiv 2508.03987 v1 pith:KBJKYIIL submitted 2025-08-06 quant-ph

Parker Kuklinski , Benjamin Rempfer , Kevin Obenland , Justin Elenewski This is my paper · ORCID
classification quant-ph MSC 81P68
keywords GaussianstatepreparationquantumcircuitrotationladderT-depthcontrolledrotationsancillapolynomialphase
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper proposes a constructive algorithm for preparing an $n$-qubit Gaussian state with exact resource counts: $n-1$ single-qubit rotations, $(n-1)(n-2)/2$ two-qubit controlled rotations, and $\lfloor (n-1)/2\rfloor$ ancilla. It then recompiles the circuit so that its T-depth grows linearly in $n$. The motivation is that the standard Kitaev-Webb preparation, while polynomial in resources, carries overheads that make it impractical in practice. If correct, this gives a transparent, count-explicit circuit whose gate count is quadratic in the number of qubits, whose ancilla count is linear, and which extends to complex functions with polynomial phase.

What carries the argument

The central object is a rotation ladder: the Gaussian amplitude profile is written as a product, with one single-qubit rotation per qubit and one controlled rotation per qubit pair, so the full $2^n$-dimensional state vector is assembled through $O(n^2)$ elementary rotations rather than through a general circuit of exponential size. Ancillas store intermediate normalization or phase factors, and the T-depth optimization reorganizes the controlled rotations within a specified Clifford+T compilation so that circuit depth scales linearly in $n$ rather than quadratically.

What would settle it

For $n=4$ or $n=5$, assemble the circuit with the stated counts and prescribed rotation angles from the paper, and compare output amplitudes to $\exp(-(x-\mu)^2/(2\sigma^2))$ over all $2^n$ computational basis states; if the maximum absolute error does not vanish as the angles are tuned to their exact values, the factorization premise is false. Separately, synthesize the optimized circuit under the paper's Clifford+T rule and count T gates per layer; if the per-layer T-count grows faster than linearly in $n$, the linear T-depth claim fails.

Watch

Extended reading notes

Core claim

On its own terms, the paper's central claim is that an $n$-qubit Gaussian state can be built exactly from $n-1$ rotations, one two-qubit controlled rotation for every pair of qubits, and $\lfloor(n-1)/2\rfloor$ ancilla, and that optimizations make the resulting circuit linear in T-depth. The construction is presented as more intuitive than Kitaev-Webb, which the paper describes as having enormous overhead that makes it functionally impractical. The same scaffolding extends to state preparation of complex functions with polynomial phase. The exactness claim rests on a factorization of the Gaussian amplitudes into single-qubit and pair-controlled factors, with no approximation beyond gate synt

Load-bearing premise

The method assumes that the amplitudes of an $n$-qubit Gaussian can be written exactly as a product of $n-1$ single-qubit rotation factors and one controlled rotation factor per qubit pair, with no leftover approximation error.

Editorial extensions

If this is right

  • For an $n$-qubit Gaussian state, total two-qubit gates are $(n-1)(n-2)/2$, so the circuit remains manageable for moderate $n$ and does not require exponential resources.
  • With $\lfloor(n-1)/2\rfloor$ ancillas, the method avoids the large overhead of the Kitaev-Webb construction that the paper identifies as functionally impractical.
  • The T-depth optimization makes the state-preparation circuit compatible with fault-tolerant gate sets at a depth that scales linearly with qubit count.
  • The method generalizes to complex functions with polynomial phase, so the same circuit shape can prepare non-Gaussian states whose log-amplitude is a polynomial.
  • Resource counts are exact and parameter-independent, so a fixed circuit topology serves any Gaussian of the same size; only rotation angles depend on the mean and variance.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The paper leaves implicit that the same pairwise-product construction could be tried on any target distribution whose log-amplitudes decompose into single- and pairwise-additive terms; log-concave or pairwise Markov distributions are natural next targets.
  • The T-depth claim is only meaningful relative to a specified Clifford+T synthesis rule, so a fair test is to compare, at a fixed synthesis accuracy, the total Clifford+T count against the stated linear T-depth.
  • If the factorization is exact, the circuit's dependence on the Gaussian parameters lives entirely in rotation angles, suggesting that one compiled circuit template could be reused across different means and variances without re-synthesis.
  • A direct numerical check on small $n$ would tell immediately whether the amplitude factorization holds without residual terms.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The manuscript claims a new method for preparing n-qubit Gaussian states using exactly n-1 single-qubit rotations, (n-1)(n-2)/2 two-qubit controlled rotations, and floor((n-1)/2) ancilla, with an optimization that makes the T-depth linear. It further claims the method extends to state preparation of complex functions with polynomial phase. The abstract frames this as an improvement over the Kitaev-Webb construction, which it calls functionally impractical due to overhead. However, the full text of the provided manuscript is corrupted and unreadable: the body consists of encoding artifacts, with only the abstract and the arXiv stamp readable. No circuit diagram, derivation, proof, or algorithmic specification is accessible. The central assertion is therefore unsupported in the available text, and a concrete mathematical obstruction to the natural one-gate-per-pair implementation is identified in the stress-test note.

Significance. If the claimed construction is correct and exact, it would be a substantial advance: Gaussian state preparation with quadratic gate count, O(n) ancilla, and linear T-depth would improve on the existing Kitaev-Webb approach and would be directly useful for quantum algorithms that require Gaussian initial states. The paper's title and abstract promise a more intuitive and practical method, which would be of interest to the quantum-algorithms community. However, the significance is entirely conditional: the readable portion of the manuscript contains only resource counts and no verifiable derivation. No proofs, pseudocode, or numerical demonstrations are available in the provided copy, so the contribution cannot currently be evaluated. The manuscript is not in a reviewable state.

major comments (3)
  1. [Full text (unreadable)] The body of the manuscript is corrupted and unreadable; only the abstract and arXiv stamp are intelligible. The paper's entire value lies in the derivation of the circuit and its resource counts, but no circuit diagram, algorithm, or proof is accessible. The abstract's exact statement 'uses exactly n-1 rotations, (n-1)(n-2)/2 two-qubit controlled rotations, and floor((n-1)/2) ancilla' is therefore an unsupported assertion. This is load-bearing: without the derivation, the central claim cannot be checked.
  2. [Abstract; mathematical obstruction] The abstract implies a construction with one controlled rotation per qubit pair and no disclosure of any other nonlinear mechanism. In the natural ladder realization, the amplitude ratio for setting qubit i to 1 versus 0 would be tan(theta_i0 + sum_{j<i} theta_ij x_j), a trigonometric function of an affine bit sum. The Gaussian amplitude exp(-(x-mu)^2/(2 sigma^2)) requires this ratio to be C exp(-2^i y / sigma^2), an exponential function of the integer y of lower bits. These functional forms cannot agree for all y once i >= 2; already for n=3 there are four lower-bit values and only three parameters. If the actual circuit uses ancilla-mediated nonlinear maps, postselection, or phase-to-amplitude conversion, the abstract does not disclose it. The manuscript must either provide the explicit circuit and prove the amplitude factorization, or the exact resource claim is not credible.
  3. [Abstract; T-depth claim] The claim 'render it linear in T-depth' is undefined without a compilation convention. T-depth depends on the Clifford+T synthesis algorithm, the accuracy parameter for approximating arbitrary rotations, and the assumed fault-tolerance architecture. The abstract gives no accuracy target or synthesis rule, so the stated asymptotic improvement over Kitaev-Webb cannot be compared or falsified. This is a load-bearing omission for the paper's practical argument.
minor comments (4)
  1. [Abstract] The Gaussian state is not defined: the normalization, the parameters mu and sigma, and whether the preparation is exact or approximate are not stated. The abstract should specify the target state and the sense in which 'state-prepare' holds.
  2. [Abstract] The reference to 'Kitaev-Webb' is not accompanied by a citation or a precise statement of its resource overhead. A proper comparison should include the relevant reference and a quantitative baseline.
  3. [Abstract] The phrase 'more intuitive' is subjective. The paper should define what 'simpler' means operationally (e.g., fewer gate types, lower connectivity requirements, or smaller constant factors), rather than relying on a qualitative claim.
  4. [Abstract] The extension to 'complex functions with polynomial phase' is mentioned but not elaborated in the readable text. At minimum, the abstract or accessible content should outline the class of functions and the resulting resource scaling.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity identified: the abstract's resource counts are structural claims, not fitted or self-referential derivations; the unreadable body prevents exhibiting any reduction.

full rationale

The only legible part of the manuscript is the abstract. It states that the method "uses exactly n-1 rotations, (n-1)(n-2)/2 two-qubit controlled rotations, and floor((n-1)/2) ancilla" and that optimizations "render it linear in T-depth." These are presented as counts of gates and ancilla in a proposed circuit; they are not parameters fitted to a target quantity, and the target Gaussian state is not used to define the circuit counts. There is no self-citation in the abstract, no imported uniqueness theorem, and no ansatz justified by prior work. The corrupted full text cannot be parsed for equations, so I cannot exhibit any specific reduction such as Eq. X = Eq. Y by construction. The skeptical note about tangent-of-affine ratios versus exponential Gaussian ratios is a mathematical correctness objection, not a circularity objection. Under the hard rule requiring an exact quote and a demonstrated reduction, no circular step can be claimed. Therefore the honest finding is no significant circularity, score 0.

Assumptions & free parameters 0 free parameters · 2 assumptions · 0 invented entities

From the abstract alone, no numbers are fitted to data and no new physical entities are introduced. The unverifiable items are structural: the factorization lemma and the gate-compilation convention behind the linear T-depth claim. Both are domain assumptions rather than free parameters, and both reside in the unreadable body text.

assumptions (2)
  • domain assumption The Gaussian amplitude profile exp(-(x-mu)^2/(2 sigma^2)) factorizes exactly into single-qubit and two-qubit rotation factors obtainable in closed form from mu and sigma.
    This factorization is the structural premise that allows exactly n-1 rotations and (n-1)(n-2)/2 controlled rotations to suffice; asserted by the abstract's construction, not shown in the readable text.
  • domain assumption The stated rotation gates are compiled to Clifford+T with a synthesis rule that preserves the claimed linear T-depth.
    T-depth is only defined relative to a fault-tolerant gate set; the abstract does not state the synthesis convention or its accuracy dependence.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A simpler Gaussian state-preparation." pith.science (2026). https://pith.science/paper/KBJKYIIL

@misc{pith2026250803987,
  author       = {Pith},
  title        = {Pith review of: A simpler Gaussian state-preparation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/KBJKYIIL}},
  note         = {Machine review of arXiv:2508.03987}
}
abstract

The ability to efficiently state-prepare Gaussian distributions is critical to the success of numerous quantum algorithms. The most popular algorithm for this subroutine (Kitaev-Webb) has favorable polynomial resource scaling, however it faces enormous resource overheads making it functionally impractical. In this paper, we present a new, more intuitive method which uses exactly $n-1$ rotations, $(n-1)(n-2)/2$ two-qubit controlled rotations, and $\lfloor(n-1)/2\rfloor$ ancilla to state-prepare an $n$-qubit Gaussian state. We then apply optimizations to the circuit to render it linear in T-depth. This method can be extended to state-preparations of complex functions with polynomial phase.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Quantum Circuits for the Metropolis-Hastings Algorithm

    quant-ph 2025-06 conditional novelty 7.0 of 10

    A new quantum circuit construction for Szegedy walks implements Metropolis-Hastings acceptance and rejection with constant oracle calls and a 4m+3 qubit overhead, preserving a quadratic spectral gap amplification.

Reference graph

Works this paper leans on

36 extracted references · 30 canonical work pages · cited by 1 Pith paper

  1. [1]

    author author A. N. \ Soklakov \ and\ author R. Schack ,\ title title Efficient state preparation for a register of quantum bits ,\ @noop journal journal Physical Review A—Atomic, Molecular, and Optical Physics \ volume 73 ( year 2006 ) NoStop

    work page 2006

  2. [2]

    Martin \ and\ author B

    author author P. Martin \ and\ author B. Časlav ,\ title title Quantum-state preparation with universal gate decompositions ,\ @noop journal journal Physical Review A—Atomic, Molecular, and Optical Physics \ volume 83 ( year 2011 ) NoStop

    work page 2011

  3. [3]

    Babbush , author C

    author author R. Babbush , author C. Gidney , author D. Berry , author N. Wiebe , author J. McClean , author A. Paler , author A. Fowler ,\ and\ author H. Neven ,\ title title Encoding electronic spectra in quantum circuits with linear t complexity ,\ @noop journal journal Physical Review X \ volume 8 ( year 2018 ) NoStop

    work page 2018

  4. [4]

    Fomichev , author K

    author author S. Fomichev , author K. Hejazi , author M. S. \ Zini , author M. Kiser , author J. Fraxanet , author P. A. M. \ Casares , author A. Delgado , author J. Huh , author A.-C. \ Voigt , author J. E. \ Mueller ,\ and\ author J. M. \ Arrazola ,\ title title Initial state preparation for quantum chemistry on quantum computers ,\ @noop journal journa...

    work page 2024

  5. [5]

    Sierra-Sosa , author M

    author author D. Sierra-Sosa , author M. Telahun ,\ and\ author A. Elmaghraby ,\ title title Tensorflow quantum: Impacts of quantum state preparation on quantum machine learning performance ,\ @noop journal journal IEEE Access \ volume 8 ( year 2020 ) NoStop

    work page 2020

  6. [6]

    Stamatopoulos \ and\ author W

    author author N. Stamatopoulos \ and\ author W. J. \ Zeng ,\ title title Derivative pricing using quantum signal processing ,\ @noop journal journal Quantum \ volume 8 ( year 2024 ) NoStop

    work page 2024

  7. [7]

    author author B. D. \ Clader , author B. C. \ Jacobs ,\ and\ author C. R. \ Sprouse ,\ title title Preconditioned quantum linear system algorithm ,\ @noop journal journal Physical review letters \ volume 110 ( year 2013 ) NoStop

    work page 2013

  8. [8]

    Krovi ,\ title title Improved quantum algorithms for linear and nonlinear differential equations ,\ @noop journal journal Quantum \ volume 7 ( year 2023 ) NoStop

    author author H. Krovi ,\ title title Improved quantum algorithms for linear and nonlinear differential equations ,\ @noop journal journal Quantum \ volume 7 ( year 2023 ) NoStop

    work page 2023

Show all 36 references
  1. [9]

    Aaronson ,\ title title Read the fine print ,\ @noop journal journal Nature Physics \ volume 11 ( year 2015 ) NoStop

    author author S. Aaronson ,\ title title Read the fine print ,\ @noop journal journal Nature Physics \ volume 11 ( year 2015 ) NoStop

    2015

  2. [10]

    \ Zhang , author T

    author author X.-M. \ Zhang , author T. Li ,\ and\ author X. Yuan ,\ title title Quantum state preparation with optimal circuit depth: Implementations and applications ,\ @noop journal journal Physical review letters \ volume 129 ( year 2022 ) NoStop

    2022

  3. [11]

    author author A. Y. \ Kitaev , author A. H. \ Shen ,\ and\ author M. N. \ Vyalyi ,\ @noop title Classical and Quantum Computation \ ( publisher American Mathematical Society ,\ year 2002 ) NoStop

    2002

  4. [12]

    Grover \ and\ author T

    author author L. Grover \ and\ author T. Rudolph ,\ title title Creating superpositions that correspond to efficiently integrably probability distributions ( year 2002 ),\ note arXiv preprint quant-ph/0208112 NoStop

    2002 arXiv

  5. [13]

    Chakrabarti , author R

    author author S. Chakrabarti , author R. Krishnakumar , author G. Mazzola , author N. Stamatopoulos , author S. Woerner ,\ and\ author W. J. \ Zeng ,\ title title A threshold for quantum advantage in derivative pricing ,\ @noop journal journal Quantum \ volume 5 ( year 2021 ) NoStop

    2021

  6. [14]

    author author S. Herbert ,\ title title No quantum speedup with grover-rudolph state preparation for quantum monte carlo integration ,\ @noop journal journal Physical Review E \ volume 103 ( year 2021 ) NoStop

    2021

  7. [15]

    @noop title 2020 IEEE International Conference on Quantum Computing and Engineering (QCE) \ ( publisher IEEE ,\ year 2020 ) NoStop

    2020

  8. [16]

    author author E. T. \ Wang ,\ title title Efficient quantum state preparation for the cauchy distribution based on piecewise arithmetic ,\ @noop journal journal IEEE Transactions on Quantum Engineering \ volume 3 ( year 2021 ) NoStop

    2021

  9. [17]

    Guseynov \ and\ author N

    author author N. Guseynov \ and\ author N. Liu ,\ title title Efficient explicit circuit for quantum state preparation of piece-wise continuous functions ( year 2024 ),\ note arXiv preprint arXiv:2411.01131 NoStop

    2024

  10. [18]

    Rosenkranz , author E

    author author M. Rosenkranz , author E. Brunner , author G. Marin-Sanchez , author N. Fitzpatrick , author Y. Tang , author Y. Kikuchi ,\ and\ author M. Benedetti ,\ title title Quantum state preparation for multivariate functions ( year 2024 ),\ note arXiv preprint arXiv:2405...

    2024 arXiv

  11. [19]

    Zylberman \ and\ author F

    author author J. Zylberman \ and\ author F. Debbasch ,\ title title Efficient quantum state preparation with walsh series ,\ @noop journal journal Physical Review A \ volume 109 ( year 2024 ) NoStop

    2024

  12. [20]

    Lemieux , author M

    author author J. Lemieux , author M. Lostaglio , author S. Pallister , author W. Pol , author K. Seetharam , author S. Sim ,\ and\ author B. S ahino g lu ,\ title title Quantum sampling algorithms for quantum state preparation and matrix block-encoding ( year 2024 ),\ note arX...

    2024 arXiv

  13. [21]

    author author J. M. \ Arrazola , author T. R. \ Bromley , author J. Izaac , author C. R. \ Myers , author K. Br\' a dler ,\ and\ author N. Killoran ,\ title title Machine learning method for state preparation and gate synthesis on photonic quantum computers ,\ @noop journal jo...

    2019

  14. [22]

    Regev ,\ title title An efficient quantum factoring algorithm ,\ @noop journal journal Journal of the ACM \ volume 72 ( year 2025 ) NoStop

    author author O. Regev ,\ title title An efficient quantum factoring algorithm ,\ @noop journal journal Journal of the ACM \ volume 72 ( year 2025 ) NoStop

    2025

  15. [23]

    Chen ,\ title title Quantum algorithms for lattice problems ( year 2024 ),\ note cryptology ePrint Archive NoStop

    author author Y. Chen ,\ title title Quantum algorithms for lattice problems ( year 2024 ),\ note cryptology ePrint Archive NoStop

    2024

  16. [24]

    author author N. J. \ Ward , author I. Kassal ,\ and\ author A. Aspuru-Guzik ,\ title title Preparation of many-body states for quantum simulation ,\ @noop journal journal The Journal of chemical physics \ volume 130 ( year 2009 ) NoStop

    2009

  17. [25]

    Kitaev \ and\ author W

    author author A. Kitaev \ and\ author W. A. \ Webb ,\ title title Wavefunction preparation and resampling using a quantum computer ( year 2008 ),\ note arXiv preprint arXiv:0801.0342 NoStop

    2008 arXiv

  18. [26]

    Deliyannis , author M

    author author P. Deliyannis , author M. Freytsis , author B. Nachman ,\ and\ author C. W. \ Bauer ,\ title title Practical considerations for the preparation of multivariate gaussian states on quantum computers ( year 2021 ),\ note arXiv preprint arXiv:2109.10918 NoStop

    2021 arXiv

  19. [27]

    Bagherimehrab , author Y

    author author M. Bagherimehrab , author Y. R. \ Sanders , author D. W. \ Berry , author G. K. \ Brennen ,\ and\ author B. C. \ Sanders ,\ title title Nearly optimal quantum algorithm for generating the ground state of a free quantum field theory ,\ @noop journal journal PRX Qu...

    2022

  20. [28]

    author author A. G. \ Rattew , author Y. Sun , author P. Minssen ,\ and\ author M. Pistoia ,\ title title The efficient preparation of normal distributions in quantum registers ,\ @noop journal journal Quantum \ volume 5 ( year 2021 ) NoStop

    2021

  21. [29]

    Iaconis , author S

    author author J. Iaconis , author S. Johri ,\ and\ author E. Y. \ Zhu ,\ title title Quantum state preparation of normal distributions using matrix product states ,\ @noop journal journal NPJ Quantum Information \ volume 10 ( year 2024 ) NoStop

    2024

  22. [30]

    Manabe \ and\ author Y

    author author H. Manabe \ and\ author Y. Sano ,\ title title The state preparation of multivariate normal distributions using tree tensor network ( year 2024 ),\ note arXiv preprint arXiv:2412.12067 NoStop

    2024 arXiv

  23. [31]

    Niemann , author A

    author author P. Niemann , author A. Gupta ,\ and\ author R. Drechsler ,\ title title T-depth optimization for fault-tolerant quantum circuits ,\ in\ @noop booktitle 2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL) \ ( organization IEEE ,\ year 2019 ) NoStop

    2019

  24. [32]

    Bocharov , author M

    author author A. Bocharov , author M. Roetteler ,\ and\ author K. M. \ Svore ,\ title title Efficient synthesis of universal repeat-until-success quantum circuits ,\ @noop journal journal Physical review letters \ volume 114 ( year 2015 ) NoStop

    2015

  25. [33]

    author author C. Jones ,\ title title Low-overhead constructions for the fault-tolerant toffoli gate ,\ @noop journal journal Physical Review A—Atomic, Molecular, and Optical Physics \ volume 87 ( year 2013 ) NoStop

    2013

  26. [34]

    Kim \ and\ author B.-S

    author author T. Kim \ and\ author B.-S. \ Choi ,\ title title Efficient decomposition methods for controlled-rn using a single ancillary qubit ,\ https://doi.org/10.1038/s41598-018-23764-x journal journal Scientific Reports \ volume 8 ( year 2018 ) NoStop

    2018 doi

  27. [35]

    Cardona , author R

    author author M. Cardona , author R. V. \ Chamberlin ,\ and\ author W. Marx ,\ title title Comment on the history of the stretched exponential function ( year 2007 ),\ note arXiv preprint arXiv:0710.4446 NoStop

    2007 arXiv

  28. [36]

    author author D. B. \ Clader , author A. M. \ Dalzell , author N. Stamatopoulos , author G. Salton , author M. Berta ,\ and\ author W. J. \ Zeng ,\ title title Quantum resources required to block-encode a matrix of classical data ,\ @noop journal journal IEEE Transactions on Q...

    2022

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.