The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Practical Scheme for Quantum Computation with Any Two-Qubit Entangling Gate
Open accessAbstract
Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-not, are universal when assisted by arbitrary one-qubit gates, it has only recently become clear precisely what class of two-qubit gates is universal in this sense. We present an elementary proof that any entangling two-qubit gate is universal for quantum computation, when assisted by one-qubit gates. A proof of this result for systems of arbitrary finite dimension has been provided by Brylinski and Brylinski; however, their proof relies on a long argument using advanced mathematics. In contrast, our proof provides a simple constructive procedure which is close to optimal and experimentally practical.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
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
Self-citationElementary 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
Quantum information and computation
Bennett, C. H., & DiVincenzo, D. P. (2000) · Nature · doi:10.1038/35005001 · Cited by 3,263
Almost Any Quantum Logic Gate is Universal
Lloyd, S. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.346 · Cited by 690
Optimal creation of entanglement using a two-qubit gate
Kraus, B., & Cirac, J. I. (2001) · Physical Review A · doi:10.1103/physreva.63.062309 · Cited by 432
Universal quantum computation and simulation using any entangling Hamiltonian and local unitaries
Dodd, J. L., Nielsen, M. A., Bremner, M. J., & Thew, R. T. (2002) · Physical Review A · doi:10.1103/physreva.65.040301 · Cited by 156
Self-citation
Cited by
Non-Abelian anyons and topological quantum computation
Nayak, C., Simon, S. H., Stern, A., Freedman, M., & Das Sarma, S. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1083 · Cited by 6,861
NMR techniques for quantum control and computation
Vandersypen, L. M. K., & Chuang, I. L. (2005) · Reviews of Modern Physics · doi:10.1103/revmodphys.76.1037 · Cited by 1,217
Distributed Quantum Computation via Optical Fibers
Serafini, A., Mancini, S., & Bose, S. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.010503 · Cited by 444
Optimal quantum circuits for general two-qubit gates
Vatan, F., & Williams, C. (2004) · Physical Review A · doi:10.1103/physreva.69.032315 · Cited by 443
Non-adiabatic holonomic quantum computation
Sjöqvist, E., Tong, D. M., Mauritz Andersson, L., Hessmo, B., Johansson, M., & Singh, K. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/10/103035 · Cited by 395
Metadata
- Authors
- Bremner, M. J., Dawson, C. M., Dodd, J. L., Gilchrist, A., Harrow, A. W., Mortimer, D., Nielsen, M. A., & Osborne, T. J.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2002-11-25
- Volume
- 89
- Issue
- 24
- Pages
- 247902-247902
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2073034252
- Cited by
- 292
- References
- 6
- FWCI
- 16.06
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Practical Scheme for Quantum Computation with Any Two-Qubit Entangling Gate. https://app.cochat.ai/papers/10.1103/physrevlett.89.247902
- The paper
- Bremner, M. J., Dawson, C. M., Dodd, J. L., Gilchrist, A., Harrow, A. W., Mortimer, D., Nielsen, M. A., & Osborne, T. J. (2002). Practical Scheme for Quantum Computation with Any Two-Qubit Entangling Gate. Physical Review Letters. https://doi.org/10.1103/physrevlett.89.247902
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
