相关论文: Pauli Propagation for Imaginary-Time Evolution

We explore the applicability of a stochastic time-evolution algorithm based on probabilistic angle interpolation. To simplify the pre-processing of the algorithm, we take the continuous-time limit, thereby explicitly eliminating Trotter…

Efficient low-energy state preparation is a key objective in quantum computation and quantum simulation. Quantum imaginary-time evolution replaces real-time dynamics with imaginary-time dynamics, exponentially suppressing higher-energy…

We describe a simple, efficient method for simulating Hamiltonian dynamics on a quantum computer by approximating the truncated Taylor series of the evolution operator. Our method can simulate the time evolution of a wide variety of…

In this note we study an iterative belief propagation (IBP) algorithm and demonstrate it's ability to solve sparse combinatorial optimization problems. Similar to simulated annealing (SA), our IBP algorithm attempts to sample from the…

We reveal the power of Grover's algorithm from thermodynamic and geometric perspectives by showing that it is a product formula approximation of imaginary-time evolution (ITE), a Riemannian gradient flow on the special unitary group. This…

A mechanism called Eligibility Propagation is proposed to speed up the Time Hopping technique used for faster Reinforcement Learning in simulations. Eligibility Propagation provides for Time Hopping similar abilities to what eligibility…

Simulating the dynamics of complex quantum systems is a central application of quantum devices. Here, we propose leveraging the power of measurements to simulate short-time quantum dynamics of physically prepared quantum states in classical…

We introduce a method to perform imaginary time evolution in a controllable quantum system using measurements and conditional unitary operations. By performing a sequence of weak measurements based on the desired Hamiltonian constructed by…

We identify quantum imaginary time evolution as a Riemannian gradient flow on the unitary group. We develop an upper bound for the error between the two evolutions that can be controlled through the step size of the Riemannian gradient…

In this work we introduce an evolutionary strategy to solve combinatorial optimization tasks, i.e. problems characterized by a discrete search space. In particular, we focus on the Traveling Salesman Problem (TSP), i.e. a famous problem…

There is increasing interest in quantum algorithms that are based on the imaginary-time evolution (ITE), a successful classical numerical approach to obtain ground states. However, most of the proposals so far require heavy post-processing…

Simulating the time dynamics of an observable under Hamiltonian evolution is one of the most promising candidates for quantum advantage as we do not expect efficient classical algorithms for this problem except in restricted settings. Here,…

Digital quantum simulation offers a promising route for studying quantum dynamics, but efficient operator representations and circuit depth remain key challenges for near-term hardware. We investigate one-dimensional wave packet dynamics…

We apply expansion methods to obtain an approximate expression in terms of elementary functions for the space and time dependence of wave packets in a dispersive medium. The specific application to pulses in a cold plasma is considered in…

We study a time-fractional Fisher-KPP equation involving a Riemann-Liouville fractional derivative acting on the diffusion term, as derived by Angstmann and Henry (Entropy, 22:1035, 2020). The model captures memory effects in diffusive…

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…

Quantum imaginary time evolution (QITE) is one of the promising candidates for finding eigenvalues and eigenstates of a Hamiltonian. However, the original QITE proposal [Nat. Phys. 16, 205-210 (2020)], which approximates the imaginary time…

Many current and near-future applications of quantum computing utilise parametric families of quantum circuits and variational methods to find optimal values for these parameters. Solving a quantum computational problem with such…

We introduce an approach for approximate real-time evolution of quantum systems using Tensor Renormalization Group (TRG) methods originally developed for imaginary time. We use Higher- Order TRG (HOTRG) to generate a coarse-grained time…

We introduce an imaginary-time evolution method to evaluate the pure-state constrained-search functional from density-functional theory formulated on finite lattices. Simultaneously, it yields a potential that produces a prescribed density…