Quantum Turing Machine History, How it Works and Types
Quantum Turing Machine
A quantum Turing machine (QTM) is a quantum computer in theory. Since quantum algorithms replicate quantum computers and completely utilise quantum processing, they are QTMs. Quasi-Turing machines use quantum physics notions like superposition and entanglement.
Unlike traditional computers, QTMs use qubits, which can be 0 or 1. This allows QTMs to run many computations simultaneously, potentially speeding up certain processes.
History
The Turing machine was conceived in 1936, when classical mechanics ruled physical knowledge. The original definition of a Turing machine was based on classical mechanics to suppress quantum effects in its physical realisation, such as in digital computers.
In 1980 and 1982, physicist Paul Benioff proposed a quantum mechanical Turing machine paradigm. This groundbreaking work laid the groundwork for quantum computation. David Deutsch developed the idea in 1985 by showing that a QTM could simulate any quantum system, making it a universal quantum computer.
Deutsch laid the groundwork for quantum computation before the first quantum computers were built. Yuri Manin separately investigated similar ideas in 1980. In 1985, David Deutsch expanded the Church-Turing thesis to say that a quantum Turing machine can perform any physically realisable computation.
Works How
Quantum Turing machines work like standard Turing machines despite their quantum mechanics. The transition function is the basic concept of quantum introduction, and most of its formulation may be recast from classical.
The Core Components of a QTM Include
Infinite Tape: A QTM’s tape is made up of qubits rather than bits, which allows each cell to exist in a superposition of states. It is frequently advantageous to think of the tape as a finite loop of length N = 2t+1 (or greater) while analyzing bounded calculations, where t is the number of steps and n is the input length.
Read/Write Head: This head is capable of performing quantum operations on the qubits on the tape and reading their current state.
Finite Set of States (Q): The internal state of the machine is a quantum state, which is a superposition of a finite number of base states, rather than a single classical state. This set is substituted with a Hilbert space in a formal sketch.
Transition Function (\Δ): The key component defining the dynamics of the QTM is the Transition Function (\Δ). The transition function of the QTM is \Δ: Q \times \γ \to C^{Q \times \γ \times {-1, +1}}, where elements are complex vectors representing amplitudes, in contrast to the transition function of a classical deterministic Turing machine, which maps Q \times \Σ \to Q \times \Σ \times {L, R, N}.
According to the current states, this function, a collection of unitary matrices, or quantum gates, defines the machine's internal and tape cell states. These amplitudes' complex numbers should be chosen from a "reasonable set," such as a finite set or one for which rational approximations can be found, to ensure data computability.
Due to superposition, a QTM analyses multiple computing paths simultaneously rather than one. A unitary operator (U_{\Δ}) on a Hilbert space with configuration vectors (machine state, head position, and tape contents) defines the global development of a quantum Turing machine. Since the QTM is unitar, its dynamics must be reversible.
QTMs can be replicated since they use classical states. QTM dynamics are deterministic for quantum state changes. However, measurements are probabilistic and must be conducted to read out the computation's result. This measurement causes the superposition to “collapse” into a single outcome because the quantum amplitudes of the superposed states determine the probability of each event.
Bernstein and Vazirani suggested calculations for a predetermined number of steps, while Deutsch suggested periodic measurements for halting criterion. The latter convention works well for quantum circuit QTM simulations with a fixed number of steps.
Types and Variants
Although the Quantum Turing Machine is a theoretical model, scientists have studied several conceptual adjustments to improve its functionality or study:
A basic model called the universal QTM can replicate any other QTM. It has been shown that a universal QTM can imitate any other QTM for any number of steps before stopping with probability one.
Linear Quantum Turing Machine (LQTM): Iriyama, Ohya, and Volovich created the LQTM, a generalisation that allows irreversible operations and mixed quantum states and represents quantum measurements without classical results.
QTM with Postselection: Scott Aaronson defined QTM with Postselection as a modification that “postselected” a computation to consider only a given result. The classical complexity class PP is equal to polynomial time on such a machine (PostBQP).
Multi-dimensional Tapes: QTMs' causal behaviour can be expanded by conceptualising them with two-dimensional tapes (a torus). This allows for more complex spatial information arrangements.
Change the transition function to include a ‘0’ for no movement to relax the definition of a QTM so the tape head can stay static on a step instead of moving left or right.