Related papers: Denoising of Imaginary Time Response Functions wit…
Today's experimental noisy quantum processors can compete with and surpass all known algorithms on state-of-the-art supercomputers for the computational benchmark task of Random Circuit Sampling [1-5]. Additionally, a circuit-based quantum…
Combining tensor network techniques with quantum autoregressive moving average models, we quantify the effects of time-correlated noise on quantum algorithms and predict their performance at scale. As a paradigmatic test case, we examine…
In this work we detail the application of a fast convolution algorithm computing high dimensional integrals to the context of multiplicative noise stochastic processes. The algorithm provides a numerical solution to the problem of…
The principle and the efficiency of the Monte Carlo transfer-matrix algorithm are discussed. Enhancements of this algorithm are illustrated by applications to several phase transitions in lattice spin models. We demonstrate how the…
Noisy unsharp measurements incorporated in quantum information protocols may hinder performance, reducing the quantum advantage. However, we show that, unlike projective measurements which completely destroy quantum correlations between…
We study quantum frequency estimation for $N$ qubits subjected to independent Markovian noise, via strategies based on time-continuous monitoring of the environment. Both physical intuition and an extended convexity property of the quantum…
Sasaki et al. (2018) presented an efficient audio declipping algorithm, based on the properties of Hankel-structure matrices constructed from time-domain signal blocks. We adapt their approach to solving the audio inpainting problem, where…
Imaginary-time evolution is fundamental for analyzing quantum many-body systems, yet classical simulation requires exponentially growing resources in both system size and evolution time. While quantum approaches reduce the system-size…
In this paper, we explore the possibility of building a quantum memory that is robust to thermal noise using large $N$ matrix quantum mechanics models. First, we investigate the gauged $SU(N)$ matrix harmonic oscillator and different ways…
In principle a quantum system could be used to simulate another quantum system. The purpose of such a simulation would be to obtain information about problems which cannot be simulated with a classical computer due to the exponential…
For parameter estimation from an $N$-component composite quantum system, it is known that a separable preparation leads to a mean-squared estimation error scaling as $1/N$ while an entangled preparation can in some conditions afford a…
This paper presents data-driven implementations of balanced truncation and several of its generalizations that rely exclusively on transfer function samples on the imaginary axis. Rather than implicitly approximating the Gramians via…
Let $f: \mathbb{F}_2^n \rightarrow \mathbb{F}_2^n$ be a Boolean function with period $\vec s$. It is well-known that Simon's algorithm finds $\vec s$ in time polynomial in $n$ on quantum devices that are capable of performing…
Noise in quantum devices is generally considered detrimental to computational accuracy. However, the recent proposal of noise-assisted simulation has demonstrated that noise can be an asset in digital quantum simulations of open systems on…
Current quantum computers present significant noise, especially as circuit depth and qubit count increase. Prior work has demonstrated that erroneous outcomes exhibit some behavior in Hamming space, enabling improvements in the output…
We present a new method for calculating quantum tunneling rates using lattice Monte Carlo simulations in imaginary time. This method is designed with the goal of studying false vacuum decay non-perturbatively on the lattice. We derive a new…
We propose an algorithm to impute and forecast a time series by transforming the observed time series into a matrix, utilizing matrix estimation to recover missing values and de-noise observed entries, and performing linear regression to…
We used methods of Bayesian statistical inference and the principle of maximum entropy to analytically continue imaginary-time Green's function generated in quantum Monte Carlo simulations to obtain the real-time Green's functions. For test…
Simulations of finite temperature quantum systems provide imaginary frequency Green's functions that correspond one-to-one to experimentally measurable real-frequency spectral functions. However, due to the bad conditioning of the…
We present a quantum Monte Carlo method which allows calculations on many-fermion systems at finite temperatures without any sign decay. This enables simulations of the grand-canonical ensemble at large system sizes and low temperatures.…