Local Transition Functions of Quantum Turing Machines

DOI10.1051/ita:2000123zbMath0987.68035arXivquant-ph/9811069MaRDI QIDQ2720411

Harumichi Nishimura, Masanao Ozawa

Publication date: 18 June 2002

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/9811069

zbMATH Keywords

quantum Turing machines

Mathematics Subject Classification ID

81P68: Quantum computation

81P10: Logical foundations of quantum mechanics; quantum logic (quantum-theoretic aspects)

Related Items

Revisiting the simulation of quantum Turing machines by quantum circuits, ANALYSIS OF QUANTUM FUNCTIONS, QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES, How does adiabatic quantum computation fit into quantum automata theory?, A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY, Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families, Quantum branching programs and space-bounded nonuniform quantum complexity, Polynomial time quantum computation with advice, Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem, Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition

Cites Work

• Unnamed Item
• The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
• Computing with quanta -- impacts of quantum theory on computation.
• Quantum computational networks
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum Complexity Theory