Impossibility of deleting an unknown quantum state
Open accessThe DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index; none of the 6 sources its claims cite is checked for support yet.
Overview
CoChat Summary
TL;DR
The paper proves a quantum no-deleting principle: linearity of quantum theory forbids perfectly deleting one copy of an arbitrary unknown quantum state against another copy. This is complementary to the no-cloning theorem and implies quantum information cannot be perfectly uncopied.
Key findings
- No quantum deleting machine can delete one unknown state against a copy in either a reversible or irreversible manner; the authors call this the “quantum no-deleting” principle.
- For two initially identical qubits in \(|\psi\rangle\) plus an ancilla \(|A\rangle\), a deleting operation intended to replace one copy with a standard state \(|\Sigma\rangle\) cannot hold for arbitrary \(|\psi\rangle=\alpha|H\rangle+\beta|V\rangle\): linearity makes the output quadratic in \(\alpha,\beta\), while the required final state must be linear.
- The only solutions are swapping onto a two-dimensional subspace of the ancilla, with orthogonal ancilla states \(|A_H\rangle\) and \(|A_V\rangle\); the authors explicitly exclude swapping as quantum deleting rather than uncopying.
- The result is complementary to no-cloning; the authors suggest approximate universal/optimal quantum deleting machines may be possible and that no-deleting may provide intrinsic security for quantum files.
Methods
- Theoretical proof in quantum information theory; no experimental data or sample are used.
- Defines a deleting machine acting on two identical qubits \(|\psi\rangle|\psi\rangle\) plus an ancilla \(|A\rangle\), aiming to replace one copy with a standard state \(|\Sigma\rangle\), while excluding swapping.
- Applies the transformation to \(|H\rangle|H\rangle\) and \(|V\rangle|V\rangle\), then to an arbitrary superposition \(|\psi\rangle=\alpha|H\rangle+\beta|V\rangle\); uses linearity and normalization to show the required linear final state conflicts with the quadratic output, leaving only swap-like solutions.
Limitations
- Stated: the transformation defining the deleting machine does not completely specify its action when the input states are non-identical, unlike the Wootters-Zurek cloning transformation; it defines a class of possible deleting machines.
- Stated: swapping is explicitly excluded as describing quantum deleting.
- Evident: the argument is a no-go proof for perfect deletion under the paper’s stated operation; the paper does not provide experimental tests or quantitative bounds for approximate deleting, and it leaves open possible links to superluminal signaling and optimal cloning/deleting fidelities.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
0 Valid · 0 Not valid · 5 Not checked · 11 Own results and interpretations
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“which is a quadratic polynomial in α and β .”
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Further, since the final state (5) must be normalized for all possible α and β , it follows that the ancilla states | A H 〉 and | A V 〉 are orthogonal.”
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We note that the transformation defining our deleting machine (1) does not completely specify its action when the input states are non-identical.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“However, as discussed above, (1) is therefore not uncopying at all, but merely swapping onto a two-dimensional subspace of the ancilla.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In fact, transformation (1) defines a whole class of possible deleting machines which could behave differently if the two inputs are unequal or even entangled”
hedgedstates a possible cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
4 more claims
Create a free account to see all 16 claims and every source verdict.
- It may state two separate claims as one. 3
- Probably not a substantial claim. 4
Citations
Cites
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
Experimental quantum teleportation
Bouwmeester, D., Pan, J.-W., Mattle, K., Eibl, M., Weinfurter, H., & Zeilinger, A. (1997) · Nature · doi:10.1038/37539 · Cited by 5,545
A single quantum cannot be cloned
Wootters, W. K., & Zurek, W. H. (1982) · Nature · doi:10.1038/299802a0 · Cited by 5,406 · cited 1×
“gif" NDATA ITEM> ]> A photon in an arbitrary polarization state cannot be cloned perfectl”
Irreversibility and heat generation in the computing process
Landauer, R. (1961) · IBM Journal of Research and Development · doi:10.1147/rd.53.0183 · Cited by 4,980
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Unconditional Quantum Teleportation
Furusawa, A., Sørensen, J. L., Braunstein, S. L., Fuchs, C. A., Kimble, H. J., & Polzik, E. S. (1998) · Science · doi:10.1126/science.282.5389.706 · Cited by 3,005
Self-citationIrreversibility and heat generation in the computing process
Landauer, R. (2000) · IBM Journal of Research and Development · doi:10.1147/rd.441.0261 · Cited by 2,585
Boschi, D., Branca, S., De Martini, F., Hardy, L., & Popescu, S. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.1121 · Cited by 1,777
Dieks, D. (1982) · Physics Letters A · doi:10.1016/0375-9601(82)90084-6 · Cited by 1,461
Quantum copying: Beyond the no-cloning theorem
Bužek, V., & Hillery, M. (1996) · Physical Review A · doi:10.1103/physreva.54.1844 · Cited by 1,124
Optimal Quantum Cloning Machines
Gisin, N., & Massar, S. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.2153 · Cited by 722 · cited 1×
“In spite of the quantum no-deleting principle one might try to construct a universal and optimal approximate quantum deleting machine by analogy with optimal quantum cloning machine”
Probabilistic Cloning and Identification of Linearly Independent Quantum States
Duan, L.-M., & Guo, G.-C. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.4999 · Cited by 475
Amplification of quantum states and noiseless photon amplifiers
Yuen, H. P. (1986) · Physics Letters A · doi:10.1016/0375-9601(86)90660-2 · Cited by 228
Bužek, V., Braunstein, S. L., Hillery, M., & Bruß, D. (1997) · Physical Review A · doi:10.1103/physreva.56.3446 · Cited by 180
Self-citationExperimental quantum teleportation
Bouwmeester, D., Pan, J.-W., Mattle, K., Eibl, M., Weinfurter, H., & Anton, Z. (1998) · Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.1998.0245 · Cited by 174
Bennett, C. H., & Brassard, G. (1989) · ACM SIGACT News · doi:10.1145/74074.74087 · Cited by 170
A probabilistic cloning machine for replicating two non-orthogonal states
Duan, L.-M., & Guo, G. (1998) · Physics Letters A · doi:10.1016/s0375-9601(98)00287-4 · Cited by 125
Quantum Superposition of Multiple Clones and the Novel Cloning Machine
Pati, A. K. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.2849 · Cited by 83
Self-citation
Cited by
(2009) · Information Theory · doi:10.1109/9780470544907.ch24 · Cited by 533
t|ket⟩: a retargetable compiler for NISQ devices
Sivarajah, S., Dilkes, S., Cowtan, A., Simmons, W., Edgington, A., & Duncan, R. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8e92 · Cited by 475
Abramsky, S., & Coecke, B. (2009) · Handbook of Quantum Logic and Quantum Structures · doi:10.1016/b978-0-444-52869-8.50010-4 · Cited by 179
Lectures on General Quantum Correlations and their Applications
Dhar, H. S., Pal, A. K., Rakshit, D., De, A. S., & Sen, U. (2017) · Quantum science and technology · doi:10.1007/978-3-319-53412-1 · Cited by 158
Non-Hermitian Hamiltonians and no-go theorems in quantum information
Ju, C.-Y., Miranowicz, A., Chen, G.-Y., & Nori, F. (2019) · Physical Review A · doi:10.1103/physreva.100.062118 · Cited by 145
Metadata
- Authors
- Kumar Pati, A., & Braunstein, S. L.
- Affiliations
- Bangor University (GB)
- Venue
- Nature
- Published
- 2000-03-09
- Volume
- 404
- Issue
- 6774
- Pages
- 164-165
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W2038068273
- Cited by
- 369
- References
- 14
- Citations by year
- 2026: 11 · 2025: 37 · 2024: 25 · 2023: 42 · 2022: 13 · 2021: 16 · 2020: 25 · 2019: 16 · 2018: 10 · 2017: 10 · 2016: 7 · 2015: 5 · 2014: 5 · 2013: 6 · 2012: 12
- FWCI
- 10.83
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- www.springer.com/tdm (vor)
- Locations
- Nature (publishedVersion)
- arXiv (Cornell University) (publishedVersion)
- PubMed (publishedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › 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
- no-cloning theorem, quantum computing, information erasure, polarization state
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.
A language model drew the claims from the paper on 2026-10-29, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-29 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
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.