QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES

DOI10.1142/S0129054103002059zbMATH Open1101.68588OpenAlexW1972659920MaRDI QIDQ5696941FDOQ5696941

Authors: 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

Recommendations

• scientific article; zbMATH DE number 2086395
• Quantum Computability
• scientific article
• Quantum Complexity Theory
• Quantum computers that can be simulated classically in polynomial time

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Quantum Computability
• Quantum computational networks
• Reliable quantum computers
• Quantum computations: algorithms and error correction
• Quantum Complexity Theory
• Strengths and Weaknesses of Quantum Computing
• Rapid solution of problems by quantum computation
• The complexity of combinatorial problems with succinct input representation
• Computational complexity of real functions
• \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\)
• Oracle Quantum Computing
• Local transition functions of quantum Turing machines

Cited In (5)

• Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
• Title not available (Why is that?)
• Title not available (Why is that?)
• Why it is sufficient to have real-valued amplitudes in quantum computing
• Quantum Computability

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696941)