Related papers: Efficient classical algorithms for simulating symm…

We present a classical algorithm for approximating the expectation values of observables in linear-optical circuits with arbitrary product input states, achieving additive-error accuracy. This result indicates that current applications of…

Simulating quantum dynamics is one of the most important applications of quantum computers. Traditional approaches for quantum simulation involve preparing the full evolved state of the system and then measuring some physical quantity.…

In this paper we describe a quantum algorithm to solve sparse systems of nonlinear differential equations whose nonlinear terms are polynomials. The algorithm is nondeterministic and its expected resource requirements are polylogarithmic in…

We propose a quantum inverse iteration algorithm which can be used to estimate the ground state properties of a programmable quantum device. The method relies on the inverse power iteration technique, where the sequential application of the…

We build a quantum algorithm which uses the Grover quantum search procedure in order to sample the exact equilibrium distribution of a wide range of classical statistical mechanics systems. The algorithm is based on recently developed exact…

We discuss how to calculate genuine multipartite quantum and classical correlations in symmetric, spatially invariant, mixed $n$-qubit density matrices. We show that the existence of symmetries greatly reduces the amount of free parameters…

The task of estimating the ground state of Hamiltonians is an important problem in physics with numerous applications ranging from solid-state physics to combinatorial optimization. We provide a hybrid quantum-classical algorithm for…

The classical shadow estimation protocol is a noise-resilient and sample-efficient quantum algorithm for learning the properties of quantum systems. Its performance depends on the choice of a unitary ensemble, which must be chosen by a user…

We devise a classical algorithm which efficiently computes the quantum expectation values arising in a class of continuous variable quantum circuits wherein the final quantum observable | after the Heisenberg evolution associated with the…

A common approach to minimizing the cost of quantum computations is by transforming a quantum system into a basis that can be optimally truncated. Here, we derive classical equations of motion subjected to similar unitary transformations,…

We present quantum algorithms for the estimation of n-time correlation functions, the local and non-local density of states, and dynamical linear response functions. These algorithms are all based on block-encodings - a versatile technique…

In this work, we developed an efficient quantum algorithm for the simulation of non-Markovian quantum dynamics, based on the Feynman path integral formulation. The algorithm scales polynomially with the number of native gates and the number…

In this paper, we present a direct quantum adaptation of the classical shifted power method. The method is very similar to the iterative phase estimation algorithm; however, it does not require any initial estimate of an eigenvector and as…

In this paper we present a novel approach to emulating a universal quantum computer with a classical system, one that uses a signal of bounded duration and amplitude to represent an arbitrary quantum state. The signal may be of any modality…

We propose efficient classical algorithms which (strongly) simulate the action of bosonic linear optics circuits applied to superpositions of Gaussian states. Our approach relies on an augmented covariance matrix formalism to keep track of…

We investigate for which resource states an efficient classical simulation of measurement based quantum computation is possible. We show that the Schmidt--rank width, a measure recently introduced to assess universality of resource states,…

We investigate the quantum algorithm of Babbush et al. (arXiv:2303.13012v3) for simulating coupled harmonic oscillators, which promises exponential speedups over classical methods. Focusing on linearly connected oscillator chains, we bridge…

The implementation and practicality of quantum algorithms highly hinge on the quality of operations within a quantum processor. Therefore, including realistic error models in quantum computing simulation platforms is crucial for testing…

In this paper, the connections are investigated between two different approaches towards the parametrization of multivariable stable all-pass systems in discrete-time. The first approach involves the tangential Schur algorithm, which…

We contrast a minimalistic implementation of quantum k-means algorithm to classical k-means algorithm. With classical simulation results, we demonstrate a quantum performance, on and above par, with the classical k-means algorithm. We…