QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES

DOI10.1142/S0129054103002059zbMath1101.68588OpenAlexW1972659920MaRDI QIDQ5696941

Harumichi Nishimura

Publication date: 19 October 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054103002059

zbMATH Keywords

exact algorithmamplitudequantum Turing machinezero-error algorithmquantum complexity class

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Related Items (1)

Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of combinatorial problems with succinct input representation
• Computational complexity of real functions
• \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\)
• Local Transition Functions of Quantum Turing Machines
• Quantum computational networks
• Rapid solution of problems by quantum computation
• Reliable quantum computers
• Quantum computations: algorithms and error correction
• Quantum Computability
• Quantum Complexity Theory
• Strengths and Weaknesses of Quantum Computing
• Oracle Quantum Computing

This page was built for publication: QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES