CoChat

Impossibility of deleting an unknown quantum state

Open access
Kumar Pati, Arun, Braunstein, Samuel L. · 2000 · Nature

The 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

Crossref · 10.1038/404130b0

Cites

18 of 18 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

0 Valid · 0 Not valid · 5 Not checked · 11 Own results and interpretations

4 more claims

Create a free account to see all 16 claims and every source verdict.

See all claims — free account
  • It may state two separate claims as one. 3
  • Probably not a substantial claim. 4

Create a free account to see these claims.

Citations

Cites

Show all 18 references

Cited by

Items 101–187 of 187

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
Licence
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.