Classical boson sampling algorithms with superior performance to near-term experiments
- Submitting institution
-
University of Bristol
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 151812949
- Type
- D - Journal article
- DOI
-
10.1038/nphys4270
- Title of journal
- Nature Physics
- Article number
- -
- First page
- 1153
- Volume
- 13
- Issue
- 12
- ISSN
- 1745-2473
- Open access status
- Compliant
- Month of publication
- October
- Year of publication
- 2017
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
6
- Research group(s)
-
D - Fundamentals of Computing
- Citation count
- 76
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Showed that the general understanding of the size and complexity of devices that would outperform classical computers was wrong. Presented as part of a plenary talk at QIP2018, the leading theory quantum information conference, which means it is seen as being in the top 5 theory results in the field that year. This paper gave the first evidence that classically simulating Boson Sampling, one of the two main candidates for establishing so-called quantum computational supremacy, might be easier than had previously been thought. The result attracted considerable publicity, for example through Scott Aaronson's blog (https://www.scottaaronson.com/blog/).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
