Metraipolis › archive › dc_739d4abe8a71

State Synthesis with an NP oracle — arXiv:2611.02370

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.02370
License (as archived)
CC0-1.0
Archived
2026-11-03T11:46:35.362Z
SHA-256 of the archived text
23ab2590bf55b8d2ca80a96d0d8549d6e2b41fce297e0d20a8f50b0eeab3afee
Stable URL of this page
https://metraipolis.com/documento/dc_739d4abe8a71

How to cite

State Synthesis with an NP oracle — arXiv:2611.02370 — arXiv (en), https://arxiv.org/abs/2611.02370 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_739d4abe8a71 (Metraipolis archive dc_739d4abe8a71, sha256 23ab2590bf55b8d2ca80a96d0d8549d6e2b41fce297e0d20a8f50b0eeab3afee)
BibTeX
@misc{dc739d4abe8a71,
  title = {State Synthesis with an NP oracle — arXiv:2611.02370},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.02370},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_739d4abe8a71; sha256 23ab2590bf55b8d2ca80a96d0d8549d6e2b41fce297e0d20a8f50b0eeab3afee},
  year = {2026}
}

Archived text

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

In this note, I describe a quantum algorithm that prepares an arbitrary state $|\psi\rangle$ to inverse exponential precision in polynomial time by making queries to an $\mathsf{NP}$ oracle, assuming one can directly query entries of the state vector corresponding to $|\psi\rangle$. The previous best upper bound on the complexity class required by an oracle for this task was $\mathsf{PP}$. I provide evidence that $\mathsf{NP}$ is the best possible upper bound by showing that any quantum algorithm using a $\mathsf{P}$ oracle, or even a $\mathsf{P/poly}$ oracle, requires exponentially many queries. I also discuss some implications of this result for the $\mathsf{QMA}$ search-to-decision problem and unitary synthesis.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.CC, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph) ; Computational Complexity (cs.CC).
Pagina del lavoro: https://arxiv.org/abs/2611.02370 — 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-03T11:08:22.237Z dalla pagina https://arxiv.org/list/cs.CC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).