Almost-everywhere superiority for quantum polynomial time
From MaRDI portal
Publication:1854537
DOI10.1006/inco.2001.3110zbMath1012.68067OpenAlexW1999477896MaRDI QIDQ1854537
Edith Hemaspaandra, Hemaspaandra, Lane A., Marius Zimand
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.2001.3110
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
New quantum algorithm for studying NP-complete problems ⋮ The Road to Quantum Computational Supremacy ⋮ Almost-everywhere superiority for quantum polynomial time
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes
- Almost-everywhere complexity hierarchies for nondeterministic time
- Almost-everywhere superiority for quantum polynomial time
- Exponential separation of quantum and classical communication complexity
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Power of Quantum Computation
- Oracle Quantum Computing
This page was built for publication: Almost-everywhere superiority for quantum polynomial time
