Related papers: Efficient Quantum Algorithms for Simulating Lindbl…
Variational compression can significantly lower implementation overheads for encoding the time evolution of Hamiltonians into quantum circuits. However, they usually lack global convergence guarantees and well-established scaling behavior.…
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…
Matrix product density operators (MPDOs) are an important class of states with interesting properties. Consequently, it is important to understand how to prepare these states experimentally. One possible way to do this is to design an open…
Block-encodings have become one of the most common oracle assumptions in the circuit model. I present an algorithm that uses von Neumann's measurement procedure to measure a phase, using time evolution on a block-encoded Hamiltonian as a…
The evolution of open systems, subject to both Hamiltonian and dissipative forces, is studied by writing the $nm$ element of the time ($t$) dependent density matrix in the form \ber \rho_{nm}(t)&=& \frac {1}{A} \sum_{\alpha=1}^A \gamma…
Simulating the time-evolution of quantum mechanical systems is BQP-hard and expected to be one of the foremost applications of quantum computers. We consider classical algorithms for the approximation of Hamiltonian dynamics using…
The presence of noise is currently one of the main obstacles to achieving large-scale quantum computation. Strategies to characterise and understand noise processes in quantum hardware are a critical part of mitigating it, especially as the…
Recent progress in quantum simulation and algorithms has demonstrated a rapid expansion in capabilities. The search continues for new techniques and applications to exploit quantum advantage. Here we propose an innovative method to…
As a milestone for general-purpose computing machines, we demonstrate that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. Moreover, on noisy devices without error correction, we…
We propose a new quantum computing formalism named Pauli quantum computing. In this formalism, we use the Pauli basis $I$ and $X$ on the non-diagonal blocks of density matrices to encode information and treat them as the computational basis…
We design a quantum algorithm for ground state preparation in the early fault tolerant regime. As a Monte Carlo-style quantum algorithm, our method features a Lindbladian where the target state is stationary. The construction of this…
The construction of quantum circuits to simulate Hamiltonian evolution is central to many quantum algorithms. State-of-the-art circuits are based on oracles whose implementation is often omitted, and the complexity of the algorithm is…
We discuss a new approach to simulate quantum algorithms using classical probabilistic bits and circuits. Each qubit (a two-level quantum system) is initially mapped to a vector in an eight dimensional probability space (equivalently, to a…
We consider the problem of constructing a "universal set" of Markovian processes, such that any Markovian open quantum system, described by a one-parameter semigroup of quantum channels, can be simulated through sequential simulations of…
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…
Hybrid quantum-classical optimization algorithms represent one of the most promising application for near-term quantum computers. In these algorithms the goal is to optimize an observable quantity with respect to some classical parameters,…
We present quantum algorithms for simulating the dynamics of a broad class of classical oscillator systems containing $2^n$ coupled oscillators (Eg: $2^n$ masses coupled by springs), including those with time-dependent forces, time-varying…
Solving the time-dependent Schr\"odinger equation is an important application area for quantum algorithms. We consider Schr\"odinger's equation in the semi-classical regime. Here the solutions exhibit strong multiple-scale behavior due to a…
Non-Markovian dynamics is ubiquitous in both quantum and classical systems, but the numerical computation of the time-delay dynamics is demanding. In this work, we propose an efficient quantum algorithm for solving linear distributed delay…
The Vlasov-Maxwell system of equations, which describes classical plasma physics, is extremely challenging to solve, even by numerical simulation on powerful computers. By linearizing and assuming a Maxwellian background distribution…