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.
2017
2017
Eigenfrequencies and Modal Analysis of Uniaxial, Biaxial, and Gyroelectric Spherical Cavities
The normalized eigenfrequencies in spherical cavities filled with uniaxial, biaxial, and gyroelectric medium are calculated, and… 
2017
2017
Coprocessors for quantum devices
Quantum devices, from simple fixed-function tools to the ultimate goal of a universal quantum computer, will require high quality… 
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… 
2010
2010
Departmental Papers ( CIS ) University of Pennsylvania Year QuanTM : A Quantitative Trust Management System
Quantitative Trust Management (QTM) provides a dynamic interpretation of authorization policies for access control decisions… 
2009
2009
An improved architecture of a realizable quantum computer for quantum programming languages
We study a new realizable architecture for a universal quantum computer based on different optimized components and computational… 
2009
2009
Supramolecular Entanglement from Interlocked Molecular Nanomagnets
The trinuclear nanomagnet [MnIII3O(Et-sao)3(MeOH)3](ClO4) (1) has been utilized as a building block for the construction of the… 
2008
2008
Language Classes Defined by Generalized Quantum Turing Machine
Ohya and Volovich proposed a quantum algorithm with chaotic amplification to solve the SAT problem, which went beyond the notion… 
2007
2007
Halting in quantum Turing computation
The paper considers the halting scheme for quantum Turing machines. The scheme originally proposed by Deutsch appears to be… 
2004
2004
20世紀の名著名論：D. Deutsch : Quantum Theory The Church - Turing Principle and The Universal Quantum Computer
1993
1993
Indexing on Spherical Surfaces Using Semi-Quadcodes
The conventional method of referencing a point on a spherical surface of known radius is by specifying the angular position of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)