Related papers: Many-Body Time Evolution from a Correlation-Effici…
We present a numerical method to simulate the time evolution, according to a Hamiltonian made of local interactions, of quantum spin chains and systems alike. The efficiency of the scheme depends on the amount of the entanglement involved…
We present a model of discrete quantum evolution based on quantum correlations between the evolving system and a reference quantum clock system. A quantum circuit for the model is provided, which in the case of a constant Hamiltonian is…
During time evolution of many-body systems entanglement grows rapidly, limiting exact simulations to small-scale systems or small timescales. Quantum information tends however to flow towards larger scales without returning to local scales,…
State-of-the-art quantum simulators permit local temporal control of interactions and midcircuit readout. These capabilities open the way towards the exploration of intriguing nonequilibrium phenomena. We illustrate this with a kinetically…
Improving quantum algorithms run-time performance involves several strategies such as reducing the quantum gate counts, decreasing the number of measurements, advancement in QPU technology for faster gate operations, or optimizing the…
Quantum computing gives direct access to the study of real-time dynamics of quantum many-body systems. In principle, it is possible to directly calculate non-equal-time correlation functions, from which one can detect interesting phenomena,…
Background: The complex scaling method (CSM) has been successfully used to describe many-body resonances as eigenvalues of the complex-scaled Hamiltonian in an appropriate $L^2$ basis representation. Its scope has subsequently been extended…
Recovering properties of correlation functions is typically challenging. On one hand, experimentally, it requires measurements with a temporal resolution finer than the system's dynamics. On the other hand, analytical or numerical analysis…
Quantum devices featuring mid-circuit measurement and reset capabilities, such as quantum computers and dual-species Rydberg quantum simulators, enable the realization of quantum cellular automata. These systems evolve in discrete time…
Two-time correlations are a crucial tool to probe the dynamics of many-body systems. We use these correlation functions to study the dynamics of dissipative quantum systems. Extending the adiabatic elimination method, we show that the…
The efficient numerical simulation of nonequilibrium real-time evolution in isolated quantum matter constitutes a key challenge for current computational methods. This holds in particular in the regime of two spatial dimensions, whose…
Building on a beyond-GW many-body framework that incorporates higher-order vertex effects in the self-energy -- giving rise to T-matrix and second-order exchange contributions -- this approach is extended to now include the vertex derived…
Imaginary-time evolution, an important technique in tensor network and quantum Monte Carlo algorithms on classical computers, has recently been adapted to quantum computing. In this study, we focus on probabilistic imaginary-time evolution…
Tensor-network simulations of quantum many-body dynamics are fundamentally limited by entanglement build-up, which leads to exponentially growing computational costs. Furthermore, these classical simulation algorithms are inherently…
We propose an efficient algorithm for simulating quantum many-body systems in two spatial dimensions using projected entangled pair states. This is done by approximating the environment, arising in the context of updating tensors in the…
We review our results for the dynamics of isolated many-body quantum systems described by one-dimensional spin-1/2 models. We explain how the evolution of these systems depends on the initial state and the strength of the perturbation that…
We report on Differential Evolution for Analytic Continuation (DEAC): a parameter-free evolutionary algorithm to generate the dynamic structure factor from imaginary time correlation functions. Our approach to this long-standing problem in…
Quantum algorithms for simulating electronic ground states are slower than popular classical mean-field algorithms such as Hartree-Fock and density functional theory, but offer higher accuracy. Accordingly, quantum computers have been…
We propose an iterative algorithm to investigate the cooperative evolution dominated by information encoded within state spaces in a random quantum cellular automaton. Inspired by the 2-gram model in statistical linguistics, the updates of…
We propose a new variational quantum algorithm, which we refer to as TIMES-ADAPT, that prepares time-evolved states in a low-energy or symmetric subspace of a time-independent Hamiltonian on a quantum computer. Using a specially trained…