Cited by 58Quantum Information and CryptographyQuantum Computing Algorithms and ArchitectureQuantum Mechanics and Applications

Self-testing of Quantum Circuits

Magniez, Frédéric, Mayers, Dominic, Mosca, Michele, Ollivier, Harold·2006·Lecture Notes in Computer Science

Integrity signals

Registry

Crossref · 10.1007/11786986_8

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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-testing is a verification process for the operations of a collection of untrusted quantum devices, and a key application of the blind computing protocol is towards such verification of quantum devices.

    “Self-testing is a verification process for the operations of a collection of untrusted quantum devices [47, 48]; a key application of the blind computing protocol is also towards such verification of quantum devices [29, 30].”

    From Demonstration of Blind Quantum Computing (2012) · cites this paper as [47]

The citation lists haven’t been fetched yet

References 14 · Cited by 58

Authors
Magniez, F., Mayers, D., Mosca, M., & Ollivier, H.
Affiliations
  • Université Paris-Sud (FR)
  • California Institute of Technology (US)
  • University of Waterloo (CA)
  • Perimeter Institute (CA)
Venue
Lecture Notes in Computer Science
Published
2006
Pages
72-83
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W1592754027
Cited by
58
References
14
Citations by year
2025: 4 · 2024: 1 · 2023: 3 · 2022: 2 · 2021: 2 · 2020: 2 · 2019: 2 · 2018: 2 · 2017: 4 · 2016: 6 · 2015: 2 · 2014: 3 · 2013: 6 · 2012: 4
FWCI
0.72
Type
conference paper
Language
en
Open access
closed
Locations
Lecture notes in computer science (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
self-testing, quantum circuits, robustness

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