We introduce the correlation-efficient time-evolution (CETE) algorithm for simulating quantum many-body dynamics. CETE recasts each step of time evolution as a time-independent correlation problem: the ansatz begins from a mean-field single Slater determinant and is then correlated to capture the true time-evolved state. We derive this exact ansatz from a contraction of the time-dependent Schrödinger equation onto the space of two electrons. Unlike conventional evolution by sequential short-time propagators, which must both correlate and decorrelate the state as the degree of correlation fluctuates in time, CETE correlates only once. This substantially reduces circuit depth, extending accessible simulation times on near-term quantum devices. We demonstrate the approach by simulating the time evolution of the hydrogen molecule's electronic wavefunction, highlighting the potential for the CETE algorithm to simulate strongly correlated systems on near-term devices.
We propose an adiabatic time evolution (ATE) method for obtaining the ground state of a quantum many-electron system on a quantum circuit based on first quantization. As a striking feature of the ATE method, it consists of only unitary operations representing real-time evolution, which means that it does not require any ancillary qubits, nor controlled real-time evolution operators. Especially, we explored the first-quantized formalism of ATE method in this study since the implementation of first-quantized real-time evolution on quantum circuits is known to be efficient. However, when realizing the ATE quantum circuit in first-quantization formalism, obstacles are how to set the adiabatic Hamiltonian and how to prepare the corresponding initial ground state. We provide a way to prepare an antisymmetrized and nondegenerate initial ground state that is suitable as an input to an ATE circuit, which allows our ATE method to be applied to systems with any number of electrons. In addition, by considering a first-quantized Hamiltonian for quantum-mechanical electron system and classical nuclear system, we design a quantum circuit for optimal structure search based on ATE. Numerical simulations are demonstrated for simple systems, and it is confirmed that the ground state of the electronic system and optimal structure can be obtained by our method.
In this paper, we investigate the time evolution of entanglement entropy and mutual information for the spatially-infinite systems where we act with a primary operator on the vacuum state and then time-evolve it with the sequence of the Euclidean and Lorentzian time evolutions. Two-dimensional holographic conformal field theories describe the systems under consideration in this paper. The Euclidean time evolution is induced by the Rindler Hamiltonian and behaves as the regulator that tames the divergence induced by the local operator, while the Lorentzian one is induced by the uniform Hamiltonian. Under these time evolutions, we investigate the time ordering effect of the Rindler Euclidean and uniform Lorentzian time evolution operators. Consequently, we find the remarkable differences between those time evolutions are induced by whether those are unitary or non-unitary. Especially, we find that the unitary time evolution induces the late-time logarithmic growth of the entanglement entropy, while the non-unitary time evolution induces the late-time constant behavior. Furthermore, we investigate the dual gravity of the systems under consideration. Especially, we investigate the gravity duals of the systems with the insertion of the heavy primary operator and show that it is a black brane with a spacetime-dependent horizon.
The (tolerant) Hamiltonian locality testing problem, introduced in [Bluhm, Caro,Oufkir `24], is to determine whether a Hamiltonian H is ε1-close to being k-local (i.e. can be written as the sum of weight-k Pauli operators) or ε2-far from any k-local Hamiltonian, given access to its time evolution operator and using as little total evolution time as possible, with distance typically defined by the normalized Frobenius norm. We give the tightest known bounds for this problem, proving an O((ε2−ε1)5ε2) evolution time upper bound and an Ω(ε2−ε11) lower bound. Our algorithm does not require reverse time evolution or controlled application of the time evolution operator, although our lower bound applies to algorithms using either tool. Furthermore, we show that if we are allowed reverse time evolution, this lower bound is tight, giving a matching O(ε2−ε11) evolution time algorithm.