Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 167 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 33 tok/s Pro
GPT-5 High 40 tok/s Pro
GPT-4o 92 tok/s Pro
Kimi K2 193 tok/s Pro
GPT OSS 120B 425 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

Boson Sampling from Non-Gaussian States (2403.17183v1)

Published 25 Mar 2024 in quant-ph

Abstract: Boson sampling has emerged as an important tool to demonstrate the difference between quantum and classical computers and has attracted the interest of experimentalists and theoreticians. In this work we study Boson sampling from general, single-mode states using a scheme that can generate any such state by combining Gaussian states and photon number measurements. We derive a formula that can be used to calculate the output photon number probabilities of these states after they travel through a linear interferometer. This extends the Boson sampling protocol to the widest array of possible single-mode states and from this we show that the complexity scaling of all such states is similar and hence there is no complexity advantage of using complex input states over simpler ones.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (32)
  1. Noisy intermediate-scale quantum algorithms. Reviews of Modern Physics, 94(1):015004, Feb 2022.
  2. D Hangleiter and Jens Eisert. Computational advantage of quantum random sampling. arXiv, quant-ph, Jun 2022.
  3. Quantum sampling problems, bosonsampling and quantum supremacy. npj Quantum Information, 3:15, Apr 2017.
  4. Photonic implementation of boson sampling: a review. Advanced Photonics, 1:034001, May 2019.
  5. The computational complexity of linear optics. Theory of Comput., 9(1):143–252, Jan 2013.
  6. Computational complexity: a modern approach. Cambridge University Press, 2009.
  7. Photonic boson sampling in a tunable circuit. Science, 339(6121):794–798, Feb 2013.
  8. Boson sampling on a photonic chip. Science, 339(6121):798–801, Feb 2013.
  9. Experimental boson sampling. Nature Photonics, 7:540, Jul 2013.
  10. Experimental validation of photonic boson sampling. Nature Photonics, 8:615, Aug 2014.
  11. Boson sampling from a gaussian state. Physical Review Letters, 113:100502, Sep 2014.
  12. Driven boson sampling. Physical Review Letters, 118:020502, Jan 2017.
  13. Gaussian boson sampling. Physical Review Letters, 119:170501, Oct 2017.
  14. Continuous-variable sampling from photon-added or photon-subtracted squeezed states. Physical Review A, 96:062307, Dec 2017.
  15. Gaussian boson sampling using threshold detectors. Physical Review A, 98:062322, Dec 2018.
  16. Detailed study of gaussian boson sampling. Physical Review A, 100(3):032326, Sep 2019.
  17. Quantum computational advantage via high-dimensional gaussian boson sampling. Science Advances, 8(1):eabi7894, 2022.
  18. Non-linear boson sampling. npj Quantum Information, 9(1):3, 2023.
  19. Resources for bosonic quantum computational advantage. Phys. Rev. Lett., 130:090602, Mar 2023.
  20. Classical simulation of gaussian quantum circuits with non-gaussian input states. Phys. Rev. Res., 3:033018, Jul 2021.
  21. Stellar representation of non-gaussian quantum states. Phys. Rev. Lett., 124:063605, Feb 2020.
  22. Conditional generation of arbitrary single-mode quantum states of light by repeated photon subtractions. Physical Review A, 72:033822, Sep 2005.
  23. Bonny L Schumaker. Quantum mechanical pure states with gaussian wave functions. Physics Reports, 135(6):317–408, 1986.
  24. Quantum-noise matrix for multimode systems: U(n) invariance, squeezing, and normal forms. Physical Review A (Atomic, 49:1567, Mar 1994.
  25. Wolfgang P Schleich. Quantum optics in phase space. John Wiley & Sons, 2011.
  26. Methods in Theoretical Quantum Optics, volume 15. Oxford University Press, 2002.
  27. Eduardo R Caianiello. Combinatorics and renormalization in quantum field theory. WA Benjamin, Inc., Reading, MA, 1973.
  28. A faster hafnian formula for complex matrices and its benchmarking on a supercomputer. Journal of Experimental Algorithmics (JEA), 24:1–17, 2019.
  29. Nicolás Quesada. Franck-condon factors by counting perfect matchings of graphs with loops. The Journal of Chemical Physics, 150:164113, Apr 2019.
  30. Alexander I Barvinok. Two algorithmic results for the traveling salesman problem. Mathematics of Operations Research, 21(1):65–84, 1996.
  31. Alexander Barvinok. Combinatorics and complexity of partition functions, volume 9. Springer, 2016.
  32. Negativity of the wigner function as an indicator of non-classicality. Journal of Optics B: Quantum and Semiclassical Optics, 6(10):396, aug 2004.
Citations (2)

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets

This paper has been mentioned in 1 tweet and received 0 likes.

Upgrade to Pro to view all of the tweets about this paper: