Related papers: Quantum algorithms for quantum dynamics: A perform…
One of the major objectives of the experimental programs at the LHC is the discovery of new physics. This requires the identification of rare signals in immense backgrounds. Using machine learning algorithms greatly enhances our ability to…
Universal quantum simulation may provide insights into those many-body systems that cannot be described classically, and that cannot be efficiently simulated with current technology. The Trotter formula, which decomposes a desired unitary…
Quantum simulation elucidates properties of quantum many-body systems by mapping its Hamiltonian to a better-controlled system. Being less stringent than a universal quantum computer, noisy small- and intermediate-scale quantum simulators…
In the context of quantum information, highly nonlinear regimes, such as those supporting solitons, are marginally investigated. We miss general methods for quantum solitons, although they can act as entanglement generators or as…
We propose an efficient quantum algorithm for simulating the dynamics of general Hamiltonian systems. Our technique is based on a power series expansion of the time-evolution operator in its off-diagonal terms. The expansion decouples the…
Simulating nonlinear classical dynamics on a quantum computer is an inherently challenging task due to the linear operator formulation of quantum mechanics. In this work, we provide a systematic approach to alleviate this difficulty by…
The variational quantum imaginary time evolution algorithm is efficient in finding the ground state of a quantum Hamiltonian. This algorithm involves solving a system of linear equations in a classical computer and the solution is then used…
We present quantum algorithms for the simulation of quantum systems in one spatial dimension, which result in quantum speedups that range from superpolynomial to polynomial. We first describe a method to simulate the evolution of the…
A stochastic representation of the dynamics of open quantum systems, suitable for non-perturbative system-reservoir interaction, non-Markovian effects and arbitrarily driven systems is presented. It includes the case of driving on…
We provide a general method for efficiently simulating time-dependent Hamiltonian dynamics on a circuit-model based quantum computer. Our approach is based on approximating the truncated Dyson series of the evolution operator, extending the…
Large-scale quantum devices provide insights beyond the reach of classical simulations. However, for a reliable and verifiable quantum simulation, the building blocks of the quantum device require exquisite benchmarking. This benchmarking…
The accurate computational study of wavepacket nuclear dynamics is considered to be a classically intractable problem, particularly with increasing dimensions. Here we present two algorithms that, in conjunction with other methods developed…
Variational quantum algorithms involve training parameterized quantum circuits using a classical co-processor. An important variational algorithm, designed for combinatorial optimization, is the quantum approximate optimization algorithm.…
Imaginary-time evolution plays an important role in algorithms for computing ground-state and thermal equilibrium properties of quantum systems, but can be challenging to simulate on classical computers. Many quantum algorithms for…
The prevalence of variational methods in near-term quantum computing makes optimizer choice critical, yet selection is frequently intuition-based. We therefore present a systematic benchmark of eight classical optimization algorithms for…
This paper is concerned with variational methods for nonlinear open quantum systems with Markovian dynamics governed by Hudson-Parthasarathy quantum stochastic differential equations. The latter are driven by quantum Wiener processes of the…
We present a framework that utilizes quantum algorithms, an architecture aware quantum noise model and an ideal simulator to benchmark quantum computers. The benchmark metrics highlight the difference between the quantum computer evolution…
When simulating the time evolution of quantum many-body systems on a digital quantum computer, one faces the challenges of quantum noise and of the Trotter error due to time discretization. The Trotter error in integrable spin chains can be…
Quantum variational algorithms (QVAs) are increasingly potent tools for simulating quantum many-body systems on noisy intermediate-scale quantum (NISQ) devices. This work examines the application of the Variational Quantum Eigensolver (VQE)…
In this paper, we present a proof-of-concept quantum algorithm for simulating time-dependent Hamiltonian evolution by reducing the problem to simulating a time-independent Hamiltonian in a larger space using a discrete clock Hamiltonian…