Holevo
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Error Exponents for Quantum Packing Problems via An Operator Layer Cake Theorem
Announce Type: replace-cross Abstract: In this work, we prove a one-shot random coding bound for classical-quantum channel coding, a problem conjectured by Burnashev and Holevo in 1998. By choosing the optimal input distribution, the bound implies the optimal error exponent (i.e., the reliability function) of classical-quantum channels for rates above the critical rate, even in infinite-dimensional Hilbert spaces. Our result extends to various quantum packing-type problems, including...
Optimal quantum locally differentially private mechanisms in the high-privacy regime
arXiv:2605.27278v2 Announce Type: replace-cross Abstract: We optimize the trade-off between privacy and utility in the high-privacy regime. We adopt local differential privacy (LDP) and its quantum extension, quantum local differential privacy (QLDP), for privacy protection, and investigate utility functions including the Holevo information (which reduces to the mutual information in the classical case) and the error exponents in symmetric and asymmetric hypothesis testing. These utility...
Improved quantum processor logical error rates via correction and detection
Abstract Performing quantum algorithms for critical problems in physics and chemistry requires substantially lower error rates than the physical error rates of present quantum computers. Achieving such low logical error rates requires quantum error correction1,2 and physical error rates below a critical threshold value3,4,5,6,7,8. We experimentally demonstrate on a trapped-ion quantum charge-coupled device (QCCD)9,10 improvements in logical error rates ranging from 11× to 800× compared with...