Collapse of the hierarchy of constant-depth exact quantum circuits
From MaRDI portal
Publication:347120
DOI10.1007/s00037-016-0140-0zbMath1353.68097arXiv1112.6063OpenAlexW2472883538MaRDI QIDQ347120
Seiichiro Tani, Yasuhiro Takahashi
Publication date: 30 November 2016
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.6063
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (4)
Unnamed Item ⋮ Optimal parallel quantum query algorithms ⋮ Power of uninitialized qubits in shallow quantum circuits ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unbounded fan-in circuits and associative functions
- Parallel Quantum Computation and Quantum Codes
- BQP and the polynomial hierarchy
- Quantum Circuits with Unbounded Fan-out
- Computational Depth Complexity of Measurement-Based Quantum Computation
- Parity, circuits, and the polynomial-time hierarchy
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Depth efficient neural networks for division and related problems
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS
- Non-adaptive measurement-based quantum computation and multi-party Bell inequalities
- Fundamentals of Computation Theory
This page was built for publication: Collapse of the hierarchy of constant-depth exact quantum circuits
