Related papers: Light Cone Matrix Product
We present an algorithm to study mixed-state dynamics in one-dimensional quantum lattice systems. The algorithm can be used, e.g., to construct thermal states or to simulate real time evolutions given by a generic master equation. Its two…
Grover's algorithm is a cornerstone of quantum search algorithm, offering quadratic speedup for unstructured problems. However, limited qubit counts and noise in today's noisy intermediate-scale quantum (NISQ) devices hinder large-scale…
We adapt the time-evolving block decimation (TEBD) algorithm, originally devised to simulate the dynamics of 1D quantum systems, to simulate the time-evolution of non-equilibrium stochastic systems. We describe this method in detail; a…
Digital quantum computers have the potential to study the dynamics of complex quantum systems. Nonequilibrium open quantum systems are, however, less straightforward to be implemented. Here we consider a collisional model representation of…
Relying on the recently proposed multicanonical algorithm, we present a numerical simulation of the first order phase transition in the 2d 10-state Potts model on lattices up to sizes $100\times100$. It is demonstrated that the new…
Electron spin qubits in quantum dot devices are promising for scalable quantum computing. However, architectural support is currently hindered by the lack of realistic and performant simulation methods for real devices. Physics-based tools…
Tau leaping is a popular method for performing fast approximate simulation of certain continuous time Markov chain models typically found in chemistry and biochemistry. This method is known to perform well when the transition rates satisfy…
We introduce a method based on matrix product states (MPS) for computing spectral functions of (quasi) one-dimensional spin chains, working directly in momentum space in the thermodynamic limit. We simulate the time evolution after applying…
The ground state of the Kitaev quantum spin liquid on a honeycomb lattice is an intriguing many-body state characterized by its topological order and massive entanglement. One of the significant issues is to prepare and manipulate the…
Solving linear systems of equations is essential for many problems in science and technology, including problems in machine learning. Existing quantum algorithms have demonstrated the potential for large speedups, but the required quantum…
The aim of this work is to design implicit and semi-implicit high-order well-balanced finite-volume numerical methods for 1D systems of balance laws. The strategy introduced by two of the authors in a previous paper for explicit schemes…
We present an algorithmic framework for a variant of the quantum Monte Carlo operator-loop algorithm, where non-local cluster updates are constructed in a way that makes each individual loop smaller. The algorithm is designed to increase…
Quantum computing is a hotspot technology for its potential to accelerate specific applications by exploiting quantum parallelism. However, current physical quantum computers are limited to a relatively small scale, simulators based on…
A wide range of implicit time integration methods, including multi-step, implicit Runge-Kutta, and Galerkin finite-time element schemes, is evaluated in the context of chaotic dynamical systems. The schemes are applied to solve the Lorenz…
Besides tensor contractions, one of the most pronounced computational bottlenecks in the non-orthogonally spin-adapted forms of the quantum chemistry methods CCSDT and CCSDTQ, and their approximate forms---including CCSD(T) and…
We propose a method to simulate the real time evolution of one dimensional quantum many-body systems at finite temperature by expressing both the density matrices and the observables as matrix product states. This allows the calculation of…
How condensed-matter simulations depend on the number of molecules being simulated ($N$) is sometimes itself a valuable piece of information. Liquid crystals provide a case in point. Light scattering and $2d$-IR experiments on…
Quantum many body physics simulations with Matrix Product States can often be accelerated if the quantum symmetries present in the system are explicitly taken into account. Conventionally, quantum symmetries have to be determined before…
Predicting the quantum dynamics of promising solid-state and molecular quantum technology candidates remains a formidable challenge. Yet, accessing these dynamics is key to understanding and controlling decoherence mechanisms -- a…
Monte Carlo simulation using a combination of Wang Landau (WL) and Transition Matrix (TM) Monte Carlo algorithms to simulate two lattice spin models with continuous energy is described. One of the models, the one dimensional Lebwohl-Lasher…