Related papers: Classical simulation of infinite-size quantum latt…
The imaginary-time evolution of quantum states is integral to various fields, ranging from natural sciences to classical optimization or machine learning. Since simulating quantum imaginary-time evolution generally requires storing an…
We present a proposal for a versatile cold-atom-based quantum simulator of relativistic fermionic theories and topological insulators in arbitrary dimensions. The setup consists of a spin-independent optical lattice that traps a collection…
We propose a quantum inverse iteration algorithm which can be used to estimate the ground state properties of a programmable quantum device. The method relies on the inverse power iteration technique, where the sequential application of the…
We establish an intriguing connection between quantum phase transitions and bifurcations in the reduced fidelity between two different reduced density matrices for quantum lattice many-body systems with symmetry-breaking orders. Our finding…
We present a quantum algorithm for implementing $\phi^4$ lattice scalar field theory on qubit computers. The field is represented in the discretized field amplitude basis. The number of qubits and elementary gates required by the…
Tensor network algorithms have proven to be very powerful tools for studying one- and two-dimensional quantum many-body systems. However, their application to three-dimensional (3D) quantum systems has so far been limited, mostly because…
Quantum simulators have the potential to shed light on the study of quantum many-body systems and materials, offering unique insights into various quantum phenomena. While adiabatic evolution has been conventionally employed for state…
Imaginary-time evolution is fundamental for analyzing quantum many-body systems, yet classical simulation requires exponentially growing resources in both system size and evolution time. While quantum approaches reduce the system-size…
Can the properties of the thermodynamic limit of a many-body quantum system be extrapolated by analysing a sequence of finite-size cases? We present a model for which such an approach gives completely misleading results: a translationally…
We study finite two dimensional spin lattices with definite geometry (spin billiards) demonstrating the display of collective integrable or chaotic dynamics depending on their shape. We show that such systems can be quantum simulated by…
The "folding algorithm"\cite{fold1} is a matrix product state algorithm for simulating quantum systems that involves a spatial evolution of a matrix product state. Hence, the computational effort of this algorithm is controlled by the…
The general problem of finding the ground state energy of lattice Hamiltonians is known to be very hard, even for a quantum computer. We show here that this is the case even for translationally invariant systems. We also show that a quantum…
We use matrix product techniques to investigate the performance of two algorithms for obtaining the ground state of a quantum many-body Hamiltonian $H = H_A + H_B$ in infinite systems. The first algorithm is a generalization of the quantum…
An algorithm to simulate the dynamics of a quantum state over a three-site lattice interacting with classical harmonic oscillators has been devised. The oscillators are linearly coupled to the quantum state and are acted upon by a…
We simulate the critical behavior of the Ising model utilizing a thermal state prepared using quantum computing techniques. The preparation of the thermal state is based on the variational quantum imaginary time evolution (QITE) algorithm.…
We present a pedagogical introduction to a quantum computing algorithm for the simulation of classical fluids, based on the Carleman linearization of a second-quantized version of lattice kinetic theory. Prospects and limitations for the…
A new algorithm for simulating compact U(1) lattice gauge theory in three dimensions is presented which is based on global changes in the configuration space. We show that this algorithm provides an effective way to extract partition…
The Kosterlitz-Thouless transition is studied from the representation of the systems's ground state wave functions in terms of Matrix Product States for a quantum system on an infinite-size lattice in one spatial dimension. It is found…
Imaginary time evolution is a powerful technique for computing the ground state of quantum Hamiltonians, where the convergence to ground state in asymptotic imaginary time is guaranteed. However, implementing this method on quantum…
Aimed at a more realistic classical description of natural quantum systems, we present a two-dimensional tensor network algorithm to study finite temperature properties of frustrated model quantum systems and real quantum materials. For…