Related papers: Monte Carlo simulation of random circuit sampling …
We describe a practical approach for accessing the logical failure rates of quantum error-correcting (QEC) circuits under low physical (component) failure rate regimes. Standard Monte Carlo is often the de facto approach for studying the…
These lectures given to graduate students in high energy physics, provide an introduction to Monte Carlo methods. After an overview of classical numerical quadrature rules, Monte Carlo integration together with variance-reducing techniques…
We present a protocol for Interleaved Randomized Benchmarking of arbitrary quantum gates using Monte Carlo sampling of quantum states. It is generally applicable, including non-Clifford gates while preserving key advantages of Randomized…
This paper proposes an efficient method for the simultaneous estimation of the state of a quantum system and the classical parameters that govern its evolution. This hybrid approach benefits from efficient numerical methods for the…
Quantum computers have a potential for solving quantum chemistry problems with higher accuracy than classical computers. Quantum computing quantum Monte Carlo (QC-QMC) is a QMC with a trial state prepared in quantum circuit, which is…
Classical simulations of quantum circuits are essential for verifying and benchmarking quantum algorithms, particularly for large circuits, where computational demands increase exponentially with the number of qubits. Among available…
Classical simulations of quantum circuits play a vital role in the development of quantum computers and for taking the temperature of the field. Here, we classically simulate various physically-motivated circuits using 2D tensor network…
One of the open challenges in quantum computing is to find meaningful and practical methods to leverage quantum computation to accelerate classical machine learning workflows. A ubiquitous problem in machine learning workflows is sampling…
In recent years efficient algorithms have been developed for the numerical computation of relativistic single-particle path integrals in quantum field theory. Here, we adapt this "worldline Monte Carlo" approach to the standard problem of…
Characterizing quantum processes is essential for unlocking the potential of quantum devices. However, standard quantum process tomography is resource-intensive and becomes infeasible on large-scale systems. Despite alternative approaches…
In this paper we carry out Quantum Monte Carlo simulations of a quantum particle in a one-dimensional random potential (plus a fixed harmonic potential) at a finite temperature. This is the simplest model of an interface in a disordered…
To ensure a long-term quantum computational advantage, the quantum hardware should be upgraded to withstand the competition of continuously improved classical algorithms and hardwares. Here, we demonstrate a superconducting quantum…
Monte Carlo methods are widely used to estimate observables in many-body quantum systems. However, conventional sampling schemes often require a large number of samples to achieve sufficient accuracy. In this work we propose the…
We give a polynomial time classical algorithm for sampling from the output distribution of a noisy random quantum circuit in the regime of anti-concentration to within inverse polynomial total variation distance. This gives strong evidence…
Recent astonishing experiments with quantum computers have demonstrated unambiguously the existence of a quantum multiverse, where calculations of mind-boggling complexity are effortlessly computed in just a few minutes. Here, we…
We review the Random Batch Methods (RBM) for interacting particle systems consisting of $N$-particles, with $N$ being large. The computational cost of such systems is of $O(N^2)$, which is prohibitively expensive. The RBM methods use small…
Discrepancies play an important role in the study of uniformity properties of point sets. Their probability distributions are a help in the analysis of the efficiency of the Quasi Monte Carlo method of numerical integration, which uses…
With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability $p$. The…
We present an elementary and self-contained account of the analogies existing between classical diffusion and the imaginary-time evolution of quantum systems. These analogies are used to develop a new quantum simulation method which allows…
Classical computation of electronic properties in large-scale materials remains challenging. Quantum computation has the potential to offer advantages in memory footprint and computational scaling. However, general and practical quantum…