Pith. sign in

REVIEW 1 cited by

Uncertain fate of fair sampling in quantum annealing

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 1806.06081 v3 pith:XRYTDHYD submitted 2018-06-15 quant-ph cond-mat.dis-nn

classification quant-phcond-mat.dis-nn
keywords quantumsamplingannealingdriverbeyondfairfieldshamiltonians
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Recently, it was demonstrated both theoretically and experimentally on the D-Wave quantum annealer that transverse-field quantum annealing does not find all ground states with equal probability. In particular, it was proposed that more complex driver Hamiltonians beyond transverse fields might mitigate this shortcoming. Here, we investigate the mechanisms of (un)fair sampling in quantum annealing. While higher-order terms can improve the sampling for selected small problems, we present multiple counterexamples where driver Hamiltonians that go beyond transverse fields do not remove the sampling bias. Using perturbation theory we explain why this is the case. In addition, we present large-scale quantum Monte Carlo simulations for spin glasses with known degeneracy in two space dimensions and demonstrate that the fair-sampling performance of quadratic driver terms is comparable to standard transverse-field drivers. Our results suggest that quantum annealing machines are not well suited for sampling applications, unless post-processing techniques to improve the sampling are applied.

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. A quantum algorithm to count weighted ground states of classical spin Hamiltonians

    quant-ph 2019-08 reject novelty 7.0 of 10

    A modified AQO and QAOA for weighted ground-state counting is proposed, but factor errors in the estimator and inverted complexity scaling invalidate the claimed speedup.

Pith tools