Efficient arbitrary simultaneously entangling gates on a trapped-ion quantum computer
Open accessThe DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
Efficiently entangling pairs of qubits is essential to fully harness the power of quantum computing. Here, we devise an exact protocol that simultaneously entangles arbitrary pairs of qubits on a trapped-ion quantum computer. The protocol requires classical computational resources polynomial in the system size, and very little overhead in the quantum control compared to a single-pair case. We demonstrate an exponential improvement in both classical and quantum resources over the current state of the art. We implement the protocol on a software-defined trapped-ion quantum computer, where we reconfigure the quantum computer architecture on demand. Our protocol may also be extended to a wide variety of other quantum computing platforms.
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
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691 · cited 3×
“• Quantum arithmetic circuits [19, 20] – useful for solving an integer factoring problem or computing discrete logarithms over Abelian groups [1].”
BackgroundMethodValidity of the single processor approach to achieving large scale computing capabilities
Amdahl, G. M. (1967) · Proceedings of the April 18-20, 1967, spring joint computer conference on - AFIPS '67 (Spring) · doi:10.1145/1465482.1465560 · Cited by 4,339
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
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Demonstration of a small programmable quantum computer with atomic qubits
Debnath, S., Linke, N. M., Figgatt, C., Landsman, K. A., Wright, K., & Monroe, C. (2016) · Nature · doi:10.1038/nature18648 · Cited by 777
Self-citationHigh-Fidelity Quantum Logic Gates Using Trapped-Ion Hyperfine Qubits
Ballance, C. J., Harty, T. P., Linke, N. M., Sepiol, M. A., & Lucas, D. M. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.060504 · Cited by 777
(2016) · doi:10.1103/physrevlett.117.060505 · Cited by 540
Experimental comparison of two quantum computing architectures
Linke, N. M., Maslov, D., Roetteler, M., Debnath, S., Figgatt, C., Landsman, K. A., Wright, K., & Monroe, C. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1618020114 · Cited by 508
Self-citationMinimal 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 · cited 2×
“This case can be shown to require 14 XX gates (two XX gates with continuous parameters per excitation), or 21 CNOT gates, since any unitary operation over two qubits does not require more than three CNOT gates [33].”
Background
Cited by
Benchmarking an 11-qubit quantum computer
Wright, K., Beck, K. M., Debnath, S., Amini, J. M., Nam, Y., Grzesiak, N., Chen, J.-S., Pisenti, N. C., Chmielewski, M., Collins, C., et al. (2019) · Nature Communications · doi:10.1038/s41467-019-13534-2 · Cited by 506
Self-citationFocus beyond Quadratic Speedups for Error-Corrected Quantum Advantage
Babbush, R., McClean, J. R., Newman, M., Gidney, C., Boixo, S., & Neven, H. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010103 · Cited by 148
Benchmarking a trapped-ion quantum computer with 30 qubits
Chen, J.-S., Nielsen, E., Ebert, M., Inlek, V., Wright, K., Chaplin, V., Maksymov, A., Páez, E., Poudel, A., Maunz, P., et al. (2024) · Quantum · doi:10.22331/q-2024-11-07-1516 · Cited by 103
“An arbitrary-entangling-angle two-qubit gate, XX ij ( χ ) , is implemented by the Mølmer–Sørensen scheme using amplitude-modulated (AM) pulses [17, 18, 19, 20], where i and j are qubit indexes and χ represents the angle of entanglement, and X is the Pauli operator.”
MethodSelf-citationPhase-Modulated Entangling Gates Robust to Static and Time-Varying Errors
Milne, A. R., Edmunds, C. L., Hempel, C., Roy, F., Mavadia, S., & Biercuk, M. J. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.13.024022 · Cited by 85
Quantum circuit engineering for correcting coherent noise
Ahsan, M., Naqvi, S. A. Z., & Anwer, H. (2022) · Physical Review A · doi:10.1103/physreva.105.022428 · Cited by 22
Metadata
- Authors
- Grzesiak, N., Blümel, R., Wright, K., Beck, K. M., Pisenti, N. C., Li, M., Chaplin, V., Amini, J. M., Debnath, S., Chen, J.-S., & Nam, Y.
- Venue
- Nature Communications
- Published
- 2020-06-11
- Volume
- 11
- Issue
- 1
- Pages
- 2963-2963
- ISSN
- 2041-1723 (ISSN-L)
- OpenAlex
- W2944994739
- Cited by
- 101
- References
- 11
- FWCI
- 5.97
- Type
- journal article
- Language
- en
- Open access
- gold
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: Efficient arbitrary simultaneously entangling gates on a trapped-ion quantum computer. https://app.cochat.ai/papers/10.1038/s41467-020-16790-9
- The paper
- Grzesiak, N., Blümel, R., Wright, K., Beck, K. M., Pisenti, N. C., Li, M., Chaplin, V., Amini, J. M., Debnath, S., Chen, J.-S., & Nam, Y. (2020). Efficient arbitrary simultaneously entangling gates on a trapped-ion quantum computer. Nature Communications. https://doi.org/10.1038/s41467-020-16790-9
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.