Driven Boson Sampling.

  title={Driven Boson Sampling.},
  author={Sonja Barkhofen and Tim J. Bartley and Linda Sansoni and Regina Kruse and Craig S. Hamilton and Igor Jex and Christine Silberhorn},
  journal={Physical review letters},
  volume={118 2},
Sampling the distribution of bosons that have undergone a random unitary evolution is strongly believed to be a computationally hard problem. Key to outperforming classical simulations of this task is to increase both the number of input photons and the size of the network. We propose driven boson sampling, in which photons are input within the network itself, as a means to approach this goal. We show that the mean number of photons entering a boson sampling experiment can exceed one photon per… 

Figures from this paper

Experimental Gaussian Boson sampling

Detailed study of Gaussian boson sampling

An expression is derived that relates the probability to measure a specific photon output pattern from a Gaussian state to the Hafnian matrix function and is used to design aGaussian Boson sampling protocol.

Quantum computational supremacy in the sampling of bosonic random walkers on a one-dimensional lattice

We study the sampling complexity of a probability distribution associated with an ensemble of identical noninteracting bosons undergoing a quantum random walk on a one-dimensional lattice. With

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.

Effect of partial distinguishability on quantum supremacy in Gaussian Boson sampling

This paper develops a model and algorithm and shows how the boundary of quantum supremacy in GBS can be affected by partial distinguishability, and proposes an efficient classical simulation algorithm which can be used to calculate the probabilities.

Quantum sampling problems, BosonSampling and quantum supremacy

This paper will review sampling problems and the arguments that have been used to deduce when sampling problems are hard for classical computers to simulate, and two classes of quantum sampling problems that demonstrate the supremacy of quantum algorithms are BosonSampling and Instantaneous Quantum Polynomial-time Sampling.

Driven Gaussian quantum walks

Quantum walks function as essential means to implement quantum simulators, allowing one to study complex and often directly inaccessible quantum processes in controllable systems. In this

Quantum photonics with active feedback loops

We develop a unified theoretical framework for the efficient description of multiphoton states generated and propagating in loop-based optical networks which contain nonlinear elements. These active

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 active



Proceedings of the forty-third annual ACM symposium on Theory of computing

The papers in this volume were presented at the 43rd ACM Symposium on Theory of Computing (STOC), held June 6-8, 2011 in San Jose, California, as part of the fifth Federated Computing Research

and a at

The xishacorene natural products are structurally unique apolar diterpenoids that feature a bicyclo[3.3.1] framework. These secondary metabolites likely arise from the well-studied, structurally

Single photon generation and quantum computing with integrated photonics

A linear optics implementation using measurementinduced nonlinearity is possible in principle, however very challenging experimentally. See Supplementary Material for further details

    * Corresponding author:

      Physical Review A 91

      • 042316
      • 2015


      • Comput. Sci. 8, 189
      • 1979

      Nature Photonics 8

      • 615
      • 2014

      Science Advances 1

      • e1400255
      • 2015

      Science 339

      • 798
      • 2013