CoChat

Efficient arbitrary simultaneously entangling gates on a trapped-ion quantum computer

Open access
Grzesiak, Nikodem, Blümel, Reinhold, Wright, Kenneth, Beck, Kristin M., Pisenti, Neal C., Li, Ming, Chaplin, Vandiver, Amini, Jason M., Debnath, Shantanu, Chen, Jwo-Sy, Nam, Yunseong · 2020 · Nature Communications
Cited by 101

The 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.

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

Integrity signals

Registry

Crossref · 10.1038/s41467-020-16790-9

Cites

11 of 11 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

Show all 11 references

Cited by

See all 101

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.