Related papers: Spin chain simulations with a meron cluster algori…

Recent works have demonstrated that large quantum circuits can be cut and decomposed into smaller clusters of quantum circuits with fewer qubits that can be executed independently on a small quantum computer. Classical post-processing then…

We provide a theoretical set up for studying the dynamics in quantum spin chain models with inhomogeneous two-body interaction. We frame in our formalism models that can be mapped into a fermion system with a quadratic Hamiltonian. Local…

There is great interest in using near-term quantum computers to simulate and study foundational problems in quantum mechanics and quantum information science, such as the scrambling measured by an out-of-time-ordered correlator (OTOC). Here…

Nuclear magnetic resonance is arguably both the best available quantum technology for implementing simple quantum computing experiments and the worst technology for building large scale quantum computers that has ever been seriously put…

We demonstrate the utility of effective Hamilonians for studying strongly correlated systems, such as quantum spin systems. After defining local relevant degrees of freedom, the numerical Contractor Renormalization (CORE) method is applied…

Different topological phases of quantum systems has become areas of increased focus in recent decades. In particular, the question of how to realize and manipulate systems with non-trivial first Chern number is pursued both experimentally…

We optimize matrix-product state-based algorithms for simulating quantum circuits with finite fidelity, specifically the time-evolving block decimation (TEBD) and the density-matrix renormalization group (DMRG) algorithms, by exploiting the…

Simulators play a critical role in aerial robotics both in and out of the classroom. We present RotorPy, a simulation environment written entirely in Python intentionally designed to be a lightweight and accessible tool for robotics…

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 study the efficiency of algorithms simulating a system evolving with Hamiltonian $H=\sum_{j=1}^m H_j$. We consider high order splitting methods that play a key role in quantum Hamiltonian simulation. We obtain upper bounds on the number…

Rotation estimation plays a fundamental role in computer vision and robot tasks, and extremely robust rotation estimation is significantly useful for safety-critical applications. Typically, estimating a rotation is considered a non-linear…

A digital quantum simulator is an envisioned quantum device that can be pro- grammed to efficiently simulate any other local system. We demonstrate and investigate the digital approach to quantum simulation in a system of trapped ions.…

We develop a methodology for performing approximate optimal control simulations for quantum systems with multiple interacting degrees of freedom. The quantum dynamics are modeled using the first-order Magnus approximation in the interaction…

This paper summarizes a quantum algorithm of [R.D. Somma, et.al., Phys. Rev. Lett. 101, 130504 (2008)] that simulates a classical annealing process for solving discrete optimization problems. The complexity of the quantum algorithm scales…

Quantum simulation holds the promise of improving the atomic simulations used at EDF to anticipate the ageing of materials of interest. One simulator in particular seems well suited to modeling interacting electrons: the Rydberg atoms…

A cluster algorithm is presented for the simulation of the q-state Potts models in which the number of spins is conserved in each state. The algorithm constructs Fortuin-Kasteleyn cluster configurations from spin configurations, in a way…

We analyze the recently developed folding algorithm [Phys. Rev. Lett. 102, 240603 (2009)] to simulate the dynamics of infinite quantum spin chains, and relate its performance to the kind of entanglement produced under the evolution of…

Enumeration algorithms have been one of recent hot topics in theoretical computer science. Different from other problems, enumeration has many interesting aspects, such as the computation time can be shorter than the total output size, by…

Numerical simulations of numerous quantum systems suffer from the notorious sign problem. Important examples include QCD and other field theories at non-zero chemical potential, at non-zero vacuum angle, or with an odd number of flavors, as…

A kind of brand-new robot, quantum robot, is proposed through fusing quantum theory with robot technology. Quantum robot is essentially a complex quantum system and it is generally composed of three fundamental parts: MQCU (multi quantum…