Related papers: Fast-forwardable Lindbladians imply quantum phase …
We develop a mathematically rigorous framework for simulating \emph{multiscale physical systems} using quantum computational resources, by translating the \emph{language of asymptotic-preserving (AP) schemes} into the formalism of quantum…
We present a stochastic quantum computing algorithm that can prepare any eigenvector of a quantum Hamiltonian within a selected energy interval $[E-\epsilon, E+\epsilon]$. In order to reduce the spectral weight of all other eigenvectors by…
Over the past three decades significant reductions have been made to the cost of estimating ground-state energies of molecular Hamiltonians with quantum computers. However, comparatively little attention has been paid to estimating the…
We present a general approach to derive Lindblad master equations for a subsystem whose dynamics is coupled to dissipative bosonic modes. The derivation relies on a Schrieffer-Wolff transformation which allows to eliminate the bosonic…
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…
Motivated by Heisenberg's observable-only stance, we replace latent "information" (filtrations, hidden diffusions, state variables) with observable transitions between price states. On a discrete price lattice with a Hilbert-space…
The time evolution of a closed quantum system is connected to its Hamiltonian through Schroedinger's equation. The ability to estimate the Hamiltonian is critical to our understanding of quantum systems, and allows optimization of control.…
Adiabatic quantum computation is based on the adiabatic evolution of quantum systems. We analyse a particular class of qauntum adiabatic evolutions where either the initial or final Hamiltonian is a one-dimensional projector Hamiltonian on…
A method for stochastic unraveling of general time-local quantum master equations (QMEs) is proposed. The present kind of jump algorithm allows a numerically efficient treatment of QMEs which are not in Lindblad form, i.e. are not positive…
It is shown how any Lindbladian evolution with selfadjoint Lindblad operators, either Markovian or nonMarkovian, can be understood as an averaged random unitary evolution. Both mathematical and physical consequences are analyzed. First a…
We study the quantum speed limit for open quantum systems described by the Lindblad master equation. The obtained inequality shows a trade-off relation between the operation time and the physical quantities such as the energy fluctuation…
In this work, we present a general theoretical framework for the study of autonomously corrected quantum devices. First, we identify a necessary and sufficient revised version of the Knill-Laflamme conditions for the existence of an…
The question of how fast a quantum state can evolve has attracted a considerable attention in connection with quantum measurement, metrology, and information processing. Since only orthogonal states can be unambiguously distinguished, a…
With rapid advancements in machine learning, first-order algorithms have emerged as the backbone of modern optimization techniques, owing to their computational efficiency and low memory requirements. Recently, the connection between…
While Quantum phase estimation (QPE) is at the core of many quantum algorithms known to date, its physical implementation (algorithms based on quantum Fourier transform (QFT)) is highly constrained by the requirement of high-precision…
We present an efficient algorithm for simulating open quantum systems dynamics described by the Lindblad master equation on quantum computers, addressing key challenges in the field. In contrast to existing approaches, our method achieves…
Preparing the thermal density matrix $\rho_{\beta} \propto e^{-\beta H}$ corresponding to a given Hamiltonian $H$ is a task of central interest across quantum many-body physics, and is particularly salient when attempting to study it with…
Quantum phase estimation is a cornerstone in quantum algorithm design, allowing for the inference of eigenvalues of exponentially-large sparse matrices.The maximum rate at which these eigenvalues may be learned, --known as the Heisenberg…
Hybrid quantum systems with different particle species are fundamental in quantum materials and quantum information science. In this work, we establish a rigorous theoretical framework proving that, given access to an unknown spin-boson…
Simulating quantum dynamics is expected to be performed more easily on a quantum computer than on a classical computer. However, the currently available quantum devices lack the capability to implement fault-tolerant quantum algorithms for…