On the need for large quantum depth
From MaRDI portal
Publication:6567267
DOI10.1145/3570637MaRDI QIDQ6567267
Nai-Hui Chia, Ching-Yi Lai, Kai-Min Chung
Publication date: 4 July 2024
Published in: Journal of the ACM (Search for Journal in Brave)
oracle separationd-shuffling Simon's problemhybrid quantum-classical computernear-term quantum computersmall-depth quantum circuit
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Random oracles and non-uniformity
- Quantum security proofs using semi-classical oracles
- Parallel quantum computation and quantum codes
- The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator
- BQP and the polynomial hierarchy
- Quantum Circuits with Unbounded Fan-out
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- Quantum computing and hidden variables
- Revocable Quantum Timed-Release Encryption
- Exponential algorithmic speedup by a quantum walk
- Random Oracles and Auxiliary Input
- Computations with greater Quantum depth are strictly more powerful (relative to an oracle)
- Computational Complexity
Related Items (2)
The NISQ complexity of collision finding ⋮ Quantum complexity for discrete logarithms and related problems
This page was built for publication: On the need for large quantum depth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567267)
