REVIEW 3 minor 134 cited by
Quantum measurements and the Abelian Stabilizer Problem
T0 review · 0 major / 3 minor · reviewed 2026-05-13 · grok-4.3
Pith's one-line read A quantum algorithm solves the Abelian stabilizer problem in polynomial time, covering factoring and discrete logarithm.
desk verdict Kitaev gives a clean general method for eigenvalue measurement of unitaries that directly yields the Abelian stabilizer algorithm and a QFT over any finite Abelian group. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
A procedure that measures an eigenvalue of a unitary operator by using controlled applications of the operator and an ancillary register to extract phase information.
What would settle it
An explicit superpolynomial lower bound on the quantum circuit complexity of either integer factoring or the Abelian stabilizer problem would show the algorithm cannot exist.
Extended reading notes
Core claim
There exists a polynomial-time quantum algorithm for the Abelian stabilizer problem. The algorithm works by repeatedly measuring the eigenvalues of a unitary operator that encodes the group action; the measured phases reveal the stabilizer subgroup. The same eigenvalue measurement technique immediately supplies a quantum Fourier transform for any finite Abelian group.
Load-bearing premise
The unitary operator corresponding to the group action or function can be realized by an efficient quantum circuit.
Editorial extensions
If this is right
- Factoring and discrete logarithm are solvable in polynomial time on a quantum computer.
- A quantum Fourier transform can be performed over any finite Abelian group in polynomial time.
- Any algebraic problem that reduces to finding the stabilizer of an efficiently implementable Abelian action inherits a polynomial quantum algorithm.
- Quantum phase estimation becomes a reusable primitive for designing new algorithms.
Reading between the lines
- The eigenvalue measurement technique may generalize to non-Abelian groups if suitable unitary representations can be constructed efficiently.
- Problems whose solutions are hidden in the eigenspectrum of implementable unitaries become candidates for similar quantum speedups.
- The method separates the algebraic structure of the problem from the details of the quantum circuit, suggesting a modular approach to algorithm design.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript presents a polynomial-time quantum algorithm for the Abelian stabilizer problem (encompassing factoring and discrete logarithm) via eigenvalue measurement of the unitary operator realizing the group action. It also derives a quantum Fourier transform over arbitrary finite Abelian groups and includes a detailed introductory overview of quantum computation.
Significance. If the central claims hold, the work provides a unifying framework that generalizes Shor's algorithms and introduces the eigenvalue-measurement primitive as a reusable tool for quantum algorithms on group problems. The derivation follows directly from standard quantum postulates and circuit constructions under the efficient-oracle assumption, which is the conventional model for these problems.
minor comments (3)
- [Abstract] The abstract states the algorithm is 'polynomial' but does not explicitly note the dependence on the group order or the precision parameter; a single clarifying sentence would improve readability.
- [Section on eigenvalue measurement] In the description of the eigenvalue measurement procedure, the analysis of the number of repetitions needed to achieve sufficient precision for stabilizer extraction is sketched but could be expanded with an explicit bound on the failure probability.
- [Introduction and preliminaries] Notation for the group action unitary and its eigenvectors is introduced without a consolidated table of symbols; adding one would aid readers new to the stabilizer formulation.
Simulated Author's Rebuttal
We thank the referee for the positive review, accurate summary of the manuscript, and recommendation to accept. The significance assessment aligns with our intent to provide a unifying framework via eigenvalue measurement that generalizes Shor's algorithms.
Circularity Check
No significant circularity; algorithm derived from standard quantum postulates and efficient unitary oracle
full rationale
The paper's central construction is the eigenvalue measurement procedure for a unitary operator U (via controlled powers and inverse QFT), applied to the group-action unitary to extract stabilizer characters. This follows directly from the quantum circuit model and the assumption that the group action is realized by an efficient unitary (the standard oracle model). No equations reduce to fitted parameters, no self-definitional loops, and no load-bearing self-citations; the derivation is self-contained against the stated assumptions and does not rename or smuggle prior results by the same authors. The extension of Shor's algorithm is presented as a generalization, not a circular reuse.
Assumptions & free parameters
assumptions (2)
- standard math Standard postulates of quantum mechanics (unitary evolution and projective measurement)
- domain assumption The group action admits an efficient quantum circuit implementation of the corresponding unitary
Cite this review
Pith. "Pith review of Quantum measurements and the Abelian Stabilizer Problem." pith.science (2026). https://pith.science/paper/EDCPWQPU
@misc{pith2026quant-ph9511026,
author = {Pith},
title = {Pith review of: Quantum measurements and the Abelian Stabilizer Problem},
year = {2026},
howpublished = {\url{https://pith.science/paper/EDCPWQPU}},
note = {Machine review of arXiv:quant-ph/9511026}
}
read the original abstract
We present a polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm. Thus we extend famous Shor's results. Our method is based on a procedure for measuring an eigenvalue of a unitary operator. Another application of this procedure is a polynomial quantum Fourier transform algorithm for an arbitrary finite Abelian group. The paper also contains a rather detailed introduction to the theory of quantum computation.
Lean theorems connected to this paper
-
IndisputableMonolith.Foundation.DimensionForcingdimension_forced unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
We present a polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm. Our method is based on a procedure for measuring an eigenvalue of a unitary operator.
-
IndisputableMonolith.Foundation.PhiForcingphi_equation unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
Another application of this procedure is a polynomial quantum Fourier transform algorithm for an arbitrary finite Abelian group.
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.
Forward citations
Showing 60 of 134 Pith papers that cite this
-
Optimal quantum metrology under energy constraints
Energy-constrained phase estimation has an ultimate precision scaling of 1/E² for unbounded dimension, and causal-superposition strategies can outperform definite-order strategies under the same energy budget.
-
New aspects of quantum topological data analysis: Betti number estimation, and testing and tracking of homology and cohomology classes
Quantum algorithms achieve polylogarithmic complexity for Betti number estimation and homology testing via block-encoded Laplacians and cohomological projections, claiming exponential speedups under sparsity assumptions.
-
A distillation-teleportation protocol for fault-tolerant QRAM
An adaptive distillation-teleportation protocol implements a fault-tolerant QRAM query with poly(n) quantum resources and 1/poly(n) device fidelity, at the cost of an exponential classical dataset update each round.
-
A quantum algorithm for Khovanov homology
A conditional quantum algorithm for estimating the Betti numbers of Khovanov homology, together with DQC1, BQP, and #P hardness results for harder approximation regimes.
-
Genuine Multipartite Entanglement between Logical Qubits via Cross-Code Lattice Surgery
Cross-code lattice surgery between surface and 3D colour codes yields certified logical GHZ and |CCZ> GME plus arbitrary logical rotations on a trapped-ion processor.
-
Canonical quantization of neurons
Canonical quantization turns a neuron into an activation observable of a parameterized Hamiltonian, with hybrid algorithms for training on quantum data and numerics showing advantage over classical Ising neurons.
-
On estimating operator norm distance, with optimal trace distance estimation when one state is pure
Rank-independent quantum estimators achieve Θ(1/ε) queries for operator-norm (and trace) distance when one state is pure, and Õ(1/ε^{3/2}) queries for general states, proving BQP-completeness.
-
Cultivating logical catalysts for fault-tolerant dyadic phase rotations
A new cultivation protocol prepares reusable logical catalysts as eigenstates of high-period Clifford circuits to implement exact Z^{2^{-b}} phase gates with constant online depth in surface codes.
-
Efficient Quantum Circuit Construction of Controlled Time-Evolution for Arbitrary Pauli-Sum Hamiltonians
Recursive grouping of Pauli terms with anti-commuting sign-flip strings reduces compiled T depth by 85.2% and CX depth by 68.9% on a 24-spin Kagome Hamiltonian versus term-by-term controlled rotations.
-
From Hilbert's Tenth Problem to Quantum Speedup: Explicit Oracles for Bounded Diophantine Systems
Explicit reversible quantum oracles for bounded Diophantine systems achieve quadratic speedup with qubit count O((n + d²) log₂ N) and Toffoli depth O(q²).
-
Characterizing and Benchmarking Dynamic Quantum Circuits
Dynamarq is a new scalable benchmarking framework that defines structural features for dynamic quantum circuits and uses statistical models to predict hardware fidelity with transferable parameters.
-
Quantum Matrix-Element Estimators for Spin-Coupled Generalized Valence Bond Wavefunctions (SCGVB)
SCGVB matrix elements are reformulated as vacuum Pauli expectation values, but the overlap estimator discards phase information and the claimed C2 validation is absent from the body.
-
Symmetry Dilemmas in Quantum Computing for Chemistry: A Comprehensive Analysis
Spatial-symmetry enforcement makes the saGSpD operator pool non-universal; ADAPT-VQE emulations then map exactly which symmetry must be enforced to avoid variational collapse.
-
Quantum Error-Corrected Computation of Molecular Energies
First end-to-end demonstration of quantum error correction integrated with quantum phase estimation to compute molecular hydrogen ground-state energy to 0.001(13) hartree accuracy on Quantinuum H2-2 hardware.
-
Super-bath Quantum Eigensolver
The authors propose the super-bath quantum eigensolver (SQE), a dissipation-based quantum algorithm that prepares ground states with polynomial resources whenever a physical sub-bath exists, and provide a rigorous err...
-
Direct Fidelity Estimation for Generic Quantum States
A fidelity estimation protocol combining classical shadow tomography and quantum amplitude estimation achieves O(sqrt(d)) computational cost for generic quantum states.
-
Tower of Structured Excited States from Measurements
A phase-estimation measurement of a global charge or momentum projects an easy-to-prepare matrix product state onto towers of quantum many-body scar states and Dicke states in logarithmic circuit depth.
-
High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization
Search-based approximate diagonalization followed by analytical inversion yields high-precision multi-qubit Clifford+T circuits with 95% fewer non-Clifford gates on real-algorithm benchmarks.
-
Efficient and high-performance routing of lattice-surgery paths on three-dimensional lattice
Lattice-surgery scheduling is mapped to 3D path embedding and solved with look-ahead Dijkstra projection, yielding 3.8x lower execution time on quantum phase estimation benchmarks versus greedy scheduling.
-
Controlled Gate Networks: Theory and Application to Eigenvalue Estimation
Controlled gate networks reduce two-qubit gate counts for linear combinations of unitary operators in quantum circuits, shown in variational calculations, rodeo eigenvalue estimation, and lattice nucleon evolution on ...
-
Quantum Amplitude Amplification and Estimation
Amplitude amplification finds solutions quadratically faster than classical methods and enables quantum estimation of solution counts.
-
Quantum algorithm for Clifford multiplication
Under amplitude encoding, Clifford geometric product reduces to cocycle-twisted convolution and is realized by a polylog-size quantum circuit with postselection on the trivial Walsh character.
-
Code-space recovery for sample-based quantum diagonalization beyond native symmetry constraints
Engineered dual-rail code-space recovery extends SQD to symmetry-free Hamiltonians and yields lower Ritz energies than unencoded sample support on Ising models up to 36 sites.
-
Orthogonal Quantum Krylov Diagonalisation
OQKD realizes classical Lanczos orthogonality and tridiagonal structure on a quantum computer via Hamiltonian polynomials and GQSP, removing overlap regularization while matching Chebyshev-QKD query complexity.
-
Hardware-native quantum phase estimation with circuit QED
The paper introduces a cQED-based iterative QPE protocol that encodes binary phase digits in bosonic phase-space rotations for sequential homodyne readout, claiming Heisenberg scaling and exponentially suppressed fail...
-
Quantum Error Management in Practice: A Cross-Stack Benchmark
On a 156-qubit IBM Heron processor, Q-CTRL and Qedma QESEM reduced estimation error by 3.1x and 4.7x versus raw IBM execution, with QESEM using 7.5 to 11.1x the QPU time of Q-CTRL.
-
Parallelizable Exact Synthesis of Quantum Circuits via Semi-Tensor Product
STP factorization of undirected CNOT topologies yields a parallel exact synthesizer that is often much faster than SAT on small instances and about 1.9× faster median in a QASMBench peephole workflow.
-
Universal Parent Hamiltonians for Adiabatic Warm Starts
A quantum algorithm framework that converts any circuit-prepared state into an initial Hamiltonian for adiabatic state preparation, with numerical evidence that same-phase MPS warm starts improve adiabatic gaps.
-
Quantum linear solvers for quantum chemistry: prospects of exponential quantum advantage
QLS applied to single- and multi-reference linearized coupled cluster shows polylog κ and sublinear sparsity on model systems, supporting prospects of exponential advantage over conjugate gradient.
-
RubriQ: Rubric-Guided Group Relative Policy Optimization for Constraint-Aware Quantum Circuit Synthesis
A rubric-guided GRPO pipeline fine-tunes a 7B LLM to synthesize quantum circuits achieving 3.31x T-gate compression with <1% hardware-constraint violations, validated on IBM and IonQ processors.
-
SlaKoNet-VQD: A universal Slater-Koster tight-binding Hamiltonian for variational quantum band-structure calculations on near-term hardware
SlaKoNet-VQD recovers full Si and superconductor bands to ~1.8 meV of exact diagonalization on a 3-qubit simulator and executes an Al ground-state point on IBM hardware at ~0.37 eV error.
-
Perturbatively Corrected Linear Response Selected Configuration Interaction
LR-SCI-PT with second-order Epstein-Nesbet corrections improves static polarizabilities toward FCI limits for small molecules but preserves the parent pole structure, limiting it to static properties.
-
Quantum-Accelerated Self-Consistent Field: A Hybrid Algorithm
GAS-SCF uses Grover adaptive search and quantum arithmetic to mark and amplify improving Fock states, offering a theoretical quadratic speedup for SCF optimization, shown via classical simulations up to 26 qubits and ...
-
Quantum-Classical Auxiliary-Field Quantum Monte Carlo at the Edge of Practicability
QC-AFQMC per-step scaling reduced from O(N^5.5) to O(N^4.5) via Aitken's block transformation for singular Pfaffians and algorithmic differentiation for force bias, with demonstrations on H8 from real quantum data and Li2O4.
-
Projector Quantum Variational Ansatz
The Projector Variational Ansatz (PVA) is a new VQE ansatz that can match ISQ-QSP or ADAPT-VQE structures and converges with shallower circuits than standard ADAPT-VQE in experiments.
-
Scalable Quantum Algorithms for Gutzwiller Projection
Amplitude amplification for Gutzwiller projection (AAGP) achieves a quadratic reduction in projection queries versus postselection, enabling practical preparation of projected BCS states for up to 100-site t-J model s...
-
Towards Heisenberg Scaling: Measurement-Efficient Non-Orthogonal Quantum Eigensolver
Replaces sampling-based estimation in NOQE with iterative quantum amplitude estimation to achieve O(1/ε) query complexity for Hamiltonian and overlap matrices.
-
Efficient and Expressive Boundary Conditions in Quantum Lattice Boltzmann Methods
New boundary condition approach for QLBM using one coherent operation on the full boundary, claimed to use fewer resources asymptotically and practically for bounce-back and specular reflection.
-
Evaluating higher-order product formulae for molecular ground-state energy estimation
Benchmarks on H-chains show an 8th-order formula minimizes cost metrics, but a new 4th-order formula achieves the lowest gate count near chemical accuracy while also lowering RZ-layer depth.
-
Quantum algorithms for density functional theory with minimal readout
Qubit-efficient quantum algorithm for KS-DFT computes occupied orbitals simultaneously and evaluates total energy via Harris functional without density readout, with a second multi-copy method for self-consistency.
-
Point-group symmetry analysis of many-electron wavefunctions on a quantum computer
An ancilla-free method projects many-electron states onto point-group irreps via orbital rotations derived from representation-matrix eigenvectors and demonstrates it on benzene and ferrocene with a 32-qubit IBM hardware run.
-
Adiabatic Quantum Phase Estimation
An adiabatic protocol for quantum phase estimation that reaches optimal scaling T = O(1/ε log(1/δ)) by encoding eigenvalues in computational basis populations rather than phases.
-
Circuits of Quantum Hashing and Quantum Fourier Transform for a Cactus as a Qubit Connectivity Graph
An O(n^3) algorithm builds quantum hashing and QFT circuits on cactus qubit graphs by solving the shortest non-simple 1-covering path problem in polynomial time.
-
Quantum Koopman Algorithms
Quantum Koopman Algorithms define an observable-space quantum framework for simulating linear quantum and nonlinear classical dynamics with polylog gate costs in some cases.
-
Near-Optimal Quantum Time Evolution Circuits via Provably Convergent Compression
A recipe for initial points in variational compression of quantum time-evolution operators that provably converges to near-optimal O(N t polylog(N t/ε)) gate complexity for local translationally invariant Hamiltonians.
-
$\mathcal{O}(n)$ alternative to Quantum Fourier Transform with efficient neural net classical post-processing
HP-1 circuits achieve O(n) depth while preserving shift invariance and exponentially growing Fisher information, enabling numerical replacement of the QFT in Shor's algorithm with neural net classical post-processing.
-
CO-MAP: A Reinforcement Learning Approach to the Qubit Allocation Problem
Reinforcement learning policy for qubit mapping reduces SWAP overhead by 65-85% versus standard quantum compilers on MQTBench and Queko benchmark circuits.
-
Demonstrating Record Fidelity for the Quantum Fourier Transform
Parity Architecture delivers record ~0.01 fidelity for 50-qubit QFT on IBM hardware with super-exponential scaling improvement.
-
Exponentially cheaper coherent phase estimation via uncontrolled unitaries
Uncontrolled unitaries plus controlled preparations replace controlled unitaries in phase estimation, cutting two-qubit gates exponentially when eigenstate preparation is known.
-
Exponential Scaling Barriers for Variational Quantum Eigensolvers
Adaptive VQE exhibits exponential growth in iterations and circuit depth with system size, accurately predicted by classical Rényi entropy on molecules with 4-10 orbitals.
-
Deterministic Ground State Preparation via Power-Cosine Filtering of Time Evolution Operators
A single-ancilla Power-Cosine QSP filter on time-evolution operators achieves deterministic many-body ground state preparation with exponential excited-state suppression and O(Δ^{-2} log(1/ε)) depth scaling.
-
Low-Resource Quantum Energy Gap Estimation via Randomization
TE-PAI randomized time evolution can be embedded into shadow spectroscopy to estimate energy gaps, with an unbiasedness proof and demonstrations on up to 20 qubits.
-
Subspace Selected Variational Quantum Configuration Interaction with a Partial Walsh Series
A new variational quantum eigensolver ansatz combines subspace-selected superpositions with diagonal Walsh operators to prepare CI wavefunctions, demonstrated on molecules.
-
Quantum Simulation of Ligand-like Molecules through Sample-based Quantum Diagonalization in Density Matrix Embedding Framework
Using DMET to fragment molecules and SQD to solve the fragments on IBM hardware, the authors report ground-state energies for eight ligand-like molecules that agree with DMET-FCI to within about 10⁻⁶ Hartree.
-
Spin-Adapted Fermionic Unitaries: From Lie Algebras to Compact Quantum Circuits
The paper derives Wei–Norman product formulas for spin-adapted saGSD unitaries, claiming the most compact symmetry-preserving circuits to date, but large-algebra parameters are numerical fits rather than closed forms.
-
First and second quantized digital quantum simulations of bosonic systems
For fixed particle and mode numbers, first-quantized bosonic encodings beat second-quantized ones in gate count for k-RDM terms and standard Hamiltonians, with unary first-quantized cheapest in gates and binary first-...
-
Unifying Qubit Routing Across Diverse Quantum ISAs via Canonical Representation
Canopus unifies qubit mapping and routing across quantum ISAs by modeling synthesis costs via canonical two-qubit gate forms, achieving 15-35% lower routing overhead than prior methods on varied backends and topologies.
-
Resource-efficient variational quantum solver for the travelling salesman problem and its silicon photonics implementation
A variational quantum solver encodes TSP routes in the correlation matrix of two entangled registers, using O(log N) qubits, and is demonstrated for four cities on a silicon photonic chip.
-
Quantum Filtering and Analysis of Multiplicities in Eigenvalue Spectra
QFAMES is a quantum algorithm that identifies clusters of closely spaced dominant eigenvalues and their multiplicities in quantum Hamiltonians under physically motivated assumptions, enabling observable estimation wit...
-
Universal initial state preparation for first quantized quantum simulations
By mapping Fock occupations to Schur labels via the Jordan-Schwinger homomorphism and applying an inverse quantum Schur transform, the paper constructs a first-quantized state-preparation protocol with poly(L,N,log d,...
Reference graph
Works this paper leans on
-
[1]
Quantum mechanical Hamiltonian models of Tu ring machines
P. Benioff, “Quantum mechanical Hamiltonian models of Tu ring machines”, J. Stat. Phys. 29, 515 (1982)
work page 1982
-
[2]
Reversible logic and quantum computers
A. Peres, “Reversible logic and quantum computers”, Phys. Rev. A 32 , 3266 (1985)
work page 1985
-
[3]
R. P. Feynman, “Quantum mechanical computers”, Optics N ews, February 1985, 11, p. 11
work page 1985
-
[4]
Quantum theory, the Church-Turing princip le and the universal quantum computer
D. Deutsch, “Quantum theory, the Church-Turing princip le and the universal quantum computer”, Proc. R. Soc. Lond. A 400 , 97 (1985)
work page 1985
-
[5]
Quantum computational networks
D. Deutsch, “Quantum computational networks”, Proc. Roy. Soc. Lond. A 425, 73 (1989)
work page 1989
-
[6]
A. C.-C. Yao, “Quantum Circuit Complexity”, Proceedings of the 34th Annual Symposium on the Foundations of Computer Science (IEEE Computer Society Press, Los Alamitos, CA, 1993), p. 352
work page 1993
-
[7]
Algorithms for quantum computation: discre te log and factoring
P. W. Shor, “Algorithms for quantum computation: discre te log and factoring”, Pro- ceedings of the 35th Annual Symposium on the Foundations of C omputer Science (IEEE Computer Society Press, Los Alamitos, CA, 1994), p. 124
work page 1994
-
[8]
E. Bernstein and U. Vazirani, “Quantum complexity theor y”, Proceedings of the 25th Annual ACM Symposium on Theory of Computing , (ACM Press, New York, 1993), pp. 11 – 20
work page 1993
Show all 16 references
-
[9]
Testing shift equivalence of polynomial s using quantum machines
D. Grigoriev, “Testing shift equivalence of polynomial s using quantum machines” (to ap- pear)
-
[10]
On the power of quantum computation
D. Simon, “On the power of quantum computation”, Proceedings of the 35th Annual Symposium on the Foundations of Computer Science (IEEE Computer Society Press, Los Alamitos, CA, 1994), p. 116
1994
-
[11]
Rapid solution of problems by quantum computation
D. Deutsch, and R. Jozsa, “Rapid solution of problems by quantum computation”, Pro- ceedings of the Royal Society , London, A439, 1992, 553–558
1992
-
[12]
An approximate Fourier transform use ful in quantum factoring
D. Coppersmith, “An approximate Fourier transform use ful in quantum factoring”, IBM Research Report RC19642 (1994)
1994
-
[13]
Riemann’s hypothesis and tests for prima rity
G. L. Miller, “Riemann’s hypothesis and tests for prima rity”, J. Comp. Sys. Sci , 13, 300–317 (1976)
1976
-
[14]
Machines de Turing reversibles. Recursi ve insolubilite en nǫN de l’equation u =θ n ou θ est un “isomorphism de codes
Yves Lecerf, “Machines de Turing reversibles. Recursi ve insolubilite en nǫN de l’equation u =θ n ou θ est un “isomorphism de codes”. Comptes Rendus 257, 2597–2600 (1963)
1963
-
[15]
Logical reversibility of computation
C. H. Bennett, “Logical reversibility of computation” , IBM Journal of Research and De- velopment 17, 525 (1973)
1973
-
[16]
Elementary gates for quantum computation
A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter, “Elementary gates for quantum computation”, quant-ph/9503016 22
Reviewed May 13, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.