The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
The Physical Implementation of Quantum Computation
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Quantum computers require both high-fidelity operations and large qubit numbers to surpass classical capabilities1.”
From A 98-qubit trapped-ion quantum computer with all-to-all connectivity (2026) · cites this paper as [1]
In the citing paper
“One of the criteria is that the level of noise affecting the physical gates is sufficiently low.”
From Quantum computing with realistically noisy devices (2005) · cites this paper as [4]
In the citing paper
“The number of resources needed for precise simulation of continuous-time dynamics of a many-body system by stroboscopic digital applications of local gates might be enormous [64].”
From Can one trust quantum simulators? (2012) · cites this paper as [64]
In the citing paper
“In the presence of errors, however, ensuring reliability to a desired precision has profound implications for efficiency even in a digital simulator on a fault-tolerant quantum computer [64, 117].”
From Can one trust quantum simulators? (2012) · cites this paper as [64]
In the citing paper
“Moreover, Brown et al. showed that for a small number of qubits where one might avoid error correction, analog control errors on the logic gates can lead to faulty results, negating requirement (c), and robust control pulses become essential.”
From Can one trust quantum simulators? (2012) · cites this paper as [64]
In the citing paper
“The result is that a fault-tolerant implementation of the Trotter expansion requires a number of gates and time to perform the simulation that grows exponentially with the degree of precision required, for a fixed number of particles being simulated.”
From Can one trust quantum simulators? (2012) · cites this paper as [64]
In the citing paper
“Indeed, as discussed above, a fault-tolerant implementation of the standard approach based on the Trotter expansion [98] comes at the cost of an overhead in the number of gates and time required that grows exponentially with the degree of precision required [64, 120].”
From Can one trust quantum simulators? (2012) · cites this paper as [64]
Citations
Cites
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2014) · Theoretical Computer Science · doi:10.1016/j.tcs.2014.05.025 · Cited by 8,299
Quantum computation with quantum dots
Loss, D., & DiVincenzo, D. P. (1998) · Physical Review A · doi:10.1103/physreva.57.120 · Cited by 6,840
Self-citationExperimental quantum teleportation
Bouwmeester, D., Pan, J.-W., Mattle, K., Eibl, M., Weinfurter, H., & Zeilinger, A. (1997) · Nature · doi:10.1038/37539 · Cited by 5,545
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
Self-citationQuantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306
Experimental Test of Bell's Inequalities Using Time- Varying Analyzers
Aspect, A., Dalibard, J., & Roger, G. (1982) · Physical Review Letters · doi:10.1103/physrevlett.49.1804 · Cited by 3,942
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
Correlation between Photons in two Coherent Beams of Light
BROWN, R. H., & TWISS, R. Q. (1956) · Nature · doi:10.1038/177027a0 · Cited by 2,573
Quantum Information Processing Using Quantum Dot Spins and Cavity QED
Imamog¯lu, A., Awschalom, D. D., Burkard, G., DiVincenzo, D. P., Loss, D., Sherwin, M., & Small, A. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.4204 · Cited by 1,995
Self-citationDensity Matrix Theory and Applications
Blum, K. (2012) · Springer Series on Atomic, Optical, and Plasma Physics · doi:10.1007/978-3-642-20561-3 · Cited by 1,936
Boschi, D., Branca, S., De Martini, F., Hardy, L., & Popescu, S. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.1121 · Cited by 1,777
Feynman, R. P. (1986) · Foundations of Physics · doi:10.1007/bf01886518 · Cited by 1,770
Experimental issues in coherent quantum-state manipulation of trapped atomic ions
Wineland, D. J., Monroe, C., Itano, W. M., Leibfried, D., King, B. E., & Meekhof, D. M. (1998) · Journal of Research of the National Institute of Standards and Technology · doi:10.6028/jres.103.019 · Cited by 1,497
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Quantum computation and Shor's factoring algorithm
Ekert, A., & Jozsa, R. (1996) · Reviews of Modern Physics · doi:10.1103/revmodphys.68.733 · Cited by 1,354
Class of quantum error-correcting codes saturating the quantum Hamming bound
Gottesman, D. (1996) · Physical Review A · doi:10.1103/physreva.54.1862 · Cited by 1,227
Two-bit gates are universal for quantum computation
DiVincenzo, D. P. (1995) · Physical Review A · doi:10.1103/physreva.51.1015 · Cited by 1,069
Self-citationQuantum Theory: Concepts and Methods
(2002) · doi:10.1007/0-306-47120-5 · Cited by 1,029
Quantum computers and dissipation
(1996) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1996.0029 · Cited by 899
Theory of Quantum Error Correction for General Noise
Knill, E., Laflamme, R., & Viola, L. (2000) · Physical Review Letters · doi:10.1103/physrevlett.84.2525 · Cited by 866
Self-citationQuantum lower bounds by polynomials
Beals, R., Buhrman, H., Cleve, R., Mosca, M., & de Wolf, R. (2001) · Journal of the ACM · doi:10.1145/502090.502097 · Cited by 639
A Modular Functor Which is Universal¶for Quantum Computation
Freedman, M. H., Larsen, M., & Wang, Z. (2002) · Communications in Mathematical Physics · doi:10.1007/s002200200645 · Cited by 573
Fault-Tolerant Quantum Computation with Constant Error Rate
Aharonov, D., & Ben-Or, M. (2008) · SIAM Journal on Computing · doi:10.1137/s0097539799359385 · Cited by 513
Nuclear magnetic resonance spectroscopy: An experimentally accessible paradigm for quantum computing
Cory, D. G., Price, M. D., & Havel, T. F. (1998) · Physica D: Nonlinear Phenomena · doi:10.1016/s0167-2789(98)00046-3 · Cited by 419
Self-citationQuantum interference in electron collision
Liu, R. C., Odom, B., Yamamoto, Y., & Tarucha, S. (1998) · Nature · doi:10.1038/34611 · Cited by 249
Cited by
Sorted by citations
A scheme for efficient quantum computation with linear optics
Knill, E., Laflamme, R., & Milburn, G. J. (2001) · Nature · doi:10.1038/35051009 · Cited by 5,880
Degen, C. L., Reinhard, F., & Cappellaro, P. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.035002 · Cited by 4,045
Ladd, T. D., Jelezko, F., Laflamme, R., Nakamura, Y., Monroe, C., & O’Brien, J. L. (2010) · Nature · doi:10.1038/nature08812 · Cited by 3,592
Charge-insensitive qubit design derived from the Cooper pair box
Koch, J., Yu, T. M., Gambetta, J., Houck, A. A., Schuster, D. I., Majer, J., Blais, A., Devoret, M. H., Girvin, S. M., & Schoelkopf, R. J. (2007) · Physical Review A · doi:10.1103/physreva.76.042319 · Cited by 3,351
Ludlow, A. D., Boyd, M. M., Ye, J., Peik, E., & Schmidt, P. O. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.637 · Cited by 2,385
Metadata
- Authors
- DiVincenzo, D. P.
- Venue
- Fortschritte der Physik
- Published
- 2000
- References
- 29
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.
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
