pith. machine review for the scientific record. sign in

arxiv: 2605.00979 · v1 · submitted 2026-05-01 · 🪐 quant-ph · cond-mat.str-el· hep-th

Recognition: unknown

Universality of Quantum Gates in Particle and Symmetry Constrained Subspaces

Andreas Stergiou , Nicolas PD Sawaya
Authors on Pith no claims yet

Pith reviewed 2026-05-09 19:11 UTC · model grok-4.3

classification 🪐 quant-ph cond-mat.str-elhep-th
keywords quantum gatesuniversalityconstrained subspacesLie algebraPauli Z dressingstate preparationparticle number conservationsymmetry preservation
0
0 comments X

The pith

Commutators of overlapping hardware-efficient gates generate Pauli Z projectors that span the full so(w) algebra for arbitrary real state preparation in constrained subspaces.

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

The paper proves that simple hardware-efficient quantum gates can prepare any state inside subspaces with fixed particle number or other symmetries by using Lie algebra methods. A sympathetic reader would care because near-term quantum simulations of molecules, Hubbard models, and conformal field theories routinely demand that the prepared state stay inside these constrained spaces, so proving that basic gates suffice removes the need for more elaborate constructions. The argument centers on how overlapping gates produce commutators that dress with Pauli Z operators on shared qubits. These Z operators act as projectors that break down multi-plane rotations into single-plane generators, filling out the entire so(w) algebra where w is the subspace dimension. Adding independent complex phases then lifts the result to the full su(w) algebra for complex states. A Jacobian-based test is supplied to check that a given circuit can reach every direction from generic parameter values.

Core claim

We use Lie algebraic techniques to prove that hardware-efficient gates are universal for state preparation in these subspaces. The key mechanism is Pauli Z dressing: commutators of overlapping gates produce Pauli Z operators on shared qubits, acting as spectator projectors that decompose multi-plane rotations into single-plane generators spanning the full so(w) algebra, where w is the dimension of the constrained subspace, thereby guaranteeing universality for real state preparation. Adding independent complex phases extends this to su(w), enabling arbitrary complex state preparation. We provide a computationally efficient Jacobian criterion for verifying that a circuit can explore any state

What carries the argument

Pauli Z dressing, in which commutators of overlapping gates produce Pauli Z operators on shared qubits that serve as spectator projectors decomposing multi-plane rotations into single-plane generators spanning the full so(w) algebra.

If this is right

  • Hardware-efficient ansatze are universal for preparing any real state in fixed-particle-number subspaces.
  • Independent complex phases extend universality to arbitrary complex states via the su(w) algebra.
  • The Jacobian criterion gives an efficient numerical test that a circuit can reach every tangent direction from almost any parameter point.
  • The same gate constructions apply directly to Fermi-Hubbard, Bose-Hubbard, molecular electronic structure, and fuzzy-sphere regularizations of the 3D Ising CFT.
  • Symmetry-preserving circuits can variationally prepare both ground and excited states to extract CFT scaling dimensions.

Where Pith is reading between the lines

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

  • The same commutator mechanism may extend to other conserved quantities such as total spin or momentum without redesigning the gate set.
  • Small-system numerical checks of algebra dimension could serve as an immediate experimental test on current quantum hardware.
  • The universality result suggests that variational algorithms for constrained problems can avoid overhead from symmetry-enforcing penalties or post-selection.
  • The Jacobian test could be adapted to certify reachability in other variational manifolds beyond particle-number constraints.

Load-bearing premise

The chosen overlapping gate arrangements produce commutators whose generated Pauli Z operators act as exact spectator projectors that fully decompose the rotations and span the complete so(w) algebra without missing generators or extra constraints.

What would settle it

For a small subspace of dimension w=4, compute the dimension of the Lie algebra generated by the proposed overlapping gates and check whether it equals exactly 6, the dimension of so(4); any shortfall would falsify the spanning claim.

Figures

Figures reproduced from arXiv: 2605.00979 by Andreas Stergiou, Nicolas PD Sawaya.

