Boson sampling with Gaussian measurements

  title={Boson sampling with Gaussian measurements},
  author={L. Chakhmakhchyan and Nicolas J. Cerf},
  journal={Physical Review A},
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… Expand

Figures from this paper

Benchmarking of Gaussian boson sampling using two-point correlators
Gaussian boson sampling is a promising scheme for demonstrating a quantum computational advantage using photonic states that are accessible in a laboratory and, thus, offer scalable sources ofExpand
Detailed study of Gaussian boson sampling
Since the development of Boson sampling, there has been a quest to construct more efficient and experimentally feasible protocols to test the computational complexity of sampling from photonicExpand
Simulating arbitrary Gaussian circuits with linear optics
Linear canonical transformations of bosonic modes correspond to Gaussian unitaries, which comprise passive linear-optical transformations as effected by a multiport passive interferometer and activeExpand
Photonic implementation of boson sampling: a review
This work reviews recent advances and discusses the future application of photonic boson sampling devices beyond the original theoretical scope, describing both the technological improvements achieved and the future challenges. Expand
Simulability of partially distinguishable superposition and Gaussian boson sampling
We study the hardness of classically simulating boson sampling with superposition and Gaussian input states at nonzero photon indistinguishability. We find that, similar to regular boson sampling,Expand
Simulating boson sampling in lossy architectures
It is proved that either the depth of the circuit is large enough that it can be simulated by thermal noise with an algorithm running in polynomial time, or it is shallow enough that a tensor network simulation runs in quasi-polynomial time. Expand
A 98 , 062314 ( 2018 ) Simulating arbitrary Gaussian circuits with linear optics
Linear canonical transformations of bosonic modes correspond to Gaussian unitaries, which comprise passive linear-optical transformations as effected by a multiport passive interferometer and activeExpand
Proposal for Quantum Simulation via All-Optically-Generated Tensor Network States.
It is demonstrated that state-of-the-art optical devices are capable of determining the ground-state properties of the spin-1/2 Heisenberg model and the principle is illustrated with the generation of two different classes of entangled tensor network states. Expand
Complexity of Fermionic Dissipative Interactions and Applications to Quantum Computing
Interactions between particles are usually a resource for quantum computing, making quantum many-body systems intractable by any known classical algorithm. In contrast, noise is typically consideredExpand
Many-Particle Interference
After the extensive discussion of bosonic and fermionic structures, we now dig deeper into the dynamical properties of these particles. More specifically, we focus on the concept of trueExpand


Exact boson sampling using Gaussian continuous-variable measurements
Boson sampling is a quantum mechanical task involving Fock basis state preparation and detection and evolution using only linear interactions. A classical algorithm for producing samples from thisExpand
Sufficient Conditions for Efficient Classical Simulation of Quantum Optics
We provide general sufficient conditions for the efficient classical simulation of quantum-optics experiments that involve inputting states to a quantum process and making measurements at the output.Expand
BosonSampling with Lost Photons
It is shown that, if k out of n photons are lost, then BosonSampling cannot sample classically from a distribution that is 1/n^Theta(k)-close to the ideal distribution, unless a $\text{BPP}^{\text{NP}}$ machine can estimate the permanents of Gaussian matrices in $n^{O(k)}$ time. Expand
Polynomial approximation of non-Gaussian unitaries by counting one photon at a time
In quantum computation with continous-variable systems, quantum advantage can only be achieved if some non-Gaussian resource is available. Yet, non-Gaussian unitary evolutions and measurements suitedExpand
The computational complexity of linear optics
A model of computation in which identical photons are generated, sent through a linear-optical network, then nonadaptively measured to count the number of photons in each mode is defined, giving new evidence that quantum computers cannot be efficiently simulated by classical computers. Expand
What can quantum optics say about complexity theory?
Considering the problem of sampling from the output photon-counting probability distribution of a linear-optical network for input Gaussian states, a general formula is derived for calculating the output probabilities, and by considering input thermal states, it is shown that theoutput probabilities are proportional to permanents of positive-semidefinite Hermitian matrices. Expand
Error tolerance of the boson-sampling model for linear optics quantum computing
Linear optics quantum computing is a promising approach to implementing scalable quantum computation. However, this approach has very demanding physical resource requirements. Recently, Aaronson andExpand
Scalable implementation of boson sampling with trapped ions.
This work proposes a scalable implementation of boson sampling using local transverse phonon modes of trapped ions to encode the bosons, which would outperform the most powerful classical computers and constitute an effective disproof of the famous extended Church-Turing thesis. Expand
Spin models and boson sampling
In this work we proof that boson sampling with $N$ particles in $M$ modes is equivalent to short-time evolution with $N$ excitations in an XY model of $2N$ spins. This mapping is efficient wheneverExpand
Compact Gaussian quantum computation by multi-pixel homodyne detection
This method is based on a multi-pixel homodyne detection system recently demonstrated experimentally, which includes classical data post-processing and allows the incorporation of the linear optics network in the stage of the measurement. Expand