Efficient classical computation of expectation values in a class of quantum circuits with an epistemically restricted phase space representation

5Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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 circuits—is at most second order in momentum. The classical computational algorithm exploits a specific epistemic restriction in classical phase space which directly captures the quantum uncertainty relation, to transform the quantum circuits in the complex Hilbert space into classical albeit unconventional stochastic processes in the phase space. The resulting multidimensional integral is then evaluated using the Monte Carlo sampling method. The convergence rate of the classical sampling algorithm is determined by the variance of the classical physical quantity over the epistemically restricted phase space distribution. The work shows that for the specific class of computational schemes, Wigner negativity is not a sufficient resource for quantum speedup. It highlights the potential role of the epistemic restriction as an intuitive conceptual tool which may be used to study the boundary between quantum and classical computations.

Cite

CITATION STYLE

APA

Budiyono, A., & Dipojono, H. K. (2020). Efficient classical computation of expectation values in a class of quantum circuits with an epistemically restricted phase space representation. Scientific Reports, 10(1). https://doi.org/10.1038/s41598-020-71836-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free