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.
Optimal trace distance and fidelity estimations for pure quantum states
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
TMPG and RSPU algorithms using tripartite matching outperform benchmarks in QoS satisfaction, allocated subchannels, and spectral efficiency for multi-platoon groupcasting and unicasting.
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.
-
Sharing-oriented Resource Allocation for Multi-platoon's Groupcasting and Unicasting Communication based on the Transmission Reliability
TMPG and RSPU algorithms using tripartite matching outperform benchmarks in QoS satisfaction, allocated subchannels, and spectral efficiency for multi-platoon groupcasting and unicasting.