Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
From MaRDI portal
Publication:1009352
DOI10.1007/s11128-008-0091-8zbMath1200.81029arXivquant-ph/0511117OpenAlexW3099196844MaRDI QIDQ1009352
Harumichi Nishimura, Masanao Ozawa
Publication date: 31 March 2009
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0511117
Turing machinesQuantum computationComplexity theoryFinitely generated uniform quantum circuit familiesUniform circuit families
Related Items
A branching distributed temporal logic for reasoning about entanglement-free quantum state transformations ⋮ Zero sum subsequences and hidden subgroups ⋮ $$\mathsf {qPCF}$$ : A Language for Quantum Circuit Computations ⋮ Uniformity of quantum circuit families for error-free algorithms ⋮ Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer ⋮ Quantum implicit computational complexity ⋮ QPCF: higher-order languages and quantum circuits
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On uniform circuit complexity
- Computational complexity of real functions
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- Uniformity of quantum circuit families for error-free algorithms
- Local Transition Functions of Quantum Turing Machines
- Quantum computational networks
- Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
- Log Depth Circuits for Division and Related Problems
- On Relating Time and Space to Size and Depth
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Computability
- Quantum Complexity Theory
- EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS
- Quantum complexity theory
- QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES
