Pith. sign in

REVIEW 1 cited by

Robust Quantum Control: Analysis & Synthesis via Averaging

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 2208.14193 v1 pith:JIPRAZHV submitted 2022-08-30 quant-ph cs.SYeess.SY

classification quant-phcs.SYeess.SY
keywords fidelitycontrolnominalrobustnessmeasurehighanalysisaveraging
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

An approach is presented for robustness analysis and quantum (unitary) control synthesis based on the classic method of averaging. The result is a multicriterion optimization competing the nominal (uncertainty-free) fidelity with a well known robustness measure: the size of an interaction (error) Hamiltonian, essentially the first term in the Magnus expansion of an interaction unitary. Combining this with the fact that the topology of the control landscape at high fidelity is determined by the null space of the nominal fidelity Hessian, we arrive at a new two-stage algorithm. Once the nominal fidelity is sufficiently high, we approximate both the nominal fidelity and robustness measure as quadratics in the control increments. An optimal solution is obtained by solving a convex optimization for the control increments at each iteration to keep the nominal fidelity high and reduce the robustness measure. Additionally, by separating fidelity from the robustness measure, more flexibility is available for uncertainty modeling.

Discussion (0). Sign in 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 Fundamental Bound for Robust Quantum Gate Control

    quant-ph 2025-07 conditional novelty 5.0 of 10

    For any gate realizable in an ideal model, Theorem 1 bounds the worst-case fidelity from below by a function of only the gate time and an aggregate uncertainty frequency.

Pith tools