Related papers: Correcting and extending Trotterized quantum many-…
Simulating quantum systems is one of the most promising avenues to harness the computational power of quantum computers. However, hardware errors in noisy near-term devices remain a major obstacle for applications. Ideas based on the…
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…
Computing the ground-state properties of quantum many-body systems is a promising application of near-term quantum hardware with a potential impact in many fields. The conventional algorithm quantum phase estimation uses deep circuits and…
Trotterization-based, iterative approaches to quantum simulation are restricted to simulation times less than the coherence time of the quantum computer, which limits their utility in the near term. Here, we present a hybrid…
Quantum simulation is a foundational application for quantum computers, projected to offer insights into complex quantum systems beyond the reach of classical computation. However, with the exception of Trotter-based methods, which suffer…
Quantum computers offer the potential to efficiently simulate the dynamics of quantum systems, a task whose difficulty scales exponentially with system size on classical devices. To assess the potential for near-term quantum computers to…
In adiabatic quantum computing the aim is to track an eigenstate as the Hamiltonian changes. In the usual setup this is achieved using the natural time-dependent Hamiltonian evolution of the system and the main technical tool is the…
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…
We simulate the time evolution of collective neutrino oscillations in two-flavor settings on a quantum computer. We explore the generalization of Trotter-Suzuki approximation to time-dependent Hamiltonian dynamics. The trotterization steps…
Quantum computers are expected to help us to achieve accurate simulation of the dynamics of many-body quantum systems. However, the limitations of current NISQ devices prevents us from realising this goal today. Recently an algorithm for…
We consider the extent to which a Trotterized time evolution implemented on a quantum computer is altered by the presence of decoherence. Given a specific set of assumptions regarding the manner in which noise processes acting on such a…
In this work we propose an approach for implementing time-evolution of a quantum system using product formulas. The quantum algorithms we develop have provably better scaling (in terms of gate complexity and circuit depth) than a naive…
We present a scheme to efficiently simulate, with a classical computer, the dynamics of multipartite quantum systems on which the amount of entanglement (or of correlations in the case of mixed-state dynamics) is conveniently restricted.…
Operator scrambling, which governs the spread of quantum information in many-body systems, is a central concept in both condensed matter and high-energy physics. Accurately capturing the emergent properties of these systems remains a…
Quantum dynamics can be simulated on a quantum computer by exponentiating elementary terms from the Hamiltonian in a sequential manner. However, such an implementation of Trotter steps has gate complexity depending on the total Hamiltonian…
The simulation of adiabatic evolution has deep connections with Adiabatic Quantum Computation, the Quantum Approximate Optimization Algorithm and adiabatic state preparation. Here we address the error analysis problem in quantum simulation…
Simulating vibrational dynamics is essential for understanding molecular structure, unlocking useful applications such as vibrational spectroscopy for high-fidelity chemical detection. Quantum algorithms for vibrational dynamics are…
Quantum circuits make it possible to simulate the continuous-time dynamics of a many-body Hamiltonian by implementing discrete Trotter steps of duration $\tau$. However, when $\tau$ is sufficiently large, the discrete dynamics exhibit…
The advent of hybrid computing platforms consisting of quantum processing units integrated with conventional high-performance computing brings new opportunities for algorithm design. By strategically offloading select portions of the…
Quantum chemistry and materials science are among the most promising areas for demonstrating algorithmic quantum advantage and quantum utility due to their inherent quantum mechanical nature. Still, large-scale simulations of quantum…