Pith. sign in

REVIEW 1 cited by

Boson Sampling from Gaussian States

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1305.4346 v3 pith:AL57PZXY submitted 2013-05-19 quant-ph

classification quant-ph
keywords problembosonclassicalcomputersevidencegaussianopticalprocessor
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We pose a generalized 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 Gaussian input states, a linear optical network and non-adaptive photon counting measurements. All the elements required to build such a processor currently exist. The demonstration of such a device would provide the first empirical evidence that quantum computers can indeed outperform classical computers and could lead to applications.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Generalized Cross-Entropy Benchmarking for Random Circuits with Ergodicity

    quant-ph 2025-02 conditional novelty 5.0 of 10

    Random circuits satisfy an ergodicity condition for positive-coefficient polynomials, and its deviation can benchmark quantum chip fidelity, recovering and generalizing linear cross-entropy benchmarking.

Pith tools