Local transition functions of quantum Turing machines
From MaRDI portal
Abstract: Foundations of the notion of quantum Turing machines are investigated. According to Deutsch's formulation, the time evolution of a quantum Turing machine is to be determined by the local transition function. In this paper, the local transition functions are characterized for fully general quantum Turing machines, including multi-tape quantum Turing machines, extending the results due to Bernstein and Vazirani.
Recommendations
- Tight Binding Hamiltonians and Quantum Turing Machines
- Quantum Turing automata
- A discrete local invariant for quantum gates
- scientific article; zbMATH DE number 2080922
- Quantum state diffusion, localization and computation
- scientific article; zbMATH DE number 1490003
- Quantum computation and the localization of modular functors
- Localization of quantum states and landscape functions
- Instantaneous non-local computation of low T-depth quantum circuits
- On local quantum Gibbs states
Cites work
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- Computing with quanta -- impacts of quantum theory on computation.
- Quantum Complexity Theory
- Quantum computational networks
- Quantum theory, the Church–Turing principle and the universal quantum computer
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
Cited in
(16)- Polynomial time quantum computation with advice
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
- Partial observation of quantum Turing machines and a weaker well-formedness condition
- Quantum computers.
- QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES
- Note on a universal quantum Turing machine
- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
- Tight Binding Hamiltonians and Quantum Turing Machines
- Quantum branching programs and space-bounded nonuniform quantum complexity
- How does adiabatic quantum computation fit into quantum automata theory?
- ANALYSIS OF QUANTUM FUNCTIONS
- Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
- Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions
- Revisiting the simulation of quantum Turing machines by quantum circuits
- The Landauer resistance and band spectra for the counting quantum Turing machine.
- scientific article; zbMATH DE number 1418357 (Why is no real title available?)
This page was built for publication: Local transition functions of quantum Turing machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2720411)
