"Universal Quantum Simulators" in "Science".

Lloyd, Seth. "Universal Quantum Simulators" in "Science", American Association for the Advancement of Science, vol 273 no. 5 278, pp 1073-1078, 23 August 1996. Original wrappers. Fine copy of the full issue. [++] 3300+ citations for this paper by Lloyd in which he shows the Feynman quantum computer conjecture (Feynman, "Simulating Physics with Computers" in "International Journal of Theoretical Physics", 21, 467, 1982) to be correct by proving that a quantum system can be simulated in a quantum computer. The very short and sweet abstract from the Lloyd paper simply states: "Feynman's 1982 conjecture that quantum computers can be programmed to simulate any local quantum system, is shown to be correct." That's it. [++] "Since their introduction in 1980 quantum computers have been investigated extensively. A comprehensive review can be found in. The best known problem that quantum computers can in principle solve more efficiently than classical computers is factoring. In this article I present another type of problem that in principle quantum computers could solve more efficiently than a classical computer that of simulating other quantum systems. In 1982, Feynman conjectured that quantum computers might be able to simulate other quantum systems more efficiently than classical computers. Quantum simulation is thus the first classically difficult problem posed for quantum computers. Here I show that a quantum computer can in fact simulate quantum systems efficiently as long as they evolve according to local interactions." [++] *Also see: BENIOFF P, "The Computer as a Physical System a Microscopic Quantum-Mechanical Hamilton Model pf Computers as Represented by Turing-Machines" Journal of Statistical Physics, 22, 563, (1980); AND see: Lloyd, S., A Potentially Realizable Quantum Computer, Science 261, 1569-1571, 1993 for an earlier (earliest?) discussion of the quantum computer.…