ua nt - p h / 98 10 08 2 v 1 2 7 O ct 1 99 8 Quantum computation over continuous variables
نویسنده
چکیده
This paper provides necessary and sufficient conditions for constructing a universal quantum computer over continuous variables. As an example, it is shown how a universal quantum computer for the amplitudes of the electromagnetic field might be constructed using simple linear devices such as beam-splitters and phase shifters, together with squeezers and nonlinear devices such as Kerr-effect fibers and atoms in optical cavities. Such a device could in principle perform ‘quantum floating point’ computations. Problems of noise, finite precision, and error correction are discussed. Quantum computation has traditionally concerned itself with the manipulation of discrete systems such as quantum bits, or ‘qubits’. Many quantum variables, such as position and momentum, or the amplitudes of electromagnetic fields, are continuous. Although noise and finite precision make precise manipulations of continuous variables intrinsically more difficult than the manipulation of discrete variables, because of the recent developments in quantum error correction and quantum teleportation of continuous quantum variables it is worthwhile addressing the question of quantum computation over continuous variables. At first it might seem that quantum computation over continuous variables is an ill-defined concept. First consider quantum computation over discrete variables. A universal quantum computer over discrete variables such as qubits can be defined to be a
منابع مشابه
ua nt - p h / 98 01 03 7 v 2 6 J un 1 99 8 Experimental realization of a quantum al - gorithm
X iv :q ua nt -p h/ 98 01 03 7v 2 6 J un 1 99 8 Experimental realization of a quantum algorithm Isaac L. Chuang, Lieven M.K. Vandersypen, Xinlan Zhou, Debbie W. Leung, and Seth Lloyd 4 1 IBM Almaden Research Center K10/D1, San Jose, CA 95120, 2 Solid State Electronics Laboratory, Stanford University, Stanford, CA 94305 3 Edward L. Ginzton Laboratory, Stanford University, Stanford, CA 94305 4 MI...
متن کاملua nt - p h / 98 10 08 8 v 1 2 9 O ct 1 99 8 Minimal coupling and the proof of Feynman
The proof of Feynman to the Maxwell equations in Dyson’s paper (Dyson,1990) was never published by Feynman himself because from his point of view the proof provides no new information about classical and quantum nature of the electromagnetic field. Even though the proof is mathematically right, there are mixing physical inputs. First of all, the proof is based on the second law of Newton, which...
متن کاملua nt - p h / 98 08 02 3 v 1 1 4 A ug 1 99 8 Probability and Entropy in Quantum Theory ∗
Entropic arguments are shown to play a central role in the foundations of quantum theory. We prove that probabilities are given by the modulus squared of wave functions, and that the time evolution of states is linear and also unitary.
متن کاملar X iv : q ua nt - p h / 98 07 07 1 v 1 2 4 Ju l 1 99 8 Trapped Ion Quantum Computer Research at Los
We briefly review the development and theory of an experiment to investigate quantum computation with trapped calcium ions. The ion trap, laser and ion requirements are determined, and the parameters required for simple quantum logic operations are described. (LAUR 98-314)
متن کاملar X iv : q ua nt - p h / 98 10 06 6 v 1 2 2 O ct 1 99 8 Reasoning about Grover ’ s Quantum Search Algorithm using Probabilistic wp
Grover’s search algorithm is designed to be executed on a quantum mechanical computer. In this paper, the probabilistic wp-calculus is used to model and reason about Grover’s algorithm. It is demonstrated that the calculus provides a rigorous programming notation for modelling this and other quantum algorithms and that it also provides a systematic framework of analysing such algorithms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998