The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Demonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum Algorithms
Open accessAbstract
Quantum algorithms offer a dramatic speedup for computational problems in material science and chemistry. However, any near-term realizations of these algorithms will need to be optimized to fit within the finite resources offered by existing noisy hardware. Here, taking advantage of the adjustable coupling of gmon qubits, we demonstrate a continuous two-qubit gate set that can provide a threefold reduction in circuit depth as compared to a standard decomposition. We implement two gate families: an imaginary swap-like (iSWAP-like) gate to attain an arbitrary swap angle, θ, and a controlled-phase gate that generates an arbitrary conditional phase, ϕ. Using one of each of these gates, we can perform an arbitrary two-qubit gate within the excitation-preserving subspace allowing for a complete implementation of the so-called Fermionic simulation (fSim) gate set. We benchmark the fidelity of the iSWAP-like and controlled-phase gate families as well as 525 other fSim gates spread evenly across the entire fSim(θ,ϕ) parameter space, achieving a purity-limited average two-qubit Pauli error of 3.8×10^{-3} per fSim gate.
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 Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
Self-citationSimulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
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
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059
Self-citationSuperconducting quantum circuits at the surface code threshold for fault tolerance
Barends, R., Kelly, J., Megrant, A., Veitia, A., Sank, D., Jeffrey, E., White, T. C., Mutus, J., Fowler, A. G., Campbell, B., et al. (2014) · Nature · doi:10.1038/nature13171 · Cited by 1,733
Self-citationCharacterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175
Self-citationQuantum Simulation of Electronic Structure with Linear Depth and Connectivity
Kivlichan, I. D., McClean, J., Wiebe, N., Gidney, C., Aspuru-Guzik, A., Chan, G. K.-L., & Babbush, R. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.110501 · Cited by 431
Self-citationTunable Coupling Scheme for Implementing High-Fidelity Two-Qubit Gates
Yan, F., Krantz, P., Sung, Y., Kjaergaard, M., Campbell, D. L., Orlando, T. P., Gustavsson, S., & Oliver, W. D. (2018) · Physical Review Applied · doi:10.1103/physrevapplied.10.054062 · Cited by 423
Quantum Supremacy through the Quantum Approximate Optimization Algorithm
Farhi, E., & Harrow, A. W. (2016) · arXiv · doi:10.48550/arxiv.1602.07674 · Cited by 331
Self-citation
Research works printed but not linked: 19
- 10.1103/PhysRevA.76.042319 · DOI · Paper page
- 10.1038/s41534-017-0044-0 · DOI · Paper page
- 10.1103/PhysRevLett.94.123602 · DOI · Paper page
- 10.1103/PhysRevLett.112.190504 · DOI · Paper page
- 10.1038/nature23459 · DOI
- 10.1016/S0301-0104(01)00318-4 · DOI
- 10.1103/PhysRevLett.113.220502 · DOI · Paper page
- 10.1038/s41586-019-1040-7 · DOI · Paper page
- 10.1103/PhysRevLett.123.120502 · DOI
- 10.1088/1361-6668/aaf048 · DOI
- 10.1063/1.3309754 · DOI
- 10.1103/PhysRevLett.105.177001 · DOI
- 10.1103/PhysRevLett.106.180504 · DOI · Paper page
- 10.1103/PhysRevA.87.030301 · DOI
- 10.1103/PhysRevLett.116.020501 · DOI · Paper page
- 10.1103/PhysRevApplied.3.044009 · DOI
- 10.1364/OE.21.013450 · DOI
- 10.1088/1367-2630/17/11/113020 · DOI
- 10.1103/PhysRevLett.123.210501 · DOI
Cited by
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
Suppressing quantum errors by scaling a surface code logical qubit
Google Quantum, A. I., Acharya, R., Aleiner, I., Allen, R., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., Atalaya, J., et al. (2023) · Nature · doi:10.1038/s41586-022-05434-1 · Cited by 1,103
Self-citationExponential suppression of bit or phase errors with cyclic error correction
Google Quantum, A. I., Chen, Z., Satzinger, K. J., Atalaya, J., Korotkov, A. N., Dunsworth, A., Sank, D., Quintana, C., McEwen, M., Barends, R., et al. (2021) · Nature · doi:10.1038/s41586-021-03588-y · Cited by 393
Self-citationQuantum simulation and computing with Rydberg-interacting qubits
Morgado, M., & Whitlock, S. (2021) · AVS Quantum Science · doi:10.1116/5.0036562 · Cited by 370
Information scrambling in quantum circuits
Mi, X., Roushan, P., Quintana, C., Mandrà, S., Marshall, J., Neill, C., Arute, F., Arya, K., Atalaya, J., Babbush, R., et al. (2021) · Science · doi:10.1126/science.abg5029 · Cited by 283
Self-citation
Metadata
- Authors
- Foxen, B., Neill, C., Dunsworth, A., Roushan, P., Chiaro, B., Megrant, A., Kelly, J., Chen, Z., Satzinger, K., Barends, R., Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Boixo, S., Buell, D., Burkett, B., Chen, Y., Collins, R., Farhi, E., Fowler, A., Gidney, C., Giustina, M., Graff, R., Harrigan, M., Huang, T., Isakov, S. V., Jeffrey, E., Jiang, Z., Kafri, D., Kechedzhi, K., Klimov, P., Korotkov, A., Kostritsa, F., Landhuis, D., Lucero, E., McClean, J., McEwen, M., Mi, X., Mohseni, M., Mutus, J. Y., Naaman, O., Neeley, M., Niu, M., Petukhov, A., Quintana, C., Rubin, N., Sank, D., Smelyanskiy, V., Vainsencher, A., White, T. C., Yao, Z., Yeh, P., Zalcman, A., Neven, H., Martinis, J. M., & Quantum, G. A.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2020-09-15
- Volume
- 125
- Issue
- 12
- Pages
- 120504-120504
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W3002718752
- Cited by
- 293
- References
- 11
- FWCI
- 16.86
- Type
- journal article
- Language
- en
- Open access
- hybrid
- Funders
- National Science Foundation
- Google LLC
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: Demonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum Algorithms. https://app.cochat.ai/papers/10.1103/physrevlett.125.120504
- The paper
- Foxen, B., Neill, C., Dunsworth, A., Roushan, P., Chiaro, B., Megrant, A., Kelly, J., Chen, Z., Satzinger, K., Barends, R., Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Boixo, S., Buell, D., Burkett, B., Chen, Y., . . . Quantum, G. A. (2020). Demonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum Algorithms. Physical Review Letters. https://doi.org/10.1103/physrevlett.125.120504
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.
