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

arXiv:1410.0433 · Physical Review A

Simple scheme for universal linear-optics quantum computing with constant experimental complexity using fiber loops

Peter P. Rohde

Published Jan 8, 2015• 32 citations
arXivHTMLPDF

Abstract

Recently, Motes, Gilchrist, Dowling, and Rohde [Phys. Rev. Lett. 113, 120501 (2014).] presented a scheme for photonic boson sampling using a fiber-loop architecture. Here we show that the same architecture can be modified to implement full, universal linear-optics quantum computing, in various incarnations. The scheme employs two embedded fiber loops, a single push-button photon source, three dynamically controlled beamsplitters, and a single time-resolved photodetector. The architecture has only a single point of interference, and thus may be significantly easier to align than other schemes. The experimental complexity of the scheme is constant, irrespective of the size of the computation, limited only by fiber lengths and their respective loss rates.

DOI
10.1103/physreva.91.012306

Related papers

Scalable Boson Sampling with Time-Bin Encoding Using a Loop-Based Architecture

Keith R. Motes, Alexei Gilchrist, Jonathan P. Dowling +1 more

We present an architecture for arbitrarily scalable boson sampling using two nested fiber loops. The architecture has fixed experimental complexity, irrespective of the size of the desired interferometer, whose scale is limited only by fiber and switch loss rates. The architecture employs time-bin encoding, whereby the incident photons form a pulse train, which enters the loops. Dynamically controlled loop coupling ratios allow the construction of the arbitrary linear optics interferometers required for boson sampling. The architecture employs only a single point of interference and may thus be easier to stabilize than other approaches. The scheme has polynomial complexity and could be realized using demonstrated present-day technologies.

arXiv:1403.4007•Physical Review Letters•Sep 18, 2014•141 citations

Beyond quantum linear optics with adaptive boson sampling

Giovanni Rodari, Tommaso Francalanci, Eugenio Caruccio +15 more

Universal photon-based quantum computing requires optical nonlinearities, which can be induced by intermediate measurements and by adaptivity, to be supplied to linear-optical elements. In a near-term perspective, it is essential to probe whether dynamics going beyond linear optics can be accessed with a limited amount of resources. Although recent results show how linear-optical dynamics implies bounds on the set of photonic states that can be generated, quantitative methods for studying the emergence of nonlinear dynamics are largely missing. Here we analyse a regime in which such bounds can be surpassed. We do this by leveraging an adaptive boson sampling architecture in which the optical evolution implemented in a photonic device is progressively adapted via measurement-based feedback. We introduce practical methods to quantify the emergence of a gap with respect to linear optics and derive nonlinearity witnesses from the properties of linear-optical evolution. Then, we validate the toolbox developed within adaptive boson sampling architectures of increasing complexity implemented on a state-of-the-art photonic platform, both by realizing real-time adaptivity and by emulating adaptive protocols via post-selection for more complex configurations. In particular, we probe experimentally a regime in which nonlinear dynamics, unobtainable within a linear-optical paradigm, can arise, thus showing how optical architectures with limited adaptivity are a powerful testbed for exploring new regimes.

Nature Photonics•Jul 20, 2026•0 citations

Multiphoton interference and the computational complexity of linear optics

Simon Laibacher

The non-classical interference undergone by multiple photons in passive, linear optical networks gives rise to a surprising computational power of such quantum systems. This is prominently highlighted by boson sampling, a scheme for quantum computation which relies solely on such multiphoton interference and omits the usage of more sophisticated techniques such as entangling gates or feed-forward control. Despite these limitations, it still allows to efficiently solve a class of computational problems which is intractable for classical computers. In this thesis, several open challenges on the way to an experimental realization of boson sampling are addressed. To that end, the idealized model for boson sampling is extended to account, for example, for inner degrees of freedom of the single-photon pulses or the probabilistic nature of single-photon sources. It is shown that the difficulties arising from these real-world effects can be overcome by suitably adapting existing boson sampling schemes. Additionally, the extended model for such interference is applied to reveal its intricate dependence on input state, evolution inside the interferometer, and the detection process. Finally, a novel description of SPDC in terms of temporal Bogoliubov transformations is provided, revealing new, intuitive insights into the temporal structure of photon correlations for such sources.

•Jan 1, 2018•0 citations

Gate-based emulation of boson sampling using photonic qubits

