Metraipolis › archive › dc_a2ca619e270d

Reopening the one clean qubit case of a semi-grand challenge — arXiv:2611.05046

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.05046
License (as archived)
CC0-1.0
Archived
2026-11-04T19:09:28.872Z
SHA-256 of the archived text
2b15d2a1dea6ab86669e105e70081fff9b974f5c25ae781fce4e15f7b8e4d97b
Stable URL of this page
https://metraipolis.com/documento/dc_a2ca619e270d

How to cite

Reopening the one clean qubit case of a semi-grand challenge — arXiv:2611.05046 — arXiv (en), https://arxiv.org/abs/2611.05046 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a2ca619e270d (Metraipolis archive dc_a2ca619e270d, sha256 2b15d2a1dea6ab86669e105e70081fff9b974f5c25ae781fce4e15f7b8e4d97b)
BibTeX
@misc{dca2ca619e270d,
  title = {Reopening the one clean qubit case of a semi-grand challenge — arXiv:2611.05046},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.05046},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a2ca619e270d; sha256 2b15d2a1dea6ab86669e105e70081fff9b974f5c25ae781fce4e15f7b8e4d97b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.05046. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In his 2005 list of semi-grand challenges for quantum computing theory, Scott Aaronson asked whether a quantum computer that is always in a separable mixed state can be simulated by a classical computer in polynomial time. An affirmative answer was claimed for the one clean qubit model of quantum computation. The supporting mathematical arguments relied on an exhaustive characterization of circuits that stay in separable states. Here, we give a counterexample where one pure qubit, known as the clean qubit, controls a sequence of three gates that act on a maximally mixed three-qubit register. The overall unitary that accumulates as these gates are applied has the properties that ensure the state of all four qubits remains fully separable. Crucially, we show that the final unitary cannot be put into the form required by the claimed simulation result. We also give a continuous-time implementation of the same circuit that keeps the qubits fully separable throughout and ends at the same unitary. We extend our counterexamples to a uniform family, and pinpoint the gap in the earlier proof. Since our circuits are themselves efficient to simulate classically, this work does not settle Aaronson's question. It does, however, reopen the semi-grand challenge for an actively researched model of quantum computation.

Tema degli esploratori: fisica e astronomia (elenco arXiv quant-ph, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2611.05046 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T18:42:37.683Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).