Local Transition Functions of Quantum Turing Machines
From MaRDI portal
Publication:2720411
DOI10.1051/ita:2000123zbMath0987.68035arXivquant-ph/9811069OpenAlexW2101654410MaRDI 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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
Polynomial time quantum computation with advice ⋮ ANALYSIS OF QUANTUM FUNCTIONS ⋮ QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES ⋮ Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem ⋮ Revisiting the simulation of quantum Turing machines by quantum circuits ⋮ Quantum branching programs and space-bounded nonuniform quantum complexity ⋮ How does adiabatic quantum computation fit into quantum automata theory? ⋮ Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families ⋮ Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition ⋮ A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
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
This page was built for publication: Local Transition Functions of Quantum Turing Machines
