The nature of a quantum computer is described in the concrete context of a quantum simulator of the single-particle Schrödinger equation. We show that a register of 6–10 qubits is sufficient to realize a useful quantum simulator capable of efficiently solving standard quantum mechanical problems.
As the first useful Quantum Computers presumably will be quantum simulators, here the minimum number of qubits necessary for the solution of Schrödinger's equation in simple test problems is evaluated. From the present preliminary results it appears that it is possible to realize a useful quantum simulator with a register of only 10-15 qubits. The intrinsic sensitivity to some errors appears to be moderate without the need of error correcting methods. At present there is at least some indication that the amplitude errors are more dangerous than phase and decoherence errors. So corrections limited to amplitude errors may be very useful.
Algorithms are described for efficiently simulating quantum mechanical systems on quantum computers. A class of algorithms for simulating the Schrödinger equation for interacting many-body systems are presented in some detail. These algorithms would make it possible to simulate nonrelativistic quantum systems on a quantum computer with an exponential speedup compared to simulations on classical computers. Issues involved in simulating relativistic systems of Dirac or gauge particles are discussed.
During the last decade, the field of quantum computation has attracted a lot of interest and motivated many theoretical and experimental studies of n -qubit quantum systems. But apart from the promise of more efficient quantum algorithms, these investigations also revealed a number of obstacles which still have to be overcome in practice. In this context, the use of simulation programs has proved to be an appropriate method. In order to facilitate the simulation of n -qubit quantum systems, we present the Feynman software program to provide the necessary tools to define and to deal with quantum registers as well as the operators acting on them. Using an interactive design within the framework of the computer algebra system Maple, we hope that the Feynman software program will be useful not only for teaching the basic elements of quantum computing but also for studying their physical realization in the future.
This paper examines whether a quantum computer can efficiently simulate the evolution of the Schrödinger particle in a one-dimensional infinite potential well.The present study involves simulation of the change of the particle's state due to instant enlarging of the well's size.In order to solve the Schrödinger equation in the quantum register, an algorithm based on the Quantum Fourier Transform is applied.The paper presents an algorithm for simulating time evolution of such a system, implemented on standard two-input gates.