Related papers: Worm-algorithm-type Simulation of Quantum Transver…
We investigate the computational power of the recently introduced class of isometric tensor network states (isoTNSs), which generalizes the isometric conditions of the canonical form of one-dimensional matrix-product states to tensor…
We present a quantum algorithm for the simulation of molecular systems that is asymptotically more efficient than all previous algorithms in the literature in terms of the main problem parameters. As in previous work [Babbush et al., New…
We use quantum Monte Carlo methods and various analytic approximations to solve the Ising spin-glass model in a transverse field in the disordered phase. We focus on the behavior of the frequency dependent susceptibility of the system above…
We generalize the previous study on the application of variational autoencoders to the two-dimensional Ising model to a system with anisotropy. Due to the self-duality property of the system, the critical points can be located exactly for…
This is a chapter of the multi-author book "Understanding Quantum Phase Transitions," edited by Lincoln Carr and published by Taylor and Francis. In this chapter, we give a general introduction to the worm algorithm and present important…
Fracton models provide examples of novel gapped quantum phases of matter that host intrinsically immobile excitations and therefore lie beyond the conventional notion of topological order. Here, we calculate optimal error thresholds for…
Finding the ground state of Ising spin glasses is notoriously difficult due to disorder and frustration. Often, this challenge is framed as a combinatorial optimization problem, for which a common strategy employs simulated annealing, a…
In a number of classical statistical-physical models, there exists a characteristic dimensionality called the upper critical dimension above which one observes the mean-field critical behavior. Instead of constructing high-dimensional…
The simulation of complex quantum systems on a quantum computer is studied, taking the kicked Harper model as an example. This well-studied system has a rich variety of dynamical behavior depending on parameters, displays interesting…
We generalize the Fortuin-Kasteleyn (FK) cluster representation of the partition function of the Ising model to represent the partition function of quantum spin models with an arbitrary spin magnitude in arbitrary dimensions. This…
The transverse-field Ising model serves as a paradigm for studying confinement and excitation spectra, particularly the emergence of $E_8$ symmetry near criticality. However, experimentally resolving the Ising meson spectroscopy required to…
We investigate quantum computational complexity of calculating partition functions of Ising models. We construct a quantum algorithm for an additive approximation of Ising partition functions on square lattices. To this end, we utilize the…
Understanding the properties of biological systems is an exciting avenue for applying advanced approaches to solving corresponding computational tasks. A specific class of problems that arises in the resolution of biological challenges is…
We present practical methods to measure entanglement for quantum simulators that can be realized with trapped ions, cold atoms, and superconducting qubits. Focussing on long- and short-range Ising-type Hamiltonians, we introduce schemes…
Quantum algorithms reformulate computational problems as quantum evolutions in a large Hilbert space. Most quantum algorithms assume that the time-evolution is perfectly unitary and that the full Hilbert space is available. However, in…
Current quantum simulators suffer from multiple limitations such as short coherence time, noisy operations, faulty readout and restricted qubit connectivity in some platforms. Variational quantum algorithms are the most promising approach…
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. This approach typically relies on deep circuits and is therefore hampered by the substantial…
We construct an algorithm to simulate imaginary time evolution of translationally invariant spin systems with local interactions on an infinite, symmetric tree. We describe the state by symmetric iPEPS and use translation-invariant…
Systems of interacting quantum spins show a rich spectrum of quantum phases and display interesting many-body dynamics. Computing characteristics of even small systems on conventional computers poses significant challenges. A quantum…
Numerical methods in spin-foam models have significantly advanced in the last few years, yet challenges remain in efficiently extracting results for amplitudes with many quantum degrees of freedom. In this paper we sketch a proposal for a…