CoChat
Sign Up
Cited by 144Quantum Information and CryptographyQuantum Mechanics and ApplicationsQuantum Computing Algorithms and Architecture

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

Analytic and Nearly Optimal Self-Testing Bounds for the Clauser-Horne-Shimony-Holt and Mermin Inequalities

Open access
Kaniewski, Jędrzej·2016·Physical Review Letters
DOI 10.1103/physrevlett.117.070402
Open this paper in CoChat — free accountOpen PDF

Abstract

Self-testing refers to the phenomenon that certain extremal quantum correlations (almost) uniquely identify the quantum system under consideration. For instance, observing the maximal violation of the Clauser-Horne-Shimony-Holt (CHSH) inequality certifies that the two parties share a singlet. While self-testing results are known for several classes of states, in many cases they are only applicable if the observed statistics are almost perfect, which makes them unsuitable for practical applications. Practically relevant self-testing bounds are much less common and moreover they all result from a single numerical method (with one exception which we discuss in detail). In this work we present a new technique for proving analytic self-testing bounds of practically relevant robustness. We obtain improved bounds for the case of self-testing the singlet using the CHSH inequality (in particular we show that nontrivial fidelity with the singlet can be achieved as long as the violation exceeds β^{*}=(16+14sqrt[2])/17≈2.11). In the case of self-testing the tripartite Greenberger-Horne-Zeilinger state using the Mermin inequality, we derive a bound which not only improves on previously known results but turns out to be tight. We discuss other scenarios to which our technique can be immediately applied.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1103/physrevlett.117.070402

Cites

52 of 52 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

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

Research works printed but not linked: 4

  1. V. Scarani, 2012, Acta Phys. Slovaca, 62, 347
  2. A. C. Doherty, 2008, Proceedings IEEE Computational Complexity ’08
  3. M. McKague, 2011, Proceedings TQC ’10, LNCS, 6519, 2011
  4. C. J. Hillar, 2013, J. ACM, 60, 45

Cited by

Sorted by citations

See all 144

Related

See all

Metadata

Authors
Kaniewski, J.
Affiliations
University of Copenhagen (DK)
Corresponding author
Kaniewski, Jędrzej
ORCID
Kaniewski, Jędrzej
Venue
Physical Review Letters
Publisher
American Physical Society (APS)
Published
2016-08-11
Volume
117
Issue
7
Pages
070402-070402
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
DOI
10.1103/physrevlett.117.070402
OpenAlex
W2344582723
Cited by
144
References
52
Citations by year
2026: 5 · 2025: 23 · 2024: 15 · 2023: 13 · 2022: 18 · 2021: 16 · 2020: 18 · 2019: 17 · 2018: 11 · 2017: 7 · 2016: 1
FWCI
9.86
Type
journal article
Language
en
Open access
Licence
link.aps.org/licenses/aps-default-license (vor)
Locations
  • Physical Review Letters (publishedVersion)
  • arXiv (Cornell University) (publishedVersion)
  • PubMed (publishedVersion)
  • Research at the University of Copenhagen (University of Copenhagen) (publishedVersion, other-oa)
  • arXiv (Cornell University)
Funders
  • European Research Council (337603)
  • Det Frie Forskningsråd
  • Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung (PP00P2_150734)
Topics
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
Keywords
self-testing, CHSH inequality, Mermin inequality, singlet state, GHZ states, quantum correlations, analytic bounds, robustness, device-independent quantum cryptography, quantum fidelity, Bell nonlocality

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