Universality of computation in real quantum theory
نویسندگان
چکیده
منابع مشابه
Universality in Quantum Computation
We show that in quantum computation almost every gate that operates on two or more bits is a universal gate. We discuss various physical considerations bearing on the proper definition of universality for computational components such as logic gates. To be published in Proc.R.Soc.London A, June 1995.
متن کاملOn Universality in Real Computation
Les modèles de calcul qui opèrent sur les ensembles de nombres réels, et qui sont capables de calculer sur une classe strictement supérieure à celle des fonctions récursives, introduisent invariablement un élément non fini, soit comme information encodée dans une entrée, soit comme information contenue dans le modèle. Dans cet article, on montrera que la propriété d’universalité des modèles de ...
متن کاملIrreversibility and Universality in Quantum Computation
At the end of the XIX century, classical physics was in a position to solve a very large number of problems [33]: Maxwell's equations and classical statistical mechanics were able to provide a good description of electromagnetic and thermodynamic phenomena, but were considered only as a pragmatic approximation to the true laws of physics. For instance, classical statistical mechanics could not ...
متن کاملUniversality of Entanglement and Quantum Computation Complexity
We study the universality of scaling of entanglement in Shor’s factoring algorithm and in adiabatic quantum algorithms across a quantum phase transition for both the NP-complete Exact Cover problem as well as the Grover’s problem. The analytic result for Shor’s algorithm shows a linear scaling of the entropy in terms of the number of qubits, therefore difficulting the possibility of an efficien...
متن کاملQuantum Computation, Theory Of
1-The study of the model of computation in which the state space consists of linear superpositions of classical configurations and the computational steps consist of applying local unitary operators and measurements as permitted by quantum mechanics. Quantum computation emerged in the 1980's when P. Benioff and R. Feynman realized that the apparent exponential complexity in simulating quantum p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EPL (Europhysics Letters)
سال: 2013
ISSN: 0295-5075,1286-4854
DOI: 10.1209/0295-5075/104/20006