Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,833,793 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
23 relations
Abstract machine
Algorithmic efficiency
Church–Turing thesis
Complexity class
Expand
Broader (2)
Quantum complexity theory
Turing machine
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Controlled Dimerization of Mn 12 Single-Molecule Magnets
T. A. Jenkins
,
M. Garnero
,
+6 authors
C. Lampropoulos
2017
Corpus ID: 165158344
Controlled dimerization of Mn12 singlemolecule magnets (SMMs) was achieved via a synthetic route involving a competition between…
Expand
2014
2014
Verified Delegated Quantum Computing with One Pure Qubit
Theodoros Kapourniotis
,
E. Kashefi
,
A. Datta
2014
Corpus ID: 119292712
While building a universal quantum computer remains challenging, devices of restricted power such as the so-called one pure qubit…
Expand
2012
2012
Upper Bound and HRU Access Matrix Model
A. Singh
2012
Corpus ID: 15383190
Service-oriented Architectures (SOA) facilitate the dynamic and seamless integration of services offered by different service…
Expand
2011
2011
NetQTM : Node Configuration In Network Setup By Quantum Turing Machine
M. Bahrami
,
Peyman Arebi
,
Mohammad Bahrami
2011
Corpus ID: 18475043
The quantum Turing machine (QTM) has been introduced by Deutsch as an abstract model of quantum computation. In this paper we try…
Expand
2009
2009
A Novel Kind of Architecture with High-Efficiency and Error-Tolerance of Universal Quantum Computer
Song Fang
2009
Corpus ID: 64183933
Universal quantum computer offers great potential advantage for solving some problems which are of super-polynomial time…
Expand
2008
2008
Simulating the Quantum Magnet
A. Friedenauer
,
H. Schmitz
,
Jan T. Gluckert
,
D. Porras
,
T. Schatz
2008
Corpus ID: 54222621
To gain deeper insight into the dynamics of complex quantum systems we need a quantum leap in computer simulations. We can not…
Expand
2004
2004
20世紀の名著名論：D. Deutsch : Quantum Theory The Church - Turing Principle and The Universal Quantum Computer
山本 喜久
,
古田 彩
2004
Corpus ID: 116898444
2004
2004
A Note on Bulk Quantum Turing Machine
Tetsushi Matsui
arXiv.org
2004
Corpus ID: 3205685
Recently, among experiments for realization of quantum computers, NMR quantum computers have achieved the most impressive…
Expand
2003
2003
A feasible gate for scalable linear optics quantum computation using polarization optics
K. Sanaka
,
K. Resch
2003
Corpus ID: 118283845
Knill, Laflamme, and Milburn (KLM) proved that it is possible to build a scalable universal quantum computer using only linear…
Expand
1998
1998
On the Halting Problem for Quantum Turing Machines
M. Ozawa
1998
Corpus ID: 54539142
Foundations of the theory of quantum Turing machines are investigated. The local transition functions are characterized for fully…
Expand