Figure 1
Figure 1. Figure 1: for our VQE tests. Key: spanning 2-wire boxes = G (2); single-wire boxes joined by vertical links = G (4) q0 : −3/2↑ q1 : −3/2↓ q2 : −1/2↑ q3 : −1/2↓ q4 : 1/2↑ q5 : 1/2↓ q6 : 3/2↑ q7 : 3/2↓ view at source ↗
Figure 2
Figure 2. Figure 2: VQE/VQD convergence for the three lowest eigenstates of the fuzzy sphere Hamiltonian (N = 4). Each panel shows the cost function at every iteration (blue curve), with the exact eigenvalue from ED indicated by the red dashed line. For the excited states (centre and right panels), the dotted vertical line marks the transition from the Adam phase to the gradient-descent phase. 20 view at source ↗
Figure 3
Figure 3. Figure 3: Decomposition of the 2-qubit Givens rotation G (2) ij (θ) into two CNOT gates and single-qubit rotations. 2-qubit A-gate A (2) ij (θ). Since A(θ) = A(0) G(−θ) and the discrete reflection matrix A(0) = diag(1, 1, −1, 1) flips the sign of the determinant in the active subspace, it is impossible to decompose A (2) ij (θ) using only two CNOTs and single-qubit SU(2) rotations. The reflection A(0) admits a singl… view at source ↗
Figure 4
Figure 4. Figure 4: Minimal exact decomposition of the 2-qubit A-gate A (2) ij (θ) into three CNOT gates. The first two CNOTs implement G(−θ) as in view at source ↗
Figure 5
Figure 5. Figure 5: Decomposition of the BEMPA Bˆ gate. The CNOT cascade controlled by qi maps |001⟩ and |110⟩ to states differing only in qi . The X gate on qj isolates these two states so that only they trigger the C 2Ry(2α) rotation on qi . 4-qubit Givens rotation G (4) ijkl(θ). The 4-qubit gate rotates in the {|1100⟩, |0011⟩} subspace. It is essentially the DoubleExcitation rotation of PennyLane. The strategy is to use a … view at source ↗
Figure 6
Figure 6. Figure 6: Decomposition of the 4-qubit Givens rotation G (4) ijkl(θ) acting on the {|1100⟩, |0011⟩} subspace. The CNOT cascade controlled by ql maps |1100⟩ 7→ |1110⟩ and |0011⟩ 7→ |1111⟩, which differ only in ql . The X gate on qk ensures these are the only states with qi = qj = qk = 1, so a single C 3Ry(2θ) implements the rotation. The cascade is then reversed to uncompute. The decomposition of the multi-controlled… view at source ↗
Figure 7
Figure 7. Figure 7: Decomposition of the 4-qubit A-gate A (4) ijkl(θ). The CNOT cascade is identical to view at source ↗
Figure 8
Figure 8. Figure 8: Decomposition of C 3Ry(α) into 8 CNOT gates and 8 single-qubit rotations R± y ≡ Ry(±α/8) of alternating sign. The CNOT controls follow the Gray code pattern c3, c2, c3, c1, c3, c2, c3, c1, where c3 toggles most frequently. The same pattern with two controls and 4 CNOTs gives C 2Ry(α) with Ry(±α/4). Summary of circuit resources. The circuit depth is the number of sequential time steps when gates acting on d… view at source ↗
read the original abstract

Simulating physical systems on near-term quantum computers often requires preparing states within constrained subspaces, like those with fixed particle number or spin. We use Lie algebraic techniques to prove that hardware-efficient gates are universal for state preparation in these subspaces. The key mechanism is Pauli $Z$ dressing: commutators of overlapping gates produce Pauli $Z$ operators on shared qubits, acting as spectator projectors that decompose multi-plane rotations into single-plane generators spanning the full $\mathfrak{so}(w)$ algebra, where $w$ is the dimension of the constrained subspace, thereby guaranteeing universality for real state preparation. Adding independent complex phases extends this to $\mathfrak{su}(w)$, enabling arbitrary complex state preparation. We provide a computationally efficient Jacobian criterion for verifying that a circuit can explore any direction on the target manifold from almost any parameter configuration. Our findings are applicable to many problem areas, including Fermi-Hubbard models, Bose-Hubbard models, and molecular electronic structure. We apply our framework to two physical settings: we prove the completeness of the binary encoded multi-level particles ansatz on the conserved-particle-number subspace, and we construct symmetry-preserving circuits for the fuzzy sphere regularisation of the 3D Ising conformal field theory (CFT). For the latter, we variationally prepare the ground and excited states to extract CFT scaling dimensions.

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

3 major / 2 minor

