相关论文: Spin chain simulations with a meron cluster algori…
We apply the Quasi Monte Carlo (QMC) and recursive numerical integration methods to evaluate the Euclidean, discretized time path-integral for the quantum mechanical anharmonic oscillator and a topological quantum mechanical rotor model.…
The simulation of electric rotating machines is both computationally expensive and memory intensive. To overcome these costs, model order reduction techniques can be applied. The focus of this contribution is especially on machines that…
Spin network systems can be used to achieve quantum state transfer with high fidelity and to generate entanglement. A new approach to design spin-chain-based spin network systems, for shortrange quantum information processing and…
Quantum simulators are engineered devices controllably designed to emulate complex and classically intractable quantum systems. A key challenge is to certify whether the simulator truly mimics the Hamiltonian of interest. This certification…
We apply the event-chain Monte Carlo algorithm to classical continuum spin models on a lattice and clarify the condition for its validity. In the two-dimensional XY model, it outperforms the local Monte Carlo algorithm by two orders of…
Recently, Syljuasen and Sandvik proposed a new framework for constructing algorithms of quantum Monte Carlo simulation. While it includes new classes of powerful algorithms, it is not straightforward to find an efficient algorithm for a…
Quantum Computing (QC) stands to revolutionize computing, but is currently still limited. To develop and test quantum algorithms today, quantum circuits are often simulated on classical computers. Simulating a complex quantum circuit…
We present a general strategy to solve the notorious fermion sign problem using cluster algorithms. The method applies to various systems in the Hubbard model family as well as to relativistic fermions. Here it is illustrated for…
Large scale numerical experiments are commonplace today in theoretical physics. The high performance algorithms described herein are the most compact, efficient methods known for representing and analyzing systems modeled well by sets or…
Quantum control requires full knowledge of the system many-body Hamiltonian. In many cases this information is not directly available due to restricted access to the system. Here we show how to indirectly estimate all the coupling strengths…
Although spin is a core property in fermionic systems, its symmetry can be easily violated in a variational simulation, especially when strong correlation plays a vital role therein. In this study, we will demonstrate that the broken…
We present a new formulation of monotonically convergent algorithms which allows to optimize both the control duration and the field fluence. A standard algorithm designs a control field of fixed duration which both brings the system close…
We have developed an efficient Monte Carlo algorithm, which accelerates slow Monte Carlo dynamics in quasi-one-dimensional Ising spin systems. The loop algorithm of the quantum Monte Carlo method is applied to the classical spin models with…
An efficient Quantum Monte Carlo algorithm for the simulation of bosonic systems on a lattice in a grand canonical ensemble is proposed. It is based on the mapping of bosonic models to the spin models in the limit of the infinite total spin…
We introduce a new method, based on alternating optimization, for compact representation of spin Hamiltonians and solution of linear systems of algebraic equations in the tensor train format. We demonstrate the method's utility by…
We consider the optimal control of quantum systems interacting non-linearly with an electromagnetic field. We propose new monotonically convergent algorithms to solve the optimal equations. The monotonic behavior of the algorithm is ensured…
We present combinatorial approximation algorithms for the weighted correlation clustering problem. In this problem, we have a set of vertices and two weight values for each pair of vertices, denoting their difference and similarity. The…
Linear differential equations are ubiquitous in science and engineering. Quantum computers can simulate quantum systems, which are described by a restricted type of linear differential equations. Here we extend quantum simulation algorithms…
Accurate performance estimation of future many-node machines is challenging because it requires detailed simulation models of both node and network. However, simulating the full system in detail is unfeasible in terms of compute and memory…
We analyze the computational aspects of detecting topological order in a quantum many-body system. We contrast the widely used topological entanglement entropy with a recently introduced operational definition for topological order based on…