PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
September 10, 2025Quantum Science and Technology0 citations

Complexity of Gaussian Quantum Optics with a Limited Number of Non-Linearities

View Full Paper
MJMichael G. JabbourLNLeonardo Novo

Key Points

  • Transition probabilities of Gaussian processes with non-linearities present significant computational challenges.
  • An efficient algorithm could approximate outcome probabilities in Gaussian boson sampling experiments.
  • Extending complexity results to Gaussian processes with multiple non-linear layers enhances computational understanding.
  • Recent advances in photon-photon interactions may lead to practical quantum computational advantages.

Abstract

Abstract It is well known in quantum optics that any process involving the preparation of a multimode gaussian state, followed by a gaussian operation and gaussian measurements, can be efficiently simulated by classical computers. Here, we provide evidence that computing transition amplitudes of Gaussian processes with a single-layer of non-linearities is hard for classical computers. To this end, we show how an efficient algorithm to solve this problem could be used to efficiently approximate outcome probabilities of a Gaussian boson sampling experiment. We also extend this complexity result to the problem of computing transition probabilities of Gaussian processes with two layers of non-linearities, by developing a Hadamard test for continuous-variable systems that may be of independent interest. Given recent experimental developments in the implementation of photon-photon interactions, our results may inspire new schemes showing quantum computational advantage or algorithmic applications of non-linear quantum optical systems realizable in the near-term.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Jabbour et al. (2025) studied this question.

synapsesocial.com/papers/68c1aab854b1d3bfb60e29fdhttps://doi.org/10.1088/2058-9565/adf6d4
Ask AI
Helpful
Bookmark
Share
View Full Paper