Cited by 827Quantum Information and CryptographyQuantum Mechanics and ApplicationsQuantum Computing Algorithms and Architecture

Reference frames, superselection rules, and quantum information

Open access
Bartlett, Stephen D., Rudolph, Terry, Spekkens, Robert W.·2007·Reviews of Modern Physics

Abstract

Recently, there has been much interest in a new kind of ``unspeakable'' quantum information that stands to regular quantum information in the same way that a direction in space or a moment in time stands to a classical bit string: the former can only be encoded using particular degrees of freedom while the latter are indifferent to the physical nature of the information carriers. The problem of correlating distant reference frames, of which aligning Cartesian axes and synchronizing clocks are important instances, is an example of a task that requires the exchange of unspeakable information and for which it is interesting to determine the fundamental quantum limit of efficiency. There have also been many investigations into the information theory that is appropriate for parties that lack reference frames or that lack correlation between their reference frames, restrictions that result in global and local superselection rules. In the presence of these, quantum unspeakable information becomes a new kind of resource that can be manipulated, depleted, quantified, etc. Methods have also been developed to contend with these restrictions using relational encodings, particularly in the context of computation, cryptography, communication, and the manipulation of entanglement. This paper reviews the role of reference frames and superselection rules in the theory of quantum-information processing.

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/revmodphys.79.555

Cites

187 of 187 references verified0 citation errors · 0 not checkable

Statistics

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?

  • Any function that quantifies the performance of states for phase estimation is automatically a measure of asymmetry relative to phase shifts.

    “any function which quantifies the performance of states for the task of phase estimation is automatically a measure of asymmetry relative to phase shifts [22].”

    From Quantum speed limits, coherence, and asymmetry (2016) · cites this paper as [22]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 20

  1. Ambainis, A., M. Mosca, A. Tapp, and R. de Wolf, in Proc. 41 st Annual Symposium on Foundations of Computer Science , (IEEE, Los Alamitos, 2000), p. 547. Also eprint quant-ph/0003101. · arXiv
  2. Bacon, D., I. L. Chuang, and A. W. Harrow, 2006, e-print quant-ph/0601001. · arXiv
  3. Bagan, E., J. Calsamiglia, R. Demkowicz-Dobrza´ nski, and R. Munoz-Tapia, 2006b, e-print quant-ph/0606165. · arXiv
  4. Bartlett, S. D., T. Rudolph, B. C. Sanders, and P. S. Turner, 2006d, eprint quant-ph/0607107. · arXiv
  5. Chiribella, G., L. Maccone, and P. Perinotti, 2006, e-print quant-ph/0608042. · arXiv
  6. Diosi, L., 2000, e-print quant-ph/0007046. · arXiv
  7. Gea-Banacloche, J., 2002a, e-print quant-ph/0212027. · arXiv
  8. Gisin, N., 2004, e-print quant-ph/0408095. · arXiv
  9. Haroche, S., 1984, in New Trends in Atomic Physics , edited by G. Grynberg and R. Stora (Elsevier, Amsterdam), Les Houches Session XXXVIII.
  10. Janzing, D., and T. Beth, 2003, IEEE Trans. Inf. Th. 49 , 230. Javanainen, J., and S. M. Yoo, 1996, Phys. Rev. Lett. 76 , 161.
  11. Landauer, R., 1993, in Proc. Workshop on Physics and Computation: PhysComp'92 , (IEEE Comp. Sci. Press, Los Alamitos), pp. 1-4.
  12. Mayers, D., 2002, e-print quant-ph/0212159. · arXiv
  13. Poulin, D., and J. Yard, 2006, e-print quant-ph/0612126. · arXiv
  14. Preskill, J., 2000, e-print quant-ph/0010098. · arXiv
  15. Rudolph, T., 1999a, e-print quant-ph/9902010. · arXiv
  16. Rudolph, T., 1999b, e-print quant-ph/9904037. · arXiv
  17. Smolin, J. A., 2004, e-print quant-ph/0407009. · arXiv
  18. Spedalieri, F. M., 2004, e-print quant-ph/0409057. · arXiv
  19. Vaccaro, J. A., F. Anselmi, H. M. Wiseman, and K. Jacobs, 2005, e-print quant-ph/0501121. · arXiv
  20. Wiseman, H. M., 2003, in Proceedings of SPIE Vol. 5111, Fluctuations and Noise in Photonics and Quantum Optics , edited by D. Abbott, J. H. Shapiro, and Y. Yamamoto (SPIE, Bellingham, WA), pp. 78-91, e-print quant-ph/0303116. · arXiv

Cited by

Sorted by citations

Authors
Bartlett, S. D., Rudolph, T., & Spekkens, R. W.
Affiliations
The University of Sydney (AU)
Venue
Reviews of Modern Physics
Published
2007-04-05
Volume
79
Issue
2
Pages
555-609
ISSN
  • 0034-6861 (ISSN-L)
  • 1539-0756
OpenAlex
W2148115906
Cited by
827
References
187
Citations by year
2026: 40 · 2025: 77 · 2024: 61 · 2023: 57 · 2022: 65 · 2021: 63 · 2020: 59 · 2019: 54 · 2018: 38 · 2017: 36 · 2016: 51 · 2015: 32 · 2014: 36 · 2013: 19 · 2012: 28
FWCI
31.53
Type
journal article
Language
en
Open access
Locations
  • Reviews of Modern Physics (publishedVersion)
  • arXiv (Cornell University) (publishedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › 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
reference frames, superselection rules, quantum information, relational encoding, entanglement, clock synchronization, coordinate alignment, quantum cryptography, quantum communication, quantum computing

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