Live briefing
Everything about Quantum Turing machine
Model of quantum computation
A quantum Turing machine (QTM) or universal quantum computer is an abstract machine used to model the effects of a quantum computer. It provides a simple model that captures all of the power of quantum computation—that is, any quantum algorithm can be expressed formally as a particular quantum Turing machine. However, the computationally equivalent quantum circuit is a more common model. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Quantum Turing machineA 5-minute orientation
- Skim a recent paper: Quaternionic quantum Turing machinesInfluential work since 2022
- Pick up a classic book: ComputerdenkenThe most-reprinted book on the subject
- Read the landmark paper: Revisiting the simulation of quantum Turing machines by quantum circuitsCited 28 times
- Go sideways: HypercomputationA closely related topic
- Go sideways: Continuous-variable quantum informationA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Revisiting the simulation of quantum Turing machines by quantum circuits
On Halting Process of Quantum Turing Machine
Language Classes Defined by Generalized Quantum Turing Machine
Models of Quantum Turing Machines
Tight Binding Hamiltonians and Quantum Turing Machines
Quantum chaos in quantum Turing machines
Pattern formation in quantum Turing machines
Note on a universal quantum Turing machine
🆕 Influential since 2022
Quaternionic quantum Turing machines
Quantum Kolmogorov complexity and quantum correlations in deterministic-control quantum Turing machines
Simple circuit simulations of classical and quantum Turing machines
Harnessing Quantum SVR on Quantum Turing Machine for Drug Compounds Corrosion Inhibitors Analysis
📚 Books worth reading
ComputerdenkenRoger Penrose · 1989
Invitation to Computer ScienceG. Michael Schneider, Judith L. Gersting · 1995
The music of the primesMarcus du Sautoy · 2003
Greatest Inventions of the Past 2,000 YearsJohn Brockman · 2000
Cosmos and ConsciousnessStephen Blaha · 2000- 📕The once and future TuringS. B. Cooper, Andrew Hodges · 2016
Quantum computingSamuel L. Braunstein · 1999
The universal history of computingGeorges Ifrah · 2000
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Hypercomputation Hypercomputation or super-Turing computation is a set of hypothetical models of computation that can provide outputs that are not Turing-computable. For…
- Continuous-variable quantum information Continuous-variable (CV) quantum information is the area of quantum information science that makes use of physical observables, like the strength of an…
- Quantum cellular automaton A quantum cellular automaton (QCA) is an abstract model of quantum computation, devised in analogy to conventional models of cellular automata introduced…
- Categorical quantum mechanics Categorical quantum mechanics is the study of quantum foundations and quantum information using paradigms from mathematics and computer science, notably…
- Church–Turing–Deutsch principle In computer science and quantum physics, the Church–Turing–Deutsch-Wolfram principle (CTDW principle) is a stronger, physical form of the Church–Turing…
- Quantum supremacy In quantum computing, quantum supremacy or quantum advantage is the goal of demonstrating that a programmable quantum computer can solve a problem that…
- Quantum computing A quantum computer is a computer that represents and processes information using quantum states. Quantum computations exploit phenomena such as superposition…
- PSPACE Unsolved problem in computer science 𝖯=?𝖯𝖲𝖯𝖠𝖢𝖤 More unsolved problems in computer science In computational complexity theory, PSPACE is the set…