Skip to search formSkip to main contentSkip to account menu

Quantum Turing machine

Known as: QTM, Universal quantum computer 
A quantum Turing machine (QTM), also a universal quantum computer, is an abstract machine used to model the effect of a quantum computer. It provides… 
Wikipedia (opens in a new tab)

Related topics

Related topics

23 relations
Abstract machineAlgorithmic efficiencyChurch–Turing thesisComplexity class

Broader (2)

Quantum complexity theoryTuring machine

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
The Quantum Socket: Three-Dimensional Wiring for Extensible Quantum Computing
J. H. Béjanin, 2, ∗ T. G. McConkey, 3, ∗ J. R. Rinehart, 2 C. T. Earnest, 2 C.R. H. McRae, 2 D. Shiri, 2, † J. D. Bateman, 2, ‡ Y… 
2016
2016
APPROACH TO IMPROVE PERFORMANCE ON DEMAND TASK SCHEDULING AND LOAD BALANCING IN CLOUD COMPUTING ENVIRONMENT
Cloud computing is emerging as a new paradigm for manipulating, configuring, and accessing large scale distributed computing… 
2014
2014
Verified Delegated Quantum Computing with One Pure Qubit
While building a universal quantum computer remains challenging, devices of restricted power such as the so-called one pure qubit… 
2011
2011
NetQTM : Node Configuration In Network Setup By Quantum Turing Machine
The quantum Turing machine (QTM) has been introduced by Deutsch as an abstract model of quantum computation. In this paper we try… 
2009
2009
A Novel Kind of Architecture with High-Efficiency and Error-Tolerance of Universal Quantum Computer
Universal quantum computer offers great potential advantage for solving some problems which are of super-polynomial time… 
2008
2008
Simulating the Quantum Magnet
To gain deeper insight into the dynamics of complex quantum systems we need a quantum leap in computer simulations. We can not… 
2004
2004
20世紀の名著名論：D. Deutsch : Quantum Theory The Church - Turing Principle and The Universal Quantum Computer
2003
2003
A feasible gate for scalable linear optics quantum computation using polarization optics
Knill, Laflamme, and Milburn (KLM) proved that it is possible to build a scalable universal quantum computer using only linear… 
2000
2000
Novel scheme for a universal quantum computer
A scenario for realization of a quantum computer is proposed consisting of spatially distributed q-bits fabricated in a host… 
1998
1998
On the Halting Problem for Quantum Turing Machines
Foundations of the theory of quantum Turing machines are investigated. The local transition functions are characterized for fully…