Related papers: Simulation Complexity of Many-Body Localized Syste…
We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of 10-dimensional qudits that makes it possible to realize universal quantum computing without any external control during the computational process.…
Multi-component quantum systems in strong interaction with their environment are receiving increasing attention due to their importance in a variety of contexts, ranging from solid state quantum information processing to the quantum…
In this paper, we present a proof-of-concept quantum algorithm for simulating time-dependent Hamiltonian evolution by reducing the problem to simulating a time-independent Hamiltonian in a larger space using a discrete clock Hamiltonian…
Quantum simulators with hundreds of qubits and engineerable Hamiltonians have the potential to explore quantum many-body models that are intractable for classical computers. However, learning the simulated Hamiltonian, a prerequisite for…
Quantifying multipartite entanglement in quantum many-body systems and hybrid quantum computing architectures is a fundamental yet challenging task. In recent years, thermodynamic quantities such as the maximum extractable work from an…
Quantum systems governed by time-dependent Hamiltonians pose significant challenges for the accurate computation of unitary time-evolution operators, which are essential for predicting quantum state dynamics. In this work, we introduce a…
In this work, the interplay between non-Hermiticity, quasi-disorder, and repulsive interaction is studied for hard-core bosons confined in a one-dimensional optical lattice, where non-Hermiticity is induced by the non-reciprocal hoppings…
Detecting many-body localization (MBL) typically requires the calculation of high-energy eigenstates using numerical approaches. This study investigates methods that assume the use of a quantum device to detect disorder-induced…
Recently, there has been an increasing interest in modelling and computation of physical systems with neural networks. Hamiltonian systems are an elegant and compact formalism in classical mechanics, where the dynamics is fully determined…
Disordered quantum many-body systems pose one of the central challenges in condensed matter physics and quantum information science, as their dynamics are generally intractable for classical computation. Many-body localization (MBL),…
Experiments in cold atom systems see almost identical signatures of many body localization (MBL) in both one-dimensional ($d=1$) and two-dimensional ($d=2$) systems despite the thermal avalanche hypothesis showing that the MBL phase is…
Symmetry is fundamental in the description and simulation of quantum systems. Leveraging symmetries in classical simulations of many-body quantum systems can results in significant overhead due to the exponentially growing size of some…
We propose a spatio-temporal characterization of the entanglement dynamics in many-body localized (MBL) systems, which exhibits a striking resemblance with dynamical heterogeneity in classical glasses. Specifically, we find that the…
Simulating noninteracting fermion systems is a common task in computational many-body physics. In absence of translational symmetries, modeling free fermions on $N$ modes usually requires poly$(N)$ computational resources. While often…
The computational complexity of simulating quantum many-body systems generally scales exponentially with the number of particles. This enormous computational cost prohibits first principles simulations of many important problems throughout…
We study the problem of simulating the dynamics of spin systems when the initial state is supported on a subspace of low energy of a Hamiltonian $H$. This is a central problem in physics with vast applications in many-body systems and…
Investigating the classical simulability of quantum circuits provides a promising avenue towards understanding the computational power of quantum systems. Whether a class of quantum circuits can be efficiently simulated with a probabilistic…
Solving the ground state and the ground-state properties of quantum many-body systems is generically a hard task for classical algorithms. For a family of Hamiltonians defined on an $m$-dimensional space of physical parameters, the ground…
In an attempt to better leverage superconducting quantum computers, scaling efforts have become the central concern. These efforts have been further exacerbated by the increased complexity of these circuits. The added complexity can…
Many quantum algorithms, such as adiabatic algorithms (e.g. AQC) and phase randomisation, require simulating Hamiltonian evolution. In addition, the simulation of physical systems is an important objective in its own right. In many cases,…