On the simulation of quantum Turing machines.
From MaRDI portal
Recommendations
- Revisiting the simulation of quantum Turing machines by quantum circuits
- Simulating quantum mechanics on a quantum computer.
- Classical simulation complexity of quantum machines.
- Simulating quantum systems on a quantum computer
- Simulating quantum dynamics on a quantum computer
- Simulating quantum computers with probabilistic methods
- Simulation of quantum algorithms on a symbolic computer
- Tolological quantum computation.
- Simulating quantum computation on a macroscopic model
Cites work
- scientific article; zbMATH DE number 3131829 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 4020506 (Why is no real title available?)
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 192916 (Why is no real title available?)
- scientific article; zbMATH DE number 3573943 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3334685 (Why is no real title available?)
- scientific article; zbMATH DE number 3337815 (Why is no real title available?)
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- A method for obtaining digital signatures and public-key cryptosystems
- An introduction to Hilbert space and quantum logic
- Demonstration of a Fundamental Quantum Logic Gate
- Logical Reversibility of Computation
- Mixed-state entanglement and quantum error correction
- Oracle Quantum Computing
- Probabilistic automata
- Quantum complexity theory
- Quantum computation
- Quantum computational networks
- Quantum computers, factoring, and decoherence
- Quantum mechanical Hamiltonian models of Turing machines
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Rapid solution of problems by quantum computation
- Realizable Universal Quantum Logic Gates
- Relations Among Complexity Measures
- Strengths and Weaknesses of Quantum Computing
- The Lattice Point Covering Theorem for Rectangles
- The network complexity and the Turing machine complexity of finite functions
This page was built for publication: On the simulation of quantum Turing machines.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401393)
