Searching for "On the simulation of quantum turing machines." – sorted by Relevance.
-
Space-Bounded Quantum Complexity
- -theoretic relationships following from classical simulations of quantum Turing machine computations, and Section 4
- Cited by 6 (1 self) – Add To MetaCart
-
Space-Bounded Quantum Computation
- Regarding Rational Functions . . . . . . . . . . . . . . 53 4 Quantum Turing Machine Simulations
- Cited by 1 (1 self) – Add To MetaCart
-
On Quantum and Classical Space-Bounded Processes With Algebraic Transition Amplitudes
- function generating the circuit. Similar to the quantum circuit simulation of quantum Turing machines due
- Cited by 1 (0 self) – Add To MetaCart
-
Why do quantum algorithms work? - The Deutsch-Josza problem
- in computation.Yao [Yao93] has shown that acyclic quantum gate arrays can simulate quantum Turing machines. So
- Cited by 1 (0 self) – Add To MetaCart
-
PhysComp96: vand Extended abstract
- are computational universal[19, 20] to create a qca that can simulate quantum Turing machines. By this result
- Add To MetaCart
-
Strengths and Weaknesses of Quantum Computing
- is sufficient to simulate quantum Turing machines. In fact, Bernstein and Vazirani 's [4] result is stronger
- Cited by 195 (8 self) – Add To MetaCart
-
Arnold Beckmann
- . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 387 Mihai Prunescu Simulations of Quantum Turing Machines by Quantum Multi-Counter Machines
- Add To MetaCart
-
Quantum Algorithms for Hidden Subgroups of S_n
- described a quantum computer (on the lines of a classical Turing Machine) which was based on quantum
- Add To MetaCart
-
Elementary Gates for Quantum Computation
- quantum gate arrays can simulate quantum Turing machines. Gate arrays are easier to think about, since
- Cited by 110 (9 self) – Add To MetaCart
-
Quantum Computation
- arrays). Yao [Yao93] has shown that acyclic quantum gate arrays could simulate quantum Turing machines
- Cited by 82 (5 self) – Add To MetaCart

