Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Conference on Lasers and Electro-Optics Pacific Rim (CLEO-PR)

New directions in optical quantum computing

Timothy C. Ralph

Published Aug 1, 2015• 0 citations
Publisher

Abstract

We will discuss new sampling algorithms that are hard for classical computers but can be solved with linear optical quantum processors and techniques for implementing universal quantum gates using strong optical non-linearities and Gaussian optics.
DOI
10.1109/cleopr.2015.7375881

Related papers

A Review on Quantum Computers with Emphasize on Linear Optics Quantum Computing

Kumar Sharma Amit, Ashish Kumar Ghunawat

IEEE Conference Proceedings•Jan 1, 2019•1 citation

Complexity of Gaussian quantum optics with a limited number of non-linearities

Michael G. Jabbour, Leonardo Novo

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.

arXiv:2310.06034•Quantum Science and Technology•Aug 1, 2025•0 citations

Non-linear Boson Sampling

Nicolò Spagnolo, Daniel J. Brod, Ernesto F. Galvão +1 more

Abstract Boson Sampling is a task that is conjectured to be computationally hard for a classical computer, but which can be efficiently solved by linear-optical interferometers with Fock state inputs. Significant advances have been reported in the last few years, with demonstrations of small- and medium-scale devices, as well as implementations of variants such as Gaussian Boson Sampling. Besides the relevance of this class of computational models in the quest for unambiguous experimental demonstrations of quantum advantage, recent results have also proposed the first applications for hybrid quantum computing. Here, we introduce the adoption of non-linear photon–photon interactions in the Boson Sampling framework, and analyze the enhancement in complexity via an explicit linear-optical simulation scheme. By extending the computational expressivity of Boson Sampling, the introduction of non-linearities promises to disclose novel functionalities for this class of quantum devices. Hence, our results are expected to lead to new applications of near-term, restricted photonic quantum computers.

arXiv:2110.13788•npj Quantum Information•Jan 9, 2023•24 citations

Towards realistic architectures for linear optical quantum computing

Sam Morley-Short

•Jan 1, 2019•0 citations

Quantum-enhanced Markov chain Monte Carlo

David Layden, Guglielmo Mazzola, Ryan V. Mishmash +4 more

Sampling from complicated probability distributions is a hard computational problem arising in many fields, including statistical physics, optimization, and machine learning. Quantum computers have recently been used to sample from complicated distributions that are hard to sample from classically, but which seldom arise in applications. Here we introduce a quantum algorithm to sample from distributions that pose a bottleneck in several applications, which we implement on a superconducting quantum processor. The algorithm performs Markov chain Monte Carlo (MCMC), a popular iterative sampling technique, to sample from the Boltzmann distribution of classical Ising models. In each step, the quantum processor explores the model in superposition to propose a random move, which is then accepted or rejected by a classical computer and returned to the quantum processor, ensuring convergence to the desired Boltzmann distribution. We find that this quantum algorithm converges in fewer iterations than common classical MCMC alternatives on relevant problem instances, both in simulations and experiments. It therefore opens a new path for quantum computers to solve useful--not merely difficult--problems in the near term.

arXiv:2203.12497•Mar 23, 2022•0 citations

Photons promise an exciting route to quantum computing

Jeremy L. O’Brien

Optical quantum computing was a dead-end street until the breakthrough of a scheme based on a massive optical nonlinearity induced by single-photon detection. Today it is a leading approach.

•Apr 1, 2008•0 citations
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.
Abstract Boson Sampling is a task that is conjectured to be computationally hard for a classical computer, but which can be efficiently solved by linear-optical interferometers with Fock state inputs. Significant advances have been reported in the last few years, with demonstrations of small- and medium-scale devices, as well as implementations of variants such as Gaussian Boson Sampling. Besides the relevance of this class of computational models in the quest for unambiguous experimental demonstrations of quantum advantage, recent results have also proposed the first applications for hybrid quantum computing. Here, we introduce the adoption of non-linear photon–photon interactions in the Boson Sampling framework, and analyze the enhancement in complexity via an explicit linear-optical simulation scheme. By extending the computational expressivity of Boson Sampling, the introduction of non-linearities promises to disclose novel functionalities for this class of quantum devices. Hence, our results are expected to lead to new applications of near-term, restricted photonic quantum computers.
Sampling from complicated probability distributions is a hard computational problem arising in many fields, including statistical physics, optimization, and machine learning. Quantum computers have recently been used to sample from complicated distributions that are hard to sample from classically, but which seldom arise in applications. Here we introduce a quantum algorithm to sample from distributions that pose a bottleneck in several applications, which we implement on a superconducting quantum processor. The algorithm performs Markov chain Monte Carlo (MCMC), a popular iterative sampling technique, to sample from the Boltzmann distribution of classical Ising models. In each step, the quantum processor explores the model in superposition to propose a random move, which is then accepted or rejected by a classical computer and returned to the quantum processor, ensuring convergence to the desired Boltzmann distribution. We find that this quantum algorithm converges in fewer iterations than common classical MCMC alternatives on relevant problem instances, both in simulations and experiments. It therefore opens a new path for quantum computers to solve useful--not merely difficult--problems in the near term.