dorsal/arxiv
View SchemaEfficient factorization with a single pure qubit and $log N$ mixed qubits
| Authors | S. Parker, M. B. Plenio |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0001066 |
| URL | https://arxiv.org/abs/quant-ph/0001066 |
| DOI | 10.1103/PhysRevLett.85.3049 |
| Journal | Phys. Rev. Lett. 85, 3049 (2000) |
Abstract
It is commonly assumed that Shor's quantum algorithm for the efficient factorization of a large number $N$ requires a pure initial state. Here we demonstrate that a single pure qubit together with a collection of $log_2 N$ qubits in an arbitrary mixed state is sufficient to implement Shor's factorization algorithm efficiently.
{
"annotation_id": "680c6467-aba9-4209-b3d8-635abff24cf5",
"date_created": "2026-03-02T18:01:35.767000Z",
"date_modified": "2026-03-02T18:01:35.767000Z",
"file_hash": "9dbcc4a62412eabe109c56ddc1389df474475f65808e3580351635dc4ffb6568",
"private": false,
"record": {
"abstract": "It is commonly assumed that Shor\u0027s quantum algorithm for the efficient\nfactorization of a large number $N$ requires a pure initial state. Here we\ndemonstrate that a single pure qubit together with a collection of $log_2 N$\nqubits in an arbitrary mixed state is sufficient to implement Shor\u0027s\nfactorization algorithm efficiently.",
"arxiv_id": "quant-ph/0001066",
"authors": [
"S. Parker",
"M. B. Plenio"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevLett.85.3049",
"journal_ref": "Phys. Rev. Lett. 85, 3049 (2000)",
"title": "Efficient factorization with a single pure qubit and $log N$ mixed qubits",
"url": "https://arxiv.org/abs/quant-ph/0001066"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "6f32ee71-4e10-4679-ba59-8b24e60a1b4f",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}