The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Degrees of concealment and bindingness in quantum bit commitment protocols
Open accessAbstract
Although it is impossible for a bit commitment protocol to be both arbitrarily concealing and arbitrarily binding, it is possible for it to be both partiallyconcealing and partiallybinding. This means that Bob cannot, prior to the beginning of the unveiling phase, find out everything about the bit committed, and Alice cannot, through actions taken after the end of the commitment phase, unveil whatever bit she desires. We determine upper bounds on the degrees of concealment and bindingness that can be achieved simultaneously in anybit commitment protocol, although it is unknown whether these can be saturated. We do, however, determine the maxima of these quantities in a restricted class of bit commitment protocols, namely, those wherein all the systems that play a role in the commitment phase are supplied by Alice. We show that these maxima can be achieved using a protocol that requires Alice to prepare a pair of systems in an entangled state, submit one of the pair to Bob at the commitment phase, and the other at the unveiling phase. Finally, we determine the form of the trade off that exists between the degree of concealment and the degree of bindingness given various assumptions about the purity and dimensionality of the states used in the protocol.
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.
Integrity signals
Registry
Cites
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.
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
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Fidelity for Mixed Quantum States
Jozsa, R. (1994) · Journal of Modern Optics · doi:10.1080/09500349414552171 · Cited by 1,911
Cited by
The Theory of Quantum Information
Watrous, J. (2018) · doi:10.1017/9781316848142 · Cited by 1,325
Advances in optical angular momentum
Franke‐Arnold, S., Allen, L., & Padgett, M. (2008) · Laser & Photonics Reviews · doi:10.1002/lpor.200810007 · Cited by 924
Reference frames, superselection rules, and quantum information
Bartlett, S. D., Rudolph, T., & Spekkens, R. W. (2007) · Reviews of Modern Physics · doi:10.1103/revmodphys.79.555 · Cited by 827
Self-citationEvidence for the epistemic view of quantum states: A toy theory
Spekkens, R. W. (2007) · Physical Review A · doi:10.1103/physreva.75.032110 · Cited by 651
Self-citationSpatial correlations in parametric down-conversion
Walborn, S. P., Monken, C. H., Pádua, S., & Souto Ribeiro, P. H. (2010) · Physics Reports · doi:10.1016/j.physrep.2010.06.003 · Cited by 399
Metadata
- Authors
- Spekkens, R. W., & Rudolph, T.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2001-12-11
- Volume
- 65
- Issue
- 1
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2033439890
- Cited by
- 195
- References
- 2
- FWCI
- 10.14
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Degrees of concealment and bindingness in quantum bit commitment protocols. https://app.cochat.ai/papers/10.1103/physreva.65.012310
- The paper
- Spekkens, R. W., & Rudolph, T. (2001). Degrees of concealment and bindingness in quantum bit commitment protocols. Physical Review A. https://doi.org/10.1103/physreva.65.012310
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.