Papers
Topics
Authors
Recent
Search
2000 character limit reached

A duality at the heart of Gaussian boson sampling

Published 9 Oct 2019 in quant-ph, math-ph, math.CO, math.MP, and math.NT | (1910.04022v1)

Abstract: Gaussian boson sampling (GBS) is a near-term quantum computation framework that is believed to be classically intractable, but yet rich of potential applications. In this paper we study the intimate relation between distributions defined over classes of samples from a GBS device with graph matching polynomials. For this purpose, we introduce a new graph polynomial called the displaced GBS polynomial, whose coefficients are the coarse-grained photon-number probabilities of an arbitrary undirected graph $G$ encoded in a GBS device. We report a discovery of a duality between the displaced GBS polynomial of $G$ and the matching polynomial of $G\,\square\,P_2(x)$ - the Cartesian graph product of $G$ with a single weighted edge also known as the prism over $G$. Besides the surprising insight gained into Gaussian boson sampling, it opens the door for the new way of classically simulating the Gaussian boson sampling device. Furthermore, it motivates the recent success of a new type of coarse-grained quantum statistics used to construct feature maps in [Schuld et al. 2019].

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.