The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Process verification of two-qubit quantum gates by randomized benchmarking
Open accessAbstract
We implement a complete randomized benchmarking protocol on a system of two superconducting qubits. The protocol consists of randomizing over gates in the Clifford group, which experimentally are generated via an improved two-qubit cross-resonance gate implementation and single-qubit unitaries. From this we extract an optimal average error per Clifford operation of $0.0936$. We also perform an interleaved experiment, alternating our optimal two-qubit gate with random two-qubit Clifford gates, to obtain a two-qubit gate error of $0.0653$. We compare these values with a two-qubit gate error of $\ensuremath{\sim}0.12$ obtained from quantum process tomography, which is likely limited by state preparation and measurement errors.
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 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
Improved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515
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
Randomized benchmarking of quantum gates
Knill, E., Leibfried, D., Reichle, R., Britton, J., Blakestad, R. B., Jost, J. D., Langer, C., Ozeri, R., Seidelin, S., & Wineland, D. J. (2008) · Physical Review A · doi:10.1103/physreva.77.012307 · Cited by 1,019
Prescription for experimental determination of the dynamics of a quantum black box
Chuang, I. L., & Nielsen, M. A. (1997) · Journal of Modern Optics · doi:10.1080/09500349708231894 · Cited by 949
Complete Characterization of a Quantum Process: The Two-Bit Quantum Gate
Poyatos, J. F., Cirac, J. I., & Zoller, P. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.390 · Cited by 694
Scalable noise estimation with random unitary operators
Emerson, J., Alicki, R., & Życzkowski, K. (2005) · Journal of Optics B: Quantum and Semiclassical Optics · doi:10.1088/1464-4266/7/10/021 · Cited by 502
Protecting superconducting qubits from radiation
Córcoles, A. D., Chow, J. M., Gambetta, J. M., Rigetti, C., Rozen, J. R., Keefe, G. A., Beth Rothwell, M., Ketchen, M. B., & Steffen, M. (2011) · Applied Physics Letters · doi:10.1063/1.3658630 · Cited by 193
Self-citationRandomized Benchmarking of Multiqubit Gates
Gaebler, J. P., Meier, A. M., Tan, T. R., Bowler, R., Lin, Y., Hanneke, D., Jost, J. D., Home, J. P., Knill, E., Leibfried, D., et al. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.260503 · Cited by 127
Cited by
Supervised learning with quantum-enhanced feature spaces
Havlíček, V., Córcoles, A. D., Temme, K., Harrow, A. W., Kandala, A., Chow, J. M., & Gambetta, J. M. (2019) · Nature · doi:10.1038/s41586-019-0980-2 · Cited by 2,572
Self-citationA quantum engineer's guide to superconducting qubits
Krantz, P., Kjaergaard, M., Yan, F., Orlando, T. P., Gustavsson, S., & Oliver, W. D. (2019) · Applied Physics Reviews · doi:10.1063/1.5089550 · Cited by 2,004
Circuit quantum electrodynamics
Blais, A., Grimsmo, A. L., Girvin, S. M., & Wallraff, A. (2021) · Reviews of Modern Physics · doi:10.1103/revmodphys.93.025005 · Cited by 1,931
Superconducting 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
Quantum information processing with superconducting circuits: a review
Wendin, G. (2017) · Reports on Progress in Physics · doi:10.1088/1361-6633/aa7e1a · Cited by 890
Error mitigation extends the computational reach of a noisy quantum processor
Kandala, A., Temme, K., Córcoles, A. D., Mezzacapo, A., Chow, J. M., & Gambetta, J. M. (2019) · Nature · doi:10.1038/s41586-019-1040-7 · Cited by 871
Self-citationCórcoles, A. D., Magesan, E., Srinivasan, S. J., Cross, A. W., Steffen, M., Gambetta, J. M., & Chow, J. M. (2015) · Nature Communications · doi:10.1038/ncomms7979 · Cited by 490
Self-citationProcedure for systematically tuning up cross-talk in the cross-resonance gate
Sheldon, S., Magesan, E., Chow, J. M., & Gambetta, J. M. (2016) · Physical Review A · doi:10.1103/physreva.93.060302 · Cited by 477
Self-citationSuperconducting quantum computing: a review
Huang, H.-L., Wu, D., Fan, D., & Zhu, X. (2020) · Science China Information Sciences · doi:10.1007/s11432-020-2881-9 · Cited by 378
Digital quantum simulation of fermionic models with a superconducting circuit
Barends, R., Lamata, L., Kelly, J., García-Álvarez, L., Fowler, A. G., Megrant, A., Jeffrey, E., White, T. C., Sank, D., Mutus, J. Y., et al. (2015) · Nature Communications · doi:10.1038/ncomms8654 · Cited by 338
Demonstration of universal parametric entangling gates on a multi-qubit lattice
Reagor, M., Osborn, C. B., Tezak, N., Staley, A., Prawiroatmodjo, G., Scheer, M., Alidoust, N., Sete, E. A., Didier, N., da Silva, M. P., et al. (2018) · Science Advances · doi:10.1126/sciadv.aao3603 · Cited by 297
Demonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum Algorithms
Foxen, B., Neill, C., Dunsworth, A., Roushan, P., Chiaro, B., Megrant, A., Kelly, J., Chen, Z., Satzinger, K., Barends, R., et al. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.120504 · Cited by 293
Implementing a strand of a scalable fault-tolerant quantum computing fabric
Chow, J. M., Gambetta, J. M., Magesan, E., Abraham, D. W., Cross, A. W., Johnson, B. R., Masluk, N. A., Ryan, C. A., Smolin, J. A., Srinivasan, S. J., et al. (2014) · Nature Communications · doi:10.1038/ncomms5015 · Cited by 281
Self-citationRealization of High-Fidelity CZ and ZZ -Free iSWAP Gates with a Tunable Coupler
Sung, Y., Ding, L., Braumüller, J., Vepsäläinen, A., Kannan, B., Kjaergaard, M., Greene, A., Samach, G. O., McNally, C., Kim, D., et al. (2021) · Physical Review X · doi:10.1103/physrevx.11.021058 · Cited by 262
Experimental Demonstration of Fault-Tolerant State Preparation with Superconducting Qubits
Takita, M., Cross, A. W., Córcoles, A. D., Chow, J. M., & Gambetta, J. M. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.180501 · Cited by 228
Self-citationQuantum Attacks on Bitcoin, and How to Protect Against Them
Aggarwal, D., Brennen, G., Lee, T., Santha, M., & Tomamichel, M. (2018) · Ledger · doi:10.5195/ledger.2018.127 · Cited by 231
Tunable Coupling Architecture for Fixed-Frequency Transmon Superconducting Qubits
Stehlik, J., Zajac, D. M., Underwood, D. L., Phung, T., Blair, J., Carnevale, S., Klaus, D., Keefe, G. A., Carniol, A., Kumph, M., et al. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.080505 · Cited by 159
Self-citationThree-Qubit Randomized Benchmarking
McKay, D. C., Sheldon, S., Smolin, J. A., Chow, J. M., & Gambetta, J. M. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.200502 · Cited by 156
Self-citationDirect Randomized Benchmarking for Multiqubit Devices
Proctor, T. J., Carignan-Dugas, A., Rudinger, K., Nielsen, E., Blume-Kohout, R., & Young, K. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.030503 · Cited by 118
Mitigating Realistic Noise in Practical Noisy Intermediate-Scale Quantum Devices
Sun, J., Yuan, X., Tsunoda, T., Vedral, V., Benjamin, S. C., & Endo, S. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.15.034026 · Cited by 105
Beverland, M. E., Kubica, A., & Svore, K. M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020341 · Cited by 82
Bounding the average gate fidelity of composite channels using the unitarity
Carignan-Dugas, A., Wallman, J. J., & Emerson, J. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab1800 · Cited by 44
Partial randomized benchmarking
Dubovitskii, K., & Makhlin, Y. (2022) · Scientific Reports · doi:10.1038/s41598-022-13813-x · Cited by 1
Metadata
- Authors
- Córcoles, A. D., Gambetta, J. M., Chow, J. M., Smolin, J. A., Ware, M., Strand, J., Plourde, B. L. T., & Steffen, M.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2013-03-19
- Volume
- 87
- Issue
- 3
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2062506119
- Cited by
- 211
- References
- 9
- FWCI
- 12.15
- 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.