REVIEW 2 cited by
A detailed study of Gaussian Boson Sampling
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Since the development of Boson sampling, there has been a quest to construct more efficient and experimentally feasible protocols to test the computational complexity of sampling from photonic states. In this paper we interpret and extend the results presented in [Phys. Rev. Lett. 119, 170501 (2017)]. We derive an expression that relates the probability to measure a specific photon output pattern from a Gaussian state to the \textit{hafnian} matrix function and us it to design a Gaussian Boson sampling protocol. Then, we discuss the advantages that this protocol has relative to other photonic protocols and the experimental requirements for Gaussian Boson Sampling. Finally, we relate it to the previously most general protocol, Scattershot Boson Sampling [Phys. Rev. Lett. 113, 100502 (2014)]
Forward citations
Cited by 2 Pith papers
-
Speedup in Classical Simulation of Gaussian Boson Sampling
A classical sampling algorithm for Gaussian boson sampling decomposes Hafnians into smaller Hafnians and permanents, enabling simulation of 18-30 photons and lowering the estimated quantum-supremacy threshold.
-
Exact simulation of Gaussian Boson Sampling in polynomial space and exponential time
A chain-rule algorithm samples each mode of a Gaussian Boson Sampler sequentially, giving exact simulation in polynomial space and time exponential in the detected photon number.
Discussion (0). Continue with ORCID to comment.