Pith. sign in

REVIEW 1 cited by

Structured singular value analysis for spintronics network information transfer control

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 1706.03247 v1 pith:U3AWPTG7 submitted 2017-06-10 quant-ph math.OC

classification quant-phmath.OC
keywords controlstructuredbiasfidelityinformationlawsnetworksensitivity
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Control laws for selective transfer of information encoded in excitations of a quantum network, based on shaping the energy landscape using time-invariant, spatially-varying bias fields, can be successfully designed using numerical optimization. Such control laws, already departing from classicality by replacing closed-loop asymptotic stability with alternative notions of localization, have the intriguing property that for all practical purposes they achieve the upper bound on the fidelity, yet the (logarithmic) sensitivity of the fidelity to such structured perturbation as spin coupling errors and bias field leakages is nearly vanishing. Here, these differential sensitivity results are extended to large structured variations using $\mu$-design tools to reveal a crossover region in the space of controllers where objectives usually thought to be conflicting are actually concordant.

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