Quantum computation and complexity theory
K. Svozil
Abstract
The Hilbert space formalism of quantum mechanics is reviewed with emphasis on applications to quantum computing. Standard interferomeric techniques are used to construct a physical device capable of universal quantum computation. Some consequences for recursion theory and complexity theory are discussed.
Create a lesson
Related papers
Proof of the AGT Conjecture at Generic β
Le-Feng Chen, Kilar Zhang
Casimir operators of 4D\,, N=2 supersymmetry in the harmonic approach
Egor Eremeev, Evgeny Ivanov
Doubly-scaled planar N = 4 SYM \& Carroll Holography
Arjun Bagchi, Prateksh Dhivakar, Alok Laddha et al.
Quantum Selection of Classical Histories
Omer Guleryuz
Wess-Zumino gauge for analytic prepotentials of off-shell N=2 supergravity: bosonic sector
Nikita Zaigraev, Julia Zernina
Testing holographic computation of entanglement pseudo-entropy in dS3/ICFT2
Liang Li