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:1803.11534 · Physical Review A

Simulating arbitrary Gaussian circuits with linear optics

Levon Chakhmakhchyan, Nicolas J. Cerf

Published Dec 10, 2018• 10 citations
arXivHTMLPDF

Abstract

Linear canonical transformations of bosonic modes correspond to Gaussian unitaries, which comprise passive linear-optical transformations as effected by a multiport passive interferometer and active Bogoliubov transformations as effected by a nonlinear amplification medium. As a consequence of the Bloch-Messiah theorem, any Gaussian unitary can be decomposed into a passive interferometer followed by a layer of single-mode squeezers and another passive interferometer. Here, it is shown how to circumvent the need for active transformations. Namely, we provide a technique to simulate sampling from the joint input and output distributions of any Gaussian circuit with passive interferometry only, provided two-mode squeezed vacuum states are available as a prior resource. At the heart of the procedure, we exploit the fact that a beam splitter under partial time reversal simulates a two-mode squeezer, which gives access to an arbitrary Gaussian circuit without any nonlinear optical medium. This yields, in particular, a procedure for simulating with linear optics an extended boson sampling experiment, where photons jointly propagate through an arbitrary multimode Gaussian circuit followed by the detection of output photon patterns.

DOI
10.1103/physreva.98.062314

Related papers

Simulating Universal Gaussian Circuits with Linear Optics

Levon Chakhmakhchyan, Nicolas J. Cerf

We develop a universal procedure for simulating sampling from arbitrary non-linear photonic Gaussian circuit with passive linear optics only, provided two-mode squeezed vacuum states are available as a prior resource.

Quantum Information and Measurement (QIM)•Jan 1, 2019•0 citations

Simulating Universal Gaussian Circuits with Linear Optics

Levon Chakhmakhchyan, Nicolas J. Cerf

We develop a universal procedure for simulating sampling from arbitrary non-linear photonic Gaussian circuit with passive linear optics only, provided two-mode squeezed vacuum states are available as a prior resource.

Quantum Information and Measurement (QIM)•Jan 1, 2019•0 citations

Boson sampling with Gaussian measurements

Levon Chakhmakhchyan, Nicolas J. Cerf

We develop an alternative boson sampling model operating on single-photon states followed by linear interferometry and Gaussian measurements. The hardness proof for simulating such continuous-variable measurements is established in two main steps, making use of the symmetry of quantum evolution under time reversal. Namely, we first construct a twofold version of scattershot boson sampling in which, as opposed to the original proposal, both legs of a collection of two-mode squeezed vacuum states undergo parallel linear-optical transformations. This twofold scattershot model yields, as a corollary, an instance of boson sampling from Gaussian states where photon counting is hard to simulate. Then, a time-reversed setup is used to exhibit a boson sampling model in which the simulation of Gaussian measurements---namely the outcome of eight-port homodyne detection---is proven to be computationally hard. These results illustrate how the symmetry of quantum evolution under time reversal may serve as a tool for analyzing the computational complexity of novel physically motivated computational problems.

arXiv:1705.05299•Physical Review A•Sep 14, 2017•53 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 simulation of partially distinguishable boson sampling

Alexandra E. Moylett, Peter S. Turner

Boson Sampling is the problem of sampling from the same output probability distribution as a collection of indistinguishable single photons input into a linear interferometer. It has been shown that, subject to certain computational complexity conjectures, in general the problem is difficult to solve classically, motivating optical experiments aimed at demonstrating quantum computational ``supremacy.'' There are a number of challenges faced by such experiments, including the generation of indistinguishable single photons. We provide a quantum circuit that simulates Boson Sampling with arbitrarily distinguishable particles. This makes clear how distinguishabililty leads to decoherence in the standard quantum circuit model, allowing insight to be gained. At the heart of the circuit is the quantum Schur transform, which follows from a representation theoretic approach to the physics of distinguishable particles in first quantization. The techniques are quite general and have application beyond Boson Sampling.

arXiv:1803.03657•Physical Review A•Jun 20, 2018•22 citations

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

Changhun Oh, Youngrong Lim, Bill Fefferman +1 more

