Feynman gave in 1982 a keynote speech \textit{Simulating Physics with Computers} (Int. J. Theor. Phys. {\bf 21}, 467 (1982)) in which he talked ``...about the possibility...that the computer will do exactly the same as nature". The motivation was that: ``...the physical world is quantum mechanical, and therefore the proper problem is the simulation of quantum physics". Here I try after more than forty years to answer Feynman's question of whether it is possible to perform exact computer simulations. Many computer simulations are not exact, they contain mean field approximations that disobey the symmetry in the quantum dynamics with Newton's third law, e.g. almost all astrophysical simulations of galaxy systems. After a review of computer simulations and the problems of simulating real systems, I argue that Newton's discrete dynamics, which is used in almost all computer simulations and which is exact in the same sense as Newton's analytic dynamics, is the classical limit path of Feynman's quantum paths. However, the physical world is not known exactly and it is much more complex than any simulated systems, and so far no real systems have been simulated exactly. Hence, more than forty years later, and after hundreds of thousands of computer simulations of the physical system's dynamics the answer to Feynman's question is still negative. But although it is not possible to simulate the dynamics exactly for any real systems, the simulations have been and will be of great use in Natural Science.
Feynman gave in 1982 a keynote speech \textit{Simulating Physics with Computers} (Int. J. Theor. Phys. {\bf 21}, 467 (1982)) in which he talked ...about the possibility...that the computer will do exactly the same as nature". The motivation was that: ...the physical world is quantum mechanical, and therefore the proper problem is the simulation of quantum physics". Here I try after more than forty years to answer Feynman's question of whether it is possible to perform exact computer simulations. Many computer simulations are not exact, they contain mean field approximations that disobey the symmetry in the quantum dynamics with Newton's third law, e.g. almost all astrophysical simulations of galaxy systems. After a review of computer simulations and the problems of simulating real systems, I argue that Newton's discrete dynamics, which is used in almost all computer simulations and which is exact in the same sense as Newton's analytic dynamics, is the classical limit path of Feynman's quantum paths. However, the physical world is not known exactly and it is much more complex than any simulated systems, and so far no real systems have been simulated exactly. Hence, more than forty years later, and after hundreds of thousands of computer simulations of the physical system's dynamics the answer to Feynman's question is still negative. But although it is not possible to simulate the dynamics exactly for any real systems, the simulations have been and will be of great use in Natural Science.
This chapter describes the possibility of simulating physics in the classical approximation, a thing which is usually described by local differential equations. But the physical world is quantum mechanical, and therefore the proper problem is the simulation of quantum physics. A computer which will give the same probabilities as the quantum system does. The present theory of physics allows space to go down into infinitesimal distances, wavelengths to get infinitely great, terms to be summed in infinite order, and so forth; and therefore, if this proposition is right, physical law is wrong. Quantum theory and quantizing is a very specific type of theory. The chapter talks about the possibility that there is to be an exact simulation, that the computer will do exactly the same as nature. There are interesting philosophical questions about reasoning, and relationship, observation, and measurement and so on, which computers have stimulated people to think about anew, with new types of thinking.
The question "What is real?" can be traced back to the shadows in Plato's cave. Two thousand years later, Rene Descartes lacked knowledge about arguing against an evil deceiver feeding us the illusion of sensation. Descartes' epistemological concept later led to various theories of sensory experiences. The concept of "illusionism", proposing that even the very conscious experience we have is an illusion, is not only a red-pill scenario found in the 1999 science fiction movie "The Matrix" but is also a philosophical concept promoted by modern tinkers, most prominently by Daniel Dennett. Reflection upon a possible simulation and our perceived reality was beautifully visualized in "The Matrix", bringing the old ideas of Descartes to coffee houses around the world. Irish philosopher Bishop Berkeley was the father of what was later coined as "subjective idealism", basically stating that "what you perceive is real". With the advent of quantum technologies based on the control of individual fundamental particles, the question of whether our universe is a simulation isn't just intriguing. Our ever-advancing understanding of fundamental physical processes will likely lead us to build quantum computers utilizing quantum effects for simulating nature quantum-mechanically in all complexity, as famously envisioned by Richard Feynman. In this article, we outline constraints on the limits of computability and predictability in/of the universe, which we then use to design experiments allowing for first conclusions as to whether we participate in a simulation chain. Eventually, in a simulation in which the computer simulating a universe is governed by the same physical laws as the simulation, the exhaustion of computational resources will halt all simulations down the simulation chain unless an external programmer intervenes, which we may be able to observe.
A challenging question in the overlap of computer science, mathematics, and physics, is the exploration of potential capabilities of quantum computers. Milestones were the factoring algorithm of Shor (1994) and the search algorithm of Grover (1996). So far, major research was concentrated on discrete and algebraic problems. Much less was known about computational problems of analysis, including such a prominent example as high dimensional numerical integration, which is well-studied in the classical settings. We seek to understand how efficiently this and related problems can be solved in the quantum model of computation (i.e., on a quantum computer) and how the outcome compares to the efficiency of deterministic or randomized algorithms on a classical (i.e. non-quantum) computer. In this paper we give a survey of the state of the art in this field, including also a brief introduction to the general ideas of quantum computing. Introduction A quantum computer is a computing device based on quantum mechanical laws of the (sub)atomic world. The idea of such a computer was developed by Feynman [8] in 1982. He emphasized that simulating quantum mechanics on a classical computer is extremely hard, probably infeasible. So why not try to simulate quantum mechanics using quantum devices themselves. (Thoughts in this direction were also expressed by Manin [21] in 1980, see also [22].) In 1985 Deutsch [6] presented a formal model of computation for quantum computing.
The year 1982 is often credited as the year that theoretical quantum computing was started with a keynote speech by Richard Feynman, who proposed a universal quantum simulator, the idea being that if you had such a machine you could in principle ``imitate any quantum system, including the physical world.'' With that in mind, we present an algorithm for a continuous-variable quantum computing architecture which gives an exponential speedup over the best-known classical methods. Specifically, this relates to efficiently calculating the scattering amplitudes in scalar bosonic quantum field theory, a problem that is believed to be hard using a classical computer. Building on this, we give an experimental implementation based on continuous-variable states that is feasible with today's technology.
Quantum computing is the offspring of quantum mechanics and computer science, two great scientific fields founded in the 20th century. Quantum computing is a relatively young field and is recognized as having the potential to revolutionize science and technology in the coming century. The primary question in this field is essentially to ask which problems are feasible with potential quantum computers and which are not. In this dissertation, we study this question with a physical bent of mind. We apply tools from computer science and mathematical physics to study the complexity of simulating quantum systems. In general, our goal is to identify parameter regimes under which simulating quantum systems is easy (efficiently solvable) or hard (not efficiently solvable). This study leads to an understanding of the features that make certain problems easy or hard to solve. We also get physical insight into the behavior of the system being simulated. In the first part of this dissertation, we study the classical complexity of simulating quantum dynamics. In general, the systems we study transition from being easy to simulate at short times to being harder to simulate at later times. We argue that the transition timescale is a useful measure for various Hamiltonians and is indicative of the physics behind the change in complexity. We illustrate this idea for a specific bosonic system, obtaining a complexity phase diagram that delineates the system into easy or hard for simulation. We also prove that the phase diagram is robust, supporting our statement that the phase diagram is indicative of the underlying physics. In the next part, we study open quantum systems from the point of view of their potential to encode hard computational problems. We study a class of fermionic Hamiltonians subject to Markovian noise described by Lindblad jump operators and illustrate how, sometimes, certain Lindblad operators can induce computational complexity into the problem. Specifically, we show that these operators can implement entangling gates, which can be used for universal quantum computation. We also study a system of bosons with Gaussian initial states subject to photon loss and detected using photon-number-resolving measurements. We show that such systems can remain hard to simulate exactly and retain a relic of the "quantumness" present in the lossless system. Finally, in the last part of this dissertation, we study the complexity of simulating a class of equilibrium states, namely ground states. We give complexity-theoretic evidence to identify two structural properties that can make ground states easier to simulate. These are the existence of a spectral gap and the existence of a classical description of the ground state. Our findings complement and guide efforts in the search for efficient algorithms.
Quantum physics is a fascinating area from a computational viewpoint. The features that make quantum systems prohibitively hard to simulate classically are precisely the aspects exploited by quantum computation to obtain exponential speedups over classical computers. In this talk I will survey our current understanding of the power (and limits) of quantum computers, and prospects for experimentally realizing them in the near future. I will also touch upon insights from quantum comuptation that have resulted in new classical algorithms for efficient simulation of certain important quantum systems.