Summary. The manuscript claims to prove, using Lie-algebraic techniques, that hardware-efficient gates are universal for real and complex state preparation in particle-number and symmetry-constrained subspaces. The central mechanism is Pauli Z dressing, in which commutators of overlapping gates generate Pauli Z operators on shared qubits that act as spectator projectors, decomposing multi-plane rotations into single-plane generators that span the full so(w) algebra (w = subspace dimension); independent phases extend this to su(w). A computationally efficient Jacobian criterion is provided to verify that a circuit can reach any tangent direction on the target manifold. The framework is applied to prove completeness of the binary-encoded multi-level particle ansatz on the fixed-particle-number subspace and to construct symmetry-preserving circuits for the fuzzy-sphere regularization of the 3D Ising CFT, with variational preparation of ground and excited states to extract scaling dimensions.

Significance. If the Lie-algebra generation and projector claims hold, the work supplies a general, non-ad-hoc route to universal ansatze for constrained quantum simulations, directly relevant to Fermi- and Bose-Hubbard models and to symmetry-preserving variational calculations in conformal field theory. The explicit Jacobian criterion and the two concrete applications (binary encoding and fuzzy-sphere CFT) are concrete strengths that would allow other researchers to verify and extend the constructions.

major comments (3)
  1. [Lie-algebra generation and Pauli Z dressing mechanism] The universality proof rests on the assertion that commutators of the chosen overlapping hardware-efficient gates produce exact Pauli Z spectator projectors with no residual non-projector terms. Explicit commutator calculations for the specific gate connectivities and embeddings used in the binary-encoded particle ansatz must be supplied; any leftover terms would prevent the generated algebra from equaling the full so(w) of dimension w(w-1)/2.
  2. [Application to fuzzy-sphere CFT regularization] For the fuzzy-sphere regularization of the 3D Ising CFT, the manuscript must verify that the symmetry-preserving circuit generates a complete basis of so(w) generators (or su(w) after phase dressing) without missing elements or preserved subspace invariants. A dimension count or explicit basis construction for the relevant w should be included.
  3. [Jacobian criterion for manifold exploration] The computationally efficient Jacobian criterion is central to practical verification of universality, yet its derivation, the precise form of the Jacobian matrix, and its numerical demonstration on at least one of the two physical examples are required to confirm both correctness and claimed efficiency.
minor comments (2)
  1. Notation for the constrained-subspace dimension w and the distinction between so(w) and su(w) should be introduced with a brief reminder of their dimensions and physical meaning at first use.
  2. The abstract states applicability to Fermi-Hubbard and Bose-Hubbard models; a short paragraph or reference in the main text clarifying how the gate sets map onto those Hamiltonians would improve readability.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments, which will help strengthen the rigor and clarity of the manuscript. We address each major comment below and will incorporate the requested additions in the revised version.

read point-by-point responses

  1. Referee: The universality proof rests on the assertion that commutators of the chosen overlapping hardware-efficient gates produce exact Pauli Z spectator projectors with no residual non-projector terms. Explicit commutator calculations for the specific gate connectivities and embeddings used in the binary-encoded particle ansatz must be supplied; any leftover terms would prevent the generated algebra from equaling the full so(w) of dimension w(w-1)/2.

    Authors: We agree that explicit verification strengthens the proof. The manuscript presents the general Pauli Z dressing mechanism, but we will add in the revision the detailed commutator calculations for the overlapping gates and embeddings specific to the binary-encoded multi-level particle ansatz. These will confirm that the commutators yield exact Pauli Z projectors with no residual terms, ensuring the generated algebra equals the full so(w). revision: yes

  2. Referee: For the fuzzy-sphere regularization of the 3D Ising CFT, the manuscript must verify that the symmetry-preserving circuit generates a complete basis of so(w) generators (or su(w) after phase dressing) without missing elements or preserved subspace invariants. A dimension count or explicit basis construction for the relevant w should be included.

    Authors: We appreciate this request for explicit verification. In the revised manuscript, we will add a dimension count for the relevant subspace dimension w in the fuzzy-sphere model together with an outline of the basis of so(w) (and su(w)) generators generated by the symmetry-preserving circuit. This will confirm completeness and the absence of extraneous preserved invariants. revision: yes

  3. Referee: The computationally efficient Jacobian criterion is central to practical verification of universality, yet its derivation, the precise form of the Jacobian matrix, and its numerical demonstration on at least one of the two physical examples are required to confirm both correctness and claimed efficiency.

    Authors: We agree that additional detail on the Jacobian criterion will improve usability. In the revision we will expand the section to include the full derivation, the precise mathematical form of the Jacobian matrix in terms of circuit parameters and generators, and a numerical demonstration on the binary-encoded particle ansatz that verifies both correctness and computational efficiency. revision: yes