Sampling from probability distributions of quantum circuits is a fundamentally and practically important task which can be used to demonstrate quantum supremacy using noisy intermediate-scale quantum devices. In the present work, we examine classical simulability of sampling from the output photon-number distribution of linear-optical circuits composed of random beam splitters with equally distributed squeezed vacuum states and single-photon states input. We provide efficient classical algorithms to simulate linear-optical random circuits and show that the algorithms' error is exponentially small up to a depth less than quadratic in the distance between sources using a classical random walk behavior of random linear-optical circuits. Notably, the average-case depth allowing an efficient classical simulation is larger than the worst-case depth limit, which is linear in the distance. Besides, our results together with the hardness of boson sampling give a lower-bound on the depth for constituting global Haar-random unitary circuits.

arXiv:2102.10083•Feb 19, 2021•3 citations
Linear canonical transformations of bosonic modes correspond to Gaussian unitaries, which comprise passive linear-optical transformations as effected by a multiport passive interferometer and active Bogoliubov transformations as effected by a nonlinear amplification medium. As a consequence of the Bloch-Messiah theorem, any Gaussian unitary can be decomposed into a passive interferometer followed by a layer of single-mode squeezers and another passive interferometer. Here, it is shown how to circumvent the need for active transformations. Namely, we provide a technique to simulate sampling from the joint input and output distributions of any Gaussian circuit with passive interferometry only, provided two-mode squeezed vacuum states are available as a prior resource. At the heart of the procedure, we exploit the fact that a beam splitter under partial time reversal simulates a two-mode squeezer, which gives access to an arbitrary Gaussian circuit without any nonlinear optical medium. This yields, in particular, a procedure for simulating with linear optics an extended boson sampling experiment, where photons jointly propagate through an arbitrary multimode Gaussian circuit followed by the detection of output photon patterns.
We develop an alternative boson sampling model operating on single-photon states followed by linear interferometry and Gaussian measurements. The hardness proof for simulating such continuous-variable measurements is established in two main steps, making use of the symmetry of quantum evolution under time reversal. Namely, we first construct a twofold version of scattershot boson sampling in which, as opposed to the original proposal, both legs of a collection of two-mode squeezed vacuum states undergo parallel linear-optical transformations. This twofold scattershot model yields, as a corollary, an instance of boson sampling from Gaussian states where photon counting is hard to simulate. Then, a time-reversed setup is used to exhibit a boson sampling model in which the simulation of Gaussian measurements---namely the outcome of eight-port homodyne detection---is proven to be computationally hard. These results illustrate how the symmetry of quantum evolution under time reversal may serve as a tool for analyzing the computational complexity of novel physically motivated computational problems.
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.
Boson Sampling is the problem of sampling from the same output probability distribution as a collection of indistinguishable single photons input into a linear interferometer. It has been shown that, subject to certain computational complexity conjectures, in general the problem is difficult to solve classically, motivating optical experiments aimed at demonstrating quantum computational ``supremacy.'' There are a number of challenges faced by such experiments, including the generation of indistinguishable single photons. We provide a quantum circuit that simulates Boson Sampling with arbitrarily distinguishable particles. This makes clear how distinguishabililty leads to decoherence in the standard quantum circuit model, allowing insight to be gained. At the heart of the circuit is the quantum Schur transform, which follows from a representation theoretic approach to the physics of distinguishable particles in first quantization. The techniques are quite general and have application beyond Boson Sampling.
Sampling from probability distributions of quantum circuits is a fundamentally and practically important task which can be used to demonstrate quantum supremacy using noisy intermediate-scale quantum devices. In the present work, we examine classical simulability of sampling from the output photon-number distribution of linear-optical circuits composed of random beam splitters with equally distributed squeezed vacuum states and single-photon states input. We provide efficient classical algorithms to simulate linear-optical random circuits and show that the algorithms' error is exponentially small up to a depth less than quadratic in the distance between sources using a classical random walk behavior of random linear-optical circuits. Notably, the average-case depth allowing an efficient classical simulation is larger than the worst-case depth limit, which is linear in the distance. Besides, our results together with the hardness of boson sampling give a lower-bound on the depth for constituting global Haar-random unitary circuits.