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
3 Pith papers cite this work, alongside 578 external citations. Polarity classification is still indexing.
3
Pith papers citing it
578
external citations · Crossref
citation-role summary
method 1
citation-polarity summary
fields
quant-ph 3years
2026 3verdicts
UNVERDICTED 3roles
method 1polarities
use method 1representative citing papers
A co-design method for frequency allocation and noise-aware transpilation in tunable-coupler quantum systems yields 8.9% lower log-infidelity cost and 6.8% shorter circuits than SABRE on SNAIL architectures.
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.
-
Fidelity-Aware Frequency Allocation and Transpilation Co-Design for Tunable Coupler Quantum Systems
A co-design method for frequency allocation and noise-aware transpilation in tunable-coupler quantum systems yields 8.9% lower log-infidelity cost and 6.8% shorter circuits than SABRE on SNAIL architectures.
-
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.