ua nt - p h / 98 07 07 0 v 1 2 4 Ju l 1 99 8 A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
نویسنده
چکیده
We describe a new polynomial time quantum algorithm that uses the quantum fast fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases (commonly found in ab initio physics and chemistry problems) for which all known classical algorithms require exponential time. Applications of the algorithm to specific problems are considered, and we find that classically intractable and interesting problems from atomic physics may be solved with between 50 and 100 quantum bits.
منابع مشابه
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...
متن کامل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)
متن کاملua nt - p h / 98 07 06 3 v 1 2 2 Ju l 1 99 8 Twin - photon techniques for fiber measurements
متن کامل
ar X iv : q ua nt - p h / 03 04 09 0 v 4 1 9 Ju n 20 06 HIDDEN SYMMETRY DETECTION ON A QUANTUM COMPUTER
The fastest quantum algorithms (for the solution of classical computational tasks) known so far are basically variations of the hidden subgroup problem with f (U [x]) = f (x). Following a discussion regarding which tasks might be solved efficiently by quantum computers, it will be demonstrated by means of a simple example, that the detection of more general hidden (two-point) symmetries V {f (x...
متن کاملar X iv : q ua nt - p h / 98 02 04 9 v 3 30 S ep 1 99 8 Quantum Lower
We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0, 1}N in the black-box model. We show that, in the blackbox model, the exponential quantum speed-up obtained for partial functions (i.e. problems involving a promise on the input) by Deutsch and Jozsa and by Simon cannot be obtained for any total function: if a quantum algorithm computes...
متن کامل