Aastha P. Zalone, S. P. Dinesh, C. M. Chandrashekar

Boson sampling arising from multiphoton interference in linear-optical networks is a prominent non-universal model for quantum computation. Here, by encoding the multi-qubit state to bosonic Fock state, we present a scalable quantum-circuit framework for simulating boson sampling on a universal quantum computing platform. Beginning with balanced beam-splitter transformations on the single- and two-photon sectors, we derive equivalent quantum-circuit implementations and unify them within a common Hilbert-space representation using an ancilla-assisted encoding. This construction is then generalized to arbitrary interferometers by replacing each optical beam splitter with a repeating quantum-circuit unit that selectively acts only within the relevant local interference subspace, requiring $N+1$ qubits for a two-photon $N$-mode interferometer and a linear-overhead subspace-identification procedure. Using this framework, gate-based quantum circuit for a four-mode boson-sampling circuit is developed and experimentally implemented on a four-qubit gate-based photonic qubit system. The qubit framework for emulating boson sampling of $n-$photons in $m-$mode will be useful to solve a broad class of sampling complexity problem on a gate-based quantum computers.

quant-pharXiv:2608.09509•Aug 11, 2026•0 citations

Quantum computation using linear optics

Gerard J Milburn

Summary form only given. Quantum computers are expected to increase the efficiency of solving problems such as factoring large integers. However an experimental implementation of even relatively simple quantum information processing with a few to a dozen qubits presents an enormous technological challenge. One of the earliest proposals for quantum computation is based on implementing a quantum bit with two optical modes containing one photon. The proposal is appealing due to the ease with which photon interference can be observed. However these early proposals required huge single photon optical nonlinearities. Unfortunately currently available optical nonlinearities are too weak and too noisy to be useful. Recently however we have discovered that efficient quantum computation is possible using only beam splitters, phase shifters, single photon sources and photodetectors. Our methods exploit feed forward from photo-detectors and are robust against errors from photon loss and detector inefficiency. In this tutorial I will outline this scheme, highlighting the technical challenges required to implement it. The tutorial will be relatively self contained with a brief introduction to quantum optics and quantum computation.

Quantum Electronics and Laser Science Conference•Jun 25, 2003•0 citations

Tensor network states in time-bin quantum optics

Michael Lubasch, Antonio A. Valido, Jelmer J. Renema +5 more

The current shift in the quantum optics community towards experiments with many modes and photons necessitates new classical simulation techniques that efficiently encode many-body quantum correlations and go beyond the usual phase-space formulation. To address this pressing demand we formulate linear quantum optics in the language of tensor network states. We extensively analyze the quantum and classical correlations of time-bin interference in a single fiber loop. We then generalize our results to more complex time-bin quantum setups and identify different classes of architectures for high-complexity and low-overhead boson sampling experiments.

