Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 293

The DOI matches its Crossref record; 33 of the 33 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 access
Foxen, B., Neill, C., Dunsworth, A., Roushan, P., Chiaro, B., Megrant, A., Kelly, J., Chen, Zijun, Satzinger, K., Barends, R., Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Boixo, S., Buell, D., Burkett, B., Chen, Yu, 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., Google AI Quantum · 2020 · Physical Review Letters

Abstract

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.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physrevlett.125.120504

Cites

33 of 33 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 293

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
Published
2020-09-15
Volume
125
Issue
12
Pages
120504-120504
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W3002718752
Cited by
293
References
33
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

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.