CoChat

Robust multi-qubit quantum network node with integrated error detection

Open access
Stas, P.-J., Huan, Y. Q., Machielse, B., Knall, E. N., Suleymanzade, A., Pingault, B., Sutula, M., Ding, S. W., Knaut, C. M., Assumpcao, D. R., Wei, Y.-C., Bhaskar, M. K., Riedinger, R., Sukachev, D. D., Park, H., Lončar, M., Levonian, D. S., Lukin, M. D. · 2022 · Science
Cited by 201

The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.

Abstract

Long-distance quantum communication and networking require quantum memory nodes with efficient optical interfaces and long memory times. We report the realization of an integrated two-qubit network node based on silicon-vacancy centers (SiVs) in diamond nanophotonic cavities. Our qubit register consists of the SiV electron spin acting as a communication qubit and the strongly coupled silicon-29 nuclear spin acting as a memory qubit with a quantum memory time exceeding 2 seconds. By using a highly strained SiV, we realize electron-photon entangling gates at temperatures up to 1.5 kelvin and nucleus-photon entangling gates up to 4.3 kelvin. We also demonstrate efficient error detection in nuclear spin–photon gates by using the electron spin as a flag qubit, making this platform a promising candidate for scalable quantum repeaters.

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.1126/science.add9771

Cites

8 of 8 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 201

Metadata

Authors
Stas, P.-J., Huan, Y. Q., Machielse, B., Knall, E. N., Suleymanzade, A., Pingault, B., Sutula, M., Ding, S. W., Knaut, C. M., Assumpcao, D. R., Wei, Y.-C., Bhaskar, M. K., Riedinger, R., Sukachev, D. D., Park, H., Lončar, M., Levonian, D. S., & Lukin, M. D.
Venue
Science
Published
2022-11-04
Volume
378
Issue
6619
Pages
557-560
ISSN
  • 0036-8075 (ISSN-L)
  • 1095-9203
OpenAlex
W4308430556
Cited by
201
References
8
FWCI
11.52
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.