Related papers: Light Cone Matrix Product
We propose a refined matrix product state representation for many-body quantum states that are invariant under SU(2) transformations, and indicate how to extend the time-evolving block decimation (TEBD) algorithm in order to simulate time…
The transverse folding algorithm [Phys. Rev. Lett. 102, 240603] is a tensor network method to compute time-dependent local observables in out-of-equilibrium quantum spin chains that can sometimes overcome the limitations of matrix product…
We apply a meron cluster algorithm to the XY spin chain, which describes a quantum rotor. This is a multi-cluster simulation supplemented by an improved estimator, which deals with objects of half-integer topological charge. This method is…
We discuss in details a modified variational matrix-product-state algorithm for periodic boundary conditions, based on a recent work by P. Pippan, S.R. White and H.G. Everts, Phys. Rev. B 81, 081103(R) (2010), which enables one to study…
We describe methods to construct digital quantum simulation algorithms for quantum spin systems on a regular lattice with local interactions. In addition to tools such as the Trotter-Suzuki expansion and graph coloring, we also discuss the…
We show how to simulate numerically both the evolution of 1D quantum systems under dissipation as well as in thermal equilibrium. The method applies to both finite and inhomogeneous systems and it is based on two ideas: (a) a representation…
We introduce a method that ensures efficient computation of one-dimensional quantum systems with long-range interactions across all temperatures. Our algorithm operates within a quasi-polynomial runtime for inverse temperatures up to…
We present a manifestly rotational invariant formulation of the matrix product method valid for spin chains and ladders. We apply it to 2 legged spin ladders with spins 1/2, 1 and 3/2 and different magnetic structures labelled by the…
One-dimensional systems exhibiting a continuous symmetry can host quantum phases of matter with true long-range order only in the presence of sufficiently long-range interactions. In most physical systems, however, the interactions are…
Matrix product states provide a natural entanglement basis to represent a quantum register and operate quantum gates on it. This scheme can be materialized to simulate a quantum adiabatic algorithm solving hard instances of a NP-Complete…
Lattice spin models are useful for studying critical phenomena and allow the extraction of equilibrium and dynamical properties. Simulations of such systems are usually based on Monte Carlo (MC) techniques, and the main difficulty is often…
We present an algorithm for studying quantum systems at finite temperature using continuous matrix product operator representation. The approach handles both short-range and long-range interactions in the thermodynamic limit without…
We investigate the out-of-equilibrium dynamics after a local quench that connects two spin-1/2 XXZ chains prepared in the ground state of the Hamiltonian in different phases, one in the ferromagnetic phase and the other in the critical…
By a high-order numerical homogenization method, a heterogeneous multiscale scheme was developed in Jin & Li (2022) for evolving differential equations containing two time scales. In this paper, we further explore the technique to propose…
Quantum simulation, the simulation of quantum processes on quantum computers, suggests a path forward for the efficient simulation of problems in condensed-matter physics, quantum chemistry, and materials science. While the majority of…
Quantum algorithms for simulation of Hamiltonian evolution are often based on product formulae. The fractal methods give a systematic way to find arbitrarily high-order product formulae, but result in a large number of exponentials. On the…
This article presents numerical recipes for simulating high-temperature and non-equilibrium quantum spin systems that are continuously measured and controlled. The notion of a spin system is broadly conceived, in order to encompass…
We propose a method for the computation of a consistent system matrix for two- and three-dimensional cone-beam computed tomography (CT). The method relies on the decomposition of the cone-voxel intersection volumes into subvolumes that…
We introduce a numerical algorithm to simulate the time evolution of a matrix product state under a long-ranged Hamiltonian. In the effectively one-dimensional representation of a system by matrix product states, long-ranged interactions…
We introduce two kinds of quantum algorithms to explore microcanonical and canonical properties of many-body systems. The first one is a hybrid quantum algorithm that, given an efficiently preparable state, computes expectation values in a…