The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Quantum data hiding
Open accessAbstract
We expand on our work on quantum data hiding - hiding classical data among parties who are restricted to performing only local quantum operations and classical communication (LOCC). We review our scheme that hides one bit between two parties using Bell (1964) states, and we derive upper and lower bounds on the secrecy of the hiding scheme. We provide an explicit bound showing that multiple bits can be hidden bitwise with our scheme. We give a preparation of the hiding states as an efficient quantum computation that uses at most one ebit of entanglement. A candidate data-hiding scheme that does not use entanglement is presented. We show how our scheme for quantum data hiding can be used in a conditionally secure quantum bit commitment scheme.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
On the Einstein Podolsky Rosen paradox
Bell, J. S. (1964) · Physics Physique Fizika · doi:10.1103/physicsphysiquefizika.1.195 · Cited by 12,252
Entanglement of Formation of an Arbitrary State of Two Qubits
Wootters, W. K. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.2245 · Cited by 8,290
A scheme for efficient quantum computation with linear optics
Knill, E., Laflamme, R., & Milburn, G. J. (2001) · Nature · doi:10.1038/35051009 · Cited by 5,880
Mixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272
Self-citationSeparability Criterion for Density Matrices
Peres, A. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.1413 · Cited by 5,191
Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model
Werner, R. F. (1989) · Physical Review A · doi:10.1103/physreva.40.4277 · Cited by 4,062
Separability of mixed states: necessary and sufficient conditions
Horodecki, M., Horodecki, P., & Horodecki, R. (1996) · Physics Letters A · doi:10.1016/s0375-9601(96)00706-2 · Cited by 3,649
Completely positive linear maps on complex matrices
Choi, M.-D. (1975) · Linear Algebra and its Applications · doi:10.1016/0024-3795(75)90075-0 · Cited by 2,659 · cited 2×
“A quantum operation is a completely positive map [10], [11] on operators in a Hilbert space H.”
BackgroundUnconditional Security of Quantum Key Distribution over Arbitrarily Long Distances
Lo, H.-K., & Chau, H. F. (1999) · Science · doi:10.1126/science.283.5410.2050 · Cited by 1,858
Cited by
Operator Spreading in Random Unitary Circuits
Nahum, A., Vijay, S., & Haah, J. (2018) · Physical Review X · doi:10.1103/physrevx.8.021014 · Cited by 738
Quantum Zeno effect and the many-body entanglement transition
Li, Y., Chen, X., & Fisher, M. P. A. (2018) · Physical Review B · doi:10.1103/physrevb.98.205136 · Cited by 707
Exact and approximate unitary 2-designs and their application to fidelity estimation
Dankert, C., Cleve, R., Emerson, J., & Livine, E. (2009) · Physical Review A · doi:10.1103/physreva.80.012304 · Cited by 685
Measurement-driven entanglement transition in hybrid quantum circuits
Li, Y., Chen, X., & Fisher, M. P. A. (2019) · Physical Review B · doi:10.1103/physrevb.100.134306 · Cited by 593
Connecting Ansatz Expressibility to Gradient Magnitudes and Barren Plateaus
Holmes, Z., Sharma, K., Cerezo, M., & Coles, P. J. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010313 · Cited by 570
Chaos and complexity by design
Roberts, D. A., & Yoshida, B. (2017) · Journal of High Energy Physics · doi:10.1007/jhep04(2017)121 · Cited by 455
Quantum Error Correction in Scrambling Dynamics and Measurement-Induced Phase Transition
Choi, S., Bao, Y., Qi, X.-L., & Altman, E. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.030505 · Cited by 435
Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)
Chitambar, E., Leung, D., Mančinska, L., Ozols, M., & Winter, A. (2014) · Communications in Mathematical Physics · doi:10.1007/s00220-014-1953-9 · Cited by 413
Self-citationDynamical Purification Phase Transition Induced by Quantum Measurements
Gullans, M. J., & Huse, D. A. (2020) · Physical Review X · doi:10.1103/physrevx.10.041020 · Cited by 391
Evenly distributed unitaries: On the structure of unitary designs
Gross, D., Audenaert, K., & Eisert, J. (2007) · Journal of Mathematical Physics · doi:10.1063/1.2716992 · Cited by 358
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
Self-citationRandom Quantum Circuits are Approximate 2-designs
Harrow, A. W., & Low, R. A. (2009) · Communications in Mathematical Physics · doi:10.1007/s00220-009-0873-6 · Cited by 324
“Approximate unitary 2-designs have been considered [13, 10, 17], although the approaches are specific to 2-designs.”
BackgroundMethodInfluentialA Decoupling Approach to the Quantum Capacity
Hayden, P., Horodecki, M., Winter, A., & Yard, J. (2008) · Open Systems & Information Dynamics · doi:10.1142/s1230161208000043 · Cited by 170
Large gradients via correlation in random parameterized quantum circuits
Volkoff, T., & Coles, P. J. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abd891 · Cited by 143
Entanglement-Assisted Quantum Turbo Codes
Wilde, M. M., Hsieh, M.-H., & Babar, Z. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2292052 · Cited by 102
Efficient error characterization in quantum information processing
Lévi, B., López, C. C., Emerson, J., & Cory, D. G. (2007) · Physical Review A · doi:10.1103/physreva.75.022314 · Cited by 65
Partial randomized benchmarking
Dubovitskii, K., & Makhlin, Y. (2022) · Scientific Reports · doi:10.1038/s41598-022-13813-x · Cited by 1
Metadata
- Authors
- DiVincenzo, D. P., Leung, D. W., & Terhal, B. M.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2002-03
- Volume
- 48
- Issue
- 3
- Pages
- 580-598
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2143202681
- Cited by
- 362
- References
- 31
- FWCI
- 4.35
- 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
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.