Related papers: A quantum-classical co-processing protocol towards…
Quantum computers have the potential of solving certain problems exponentially faster than classical computers. Recently, Harrow, Hassidim and Lloyd proposed a quantum algorithm for solving linear systems of equations: given an $N\times{N}$…
In the effort to develop useful quantum computers simulating quantum machines with conventional computing resources is a key capability. Such simulations will always face limits preventing the emulation of quantum computers of substantial…
We propose a framework for simulating the real-time dynamics of quantum field theories (QFTs) using continuous-variable quantum computing (CVQC). Focusing on ($1+1$)-dimensional $\varphi^4$ scalar field theory, the approach employs the…
Digital quantum computers provide a computational framework for solving the Schr\"{o}dinger equation for a variety of many-particle systems. Quantum computing algorithms for the quantum simulation of these systems have recently witnessed…
We develop a framework for simulating measure-preserving, ergodic dynamical systems on a quantum computer. Our approach provides a new operator-theoretic representation of classical dynamics by combining ergodic theory with quantum…
Recently a new formulation of quantum mechanics has been suggested which describes systems by means of ensembles of classical particles provided with a sign. This novel approach mainly consists of two steps: the computation of the Wigner…
Simulating physical systems on quantum devices is one of the most promising applications of quantum technology. Current quantum approaches to simulating open quantum systems are still practically challenging on NISQ-era devices, because…
Algorithmic cooling can be used to find correlated states of many-body quantum systems. It is based on quantum circuits that perform nonunitary operations, whose implementation can be challenging on near-term quantum computers. In this work…
In this work, we present a quantum algorithm for direct first-principles simulation of electron-nuclear dynamics on a first-quantized real-space grid. Our algorithm achieves best-in-class efficiency for block-encoding the…
Numerical simulation is an important method for verifying the quantum circuits used to simulate low-energy nuclear states. However, real-world applications of quantum computing for nuclear theory often generate deep quantum circuits that…
We develop a non-perturbative approach to simulating scattering on classical and quantum computers, in which the initial and final states contain a fixed number of composite particles. The construction is designed to mimic a particle…
In light of recent exciting progress in building up quantum computing facilities based on both optical and cold-atom techniques, the algorithms for quantum simulations of particle-physics systems are in rapid progress. In this paper, we…
Resolving quantum many-body problems represents one of the greatest challenges in physics and physical chemistry, due to the prohibitively large computational resources that would be required by using classical computers. A solution has…
In the recent years, numerous research advancements have extended the limit of classical simulation of quantum algorithms. Although, most of the state-of-the-art classical simulators are only limited to binary quantum systems, which…
Artificial intelligence and machine learning have been widely adopted both in the industry and in everyday life, but at the cost of high compute demands. Recent studies show that implementing machine learning in physical systems in the deep…
Quantum circuits with local unitaries have emerged as a rich playground for the exploration of many-body quantum dynamics of discrete-time systems. While the intrinsic locality makes them particularly suited to run on current quantum…
We introduce a classical-quantum hybrid approach to computation, allowing for a quadratic performance improvement in the decision process of a learning agent. In particular, a quantum routine is described, which encodes on a quantum…
Classical simulation is important because it sets a benchmark for quantum computer performance. Classical simulation is currently the only way to exercise larger numbers of qubits. To achieve larger simulations, sparse matrix processing is…
Practical challenges in simulating quantum systems on classical computers have been widely recognized in the quantum physics and quantum chemistry communities over the past century. Although many approximation methods have been introduced,…
We present an algorithm that exploits quantum parallelism to simulate randomness in a quantum system. In our scheme, all possible realizations of the random parameters are encoded quantum mechanically in a superposition state of an…