# Classical simulability of noisy boson sampling

@article{Renema2018ClassicalSO, title={Classical simulability of noisy boson sampling}, author={Jelmer J. Renema and Valery S. Shchesnovich and Ra{\'u}l Garc{\'i}a-Patr{\'o}n}, journal={arXiv: Quantum Physics}, year={2018} }

Quantum mechanics promises computational powers beyond the reach of classical computers. Current technology is on the brink of an experimental demonstration of the superior power of quantum computation compared to classical devices. For such a demonstration to be meaningful, experimental noise must not affect the computational power of the device; this occurs when a classical algorithm can use the noise to simulate the quantum system.
In this work, we demonstrate an algorithm which simulates…

## 21 Citations

Boson Sampling with efficient scaling and efficient verification.

- Physics
- 2020

A universal quantum computer of moderate scale is not available yet, however intermediate models of quantum computation would still permit demonstrations of a quantum computational advantage over…

Distinguishing noisy boson sampling from classical simulations

- Physics, Computer ScienceQuantum
- 2021

It is shown analytically and confirmed by numerical simulations that one can efficiently distinguish the output distribution of such a noisy boson sampling from the approximations accounting for low-order quantum multiboson interferences, what includes the mentioned classical algorithms.

Efficient classical simulation of noisy random quantum circuits in one dimension

- Computer Science, PhysicsQuantum
- 2020

It is numerically demonstrated that for the two-qubit gate error rates the authors considered, there exists a characteristic system size above which adding more qubits does not bring about an exponential growth of the cost of classical MPO simulation of 1D noisy systems, possibly making classical simulation practically not feasible even with state-of-the-art supercomputers.

Classical simulation of lossy boson sampling using matrix product operators

- Computer SciencePhysical Review A
- 2021

By simulating lossy boson sampling using MPO, it is shown that as an input photon number grows, its computational cost, or MPO EE, behaves differently depending on a loss-scaling, exhibiting a different feature from that of lossless boson sampled.

Classically simulating near-term partially-distinguishable and lossy boson sampling

- Computer ScienceQuantum Science and Technology
- 2019

This work develops a scheme for classical simulation of boson sampling under uniform distinguishability and loss, based on the idea of sampling from distributions where at most k photons are indistinguishable, and shows that asymptotically this scheme can provide a polynomial improvement in the runtime compared to classically simulating idealised bosons sampling.

Photonic implementation of boson sampling: a review

- PhysicsAdvanced Photonics
- 2019

This work reviews recent advances and discusses the future application of photonic boson sampling devices beyond the original theoretical scope, describing both the technological improvements achieved and the future challenges.

Classical simulation of bosonic linear-optical random circuits beyond linear light cone

- Physics
- 2021

Sampling from probability distributions of quantum circuits is a fundamentally and practically important task which can be used to demonstrate quantum supremacy using noisy intermediatescale quantum…

Physical Unclonable Functions with Boson Sampling

- Computer Science
- 2019

A way to turn any boson sampling device for which there are certain fabrication limits into a physically unclonable function which could be used in identification systems and other security protocols.

Optimizing spontaneous parametric down-conversion sources for boson sampling

- PhysicsPhysical Review A
- 2020

An important step for photonic quantum technologies is the demonstration of a quantum advantage through boson sampling. In order to prevent classical simulability of boson sampling, the photons need…

Sampling and the complexity of nature

- Computer Science
- 2020

The quantum sign problem is identified as a root of the computational intractability of quantum output probabilities and it turns out that the intricate structure of the probability distributions the sign problem gives rise to, prohibits their verification from few samples.

## References

SHOWING 1-10 OF 21 REFERENCES

I and i

- EducationBMJ : British Medical Journal
- 2001

There is, I think, something ethereal about i —the square root of minus one, which seems an odd beast at that time—an intruder hovering on the edge of reality.

and Y

- Shi, arXiv:1805.01450,
- 2018

Nature 549 7671

- 2017

Theory Comput

- 9, 143
- 2013

Phys

- Rev. A 89
- 2014

and S

- Boixo, arXiv:1807.10749
- 2018

Phys

- Rev. Lett. 112, 050504
- 2014

Quantum 1

- 8
- 2017

Permanents

- Encyclopedia of Mathematics and its Applications. 6.
- 1978