Boson sampling from a Gaussian state.

@article{Lund2014BosonSF,
  title={Boson sampling from a Gaussian state.},
  author={Austin P. Lund and Anthony Laing and Saleh Rahimi-Keshari and Terry Rudolph and Jeremy Lloyd O'Brien and Timothy C. Ralph},
  journal={Physical review letters},
  year={2014},
  volume={113 10},
  pages={
          100502
        }
}
We pose a randomized boson-sampling problem. Strong evidence exists that such a problem becomes intractable on a classical computer as a function of the number of bosons. We describe a quantum optical processor that can solve this problem efficiently based on a Gaussian input state, a linear optical network, and nonadaptive photon counting measurements. All the elements required to build such a processor currently exist. The demonstration of such a device would provide empirical evidence that… Expand
A certification scheme for the boson sampler
Boson sampling can provide strong evidence that the computational power of a quantum computer outperforms a classical one via currently feasible linear optics experiments. However, how to identify anExpand
An introduction to boson-sampling
TLDR
This chapter begins by motivating boson-sampling and discussing the history of linear optics quantum computing, and discusses the Extended Church-Turing thesis, then discusses what a sampling problem is, and explains why boson -sampling is easier than linear opticsquantum computing. Expand
Efficient Classical Algorithm for Boson Sampling with Partially Distinguishable Photons.
TLDR
It is demonstrated how boson sampling with photons of partial distinguishability can be expressed in terms of interference of fewer photons, and a classical algorithm is proposed to simulate the output of a boson sampler fed with photon ofpartial distinguishability. Expand
Boson sampling with non-identical single photons
The boson-sampling problem has triggered a lot of interest in the scientific community because of its potential of demonstrating the computational power of quantum interference without the need ofExpand
Gaussian boson sampling using threshold detectors
We study what is arguably the most experimentally appealing Boson Sampling architecture: Gaussian states sampled with threshold detectors. We show that in this setting, the probability of observing aExpand
Continuous-Variables Boson Sampling: Scaling and Verification
A universal quantum computer of a moderate scale is not available yet, however intermediate models of quantum computation would still permit demonstrations of a quantum computational advantage overExpand
Sampling of bosonic qubits
The boson sampling problem has brought a lot of attention in the quantum information field because it is not efficiently solvable with a classical computer; nonetheless it can be implementable withExpand
Decision and function problems based on boson sampling
TLDR
The purpose of this work is to investigate whether boson sampling can be used as a resource of decision and function problems that are computationally hard, and may thus have cryptographic applications. Expand
Boson Sampling with efficient scaling and efficient verification.
A universal quantum computer of moderate scale is not available yet, however intermediate models of quantum computation would still permit demonstrations of a quantum computational advantage overExpand
Partial distinguishability as a coherence resource in boson sampling
TLDR
The result shows that coherence is one of crucial resources for the computational time cost of boson sampling and presents an insight to understand the quantum complexity of the linear optical network system. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 16 REFERENCES
Quantum Computation and Quantum Information
Preface Acknowledgement Nomenclature and notation Part I. Fundamental Concepts: 1. Introduction and overview 2. Introduction to quantum mechanics 3. Introduction to computer science Part II. QuantumExpand
The Polynomial-Time Hierarchy
  • L. Stockmeyer
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1976
TLDR
The problem of deciding validity in the theory of equality is shown to be complete in polynomial-space, and close upper and lower bounds on the space complexity of this problem are established. Expand
Phys
  • Rev. A 85, 022332 (2012). PRL 113, 100502
  • 2014
Nat
  • Photonics 7, 540
  • 2013
Nat
  • Photonics 7, 545
  • 2013
Science 339
  • 794
  • 2013
Theory Comput
  • 9, 143
  • 2013
Phys
  • Rev. Lett. 104, 250503
  • 2010
Phys
  • Rev. Lett. 88, 097904
  • 2002
...
1
2
...