On the simulation of quantum Turing machines.
From MaRDI portal
Publication:1401393
DOI10.1016/S0304-3975(03)00054-9zbMath1044.68053MaRDI QIDQ1401393
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
81P68: Quantum computation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum mechanical Hamiltonian models of Turing machines
- An introduction to Hilbert space and quantum logic
- The network complexity and the Turing machine complexity of finite functions
- Quantum computational networks
- Quantum Computation
- Quantum Computers, Factoring, and Decoherence
- Rapid solution of problems by quantum computation
- A method for obtaining digital signatures and public-key cryptosystems
- Relations Among Complexity Measures
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Strengths and Weaknesses of Quantum Computing
- Oracle Quantum Computing
- Realizable Universal Quantum Logic Gates
- Demonstration of a Fundamental Quantum Logic Gate
- Quantum complexity theory
- Mixed-state entanglement and quantum error correction
- Probabilistic automata
- The Lattice Point Covering Theorem for Rectangles
- Logical Reversibility of Computation