相关论文: Monte Carlo Simulation of Quantum Computation

It is shown that a class of separately frustration-free (SFF) Hamiltonians can be Monte Carlo simulated efficiently on a classical computing machine, because such an SFF Hamiltonian corresponds to a Gibbs wavefunction whose nodal structure…

We describe a novel simulation method that eliminates the slowing-down problem in the Monte Carlo simulations of imaginary-time path integrals near the continuum limit. This method combines a stochastic blocking procedure with the multigrid…

Three-dimensional (3D) strongly correlated many-body systems, especially their dynamics across quantum phase transitions, are prohibitively difficult to be numerically simulated. We experimentally demonstrate that such complex many-body…

In this paper, we aim to broaden the spectrum of possible applications of quantum computers and use their capabilities to investigate effects in cavity quantum electrodynamics ("cavity QED"). Interesting application examples are material…

Using the tensor product representation in the density matrix renormalization group, we show that a quantum circuit of Grover's algorithm, which has one-qubit unitary gates, generalized Toffoli gates, and projective measurements, can be…

A one-dimensional quantum simulator can simulate two-dimensional quantum many-body systems. A representation of a low-energy state is obtained by applying a feedback loop.

The Suzuki-Trotter decomposition, which digitalizes quantum time evolution, provides a promising framework for simulating quantum dynamics on quantum hardware and exploring quantum advantage over classical computation. However, conventional…

The main purpose of this article is to evaluate possible applications of quantum computers in foreign exchange reserves management. The capabilities of quantum computers are demonstrated by means of risk measurement using the quantum Monte…

Typically, quantum mechanics is thought of as a linear theory with unitary evolution governed by the Schr\"odinger equation. While this is technically true and useful for a physicist, with regards to computation it is an unfortunately…

We develop a Monte Carlo wave function algorithm for the quantum linear Boltzmann equation, a Markovian master equation describing the quantum motion of a test particle interacting with the particles of an environmental background gas. The…

We present a quantum algorithm that analyzes risk more efficiently than Monte Carlo simulations traditionally used on classical computers. We employ quantum amplitude estimation to evaluate risk measures such as Value at Risk and…

Continuous-time determinantal algorithm is proposed for the quantum Monte Carlo simulation of the interacting fermions. The scheme does not invoke Hubbard-Stratonovich transformation. The fermionic action is divided into two parts. One of…

Quantum Monte Carlo simulations offer an unbiased means to study the static and dynamic properties of quantum critical systems, while quantum field theory provides direct analytical results. We study three dimensional, critical quantum…

Monte Carlo methods use random sampling to estimate numerical quantities which are hard to compute deterministically. One important example is the use in statistical physics of rapidly mixing Markov chains to approximately compute partition…

We present a real-time quantum Monte Carlo algorithm that simulates the dynamics of open quantum systems by stochastically compressing and evolving the density matrix under both Markovian and non-Markovian master equations. Our algorithm…

The advent of near-term digital quantum computers could offer us an exciting opportunity to investigate quantum many-body phenomena beyond that of classical computing. To make the best use of the hardware available, it is paramount that we…

Compilation optimizes quantum algorithms performances on real-world quantum computers. To date, it is performed via classical optimization strategies. We introduce a class of quantum algorithms to perform compilation via quantum computers,…

Conventional vector-based simulators for quantum computers are quite limited in the size of the quantum circuits they can handle, due to the worst-case exponential growth of even sparse representations of the full quantum state vector as a…

Simulating the dynamics of non-equilibrium matter under extreme conditions lies beyond the capabilities of classical computation alone. Remarkable advances in quantum information science and technology are profoundly changing how we…

Analog quantum simulators offer a powerful microscopic probe of quantum many-body systems, yet have largely been benchmarked against model Hamiltonians rather than real materials. Here, we use a 256-qubit Rydberg simulator to implement the…