• Editors' Suggestion

Complexity of simulating constant-depth BosonSampling

Daniel J. Brod
Phys. Rev. A 91, 042316 – Published 13 April 2015

Abstract

BosonSampling is a restricted model of quantum computation proposed recently, where a nonadaptive linear-optical network is used to solve a sampling problem that seems to be hard for classical computers. Here we show that, even if the linear-optical network has a constant number (greater than four) of beam splitter layers, the exact version of the BosonSampling problem is still classically hard, unless the polynomial hierarchy collapses to its third level. This is based on a similar result known for constant-depth quantum circuits and circuits of 2-local commuting gates (IQP).

  • Figure
  • Figure
  • Figure
  • Received 13 January 2015

DOI:https://doi.org/10.1103/PhysRevA.91.042316

©2015 American Physical Society

Authors & Affiliations

Daniel J. Brod*

  • Perimeter Institute for Theoretical Physics, 31 Caroline Street North, Waterloo, Ontario, N2L 2Y5, Canada

  • *dbrod@perimeterinstitute.ca

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 91, Iss. 4 — April 2015

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×