Pith. sign in

REVIEW 1 cited by

Optimal quantum control with digitized 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 1911.12259 v1 pith:XKQM3YD3 submitted 2019-11-25 quant-ph

classification quant-ph
keywords quantumoptimalannealingcontroldigitizedalgorithmsallowedantiferromagnetic
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We show how a digitized version of Quantum Annealing can be made optimal, realizing the best possible solution allowed by quantum mechanics in the shortest time, without any prior knowledge on the location and properties of the spectral gap. Our findings elucidate the intimate relation between digitized-QA, optimal Quantum Control, and recently proposed hybrid quantum-classical variational algorithms for quantum-state preparation and optimization. We illustrate this on the simple benchmark problem of an unfrustrated antiferromagnetic Ising chain in a transverse field.

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. Parity Mapping for Quantum Optimization on Frustrated Ising Rings

    quant-ph 2026-08 conditional novelty 7.0 of 10

    On the frustrated Ising ring, parity-encoded QAOA prepares the exact ground state with a system-size-independent number of layers when local fields are distinct, while parity quantum annealing only halves the exponent...

Pith tools