Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
It is a standard result in the theory of quantum error- correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding and encoded Hilbert spaces. However, this bound only applies to codes which recover the message exactly. Naively, one might expect that correcting errors to very high fidelity would only allow small violations of this bound. This intuition is incorrect: in this paper we describe quantum error-correcting codes capable of correcting up to $\lfloor(n - 1)/2\rfloor$ arbitrary errors with fidelity exponentially close to 1, at the price of increasing the size of the registers (i.e., the coding alphabet). This demonstrates a sharp distinction between exact and approximate quantum error correction. The codes have the property that any t components reveal no information about the message, and so they can also be viewed as error-tolerant secret sharing schemes. The construction has several interesting implications for cryptography and quantum information theory. First, it suggests that secret sharing is a better classical analogue to quantum error correction than is classical error correction. Second, it highlights an error in a purported proof that verifiable quantum secret sharing (VQSS) is impossible when the number of cheaters t is n/4. In particular, the construction directly yields an honest-dealer VQSS scheme for $t= \lfloor(n - 1)/2\rfloor$. We believe the codes could also potentially lead to improved protocols for dishonest-dealer VQSS and secure multi-party quantum computation. More generally, the construction illustrates a difference between exact and approximate requirements in quantum cryptography and (yet again) the delicacy of security proofs and impossibility results in the quantum model.
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
A single quantum cannot be cloned
Wootters, W. K., & Zurek, W. H. (1982) · Nature · doi:10.1038/299802a0 · Cited by 5,406 · cited 1×
“It is an immediate result of the no-cloning theorem [24] that no quantum error-correcting code of length n can fix n/2 erasures: such a code would allow one to reconstruct two copies of an encoded quantum state from two halves of the full codeword, which would be cloning the state.”
BackgroundCleve, R., Gottesman, D., & Lo, H.-K. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.648 · Cited by 1,373 · cited 2×
“[6] observed that any (perfect) QECC correcting t erasures is itself a secret sharing scheme, in that no t components of the code reveal any information about the message.”
BackgroundSelf-citationFault-tolerant quantum computation with constant error
Aharonov, D., & Ben-Or, M. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258579 · Cited by 631
Randomizing Quantum States: Constructions and Applications
Hayden, P., Leung, D., Shor, P. W., & Winter, A. (2004) · Communications in Mathematical Physics · doi:10.1007/s00220-004-1087-6 · Cited by 345 · cited 1×
“A similar divergence between exact and approximate bounds has recently been seen in the context of private quantum channels [13].”
BackgroundApproximate Quantum Error Correction
Schumacher, B., & Westmoreland, M. D. (2002) · Quantum Information Processing · doi:10.1023/a:1019653202562 · Cited by 142
Cited by
Quantum internet: a vision for the road ahead
Wehner, S., Elkouss, D., & Hanson, R. (2018) · Science · doi:10.1126/science.aam9288 · Cited by 2,467
New Class of Quantum Error-Correcting Codes for a Bosonic Mode
Michael, M. H., Silveri, M., Brierley, R. T., Albert, V. V., Salmilehto, J., Jiang, L., & Girvin, S. M. (2016) · Physical Review X · doi:10.1103/physrevx.6.031006 · Cited by 419
Performance and structure of single-mode bosonic codes
Albert, V. V., Noh, K., Duivenvoorden, K., Young, D. J., Brierley, R. T., Reinhold, P., Vuillot, C., Li, L., Shen, C., Girvin, S. M., et al. (2018) · Physical Review A · doi:10.1103/physreva.97.032346 · Cited by 305
General Conditions for Approximate Quantum Error Correction and Near-Optimal Recovery Channels
Bény, C., & Oreshkov, O. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.120501 · Cited by 126
Quantum minimal surfaces from quantum error correction
Akers, C., & Penington, G. (2022) · SciPost Physics · doi:10.21468/scipostphys.12.5.157 · Cited by 65
Metadata
- Authors
- Crépeau, C., Gottesman, D., & Smith, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 285-301
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2144746005
- Cited by
- 51
- References
- 5
- FWCI
- 1.67
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.