Related papers: Light Cone Matrix Product
The infinite time-evolving block decimation (iTEBD) algorithm [Phys. Rev. Lett. 98, 070201 (2007)] allows to simulate unitary evolution and to compute the ground state of one-dimensional quantum lattice systems in the thermodynamic limit.…
Quasi-2D Coulomb systems are of fundamental importance and have attracted much attention in many areas nowadays. Their reduced symmetry gives rise to interesting collective behaviors, but also brings great challenges for particle-based…
Quantum sources with strong correlations are essential but delicate resources in quantum information science and engineering. Decoherence and loss are the primary factors that degrade nonclassical quantum correlations, with scattering…
We present some new results regarding simulations of finite density QCD based on a canonical approach. A previous study has shown that such simulations are feasible, at least on small lattices. In the current study, we investigate some of…
Within the framework of imaginary-time evolution for matrix product states, we introduce a cluster version of the infinite time-evolving block decimation algorithm for simulating quantum many-body systems, addressing the computational…
In this work, we develop a stochastic matrix product state (stoMPS) approach that combines the MPS technique and Monte Carlo samplings and can be applied to simulate quantum lattice models down to low temperature. In particular, we exploit…
We present a quantum algorithm that verifies a product of two n*n matrices over any field with bounded error in worst-case time n^{5/3} and expected time n^{5/3} / min(w,sqrt(n))^{1/3}, where w is the number of wrong entries. This improves…
This talk presents results of our study of heavy-to-light transition form factors extracted with the help of light-cone sum rules. We employ a model with scalar particles interacting via massless-boson exchange and study the heavy-to-light…
We show how to efficiently simulate pure quantum states in one dimensional systems that have both finite energy density and vanishingly small energy fluctuations. We do so by studying the performance of a tensor network algorithm that…
To date, all proposed quantum algorithms for simulating quantum field theory (QFT) simulate (continuous-time) Hamiltonian lattice QFT as a stepping stone. Two overlooked issues are how large we can take the timestep in these simulations…
We treat the accurate simulation of the calcination reaction in particles, where the particles are large and, thus, the inner-particle processes must be resolved. Because these processes need to be described with coupled partial…
Upcoming surveys of cosmic structures will probe scales close to the cosmological horizon, which opens up new opportunities for testing the cosmological concordance model to high accuracy. In particular, constraints on the squeezed…
Quantum-optical techniques allow for generating controllable spin-spin interactions between ions, making trapped ions an ideal quantum simulator of Heisenberg chains. A single parameter, the detuning of the Raman coupling, allows to switch…
It was demonstrated that the lattice simulation of $B$-meson light-cone distribution amplitude (LCDA) is feasible via the quasi-distribution amplitude (quasi-DA) in large momentum effective theory (LaMET). The structures of logarithmic…
The main objective of quantum simulation is an in-depth understanding of many-body physics. It is important for fundamental issues (quantum phase transitions, transport, . . . ) and for the development of innovative materials. Analytic…
In this paper we establish a new efficient method for simulating polymer-solvent systems which combines a lattice Boltzmann approach for the fluid with a continuum molecular dynamics (MD) model for the polymer chain. The two parts are…
We provide new examples of pure entangled systems related to cluster state quantum computation that can be efficiently simulated classically. In cluster state quantum computation input qubits are initialised in the `equator' of the Bloch…
Linear constrained switching systems are linear switched systems whose switching sequences are constrained by a deterministic finite automaton. This work investigates how to generate a sequence of matrices with an asymptotic growth rate…
There has been a great deal of recent interest in methods for performing lifted inference; however, most of this work assumes that the first-order model is given as input to the system. Here, we describe lifted inference algorithms that…
Quantum circuits for loading probability distributions into quantum states are essential subroutines in quantum algorithms used in physics, finance engineering, and machine learning. The ability to implement these with high accuracy in…