Related papers: Efficient Quantum Algorithm for Computing n-time C…
A class of improved estimators is proposed for N-point correlation functions of galaxy clustering, and for discrete spatial random processes in general. In the limit of weak clustering, the variance of the unbiased estimator converges to…
We derive an extension of the quantum regression theorem to calculate out-of-time-order correlation functions in Markovian open quantum systems. While so far mostly being applied in the analysis of many-body physics, we demonstrate that…
A status report is presented on the large-volume simulations in the Schroedinger functional with two flavours of O(a) improved Wilson quarks performed by the ALPHA collaboration. The physics goal is to set the scale for the computation of…
Quantum computation of vibrational properties of molecules is a promising platform to obtain computational advantages for computational chemistry. However, fault-tolerant quantum computations of vibrational properties remain a relatively…
We describe an algorithm that computes the ground state energy and correlation functions for 2-local Hamiltonians in which interactions between qubits are weak compared to single-qubit terms. The running time of the algorithm is polynomial…
Quantifying correlation and entanglement between molecular orbitals can elucidate the role of quantum effects in strongly correlated reaction processes. However, accurately storing the wavefunction for a classical computation of those…
Quantum computers can solve many number theory problems efficiently. Using the efficient quantum algorithm for order finding as an oracle, this paper presents an algorithm that computes the Carmichael function for any integer $N$ with a…
Within the framework of probability distributions on projective Hilbert space a scheme for the calculation of multitime correlation functions is developed. The starting point is the Markovian stochastic wave function description of an open…
Quantum computers are expected to become a powerful tool for studying physical quantum systems. Consequently, a number of quantum algorithms for studying the physical properties of such systems have been developed. While qubit-based quantum…
Efficient continuous time quantum Monte Carlo (CT-QMC) algorithms that do not suffer from time discretization errors have become the state-of-the-art for most discrete quantum models. They have not been widely used yet for fermionic quantum…
We show how conformal invariance predicts the functional form of two-point correlators in one-dimensional periodic quantum systems. Numerical evidence for this functional form in a wide class of models --- including long-ranged ones --- is…
We extend the continuous-time interaction-expansion quantum Monte Carlo method with respect to measuring observables for fermion-boson lattice models. Using generating functionals, we express expectation values involving boson operators,…
In this work we intend to study a class of time-dependent quantum systems with non-Hermitian Hamiltonians, particularly those whose Hermitian counterpart are important for the comprehension of posed problems in quantum optics and quantum…
We propose a novel family of entanglement measures for time-separated subsystems. Our definitions are applicable to any quantum system, continuous or discrete. To illustrate their utility, we derive upper and lower bounds on time-separated…
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…
We introduce novel algorithms for the quantum simulation of molecular systems which are asymptotically more efficient than those based on the Trotter-Suzuki decomposition. We present the first application of a recently developed technique…
We develop a generalized framework for constructing many-body-interaction operations either in linear time, or in logarithmic time with a linear number of ancilla qubits. Exact gate decompositions are given in particular for Pauli strings,…
We present a method based on the Path Integral Monte Carlo formalism for the calculation of ground-state time correlation functions in quantum systems. The key point of the method is the consideration of time as a complex variable whose…
Harrow, Hassidim, and Lloyd showed that for a suitably specified $N \times N$ matrix $A$ and $N$-dimensional vector $\vec{b}$, there is a quantum algorithm that outputs a quantum state proportional to the solution of the linear system of…
Following Ref. [Oriols X 2007 Phys. Rev. Lett., 98 066803], an algorithm to deal with the exchange interaction in non-separable quantum systems is presented. The algorithm can be applied to fermions or bosons and, by construction, it…