Uniformity of quantum circuit families for error-free algorithms

DOI10.1016/j.tcs.2004.12.020zbMath1142.68356OpenAlexW1963604719MaRDI QIDQ1770403

Harumichi Nishimura, Masanao Ozawa

Publication date: 6 April 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.12.020

zbMATH Keywords

Quantum computationComplexity theoryExact algorithmsUniform circuit familiesZero-error algorithms

Mathematics Subject Classification ID

Related Items (2)

Zero sum subsequences and hidden subgroups ⋮ Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
• Computational complexity of real functions
• Computational complexity of uniform quantum circuit families and quantum Turing machines
• Complexity limitations on quantum computation
• Quantum computational networks
• Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
• 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
• Programmable Quantum Gate Arrays
• EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS
• Logical Reversibility of Computation

This page was built for publication: Uniformity of quantum circuit families for error-free algorithms