Pith. sign in

Randomized Quantum Optimal Control

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Quantum optimal control (QOC) aims to find control functions that optimally steer a quantum system toward a target operation. We introduce a \emph{randomized} QOC framework where optimization is carried over an ensemble of control functions and their probabilities, instead of a single set of functions. Using this framework, we prove that randomized QOC can reach a target accuracy faster than any deterministic protocol under the same resource constraints. We also develop general symmetry-based constructions that convert a given control into an ensemble of controls that can systematically reduce the error. We benchmark these constructions for CNOT implementation and find that the resulting randomized protocol quadratically suppresses the error of the optimized deterministic solution. In addition, we introduce randomized GRAPE, which generalizes GRAPE to directly optimize control ensembles and their associated probabilities. Finally, as a related application, we discuss randomized boundary-pulse constructions {that enhance} robustness against coherent noise.

citation-role summary

background 1

citation-polarity summary

fields

quant-ph 1

years

2026 1

verdicts

ACCEPT 1

roles

background 1

polarities

unclear 1

representative citing papers

Randomized product formulas beyond optimal deterministic scaling

quant-ph · 2026-08-07 · accept · novelty 8.0

Randomized Trotter formulas achieve O(alpha^2) (and O(alpha^3) with a stronger oracle) error scaling for H=A+alpha B with only constant gate overhead, beating proven lower bounds for deterministic formulas.

citing papers explorer

Showing 1 of 1 citing paper.

  • Randomized product formulas beyond optimal deterministic scaling quant-ph · 2026-08-07 · accept · none · ref 26 · internal anchor

    Randomized Trotter formulas achieve O(alpha^2) (and O(alpha^3) with a stronger oracle) error scaling for H=A+alpha B with only constant gate overhead, beating proven lower bounds for deterministic formulas.