Optimal algorithms achieve query complexities Θ(d/ε²) for incoherent access, Θ(d/ε) for coherent access, and Θ(√d/ε) for source-code access in quantum channel certification to unitary, exactly matching prior lower bounds.
A simple formula for the average gate fidelity of a quantum dynamical operation
2 Pith papers cite this work, alongside 578 external citations. Polarity classification is still indexing.
2
Pith papers citing it
578
external citations · Crossref
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
QCNN, QRNN, and QViT perform well on low-feature data but degrade on high-feature datasets, with QViT most robust to quantum noise and classical-style models better against adversarial noise.
citing papers explorer
-
Strict Hierarchy for Quantum Channel Certification to Unitary
Optimal algorithms achieve query complexities Θ(d/ε²) for incoherent access, Θ(d/ε) for coherent access, and Θ(√d/ε) for source-code access in quantum channel certification to unitary, exactly matching prior lower bounds.
-
A Comprehensive Analysis of Accuracy and Robustness in Quantum Neural Networks
QCNN, QRNN, and QViT perform well on low-feature data but degrade on high-feature datasets, with QViT most robust to quantum noise and classical-style models better against adversarial noise.