Circularity Check

0 steps flagged

No circularity: proof uses standard Lie-algebra commutators on explicit gate sets

full rationale

The derivation claims universality by showing that nested commutators of hardware-efficient gates generate the full so(w) algebra on the constrained subspace via Pauli Z dressing. This is a direct algebraic construction from the gate definitions and overlap structure, not a self-definition, fitted parameter renamed as prediction, or reduction to prior self-citations. The Jacobian criterion is an independent verification tool. No load-bearing step equates the claimed result to its inputs by construction; the argument is self-contained against external Lie-algebra benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The proof rests on standard Lie-algebraic facts about su(2^n) and its subalgebras; no new free parameters, ad-hoc axioms, or invented entities are introduced in the abstract.

axioms (1)
  • standard math Commutators of Pauli-string operators generate the Lie algebra structure needed to span so(w) and su(w) when restricted to the constrained subspace.
    Invoked to show that Z dressing produces the required generators.

pith-pipeline@v0.9.0 · 5536 in / 1340 out tokens · 47001 ms · 2026-05-09T19:11:12.838882+00:00 · methodology

discussion (0)

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

Reference graph

Works this paper leans on

31 extracted references · 22 canonical work pages · 2 internal anchors

  1. [1]

    Peruzzo, J

    A. Peruzzo et al.,“A variational eigenvalue solver on a photonic quantum processor”, Nature Commun.5, 4213 (2014),arXiv:1304.3061 [quant-ph]; J. Tilly et al.,“The Variational Quantum Eigensolver: A review of methods and best practices”, Phys. Rept.986, 1 (2022),arXiv:2111.05176 [quant-ph]

    work page arXiv 2014

  2. [2]

    Dawson and Michael A

    A. Y. Kitaev,“Quantum computations: algorithms and error correction”, Russ. Math. Surv. 52, 1191 (1997); C. M. Dawson & M. A. Nielsen,“The Solovay–Kitaev algorithm”, Quant. Inf. Comput.6, 081 (2006),quant-ph/0505030. 27

    work page arXiv 1997

  3. [3]

    Control systems on Lie groups

    V. Jurdjevic & H. J. Sussmann,“Control systems on Lie groups”, J. Differ. Equ.12, 313 (1972)

    1972

  4. [4]

    Two-bit gates are universal for quantum computation

    D. P. DiVincenzo,“Two-bit gates are universal for quantum computation”, Phys. Rev. A51, 1015 (1995),cond-mat/9407022; S. Lloyd,“Almost any quantum logic gate is universal”, Phys. Rev. Lett.75, 346 (1995); A. Barenco,“A Universal two bit gate for quantum computation”, Proc. Roy. Soc. Lond. A449, 679 (1995),quant-ph/9505016; D. Deutsch, A. Barenco & A. Eker...

    work page arXiv 1995

  5. [5]

    Solving strongly correlated electron models on a quantum computer

    D. Wecker, M. B. Hastings, N. Wiebe, B. K. Clark, C. Nayak & M. Troyer,“Solving strongly correlated electron models on a quantum computer”, Phys. Rev. A92, 062318 (2015), arXiv:1506.05135 [quant-ph]; Z. Jiang, K. J. Sung, K. Kechedzhi, V. N. Smelyanskiy & S. Boixo,“Quantum algorithms to simulate many-body physics of correlated fermions”, Phys. Rev. Applie...

    work page arXiv 2015

  6. [6]

    Particle-conserving quantum circuit ansatz with applications in variational simulation of bosonic systems

    S. Bahrami & N. Sawaya,“Particle-conserving quantum circuit ansatz with applications in variational simulation of bosonic systems”,arXiv:2402.18768 [quant-ph]

    work page arXiv

  7. [7]

    Uncovering Conformal Symmetry in the 3D Ising Transition: State-Operator Correspondence from a Quantum Fuzzy Sphere Regularization

    W. Zhu, C. Han, E. Huffman, J. S. Hofmann & Y.-C. He,“Uncovering Conformal Symmetry in the 3D Ising Transition: State-Operator Correspondence from a Quantum Fuzzy Sphere Regularization”, Phys. Rev. X13, 021009 (2023),arXiv:2210.13482 [cond-mat.stat-mech]

    work page arXiv 2023

  8. [8]

    Variational Quantum Computation of Excited States

    O. Higgott, D. Wang & S. Brierley,“Variational Quantum Computation of Excited States”, Quantum3, 156 (2019)

    2019

  9. [9]

    Real-Time Evolution for Ultracompact Hamiltonian Eigenstates on Quantum Hardware

    K. Klymko et al.,“Real-Time Evolution for Ultracompact Hamiltonian Eigenstates on Quantum Hardware”, PRX Quantum3, 020323 (2022),arXiv:2103.08563 [quant-ph]

    work page arXiv 2022

  10. [10]

    The Conformal Bootstrap: Theory, Numerical Techniques, and Applications

    D. Poland, S. Rychkov & A. Vichi,“The Conformal Bootstrap: Theory, Numerical Techniques, and Applications”, Rev. Mod. Phys.91, 015002 (2019),arXiv:1805.04405 [hep-th]

    work page Pith review arXiv 2019

  11. [11]

    Uni- versal quantum circuits for quantum chemistry

    J. M. Arrazola, O. Di Matteo, N. Quesada, S. Jahangiri, A. Delgado & N. Killoran,“Uni- versal quantum circuits for quantum chemistry”, Quantum6, 742 (2022),arXiv:2106.13839 [quant-ph]

    work page arXiv 2022

  12. [12]

    On an arcwise connected subgroup of a Lie group

    H. Yamabe,“On an arcwise connected subgroup of a Lie group”, Osaka Mathematical Journal 2, 13 (1950). 28

    1950

  13. [13]

    Quantum algorithms for electronic structure calculations: Particle- hole Hamiltonian and optimized wave-function expansions

    P. K. Barkoutsos et al.,“Quantum algorithms for electronic structure calculations: Particle- hole Hamiltonian and optimized wave-function expansions”, Phys. Rev. A98, 022322 (2018), arXiv:1805.04340 [quant-ph]

    work page arXiv 2018

  14. [14]

    Efficient symmetry-preserving state preparation circuits for the variational quantum eigensolver algorithm

    B. T. Gard, L. Zhu, G. S. Barron, N. J. Mayhall, S. E. Economou & E. Barnes,“Efficient symmetry-preserving state preparation circuits for the variational quantum eigensolver algorithm”, npj Quantum Inf.6, 10 (2020)

    2020

  15. [15]

    Universal Hamming Weight Preserving Variational Quantum Ansatz

    G. Yan, K. Pan, R. Wang, M. Ran, H. Chen, X. Wang & J. Yan,“Universal Hamming Weight Preserving Variational Quantum Ansatz”,arXiv:2412.04825 [quant-ph]

    work page arXiv

  16. [16]

    The Complexity of the Local Hamiltonian Problem

    J. Kempe, A. Kitaev & O. Regev,“The Complexity of the Local Hamiltonian Problem”, SIAM J. Comput.35, 1070 (2006),quant-ph/0406180

    work page arXiv 2006

  17. [17]

    Quantum Simulations of Physics Problems

    R. Somma, G. Ortiz, E. Knill & J. Gubernatis,“Quantum Simulations of Physics Problems”, Int. J. Quant. Inf.01, 417 (2003),quant-ph/0304063; S. McArdle, A. Mayorov, X. Shan, S. Benjamin & X. Yuan,“Digital quantum simulation of molecular vibrations”, Chem. Sci.10, 5725 (2019),arXiv:1811.04069 [quant-ph]; P. J. Ollitrault, A. Baiardi, M. Reiher & I. Tavernel...

    work page arXiv 2003

  18. [18]

    Fractional quantization of the Hall effect: a hierarchy of incompressible quantum fluid states

    F. D. M. Haldane,“Fractional quantization of the Hall effect: a hierarchy of incompressible quantum fluid states”, Phys. Rev. Lett.51, 605 (1983)

    1983

  19. [19]

    Dirac monopole without strings: Monopole harmonics

    T. T. Wu & C. N. Yang,“Dirac monopole without strings: Monopole harmonics”, Nuclear Physics B107, 365 (1976); E. T. Newman & R. Penrose,“Note on the Bondi-Metzner-Sachs group”, J. Math. Phys.7, 863 (1966); 29 T. Dray,“The relationship between monopole harmonics and spin-weighted spherical harmonics”, Journal of Mathematical Physics26, 1030 (1985)

    1976

  20. [20]

    The Fuzzy sphere

    J. Madore,“The Fuzzy sphere”, Class. Quant. Grav.9, 69 (1992); K. Hasebe,“Hopf Maps, Lowest Landau Level, and Fuzzy Spheres”, SIGMA6, 071 (2010), arXiv:1009.1192 [hep-th]

    work page arXiv 1992

  21. [21]

    Conformal Field Theory

    P. Di Francesco, P. Mathieu & D. Senechal,“Conformal Field Theory”, Springer-Verlag (1997), New York

    1997

  22. [22]

    Conformal four-point correlators of the 3D Ising transition via the quantum fuzzy sphere

    C. Han, L. Hu, W. Zhu & Y.-C. He,“Conformal four-point correlators of the 3D Ising transition via the quantum fuzzy sphere”,arXiv:2306.04681 [cond-mat.stat-mech]

    work page arXiv

  23. [23]

    OpenFermion: the electronic structure package for quantum computers

    J. R. McClean et al.,“OpenFermion: the electronic structure package for quantum computers”, Quantum Science and Technology5, 034014 (2020)

    2020

  24. [24]

    A125809 entry in the On-Line Encyclopedia of Integer Sequences

    OEIS Foundation Inc.,“A125809 entry in the On-Line Encyclopedia of Integer Sequences”, Published electronically athttp://oeis.org/A125809

  25. [25]

    The Lightcone Bootstrap and the Spectrum of the 3d Ising CFT

    D. Simmons-Duffin,“The Lightcone Bootstrap and the Spectrum of the 3d Ising CFT”, JHEP 1703, 086 (2017),arXiv:1612.08471 [hep-th]

    work page arXiv 2017

  26. [26]

    Conformal operator content of the Wilson–Fisher transition on fuzzy sphere bilayers

    C. Han, L. Hu & W. Zhu,“Conformal Operator Content of the Wilson-Fisher Transition on Fuzzy Sphere Bilayers”,arXiv:2312.04047 [cond-mat.str-el]; A. Dey, L. Herviou, C. Mudry & A. M. Läuchli,“Conformal Data for the O(3) Wilson- Fisher CFT from Fuzzy Sphere Realization of Quantum Rotor Model”,arXiv:2510.09755 [cond-mat.str-el]; W. Guo, Z. Zhou, T.-C. Wei & ...

    work page arXiv

  27. [27]

    SO(5) Deconfined Phase Transition under the Fuzzy-Sphere Microscope: Approximate Conformal Symmetry, Pseudo-Criticality, and Operator Spectrum

    Z. Zhou, L. Hu, W. Zhu & Y.-C. He,“SO(5) Deconfined Phase Transition under the Fuzzy-Sphere Microscope: Approximate Conformal Symmetry, Pseudo-Criticality, and Operator Spectrum”, Phys. Rev. X14, 021044 (2024),arXiv:2306.16435 [cond-mat.str-el]; R. Fan, J. Dong & A. Vishwanath,“Simulating the non-unitary Yang-Lee conformal field theory on the fuzzy sphere...

    work page arXiv 2024

  28. [28]

    PennyLane: Automatic differentiation of hybrid quantum-classical computations

    V. Bergholm et al.,“PennyLane: Automatic differentiation of hybrid quantum-classical compu- tations”,arXiv:1811.04968 [quant-ph]

    work page internal anchor Pith review arXiv

  29. [29]

    State preparation and symmetries

    I. Miháliková, J. Carlson, D. Neill & I. Stetcu,“State preparation and symmetries”, arXiv:2510.06702 [quant-ph]

    work page arXiv

  30. [30]

    Adam: A Method for Stochastic Optimization

    D. P. Kingma & J. Ba,“Adam: A Method for Stochastic Optimization”,arXiv:1412.6980 [cs.LG]

    work page internal anchor Pith review Pith/arXiv arXiv

  31. [31]

    Quantum circuits for general multiqubit gates

    M. Möttönen, J. J. Vartiainen, V. Bergholm & M. M. Salomaa,“Quantum circuits for general multiqubit gates”, Phys. Rev. Lett.93, 130502 (2004),quant-ph/0404089. 31

    work page arXiv 2004