The DOI matches its Crossref record; 43 of the 52 references it cites were found in a registry or an index, and 9 are not checked yet; none of the 18 sources its claims cite is checked for support yet.
Elementary gates for quantum computation
Open accessAbstract
We show that a set of gates that consists of all one-bit quantum gates [U(2)] and the two-bit exclusive-OR gate [that maps Boolean values (x,y) to (x,x\ensuremath{\bigoplus}y)] is universal in the sense that all unitary operations on arbitrarily many bits n [U(${2}^{\mathit{n}}$)] can be expressed as compositions of these gates. We investigate the number of the above gates required to implement other gates, such as generalized Deutsch-Toffoli gates, that apply a specific U(2) transformation to one input bit if and only if the logical and of all remaining input bits is satisfied. These gates play a central role in many proposed constructions of quantum computational networks. We derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number required for arbitrary n-bit unitary operations.
Checked 2026-10-06 · 9 references not checked yet
Overview
AI snapshot
Written from the paper’s full text.
TL;DR
The paper proves that all one-bit quantum gates together with the two-bit exclusive-or gate are universal for quantum computation, and derives explicit gate constructions and bounds for generalized Toffoli and arbitrary unitary operations. It gives polynomial-size constructions for many important gates, including Θ(n²) basic operations for general ∧_{n−1}(U) gates and Θ(n³4ⁿ) two-bit gates for arbitrary n-bit unitaries.
Key findings
- The set consisting of all one-bit gates U(2) and the two-bit XOR gate is universal: every unitary operation on n bits, U(2ⁿ), can be expressed as a composition of these gates.
- A ∧₁(U) gate can be simulated by at most six basic gates: four one-bit gates and two XOR gates (Corollary 5.3). A ∧₂(U) gate can be simulated by at most sixteen basic gates: eight one-bit gates and eight XOR gates (Corollary 6.2).
- For n ≥ 7, a ∧_{n−2}(σ_x) gate can be simulated by 8(n−5) three-bit Toffoli gates, or by 48n−204 basic operations (Corollary 7.4).
- General ∧_{n−1}(U) gates can be simulated in Θ(n²) basic operations, specifically 48n² + O(n) (Corollary 7.6), with an Ω(n) lower bound for nonscalar ∧_{n−1}(U) (Lemma 7.7). Approximation within ε is possible in Θ(n log(1/ε)) basic operations (Lemma 7.8).
- Special cases are more efficient: for W ∈ SU(2), ∧_{n−2}(W) can be simulated in Θ(n) basic operations (Corollary 7.10), and with one fixed workspace bit, general ∧_{n−2}(U) also takes Θ(n) basic operations (Corollary 7.12).
- Any unitary operator on n bits can be simulated exactly using Θ(n³4ⁿ) two-bit gates and no work bits, via a Reck-type decomposition (Section 8).
Methods
- Theoretical quantum gate-array formalism: defines ∧_m(U) gates, Toffoli gates, and the two-bit XOR gate, then constructs networks from basic operations consisting of one-bit gates ∧₀(U) and the XOR gate ∧₁(σ_x).
- Proofs use matrix factorizations of 2×2 unitaries, SU(2) identities, recursive gate constructions, grey-code sequences, gate merging, phase-congruence arguments, and asymptotic recurrence/lower-bound analysis.
- No physical experiments are reported; the paper mentions numerical study as evidence that some constructions are minimal for small cases (Section 8).
Limitations
- The paper explicitly does not address physical realization difficulties, stating that error correction and quantum coherence are “very serious” problems and referring the reader elsewhere.
- It states that for most examples there is no proof the constructions are the most economical, though numerical study gives compelling evidence of minimality.
- The exact simulation of arbitrary n-bit unitaries uses Θ(n³4ⁿ) two-bit gates, which is exponential; the paper notes this is unlikely to provide a polynomial-time simulation for the special unitaries of most interest in quantum computation, and that a truly efficient design methodology remains to be found.
- The Ω(n) lower bound leaves open the possibility of a linear-size simulation of ∧_{n−1}(U) gates, which the paper says it cannot presently show.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
0 of 18 cited sources checked · 0 supported · 0 flagged
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Lemma 5.1: For a unitary 2 × 2 matrix W , a ∧ 1 ( W ) gate can be simulated by a network of the form”
- Also stated in: § 5.1 Simulation of General ∧ 1 ( U ) Gates · p. 10 · plain
“where A , B , and C ∈ SU (2) , if and only if W ∈ SU (2) .”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes- Also stated in: § 5.1 Simulation of General ∧ 1 ( U ) Gates · p. 10 · plain
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Corollary 5.6: For any unitary 2 × 2 matrix U , a ∧ 1 ( U ) gate can be simulated by at most six basic gates: four 1-bit gates ( ∧ 0 ), and two gates ( ∧ 1 ( V ) ), where V is of the form V = R z ( α ) · R y ( θ ) · R z ( α ) · σ x .”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesA result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Still, the presence of a workspace plays an important role in the quantum gate constructions - we find that to implement a family of ∧ m gates exactly, the time required for our implementation can be reduced from Θ( m 2 ) to Θ( m ) merely by the introduction of one bit for workspace.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Lemma 6.1: For any unitary 2 × 2 matrix U , a ∧ 2 ( U ) gate can be simulated by a network of the form”
- Also stated in: § 6.1 Simulation of General ∧ 2 ( U ) Gates · p. 14 · plain
“where V is unitary.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes- Also stated in: § 6.1 Simulation of General ∧ 2 ( U ) Gates · p. 14 · plain
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Lemma 5.4: A ∧ 1 ( W ) gate can be simulated by a network of the form”
- Also stated in: § Lemma 5.4: A ∧ 1 ( W ) gate can be simulated by a network of the form · p. 12 · plain
“where A and B ∈ SU (2) if and only if W is of the form”
- Also stated in: § Lemma 5.4: A ∧ 1 ( W ) gate can be simulated by a network of the form · p. 12 · plain
“where α and θ are real-valued.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes- Also stated in: § Lemma 5.4: A ∧ 1 ( W ) gate can be simulated by a network of the form · p. 12 · plain
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Corollary 6.2: For any unitary 2 × 2 matrix U , a ∧ 2 ( U ) gate can be simulated by at most sixteen basic gates: eight 1-bit gates ( ∧ 0 ) and eight XOR gates ( ∧ 1 ( σ x ) ).”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesA result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We will also exhibit a number of explicit constructions of ∧ m ( U ) using ∧ 1 ( U ), which can all be made polynomial in m .”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Lemma 4.3: For any special unitary matrix W ( W ∈ SU (2) ), there exist matrices A , B , and C ∈ SU (2) such that A · B · C = I and A · σ x · B · σ x · C = W .”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes? Based: unclearThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Corollary 5.3: For any unitary 2 × 2 matrix U , a ∧ 1 ( U ) gate can be simulated by at most six basic gates: four 1-bit gates ( ∧ 0 ), and two XOR gates ( ∧ 1 ( σ x ) ).”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Examples of matrices of the form of Lemma 5.5 are the Pauli matrices”
- Also stated in: § Lemma 5.4: A ∧ 1 ( W ) gate can be simulated by a network of the form · p. 13 · plain
“(as well as σ x itself).”
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passes- Also stated in: § Lemma 5.4: A ∧ 1 ( W ) gate can be simulated by a network of the form · p. 13 · plain
- The quote only partly states this claim. 3
- Probably not a substantial claim. 11
- It may state two separate claims as one. 8
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Lemma 5.5: A ∧ 1 ( V ) gate can be simulated by a construction of the form”
- Also stated in: § Lemma 5.4: A ∧ 1 ( W ) gate can be simulated by a network of the form · p. 13 · plain
“where A and B are unitary if and only if V is of the form”
- Also stated in: § Lemma 5.4: A ∧ 1 ( W ) gate can be simulated by a network of the form · p. 12 · plain
“where α and θ are real-valued.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe quote only partly states this claim.
- Also stated in: § Lemma 5.4: A ∧ 1 ( W ) gate can be simulated by a network of the form · p. 13 · plain
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“A particular feature of the ∧ 1 ( σ z ) gates is that they are symmetric with respect to their input bits.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Examples of matrices of the form of Lemma 5.4 are R y ( θ ) itself, as well as R z ( α ) = R z ( α 2 ) · R y (0) · R z ( α 2 ). However, R x ( θ ) is not of this form.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Lemma 5.2: For any δ and S = Ph ( δ ) , a ∧ 1 ( S ) gate can be simulated by a network of the form”
- Also stated in: § 5.1 Simulation of General ∧ 1 ( U ) Gates · p. 11 · plain
“where E is unitary.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe quote only partly states this claim.
- Also stated in: § 5.1 Simulation of General ∧ 1 ( U ) Gates · p. 11 · plain
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“For example, the ' x -axis rotation matrix' (to use the language suggested by the mapping between SU(2) and SO(3), the group of rigid-body rotations[43])”
- Also stated in: § 5.2 Special Cases · p. 12 · plain
“is special unitary.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
- Also stated in: § 5.2 Special Cases · p. 12 · plain
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Lemma 4.1: Every unitary 2 × 2 matrix can be expressed as”
- Also stated in: § 4 Matrix Properties · p. 8 · plain
“where δ , α , θ , and β are real-valued. Moreover, any special unitary 2 × 2 matrix (i.e., with unity determinant) can be expressed as”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one. The quote only partly states this claim.
- Also stated in: § 4 Matrix Properties · p. 8 · plain
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Note that the 'extra' bit above may be reused in the course of several simulations of ∧ m ( U ) gates.”
Strength:hedged· not yet calibratedCausal:conditional· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The following is a more efficient simulation of a gate congruent to ∧ 2 ( σ x ) modulo phase shifts:”
- Also stated in: § 6.2 Three-bit gates congruent to ∧ 2 ( U ) · p. 16 · plain
“where A = R y ( π 4 ). In the above, the ' ∼ =' indicates that the networks are not identical, but differ at most in the phases of their amplitudes, which are all ± 1 (the phase of the | 101 〉 state is reversed in this case).”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
- Also stated in: § 6.2 Three-bit gates congruent to ∧ 2 ( U ) · p. 16 · plain
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“When the arbitrary two-bit gate is taken as the basic operation, then as we have seen, 5 operations suffice to produce the Toffoli gate (recall Lemma 6.1), 3 produce the Toffoli gate modulo phases (we permit a merging of the operations in the construction of Sec. 6.2), and 13 can be used to produce the 4-bit Toffoli gate (see Lemma 7.1).”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Corollary 7.4: On an n -bit network (where n ≥ 7 ), a ∧ n -2 ( σ x ) gate can be simulated by 8( n -5) ∧ 2 ( σ x ) gates (3-bit Toffoli gates), as well as by 48 n -204 basic operations.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“Note that in this construction and in the ones following, although many of the bits not involved in the gate are operated upon, the gate operation is performed correctly independent of the initial state of the bits (i.e., they do not have to be 'cleared' to 0 first), and they are reset to their initial values after the operations of the gate (as in the computations which occur in [41] and [40]).”
What the sources say
- Not checked yetcites [41] [41] Michael Ben-Or and Richard Cleve, 'Computing algebraic formulas using a constant number of registers', SIAM J. Comput. 21 , 54 (1992). -
- Not checked yetcites [40] [40] Richard Cleve, 'Reversible Programs and Simple Product Ciphers' in Methodologies for Designing Block Ciphers and Cryptographic Protocols , PhD Thesis, University of Toronto, pp. 2-56 (1989). -
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Later we will use the fact that because ∧ 2 ( σ x ) is its own inverse, either the simulation of Lemma 6.1 or the time-reversed simulation (in which the order of the gates is reversed, and each unitary operator is replaced by its Hermitian conjugate) may be used.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
In the paper
“The formalism we use for quantum computation, which we call a quantum 'gate array' was introduced by Deutsch [24], who showed that a simple generalization of the Toffoli gate (the three-bit gate ∧ 2 ( R x ), in the language introduced later in this paper) suffices as a universal gate for quantum computing.”
What the sources say
- Not matchedcites [24] [24] D. Deutsch, 'Quantum computational networks', Proc. Roy. Soc. Lond. A 425 , 73 (1989). -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Strength:boosted· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“It is possible to perform any computation in a way that is reversible both logically -i.e., the computation is a sequence of bijective transformations-and thermodynamically -the computation could in principle be performed by a physical apparatus dissipating arbitrarily little energy [2].”
What the sources say
- Not checked yetcites [2] [2] R. Landauer, 'Irreversibility and heat generation in the computing process', IBM J. Res. Dev. 5 , 183 (1961); C. H. Bennett, 'Logical reversibility of computation', IBM Journal of Research and Development, 17 , 525 (1973); Yves Lecerf, 'Machines de Turing reversibles. Recursive insolubilite en nεN de l'equation u = θ n ou θ est un 'isomorphism de codes'. Comptes Rendus 257 , 2597-2600 (1963); C. H. Bennett, 'Time/space trade-offs for reversible computation', SIAM J. Comput. 18 , 766 (1989). For a review, see C. H. Bennett and R. Landauer, 'Physical limits of computation', Scientific Americ source
Load-bearingStrength:hedged· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
In the paper
“Fortunately, Yao has shown [27] that acyclic quantum gate arrays can simulate quantum Turing machines.”
What the sources say
- Not checked yetcites [27] [27] 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. -
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“( R x is of special interest because ∧ 2 ( iR x ) is the 'Deutsch gate'[24], which was shown to be universal for quantum logic.)”
What the sources say
- Not matchedcites [24] [24] D. Deutsch, 'Quantum computational networks', Proc. Roy. Soc. Lond. A 425 , 73 (1989). -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
- Not matched
In the paper
“Sleator and Weinfurter[9], who exhibited a scheme for obtaining the Toffoli gate with a sequence of exactly five two-bit gates.”
What the sources say
- Not matchedcites [9] [9] Tycho Sleator and Harald Weinfurter, 'Realizable universal quantum logic gates', preprint (1994). -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Strength:boosted· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“In fact, it is well known that only a tiny fraction of Boolean functions (those which are linear with respect to modulo 2 arithmetic) can be generated with these gates[39].”
What the sources say
- Not checked yetcites [39] [39] D. Coppersmith and E. Grossman, 'Generators for Certain Alternating Groups with Applications to Cryptography', SIAM J. Applied Math. 29 , No. 4, pp. 624-627 (1975). -
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
In the paper
“Fredkin and Toffoli[3] showed that there exists a 3-bit 'universal gate' for reversible computation, that is, a gate which, when applied in succession to different triplets of bits in a gate array, could be used to simulate any arbitrary reversible computation.”
What the sources say
- Not matchedcites [3] [3] E. Fredkin and T. Toffoli, 'Conservative Logic', Internat. J. Theoret. Phys. 21 , 219 (1982). -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
- Not matched
In the paper
“This unitary evolution on a normalized state vector is known to be the correct physical description of an isolated system evolving in time according to the laws of quantum mechanics[1].”
What the sources say
- Not checked yetcites [1] [1] P. A. M. Dirac, The Principles of Quantum Mechanics , (Oxford, 1958), Chap. 5; for a modern treatment, see A. Peres, Quantum Theory: Concepts and Methods , (Kluwer, 1993), Chap. 8.6. - source
Load-bearingStrength:boosted· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In fact for general k, time-efficient design as in Fig. 5a requires k-2 zeroed work qubits within depth 2k-3, whereas space-efficient design as in Fig. 5b uses only one arbitrary qubit within depth 8k-24 (for k ≥ 5) [32].”
From Time–space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 (2018) · cites this paper as [32]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Any two-qubit gate can be obtained from this minimal set by using circuit decompositions (Barenco et al. , 1995; Blaauboer and De Visser, 2008; de Guise et al. , 2018; Peterson et al. , 2020; Watts et al. , 2013).”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Barenco et al., 1995
In the citing paper
“We should point out here that the results presented here give faster gates than any results for the maximum speed of Toffoli gates in the literature [2,3].”
From Speed limits for quantum gates in multiqubit systems (2012) · cites this paper as [3]
In the citing paper
“In particular, one can compare the factor 1.9 in Table II with the corresponding factor of 2.2 in Ref. [3]: an improvement of about 15%.”
From Speed limits for quantum gates in multiqubit systems (2012) · cites this paper as [3]
In the citing paper
“An optimal-control-theory-related calculation based on certain forms of pulses has found a gate time of about 2.2 times the CNOT gate time for qubits coupled in a triangle geometry [3].”
From Speed limits for quantum gates in multiqubit systems (2012) · cites this paper as [3]
In the citing paper
“Although computational universality might at first seem to be a stringent demand on a physical system, a wide variety of physical systems - ranging from nearest neighbor Ising models 52 to quantum electrodynamics 84 and conformal field theories 86 - are known to be computationally universal 51 -53 , 55 -65 .”
From Ultimate physical limits to computation (2000) · cites this paper as [59]
In the citing paper
“In other words, given an arbitrary quantum gate, there is a circuit built from one-and two-qubit gates that can enact it to arbitrary precision.”
From The prospects of quantum computing in computational molecular biology (2021) · cites this paper as [47]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Corollary 7.4 miscounts the remaining Toffoli gates
MinorThe stated total is 8(n−5) Toffoli gates. If 4 are simulated exactly, the number of other gates is 8n−44, not 8n−36.
“a ∧ n -2 ( σ x ) gate can be simulated by 8( n -5) ∧ 2 ( σ x ) gates”
“only 4 of the Toffoli gates, the ones which involve the last bit in the diagram above, need to be simulated exactly according to the construction of Corollary 6.2. Thus these 4 gates are simulated by 16 basic operations, while the other 8 n -36 Toffoli gates are simulated in just 6 basic operations.”
Citations
Cites
The Principles of Quantum Mechanics
Dirac, P. A. M., & Polkinghorne, J. C. (1958) · Physics Today · doi:10.1063/1.3062610 · Cited by 5,409
Irreversibility and heat generation in the computing process
Landauer, R. (1961) · IBM Journal of Research and Development · doi:10.1147/rd.53.0183 · Cited by 4,980
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Quantum Computations with Cold Trapped Ions
Cirac, J. I., & Zoller, P. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.4091 · Cited by 3,733
Logical Reversibility of Computation
Bennett, C. H. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.176.0525 · Cited by 3,679
Self-citationRapid solution of problems by quantum computation
Deutsch, D., & Jozsa, R. (1992) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1992.0167 · Cited by 2,700
Irreversibility and heat generation in the computing process
Landauer, R. W. (2000) · IBM Journal of Research and Development · doi:10.1147/rd.441.0261 · Cited by 2,665
Experimental realization of any discrete unitary operator
Reck, M., Zeilinger, A., Bernstein, H. J., & Bertani, P. (1994) · Physical Review Letters · doi:10.1103/physrevlett.73.58 · Cited by 2,155
Fredkin, E., & Toffoli, T. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857727 · Cited by 1,896
Feynman, R. P. (1986) · Foundations of Physics · doi:10.1007/bf01886518 · Cited by 1,770
Flagged first, then by citations
Research works printed but not linked: 2
- A. C. C. Yao, Proceedings of the 34th Annual Symposium on the Foundations of Computer Science
- D. P. DiVincenzo, Proceedings of the Workshop on Physics and Computation, PhysComp '94
Cited by
Sorted by citations
Items 501–600 of 1,008
Flexible representation and manipulation of audio signals on quantum computers
Yan, F., Iliyasu, A. M., Guo, Y., & Yang, H. (2017) · Theoretical Computer Science · doi:10.1016/j.tcs.2017.12.025 · Cited by 75
An Introduction to Quantum Complexity Theory
Cleve, R. (2001) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789810248185_0004 · Cited by 92
Self-citationThe physics of information technology
(2001) · Choice Reviews Online · doi:10.5860/choice.38-5598 · Cited by 79
Subsystem symmetries, quantum cellular automata, and computational phases of quantum matter
Stephen, D., Nautrup, H., Bermejo-Vega, J., Eisert, J., & Raussendorf, R. (2019) · MPG.PuRe (Max Planck Society) · Cited by 75
Neural networks with quantum architecture and quantum learning
Panella, M., & Martinelli, G. (2009) · International Journal of Circuit Theory and Applications · doi:10.1002/cta.619 · Cited by 79
TERASHIMA, H., & UEDA, M. (2005) · International Journal of Quantum Information · doi:10.1142/s0219749905001456 · Cited by 81
Quantum gate learning in qubit networks: Toffoli gate without time-dependent control
Banchi, L., Pancotti, N., & Bose, S. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.19 · Cited by 74
Quantum synchronization on the IBM Q system
Koppenhöfer, M., Bruder, C., & Roulet, A. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.023026 · Cited by 81
A novel image encryption scheme based on quantum dynamical spinning and rotations
Khan, M., & Waseem, H. M. (2018) · PLoS ONE · doi:10.1371/journal.pone.0206460 · Cited by 74
RetractedTrading T gates for dirty qubits in state preparation and unitary synthesis
Low, G. H., Kliuchnikov, V., & Schaeffer, L. (2024) · Quantum · doi:10.22331/q-2024-06-17-1375 · Cited by 138
Scalable quantum computing with qudits on a graph
Kiktenko, E. O., Nikolaeva, A. S., Xu, P., Shlyapnikov, G. V., & Fedorov, A. K. (2020) · Physical Review A · doi:10.1103/physreva.101.022304 · Cited by 71
Dangling-bond charge qubit on a silicon surface
Livadaru, L., Xue, P., Shaterzadeh‐Yazdi, Z., DiLabio, G. A., Mutus, J., Pitters, J., Sanders, B. C., & Wolkow, R. A. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/8/083018 · Cited by 74
Phase gate of one qubit simultaneously controlling n qubits in a cavity
Yang, C., Liu, Y.-X., & Nori, F. (2010) · Physical Review A · doi:10.1103/physreva.81.062323 · Cited by 74
Valiant, L. G. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(01)00325-5 · Cited by 70
Manipulation of single neutral atoms in optical lattices
Zhang, C., Rolston, S. L., & Sarma, S. D. (2006) · Physical Review A · doi:10.1103/physreva.74.042316 · Cited by 74
Quantum fast Poisson solver: the algorithm and complete and modular circuit design
Wang, S., Wang, Z., Li, W., Fan, L., Wei, Z., & Gu, Y. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02669-7 · Cited by 83
Time-sliced quantum circuit partitioning for modular architectures
Baker, J. M., Duckering, C., Hoover, A., & Chong, F. T. (2020) · ACM International Conference on Computing Frontiers (CF) · doi:10.1145/3387902.3392617 · Cited by 95
Synthesis of multivalued quantum logic circuits by elementary gates
Di, Y.-M., & Wei, H. (2013) · Physical Review A · doi:10.1103/physreva.87.012325 · Cited by 76
Quantum Reed-Solomon CodesPreprint
Grassl, M., Geiselmann, W., Beth, T., & Karlsruhe, U. (1999) · Cited by 75
Processing multiphoton states through operation on a single photon: Methods and applications
Lin, Q., He, B., Bergou, J. A., & Ren, Y. (2009) · Physical Review A · doi:10.1103/physreva.80.042311 · Cited by 71
Decoherence and relaxation of a superconducting quantum bit during measurement
Tian, L., Lloyd, S., & Orlando, T. P. (2002) · Physical review. B, Condensed matter · doi:10.1103/physrevb.65.144516 · Cited by 72
Quantum Computing Applications of Genetic Programming
(1999) · The MIT Press eBooks · doi:10.7551/mitpress/1110.003.0010 · Cited by 70
Schumann, R. H. (2018) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789813237230_0009 · Cited by 78
The Complexity of the Local Hamiltonian Problem
Kempe, J., Kitaev, A., & Regev, O. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30538-5_31 · Cited by 71
Resource-Optimal Single-Qubit Quantum Circuits
Bocharov, A., & Svore, K. M. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.190501 · Cited by 69
Linear-depth quantum circuits for n -qubit Toffoli gates with no ancilla
Saeedi, M., & Pedram, M. (2013) · Physical Review A · doi:10.1103/physreva.87.062318 · Cited by 71
Hirata, Y., Nakanishi, M., Yamashita, S., & Nakashima, Y. (2009) · International Conference on Quantum, Nano and Micro Technologies (ICQNM) · doi:10.1109/icqnm.2009.25 · Cited by 71
Kole, A., Datta, K., & Sengupta, I. (2016) · IEEE Journal on Emerging and Selected Topics in Circuits and Systems · doi:10.1109/jetcas.2016.2528720 · Cited by 70
Allowable Generalized Quantum Gates
Gui-Lu, L., Yang, L., & Wang, C. X. (2009) · Communications in Theoretical Physics · doi:10.1088/0253-6102/51/1/13 · Cited by 71
Checking equivalence of quantum circuits and states
Viamontes, G. F., Markov, I. L., & Hayes, J. P. (2007) · Digest of technical papers/Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design · doi:10.1109/iccad.2007.4397246 · Cited by 72
Coherent controlization using superconducting qubits
Friis, N., Melnikov, A. A., Kirchmair, G., & Briegel, H. J. (2015) · Scientific Reports · doi:10.1038/srep18036 · Cited by 68
Shortcuts to adiabatic passage for multiqubit controlled-phase gate
Liang, Y., Wu, Q., Su, S., Ji, X., & Zhang, S. (2015) · Physical Review A · doi:10.1103/physreva.91.032304 · Cited by 70
ANALYTIC ONE-BIT AND CNOT GATE CONSTRUCTIONS OF GENERAL n-QUBIT CONTROLLED GATES
Liu, Y., LONG, G. L., & Sun, Y. (2008) · International Journal of Quantum Information · doi:10.1142/s0219749908003621 · Cited by 70
Experimental realization of a quantum game on a one-way quantum computer
Prevedel, R., Stefanov, A., Walther, P. J., & Zeilinger, A. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/205 · Cited by 69
Liquid-state NMR simulations of quantum many-body problems
Negrevergne, C., Somma, R. D., Ortíz, G., Knill, E., & Laflamme, R. (2005) · Physical Review A · doi:10.1103/physreva.71.032344 · Cited by 71
Geometric transformations of multidimensional color images based on NASS
Fan, P., Zhou, R., Jing, N., & Li, H.-S. (2016) · Information Sciences · doi:10.1016/j.ins.2015.12.024 · Cited by 71
One-Pass Design of Reversible Circuits: Combining Embedding and Synthesis for Reversible Logic
Zulehner, A., & Wille, R. (2018) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2017.2729468 · Cited by 72
Quantum image encryption algorithm based on Arnold scrambling and wavelet transforms
Hu, W., Zhou, R., Luo, J., Jiang, S.-X., & Luo, G. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-2579-9 · Cited by 72
Climbing mount scalable: Physical resource requirements for a scalable quantum computer
Blume-Kohout, R., Caves, C. M., & Deutsch, I. (2002) · Cited by 70
Robust hyperparallel photonic quantum entangling gate with cavity QED
Ren, B., & Deng, F. (2017) · Optics Express · doi:10.1364/oe.25.010863 · Cited by 70
Clustering of Conditional Mutual Information for Quantum Gibbs States above a Threshold Temperature
Kuwahara, T., Kato, K., & Brandão, F. G. S. L. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.220601 · Cited by 75
Universal gate-set for trapped-ion qubits using a narrow linewidth diode laser
Akerman, N., Navon, N., Kotler, S., Glickman, Y., & Ozeri, R. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/11/113060 · Cited by 69
Teleportation-based realization of an optical quantum two-qubit entangling gate
Gao, W.-B., Goebel, A., Lu, C., Dai, H.-N., Wagenknecht, C., Zhang, Q., Zhao, B., Peng, C.-Z., Chen, Z., Chen, Y.-A., et al. (2010) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1005720107 · Cited by 70
Protecting Conditional Quantum Gates by Robust Dynamical Decoupling
Piltz, C., Scharfenberger, B., Khromova, A., Varón, A. F., & Wunderlich, C. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.200501 · Cited by 69
Majority-based reversible logic gates
Yang, G., Hung, W. N. N., Song, X., & Perkowski, M. A. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2004.12.026 · Cited by 71
Minimum Construction of Two-Qubit Quantum Operations
Zhang, J., Vala, J., Sastry, S., & Whaley, K. B. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.020502 · Cited by 69
Cluster states from Heisenberg interactions
Borhani, M., & Loss, D. (2005) · Physical Review A · doi:10.1103/physreva.71.034308 · Cited by 68
Exact Two-Qubit Universal Quantum Circuit
Zhang, J., Vala, J., Sastry, S., & Whaley, K. B. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.027903 · Cited by 76
Wei, H.-R., & Deng, F.-G. (2014) · Scientific Reports · doi:10.1038/srep07551 · Cited by 68
QUANTUM COMPUTATION WITH BALLISTIC ELECTRONS
Ionicioiu, R., Amaratunga, G. A. J., & Udrea, F. (2001) · International Journal of Modern Physics B · doi:10.1142/s0217979201003521 · Cited by 68
A New Heuristic for $N$ -Dimensional Nearest Neighbor Realization of a Quantum Circuit
Kole, A., Datta, K., & Sengupta, I. (2017) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2017.2693284 · Cited by 68
Positive operator valued measure in quantum information processing
Brandt, H. E. (1999) · American Journal of Physics · doi:10.1119/1.19280 · Cited by 69
Synthesis of Quantum Multiple-Valued Circuits.
Miller, D. M., Maslov, D., & Dueck, G. W. (2006) · Cited by 66
Reversible logic circuit synthesis
Shende, V., Prasad, A. K., Markov, I. L., & Hayes, J. P. (2003) · doi:10.1109/iccad.2002.1167558 · Cited by 68
Grover search with pairs of trapped ions
Feng, M. (2001) · Physical Review A · doi:10.1103/physreva.63.052308 · Cited by 69
Qubit allocation as a combination of subgraph isomorphism and token swapping
Siraichi, M. Y., dos Santos, V. F., Collange, C., & Pereira, F. M. Q. (2019) · Proceedings of the ACM on Programming Languages · doi:10.1145/3360546 · Cited by 76
Evolution of Quantum Computing: A Systematic Survey on the Use of Quantum Computing Tools
Upama, P. B., Faruk, M. J. H., Nazim, M. T. B., Masum, M., Shahriar, H., Uddin, G., Barzanjeh, S., Ahamed, S. I., & Rahman, A. (2022) · IEEE Annual International Computer Software and Applications Conference (COMPSAC) · doi:10.1109/compsac54236.2022.00096 · Cited by 80
Discrete cosine transforms on quantum computers
Klappenecker, A., & Rötteler, M. (2002) · International symposium on image and signal processing and analysis/ISPA ... · doi:10.1109/ispa.2001.938674 · Cited by 69
Minimally entangled state preparation of localized wave functions on quantum computers
Klco, N., & A, M. J. S. (2020) · Physical Review A · doi:10.1103/physreva.102.012612 · Cited by 67
Quantum algorithms for jet clustering
Wei, A. Y., Naik, P., Harrow, A. W., & Thaler, J. (2020) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.101.094015 · Cited by 65
Factoring in a dissipative quantum computer
Miquel, C., Paz, J. P., & Perazzo, R. P. J. (1996) · Physical Review A · doi:10.1103/physreva.54.2605 · Cited by 67
Climbing Mount Scalable: Physical Resource Requirements for a Scalable Quantum Computer
Blume-Kohout, R., Caves, C. M., & Deutsch, I. H. (2002) · Foundations of Physics · doi:10.1023/a:1021471621587 · Cited by 84
QuCloud: A New Qubit Mapping Mechanism for Multi-programming Quantum Computing in Cloud Environment
Liu, L., & Dou, X. (2021) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca51647.2021.00024 · Cited by 79
Stable organic radical qubits and their applications in quantum information science
Zhou, A.-M., Sun, Z., & Sun, L. (2024) · The Innovation · doi:10.1016/j.xinn.2024.100662 · Cited by 71
Quantum Computing and Communication Complexity
de Wolf, R. (2001) · Cited by 78
Quantum logic between atoms inside a high- Q optical cavity
You, L., Yi, X. X., & Su, X. H. (2003) · Physical Review A · doi:10.1103/physreva.67.032308 · Cited by 64
Generic quantum Fourier transforms
Moore, C., Rockmore, D. N., & Russell, A. C. (2006) · ACM Transactions on Algorithms · doi:10.1145/1198513.1198525 · Cited by 64
Introduction to Grassmann manifolds and quantum computation
Fujii, K. (2002) · Journal of Applied Mathematics · doi:10.1155/s1110757x02110163 · Cited by 62
Simple factorization of unitary transformations
de Guise, H., Di Matteo, O., & Sánchez-Soto, L. L. (2018) · Physical Review A · doi:10.1103/physreva.97.022328 · Cited by 70
Software engineering for quantum programming: How far are we?
Stefano, M. D., Pecorelli, F., Nucci, D. D., Palomba, F., & Lucia, A. D. (2022) · Journal of Systems and Software · doi:10.1016/j.jss.2022.111326 · Cited by 81
Qudit-based high-dimensional controlled-not gate
Du, F., Ren, X.-M., Ma, M., & Fan, G. (2024) · Optics Letters · doi:10.1364/ol.518336 · Cited by 65
Sinha, N., Mahesh, T. S., Ramanathan, K. V., & Kumar, A. (2001) · The Journal of Chemical Physics · doi:10.1063/1.1346645 · Cited by 61
Quantum Computation-Based Image Representation, Processing Operations and Their Applications
Yan, F., Iliyasu, A. M., & Jiang, Z. (2014) · Entropy · doi:10.3390/e16105290 · Cited by 67
Strategies and networks for state-dependent quantum cloning
Chefles, A., & Barnett, S. M. (1999) · Physical Review A · doi:10.1103/physreva.60.136 · Cited by 67
Multiparticle entanglement with quantum logic networks: Application to cold trapped ions
Šašura, M., & Bužek, V. (2001) · Physical Review A · doi:10.1103/physreva.64.012305 · Cited by 65
Solid-state quantum computing using spectral holes
Shahriar, M. S., Hemmer, P., Lloyd, S., Bhatia, P. S., & Craig, A. E. (2002) · Physical Review A · doi:10.1103/physreva.66.032301 · Cited by 68
Quantum computer with mixed states and four-valued logic
Tarasov, V. E. (2002) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/35/25/305 · Cited by 65
Lidar, D. A., Bacon, D., Kempe, J., & Whaley, K. B. (2001) · Physical Review A · doi:10.1103/physreva.63.022307 · Cited by 62
Both Toffoli and Controlled-NOT need little help to universal quantum computing
Shi, Y.-Y. (2003) · Quantum Information and Computation · doi:10.26421/qic3.1-7 · Cited by 193
Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians
Haah, J., Hastings, M. B., Kothari, R., & Low, G. H. (2018) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2018.00041 · Cited by 70
Improving the mapping of reversible circuits to quantum circuits using multiple target lines
Wille, R., Soeken, M., Otterstedt, C., & Drechsler, R. (2013) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/aspdac.2013.6509587 · Cited by 64
Towards Realising Secure and Efficient Image and Video Processing Applications on Quantum Computers
Iliyasu, A. M. (2013) · Entropy · doi:10.3390/e15082874 · Cited by 63
Yepez, J. (2001) · International Journal of Modern Physics C · doi:10.1142/s0129183101002668 · Cited by 64
A QUICK GLANCE AT QUANTUM CRYPTOGRAPHY
Lomonaco, S. J. (1999) · Cryptologia · doi:10.1080/0161-119991887739 · Cited by 75
Reducing Reversible Circuit Cost by Adding Lines
Miller, D. M., Wille, R., & Drechsler, R. (2010) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl.2010.48 · Cited by 64
A linear-size quantum circuit for addition with no ancillary qubits
Takahashi, Y., & Kunihiro, N. (2005) · Quantum Information and Computation · doi:10.26421/qic5.6-2 · Cited by 66
Low-Cost Fredkin Gate with Auxiliary Space
Liu, W., Wei, H., & Kwek, L. C. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.14.054057 · Cited by 66
Analysis and Synthesis of Quantum Circuits by Using Quantum Decision Diagrams
Abdollahi, A., & Pedram, M. (2006) · Design, Automation, and Test in Europe · doi:10.1109/date.2006.244176 · Cited by 63
Wu, L.-A., & Lidar, D. A. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499208 · Cited by 66
Quantum entanglement using trapped atomic spins
You, L., & Chapman, M. (2000) · Physical Review A · doi:10.1103/physreva.62.052302 · Cited by 63
Quantum Cloning Machines and the ApplicationsPreprint
Fan, H., Wang, Y.-N., Li, J., Yue, J.-D., Shi, H., Zhang, Y., & Mu, L.-Z. (2013) · Cited by 68
New Logic Synthesis as Nanotechnology Enabler
Amarù, L., Gaillardon, P., Mitra, S., & Micheli, G. D. (2015) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2460377 · Cited by 62
Simulation of many-body interactions by conditional geometric phases
Wang, X., & Zanardi, P. (2002) · Physical Review A · doi:10.1103/physreva.65.032327 · Cited by 61
Reducing the number of lines in reversible circuits
Wille, R., Soeken, M., & Drechsler, R. (2010) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/1837274.1837439 · Cited by 62
Nishimura, H., & Ozawa, M. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(01)00111-6 · Cited by 71
Quantum Computation with Phase Drift Errors
Miquel, C., Paz, J. P., & Zurek, W. H. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.3971 · Cited by 61
Revisiting the simulation of quantum Turing machines by quantum circuits
Molina, A., & Watrous, J. (2019) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2018.0767 · Cited by 64
A programmable two-qubit solid-state quantum processor under ambient conditions
Wu, Y., Wang, Y., Qin, X., Rong, X., & Du, J. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0129-z · Cited by 68
Impact of qubit connectivity on quantum algorithm performance
Holmes, A., Johri, S., Guerreschi, G. G., Clarke, J. S., & Matsuura, A. Y. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab73e0 · Cited by 67
Verifying Results of the IBM Qiskit Quantum Circuit Compilation Flow
Burgholzer, L., Raymond, R., & Wille, R. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00051 · Cited by 64
Metadata
- Authors
- Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H.
- Affiliations
- AT&T (United States) (US)
- ORCID
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 1995-11-01
- Volume
- 52
- Issue
- 5
- Pages
- 3457-3467
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2102008187
- Semantic Scholar
- 59b447f58246fbbdffd5e896f83a3a142eca5cf1
- Cited by
- 4,311
- References
- 52
- Citations by year
- 2026: 201 · 2025: 271 · 2024: 253 · 2023: 271 · 2022: 258 · 2021: 218 · 2020: 200 · 2019: 179 · 2018: 152 · 2017: 125 · 2016: 125 · 2015: 130 · 2014: 119 · 2013: 124 · 2012: 136
- FWCI
- 63.39
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review A (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Quantum-Dot Cellular Automata
- Keywords
- quantum gates, XOR gate, gate decomposition, circuit complexity, lower bounds, upper bounds, quantum computing
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-10-06, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-06 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
