Related papers: Trotter error mitigation by error profiling with s…
One of the premier utilities of present day noisy quantum computers is simulation of many-body quantum systems. We study how long in time is such a discrete-time simulation representative of a continuous time Hamiltonian evolution, namely,…
The time evolution of quantum many-body systems is one of the most promising applications for near-term quantum computers. However, the utility of current quantum devices is strongly hampered by the proliferation of hardware errors. The…
In a circuit-based quantum computer, the computing is performed via the discrete-time evolution driven by quantum gates. Accurate simulation of continuoustime evolution requires a large number of quantum gates and therefore suffers from…
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…
This work aims to address the bottleneck issues of hardware resource limitation and decoherence error in the Hamiltonian simulation of quantum fluids, which are caused by the standard quantum Fourier transform and the evolution of momentum…
Quantum computers have shown promise in improving algorithms in a variety of fields. The realization of these advancements is limited by the presence of noise and high error rates, which become prominent especially with increasing system…
The extent to which quantum computers can simulate physical phenomena and solve the partial differential equations (PDEs) that govern them remains a central open question. In this work, one of the most fundamental PDEs is addressed: the…
We provide practical simulation methods for scalar field theories on a quantum computer that yield improved asymptotics as well as concrete gate estimates for the simulation and physical qubit estimates using the surface code. We achieve…
The Lie-Trotter formula, together with its higher-order generalizations, provides a direct approach to decomposing the exponential of a sum of operators. Despite significant effort, the error scaling of such product formulas remains poorly…
The advent of near-term digital quantum computers could offer us an exciting opportunity to investigate quantum many-body phenomena beyond that of classical computing. To make the best use of the hardware available, it is paramount that we…
Hamiltonian simulation on quantum computers is strongly constrained by gate counts, motivating techniques to reduce circuit depths. While tensor networks are natural competitors to quantum computers, we instead leverage them to support…
We propose a hybrid approach to simulate quantum many body dynamics by combining Trotter based quantum algorithm with classical dynamic mode decomposition. The interest often lies in estimating observables rather than explicitly obtaining…
Efficiently simulating many-body quantum systems with Coulomb interactions is a fundamental question in quantum physics, quantum chemistry, and quantum computing, yet it presents unique challenges: the Hamiltonian is an unbounded operator…
We introduce an error mitigation framework that mitigates errors in a quantum circuit using circuit cutting. Our framework can be implemented in polynomial time for a wide variety of quantum circuits. Our technique involves cutting the…
We propose a quantum algorithm to simulate the dynamics in quantum chemistry problems. It is based on adding fresh qubits at each Trotter step, which enables a simpler implementation of the dynamics in the extended system. After each step,…
Trotterization in quantum mechanics is an important theoretical concept in handling the exponential of noncommutative operators. In this communication, we give a mathematical formulation of the Trotter Product Formula, and apply it to basic…
In a recent milestone experiment, Google's processor Sycamore heralded the era of "quantum supremacy" by sampling from the output of (pseudo-)random circuits. We show that such random circuits provide tailor-made building blocks for…
Quantum simulation is a promising application for quantum computing. Quantum simulation algorithms may require the ability to control the time evolution unitary. Naive techniques to control a unitary can substantially increase the required…
Quantum phase estimation requires simulating the evolution of the Hamiltonian, for which product formulas are attractive due to their smaller qubit cost and ease of implementation. However, the estimation of the error incurred by product…
State-of-the-art quantum computers can only reliably execute circuits with limited qubit numbers and computational depth. This severely reduces the scope of algorithms that can be run. While numerous techniques have been invented to exploit…