arXiv:1712.09869•Physical Review A•Jun 5, 2018•42 citations
Recently, Motes, Gilchrist, Dowling, and Rohde [Phys. Rev. Lett. 113, 120501 (2014).] presented a scheme for photonic boson sampling using a fiber-loop architecture. Here we show that the same architecture can be modified to implement full, universal linear-optics quantum computing, in various incarnations. The scheme employs two embedded fiber loops, a single push-button photon source, three dynamically controlled beamsplitters, and a single time-resolved photodetector. The architecture has only a single point of interference, and thus may be significantly easier to align than other schemes. The experimental complexity of the scheme is constant, irrespective of the size of the computation, limited only by fiber lengths and their respective loss rates.
We present an architecture for arbitrarily scalable boson sampling using two nested fiber loops. The architecture has fixed experimental complexity, irrespective of the size of the desired interferometer, whose scale is limited only by fiber and switch loss rates. The architecture employs time-bin encoding, whereby the incident photons form a pulse train, which enters the loops. Dynamically controlled loop coupling ratios allow the construction of the arbitrary linear optics interferometers required for boson sampling. The architecture employs only a single point of interference and may thus be easier to stabilize than other approaches. The scheme has polynomial complexity and could be realized using demonstrated present-day technologies.
Universal photon-based quantum computing requires optical nonlinearities, which can be induced by intermediate measurements and by adaptivity, to be supplied to linear-optical elements. In a near-term perspective, it is essential to probe whether dynamics going beyond linear optics can be accessed with a limited amount of resources. Although recent results show how linear-optical dynamics implies bounds on the set of photonic states that can be generated, quantitative methods for studying the emergence of nonlinear dynamics are largely missing. Here we analyse a regime in which such bounds can be surpassed. We do this by leveraging an adaptive boson sampling architecture in which the optical evolution implemented in a photonic device is progressively adapted via measurement-based feedback. We introduce practical methods to quantify the emergence of a gap with respect to linear optics and derive nonlinearity witnesses from the properties of linear-optical evolution. Then, we validate the toolbox developed within adaptive boson sampling architectures of increasing complexity implemented on a state-of-the-art photonic platform, both by realizing real-time adaptivity and by emulating adaptive protocols via post-selection for more complex configurations. In particular, we probe experimentally a regime in which nonlinear dynamics, unobtainable within a linear-optical paradigm, can arise, thus showing how optical architectures with limited adaptivity are a powerful testbed for exploring new regimes.
The non-classical interference undergone by multiple photons in passive, linear optical networks gives rise to a surprising computational power of such quantum systems. This is prominently highlighted by boson sampling, a scheme for quantum computation which relies solely on such multiphoton interference and omits the usage of more sophisticated techniques such as entangling gates or feed-forward control. Despite these limitations, it still allows to efficiently solve a class of computational problems which is intractable for classical computers. In this thesis, several open challenges on the way to an experimental realization of boson sampling are addressed. To that end, the idealized model for boson sampling is extended to account, for example, for inner degrees of freedom of the single-photon pulses or the probabilistic nature of single-photon sources. It is shown that the difficulties arising from these real-world effects can be overcome by suitably adapting existing boson sampling schemes. Additionally, the extended model for such interference is applied to reveal its intricate dependence on input state, evolution inside the interferometer, and the detection process. Finally, a novel description of SPDC in terms of temporal Bogoliubov transformations is provided, revealing new, intuitive insights into the temporal structure of photon correlations for such sources.
Boson sampling arising from multiphoton interference in linear-optical networks is a prominent non-universal model for quantum computation. Here, by encoding the multi-qubit state to bosonic Fock state, we present a scalable quantum-circuit framework for simulating boson sampling on a universal quantum computing platform. Beginning with balanced beam-splitter transformations on the single- and two-photon sectors, we derive equivalent quantum-circuit implementations and unify them within a common Hilbert-space representation using an ancilla-assisted encoding. This construction is then generalized to arbitrary interferometers by replacing each optical beam splitter with a repeating quantum-circuit unit that selectively acts only within the relevant local interference subspace, requiring N+1N+1N+1 qubits for a two-photon NNN-mode interferometer and a linear-overhead subspace-identification procedure. Using this framework, gate-based quantum circuit for a four-mode boson-sampling circuit is developed and experimentally implemented on a four-qubit gate-based photonic qubit system. The qubit framework for emulating boson sampling of n−n-n−photons in m−m-m−mode will be useful to solve a broad class of sampling complexity problem on a gate-based quantum computers.
Summary form only given. Quantum computers are expected to increase the efficiency of solving problems such as factoring large integers. However an experimental implementation of even relatively simple quantum information processing with a few to a dozen qubits presents an enormous technological challenge. One of the earliest proposals for quantum computation is based on implementing a quantum bit with two optical modes containing one photon. The proposal is appealing due to the ease with which photon interference can be observed. However these early proposals required huge single photon optical nonlinearities. Unfortunately currently available optical nonlinearities are too weak and too noisy to be useful. Recently however we have discovered that efficient quantum computation is possible using only beam splitters, phase shifters, single photon sources and photodetectors. Our methods exploit feed forward from photo-detectors and are robust against errors from photon loss and detector inefficiency. In this tutorial I will outline this scheme, highlighting the technical challenges required to implement it. The tutorial will be relatively self contained with a brief introduction to quantum optics and quantum computation.
The current shift in the quantum optics community towards experiments with many modes and photons necessitates new classical simulation techniques that efficiently encode many-body quantum correlations and go beyond the usual phase-space formulation. To address this pressing demand we formulate linear quantum optics in the language of tensor network states. We extensively analyze the quantum and classical correlations of time-bin interference in a single fiber loop. We then generalize our results to more complex time-bin quantum setups and identify different classes of architectures for high-complexity and low-overhead boson sampling experiments.