The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Universal quantum circuit for two-qubit transformations with three controlled-NOT gates
Open accessAbstract
We consider quantum circuits made of controlled-NOT (CNOT) gates and single-qubit unitary gates and look for constructions that minimize the use of CNOT gates. We show, by means of an explicit quantum circuit, that three CNOT gates are necessary and sufficient in order to implement an arbitrary unitary transformation of two qubits. We also identify the subset of two-qubit gates that can be performed with only two CNOT gates and provide a simple characterization for them.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
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
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
Time optimal control in spin systems
Khaneja, N., Brockett, R., & Glaser, S. J. (2001) · Physical Review A · doi:10.1103/physreva.63.032308 · Cited by 742
Almost Any Quantum Logic Gate is Universal
Lloyd, S. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.346 · Cited by 690
Realizable Universal Quantum Logic Gates
Sleator, T., & Weinfurter, H. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.4087 · Cited by 515
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
Universality in quantum computation
Deutsch, D. E., Barenco, A., & Ekert, A. (1995) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1995.0065 · Cited by 346
Practical Scheme for Quantum Computation with Any Two-Qubit Entangling Gate
Bremner, M. J., Dawson, C. M., Dodd, J. L., Gilchrist, A., Harrow, A. W., Mortimer, D., Nielsen, M. A., & Osborne, T. J. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.247902 · Cited by 292
Self-citation
Cited by
Validating quantum computers using randomized model circuits
Cross, A. W., Bishop, L. S., Sheldon, S., Nation, P. D., & Gambetta, J. M. (2019) · Physical Review A · doi:10.1103/physreva.100.032328 · Cited by 704
Synthesis of quantum-logic circuits
Shende, V. V., Bullock, S. S., & Markov, I. L. (2006) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2005.855930 · Cited by 669
Large-scale silicon quantum photonics implementing arbitrary two-qubit processing
Qiang, X., Zhou, X., Wang, J., Wilkes, C. M., Loke, T., O’Gara, S., Kling, L., Marshall, G. D., Santagati, R., Ralph, T. C., et al. (2018) · Nature Photonics · doi:10.1038/s41566-018-0236-y · Cited by 516
t|ket⟩: a retargetable compiler for NISQ devices
Sivarajah, S., Dilkes, S., Cowtan, A., Simmons, W., Edgington, A., & Duncan, R. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8e92 · Cited by 475
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
Quantum-classical computation of Schwinger model dynamics using quantum computers
Klco, N., Dumitrescu, E. F., McCaskey, A. J., Morris, T. D., Pooser, R. C., Sanz, M., Solano, E., Lougovski, P., & Savage, M. J. (2018) · Physical Review A · doi:10.1103/physreva.98.032331 · Cited by 437
Quantum Circuits for General Multiqubit Gates
Möttönen, M., Vartiainen, J. J., Bergholm, V., & Salomaa, M. M. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.130502 · Cited by 390
Robust data encodings for quantum classifiers
LaRose, R., & Coyle, B. (2020) · Physical Review A · doi:10.1103/physreva.102.032420 · Cited by 326
Minimal universal two-qubit controlled-NOT-based circuits
Shende, V. V., Markov, I. L., & Bullock, S. S. (2004) · Physical Review A · doi:10.1103/physreva.69.062321 · Cited by 288
Izmaylov, A. F., Yen, T.-C., Lang, R. A., & Verteletskyi, V. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.9b00791 · Cited by 171
MQT QMAP: Efficient Quantum Circuit Mapping
Wille, R., & Burgholzer, L. (2023) · Proceedings of the 2023 International Symposium on Physical Design · doi:10.1145/3569052.3578928 · Cited by 41
“This is accomplished by translating all non-native gates into a set of native gates that can be directly executed on the device [15]–[18].”
BackgroundAn analytical decomposition protocol for optimal implementation of two-qubit entangling gates
Blaauboer, M., & de Visser, R. L. (2008) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/41/39/395307 · Cited by 20
Metadata
- Authors
- Vidal, G., & Dawson, C. M.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2004-01-08
- Volume
- 69
- Issue
- 1
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2088468720
- Cited by
- 277
- References
- 13
- FWCI
- 10.51
- 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
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.