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 701–800 of 1,008
Quantum arithmetic and numerical analysis using Repeat-Until-Success circuits
Wiebe, N., & Roetteler, M. (2016) · Quantum Information and Computation · doi:10.26421/qic16.1-2-9 · Cited by 61
Sampling Rotation Groups by Successive Orthogonal Images
Mitchell, J. C. (2008) · SIAM Journal on Scientific Computing · doi:10.1137/030601879 · Cited by 51
Reversible Logic Synthesis with Output Permutation
Wille, R., Grosse, D. J., Dueck, G. W., & Drechsler, R. (2009) · International Conference on VLSI Design · doi:10.1109/vlsi.design.2009.40 · Cited by 51
Mohammadi, M., Eshghi, M., Haghparast, M., & Bahrololoom, A. (2008) · Cited by 51
LSBs-based quantum color images watermarking algorithm in edge region
Hu, W., Zhou, R., Luo, J., & Liu, B. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2138-9 · Cited by 51
An improved flexible representation of quantum images
Khan, R. A. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2306-6 · Cited by 52
Quantum Image Watermarking Algorithm Based on Haar Wavelet Transform
Hu, W., Zhou, R., El-Rafei, A., & Jiang, S.-X. (2019) · IEEE Access · doi:10.1109/access.2019.2937390 · Cited by 53
Quantum video encryption based on qubit-planes controlled-XOR operations and improved logistic map
Song, X., Wang, H., Venegas-Andraca, S. E., & El‐Latif, A. A. A. (2019) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2019.122660 · Cited by 51
Quantum image processing algorithm using edge extraction based on Kirsch operator
Xu, P., He, Z., Qiu, T., & Ma, H. (2020) · Optics Express · doi:10.1364/oe.386283 · Cited by 51
Adiabatic Spectroscopy and a Variational Quantum Adiabatic Algorithm
Schiffer, B. F., Brugués, J. T. I., & Cirac, J. (2021) · PRX Quantum · doi:10.1103/prxquantum.3.020347 · Cited by 50
Schumacher’s quantum data compression as a quantum computation
Cleve, R., & Divincenzo, D. P. (1996) · Physical Review A · doi:10.1103/physreva.54.2636 · Cited by 52
Self-citationIntroduction to quantum algorithms
Shor, P. W. (2002) · Proceedings of symposia in applied mathematics · doi:10.1090/psapm/058/1922896 · Cited by 55
Self-citationFast Multiqubit Gates through Simultaneous Two-Qubit Gates
Gu, X. Q., Fernández-Pendás, J., Vikstål, P., Abad, T., Warren, C., Bengtsson, A., Tancredi, G., Shumeiko, V. S., Bylander, J., Johansson, G., et al. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040348 · Cited by 49
Liu, P., Wang, R., Zhang, J.-N., Zhang, Y., Cai, X., Xu, H., Li, Z., Han, J., Li, X., Xue, G., et al. (2023) · Physical Review X · doi:10.1103/physrevx.13.021028 · Cited by 51
Trading off circuit lines and gate costs in the synthesis of reversible logic
Wille, R., Soeken, M., Miller, D. M., & Drechsler, R. (2013) · Integration · doi:10.1016/j.vlsi.2013.08.002 · Cited by 51
Distilling one-qubit magic states into Toffoli states
Eastin, B. (2013) · Physical Review A · doi:10.1103/physreva.87.032321 · Cited by 50
Quantum computation with Kerr-nonlinear photonic crystals
Azuma, H. (2007) · Journal of Physics D Applied Physics · doi:10.1088/0022-3727/41/2/025102 · Cited by 53
Experimental architecture of joint remote state preparation
Luo, M., Chen, X., Yang, Y., & Niu, X. (2011) · Quantum Information Processing · doi:10.1007/s11128-011-0283-5 · Cited by 50
QHSL: A quantum hue, saturation, and lightness color model
Yan, F., Li, N., & Hirota, K. (2021) · Information Sciences · doi:10.1016/j.ins.2021.06.077 · Cited by 52
Experimental realization of a two-bit phase damping quantum code
Leung, D., Vandersypen, L. M. K., Zhou, X., Sherwood, M., Yannoni, C. S., Kubinec, M. G., & Chuang, I. L. (1999) · Physical Review A · doi:10.1103/physreva.60.1924 · Cited by 52
Quantum phase gate through a dispersive atom-field interaction
Zou, X., Xiao, Y., Li, S., Yang, Y., & Guo, G. (2007) · Physical Review A · doi:10.1103/physreva.75.064301 · Cited by 50
Synthesis of multi-qudit hybrid and d-valued quantum logic circuits by decomposition
Khan, F. S., & Perkowski, M. A. (2006) · Theoretical Computer Science · doi:10.1016/j.tcs.2006.09.006 · Cited by 50
Synthesis of multipurpose reversible logic gates
Kerntopf, P. (2003) · Euromicro Conference on Digital System Design (DSD) · doi:10.1109/dsd.2002.1115377 · Cited by 50
Transformation rules for designing CNOT-based quantum circuits
Iwama, K., Kambayashi, Y., & Yamashita, S. (2002) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac.2002.1012662 · Cited by 50
Rule-based optimization of reversible circuitsPreprint
Arabzadeh, M., Saeedi, M., & Zamani, M. S. (2010) · arXiv (Cornell University) · doi:10.5555/1899721.1899916 · Cited by 50
A new algorithm for producing quantum circuits using KAK decompositions
Nakajima, M. Y., Kawano, Y., & Sekigawa, H. (2006) · Quantum Information and Computation · doi:10.26421/qic6.1-5 · Cited by 49
Machine Learning Optimization of Quantum Circuit Layouts
Paler, A., Sasu, L. M., Florea, A.-C., & Andonie, R. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3565271 · Cited by 64
Quantum advantage and noise reduction in distributed quantum computing
Avron, J. E., Casper, O., & Rozen, I. (2021) · Physical Review A · doi:10.1103/physreva.104.052404 · Cited by 49
An Efficient Algorithm for Sparse Quantum State Preparation
Gleinig, N., & Hoefler, T. (2021) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac18074.2021.9586240 · Cited by 49
Linear-depth quantum circuits for multiqubit controlled gates
da Silva, A. J., & Park, D. K. (2022) · Physical Review A · doi:10.1103/physreva.106.042602 · Cited by 51
Dynamical invariants for quantum control of four-level systems
Güngördü, U., Wan, Y., Fasihi, M. A., & Nakahara, M. (2012) · Physical Review A · doi:10.1103/physreva.86.062312 · Cited by 49
Maslov, D., & Miller, D. M. (2007) · IET Computers & Digital Techniques · doi:10.1049/iet-cdt:20060070 · Cited by 46
Efficient compression of quantum information
Plesch, M., & Bužek, V. (2010) · Physical Review A · doi:10.1103/physreva.81.032317 · Cited by 49
Optimal quantum circuit synthesis from controlled-unitary gates
Zhang, J., Vala, J., Sastry, S., & Whaley, K. B. (2004) · Physical Review A · doi:10.1103/physreva.69.042309 · Cited by 55
Efficient synthesis of quantum circuits implementing clifford group operations
Niemann, P., Wille, R., & Drechsler, R. (2014) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/aspdac.2014.6742938 · Cited by 48
Two-electron quantum dots as scalable qubits
Jefferson, J. H., Fearn, M., Tipton, D. L. J., & Spiller, T. P. (2002) · Physical Review A · doi:10.1103/physreva.66.042328 · Cited by 48
Complete control of a matter qubit using a single picosecond laser pulse
Kodriano, Y., Schwartz, I., Poem, E., Benny, Y., Presman, R., Truong, T. A., Petroff, P. M., & Gershoni, D. (2012) · Physical Review B · doi:10.1103/physrevb.85.241304 · Cited by 47
T-Count Optimization and Reed–Muller Codes
Amy, M., & Mosca, M. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2906374 · Cited by 49
Thresholds for Universal Concatenated Quantum Codes
Chamberland, C., Jochym-O’Connor, T., & Laflamme, R. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.010501 · Cited by 52
Programmable Superconducting Processor with Native Three-Qubit Gates
Roy, T., Hazra, S., Kundu, S., Chand, M., Patankar, M. P., & Vijay, R. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.14.014072 · Cited by 55
Arrow of time and its reversal on the IBM quantum computer
Lesovik, G. B., Sadovskyy, I., Suslov, M. V., Lebedev, A. V., & Vinokur, V. M. (2019) · Scientific Reports · doi:10.1038/s41598-019-40765-6 · Cited by 57
Primitive quantum gates for dihedral gauge theories
Alam, M. S., Hadfield, S., Lamm, H., & Li, A. C. Y. (2022) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.105.114501 · Cited by 49
Polynomial time quantum computation with advice
Nishimura, H., & Yamakami, T. (2004) · Information Processing Letters · doi:10.1016/j.ipl.2004.02.005 · Cited by 49
Optical realization of universal quantum cloning
Huang, Y., Li, W., Li, C., Zhang, Y.-S., Jiang, Y.-K., & Guo, G. (2001) · Physical Review A · doi:10.1103/physreva.64.012315 · Cited by 51
Block-based quantum-logic synthesis
Saeedi, M., Arabzadeh, M., Zamani, M. S., & Sedighi, M. (2011) · Quantum Information and Computation · doi:10.26421/qic11.3-4-6 · Cited by 51
Implementing bilinear interpolation with quantum images
Yan, F., Zhao, S.-S., Venegas-Andraca, S. E., & Hirota, K. (2021) · Digital Signal Processing · doi:10.1016/j.dsp.2021.103149 · Cited by 48
An exchange coupled meso – meso linked vanadyl porphyrin dimer for quantum information processing
Ranieri, D., Santanni, F., Privitera, A., Albino, A., Salvadori, E., Chiesa, M., Totti, F., Sorace, L., & Sessoli, R. (2022) · Chemical Science · doi:10.1039/d2sc04969d · Cited by 48
Quantum NETwork: from theory to practice
Fang, K., Zhao, J., Li, X., Li, Y., & Duan, R. (2023) · Science China Information Sciences · doi:10.1007/s11432-023-3773-4 · Cited by 61
Qubit Allocation for Distributed Quantum Computing
Mao, Y., Liu, Y., & Yang, Y. (2023) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom53939.2023.10228915 · Cited by 53
Quantum circuits for controlled teleportation of two-particle entanglement via a W state
Chen, X., Zhang, N., Lin, S., Wen, Q., & Zhu, F.-C. (2008) · Optics Communications · doi:10.1016/j.optcom.2007.12.002 · Cited by 48
Technology Mapping of Reversible Circuits to Clifford+T Quantum Circuits
Abdessaied, N., Amy, M., Soeken, M., & Drechsler, R. (2016) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl.2016.33 · Cited by 48
Quantum Circuits for Sparse Isometries
Malvetti, E., Iten, R., & Colbeck, R. (2021) · Quantum · doi:10.22331/q-2021-03-15-412 · Cited by 48
Efficient quantum algorithm for preparing molecular-system-like states on a quantum computer
Wang, H., Ashhab, S., & Nori, F. (2009) · Physical Review A · doi:10.1103/physreva.79.042335 · Cited by 48
Høyer, P., & Špalek, R. (2005) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · Cited by 51
Shor's algorithm on a nearest-neighbor machine
Kutin, S. A. (2006) · arXiv · doi:10.48550/arxiv.quant-ph/0609001 · Cited by 47
Classically verifiable quantum advantage from a computational Bell test
Kahanamoku–Meyer, G. D., Choi, S., Vazirani, U. V., & Yao, N. Y. (2022) · Nature Physics · doi:10.1038/s41567-022-01643-7 · Cited by 62
Li, A., Fang, B., Granade, C., Prawiroatmodjo, G., Heim, B., Roetteler, M., & Krishnamoorthy, S. (2021) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3458817.3476169 · Cited by 46
Design and integration of single-qubit rotations and two-qubit gates in silicon above one Kelvin
Petit, L., Rimbach-Russ, M., Eenink, H. G. J., Lawrie, W. I. L., Clarke, J. S., Vandersypen, L. M. K., & Veldhorst, M. (2022) · Communications Materials · doi:10.1038/s43246-022-00304-9 · Cited by 48
Liu, Y., Singh, S., Smith, K. C., Crane, E., Martyn, J. M., Eickbusch, A., Schuckert, A., Li, R. D., Sinanan-Singh, J., Soley, M. B., et al. (2025) · PRX Quantum · doi:10.1103/4rf7-9tfx · Cited by 107
Lanzagorta, M. O., & Uhlmann, J. K. (2008) · Synthesis lectures on quantum computing · doi:10.2200/s00159ed1v01y200810qmc002 · Cited by 87
Exact Synthesis of Elementary Quantum Gate Circuits for Reversible Functions with Don't Cares
Grosse, D. J., Wille, R., Dueck, G. W., & Drechsler, R. (2008) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl.2008.42 · Cited by 47
Quantum associative memory with exponential capacity
Ventura, D. A., & Martinez, T. R. (2002) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1998.682319 · Cited by 45
Fast Quantum Fourier Transforms for a Class of Non-abelian Groups
Püschel, M., Rötteler, M., & Beth, T. (1999) · Lecture notes in computer science · doi:10.1007/3-540-46796-3_15 · Cited by 45
Castaño‐Yepes, J. D., Amor-Quiroz, D. A., Ramirez-Gutierrez, C. F., & Gómez, E. A. (2018) · arXiv (Cornell University) · Cited by 47
Continuous-variable and hybrid quantum gates
Wang, X. (2001) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/34/44/316 · Cited by 51
Optimal synthesis of the Fredkin gate in a multilevel system
Liu, W.-Q., & Wei, H.-R. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab8e13 · Cited by 46
Synthesis of quantum logic circuits
Shende, V., Bullock, S. S., & Markov, I. L. (2005) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/aspdac.2005.1466172 · Cited by 47
Equivalence Checking of Quantum Circuits With the ZX-Calculus
Peham, T., Burgholzer, L., & Wille, R. (2022) · IEEE Journal on Emerging and Selected Topics in Circuits and Systems · doi:10.1109/jetcas.2022.3202204 · Cited by 65
Integration of Quantum Technologies into Metaverse: Applications, Potentials, and Challenges
Tuli, E. A., Lee, J., & Kim, D. (2024) · IEEE Access · doi:10.1109/access.2024.3366527 · Cited by 48
Subspace methods for electronic structure simulations on quantum computers
Motta, M., Kirby, W., Liepuoniute, I., Sung, K. J., Cohn, J. F., Mezzacapo, A., Klymko, K., Nguyen, N., Yoshioka, N., & Rice, J. E. (2024) · Electronic Structure · doi:10.1088/2516-1075/ad3592 · Cited by 61
Assessing the similarity of quantum images based on probability measurements
Yan, F., Le, P. Q., Iliyasu, A. M., Sun, B., Garcia, J. A. S., Dong, F., & Hirota, K. (2012) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2012.6256418 · Cited by 44
Analyzing Fault Models for Reversible Logic Circuits
Zhong, J., & Muzio, J. C. (2006) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2006.1688609 · Cited by 46
Efficient universal quantum channel simulation in IBM’s cloud quantum computer
Wei, S.-J., Xin, T., & Long, G. (2018) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-017-9181-9 · Cited by 46
The multi-level and multi-dimensional quantum wavelet packet transforms
Li, H.-S., Fan, P., Xia, H., Song, S., & He, X. (2018) · Scientific Reports · doi:10.1038/s41598-018-32348-8 · Cited by 46
Quantum circuits for maximally entangled states
Cervera-Lierta, A., Latorre, J. I., & Goyeneche, D. (2019) · Physical Review A · doi:10.1103/physreva.100.022342 · Cited by 46
Quantum unary approach to option pricing
Ramos-Calderer, S., Pérez-Salinas, A., García-Martín, D., Bravo-Prieto, C., Cortada, J., Planagumà, J., & Latorre, J. I. (2021) · Physical Review A · doi:10.1103/physreva.103.032414 · Cited by 58
Nonlinear quantum neuron: A fundamental building block for quantum neural networks
Yan, S., Qi, H., & Cui, W. (2020) · Physical Review A · doi:10.1103/physreva.102.052421 · Cited by 45
Multilevel 2-D Quantum Wavelet Transforms
Li, H.-S., Fan, P., Peng, H., Song, S., & Long, G. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2021.3049509 · Cited by 46
Deterministic photonic quantum computation in a synthetic time dimension
Bartlett, B., Dutt, A., & Fan, S. (2021) · Optica · doi:10.1364/optica.424258 · Cited by 47
Asymptotically optimal circuits for arbitrary n-qubit diagonal comutations
Bullock, S. S., & Markov, I. L. (2004) · Quantum Information and Computation · doi:10.5555/2011572.2011575 · Cited by 46
Implementing a conditional z gate by a combination of resonant interaction and quantum interference
Zou, X., Dong, Y., & Guo, G. (2006) · Physical Review A · doi:10.1103/physreva.74.032325 · Cited by 46
Geometric strategy for the optimal quantum search
Miyake, A., & Wadati, M. (2001) · Physical Review A · doi:10.1103/physreva.64.042317 · Cited by 46
Implementing unitary operators in quantum computation
Kim, J., Lee, J., & Lee, S. (2000) · Physical Review A · doi:10.1103/physreva.61.032312 · Cited by 52
Experimental coherent computation of a multiple-input AND gate using pure molecular superpositions
Amitay, Z., Kosloff, R., & Leone, S. R. (2002) · Chemical Physics Letters · doi:10.1016/s0009-2614(02)00551-1 · Cited by 46
Computing Spin NetworksPreprint
Marzuoli, A., & Rasetti, M. (2004) · Cited by 49
Efficient realization of quantum algorithms with qudits
Nikolaeva, A. S., Kiktenko, E. O., & Fedorov, A. K. (2024) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-024-00250-0 · Cited by 64
A new design of parity preserving reversible Vedic multiplier targeting emerging quantum circuits
Noorallahzadeh, M., Mosleh, M., Ahmadpour, S., Pal, J., & Sen, B. (2023) · International Journal of Numerical Modelling Electronic Networks Devices and Fields · doi:10.1002/jnm.3089 · Cited by 45
Realizing quantum gates with optically addressable Yb + 171 ion qudits
Aksenov, M. A., Zalivako, I. V., Semerikov, I. A., Borisenko, A. S., Semenin, N. V., Sidorov, P., Fedorov, A. K., Khabarova, K. Y., & Kolachevsky, N. (2023) · Physical Review A · doi:10.1103/physreva.107.052612 · Cited by 51
Dicke Simulators with Emergent Collective Quantum Computational Abilities
Rotondo, P., Lagomarsino, M. C., & Viola, G. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.143601 · Cited by 44
Generalized shortcuts to adiabaticity and enhanced robustness against decoherence
Santos, A. C., & Sarandy, M. S. (2017) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/aa96f1 · Cited by 44
Quantum simulation of quantum channels in nuclear magnetic resonance
Xin, T., Wei, S.-J., Pedernales, J. S., Solano, E., & Long, G. (2017) · Physical Review A · doi:10.1103/physreva.96.062303 · Cited by 45
Natural heavy-hole flopping mode qubit in germanium
Mutter, P. M., & Burkard, G. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013194 · Cited by 48
Quantum computing of delocalization in small-world networks
Giraud, O., Georgeot, B., & Shepelyansky, D. L. (2005) · Physical Review E · doi:10.1103/physreve.72.036203 · Cited by 45
Cyclic quantum error–correcting codes and quantum shift registers
Grassl, M., & Beth, T. (2000) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2000.0633 · Cited by 45
Theoretical analysis of a realistic atom-chip quantum gate
Charron, É., Cirone, M. A., Negretti, A., Schmiedmayer, J., & Calarco, T. (2006) · Physical Review A · doi:10.1103/physreva.74.012308 · Cited by 44
Scalable quantum computation with cavity QED systems
Giovannetti, V., Vitali, D., Tombesi, P., & EKERT, A. K. (2000) · Physical Review A · doi:10.1103/physreva.62.032306 · Cited by 44
Zuliani, P. (2001) · IBM Journal of Research and Development · doi:10.1147/rd.456.0807 · Cited by 45
Quantum computing with trapped ions in an optical cavity via Raman transition
Feng, M. (2002) · Physical Review A · doi:10.1103/physreva.66.054303 · Cited by 45
Testing Bell’s inequality with ballistic electrons in semiconductors
Ionicioiu, R., Zanardi, P., & Rossi, F. (2001) · Physical Review A · doi:10.1103/physreva.63.050101 · Cited by 45
Room-temperature photonic logical qubits via second-order nonlinearities
Krastanov, S., Heuck, M., Shapiro, J. H., Narang, P., Englund, D. R., & Jacobs, K. (2021) · Nature Communications · doi:10.1038/s41467-020-20417-4 · Cited by 44
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
