Related papers: Quantum simulation from the bottom up: the case of…
Quantum computers could potentially simulate the dynamics of systems such as polyatomic molecules on a much larger scale than classical computers. We investigate a general quantum computational algorithm that simulates the time evolution of…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
Non-relativistic quantum mechanics is shown to emerge from classical mechanics through the requirement of a relativity principle based on special transformations acting on position and momentum uncertainties. These transformations keep the…
We introduce a new family of quantum circuits for which the scrambling of a subspace of non-local operators is classically simulable. We call these circuits `super-Clifford circuits', since the Heisenberg time evolution of these operators…
Algorithms are described for efficiently simulating quantum mechanical systems on quantum computers. A class of algorithms for simulating the Schrodinger equation for interacting many-body systems are presented in some detail. These…
State-of-the-art cosmological simulations on classical computers are limited by time, energy, and memory usage. Quantum computers can perform some calculations exponentially faster than classical computers, using exponentially less energy…
A large spectrum of problems in classical physics and engineering, such as turbulence, is governed by nonlinear differential equations, which typically require high-performance computing to be solved. Over the past decade, however, the…
While quantum computers are naturally well-suited to implementing linear operations, it is less clear how to implement nonlinear operations on quantum computers. However, nonlinear subroutines may prove key to a range of applications of…
We have shown that quantum systems on finite-dimensional Hilbert spaces are equivalent under local transformations. Using these transformations give rise to a gauge group that connects the hamiltonian operators associated with each quantum…
Algorithmic approach is based on the assumption that any quantum evolution of many particle system can be simulated on a classical computer with the polynomial time and memory cost. Algorithms play the central role here but not the…
We present the generalization of the CNC formalism, based on closed and noncontextual sets of Pauli observables, to the setting of odd-prime-dimensional qudits. By introducing new CNC-type phase space point operators, we construct a…
Quantum computers will work by evolving a high tensor power of a small (e.g. two) dimensional Hilbert space by local gates, which can be implemented by applying a local Hamiltonian H for a time t. In contrast to this quantum engineering,…
We present an approach to simulating quantum computation based on a classical model that directly imitates discrete quantum systems. Qubits are represented as harmonic functions in a 2D vector space. Multiplication of qubit representations…
The past few years have witnessed the concrete and fast spreading of quantum technologies for practical computation and simulation. In particular, quantum computing platforms based on either trapped ions or superconducting qubits have…
A quantum simulator is a device engineered to reproduce the properties of an ideal quantum model. It allows the study of quantum systems that cannot be efficiently simulated on classical computers. While a universal quantum computer is also…
Is quantum mechanics about 'states'? Or is it basically another kind of probability theory? It is argued that the elementary formalism of quantum mechanics operates as a well-justified alternative to 'classical' instantiations of a…
Quantum computers are a promising candidate to radically expand computational science through increased computing power and more effective algorithms. In particular quantum computing could have a tremendous impact in the field of quantum…
Numerical simulation of quantum systems is crucial to further our understanding of natural phenomena. Many systems of key interest and importance, in areas such as superconducting materials and quantum chemistry, are thought to be described…
We study classical simulation of quantum computation, taking the Gottesman-Knill theorem as a starting point. We show how each Clifford circuit can be reduced to an equivalent, manifestly simulatable circuit (normal form). This provides a…
In this paper we present the computational model underlying the one-way quantum computer which we introduced recently [Phys. Rev. Lett. 86, 5188 (2001)]. The one-way quantum computer has the property that any quantum logic network can be…