Pith. sign in

REVIEW 1 cited by

Quantum algorithms for simulated annealing

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 1512.03806 v2 pith:BNKQYLPB submitted 2015-12-11 quant-ph

Sergio Boixo , Rolando D. Somma This is my paper · ORCID
classification quant-ph
keywords quantumannealingalgorithmclassicalsimulatedalgorithmsassociatedcomplexity
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper summarizes a quantum algorithm of [R.D. Somma, et.al., Phys. Rev. Lett. 101, 130504 (2008)] that simulates a classical annealing process for solving discrete optimization problems. The complexity of the quantum algorithm scales with the inverse square root of the spectral gap of an associated stochastic matrix. This represents a quadratic quantum speedup, in terms of the gap, with respect to classical simulated annealing.

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. Quantum algorithm for estimating volumes of convex bodies

    quant-ph 2019-08 accept novelty 8.0 of 10

    A quantum algorithm estimates the volume of an n-dimensional convex body within error epsilon using O-tilde(n^3 + n^2.5/epsilon) membership queries, the first quantum speedup for this task.

Pith tools