Details
| Original language | English |
|---|---|
| Title of host publication | IEEE International Symposium on Information Theory |
| Subtitle of host publication | ISIT 2024 - Proceedings |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 2921-2926 |
| Number of pages | 6 |
| ISBN (electronic) | 9798350382846 |
| ISBN (print) | 979-8-3503-8285-3 |
| Publication status | Published - 7 Jul 2024 |
| Event | 2024 IEEE International Symposium on Information Theory, ISIT 2024 - Athens, Greece Duration: 7 Jul 2024 → 12 Jul 2024 |
Abstract
Quantum state discrimination is an important problem in many information processing tasks. In this work we are concerned with finding the best possible sample complexity when the states are preprocessed by a quantum channel that is required to be locally differentially private. We give achievability and converse bounds that nearly match the best known classical bounds. On the way, we prove several novel inequalities between quantum divergences that should be of independent interest.
ASJC Scopus subject areas
- Mathematics(all)
- Theoretical Computer Science
- Computer Science(all)
- Information Systems
- Mathematics(all)
- Modelling and Simulation
- Mathematics(all)
- Applied Mathematics
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
IEEE International Symposium on Information Theory: ISIT 2024 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2024. p. 2921-2926.
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
T1 - Sample Complexity of Locally Differentially Private Quantum Hypothesis Testing
AU - Cheng, Hao Chung
AU - Hirche, Christoph
AU - Rouzé, Cambyse
N1 - Publisher Copyright: © 2024 IEEE.
PY - 2024/7/7
Y1 - 2024/7/7
N2 - Quantum state discrimination is an important problem in many information processing tasks. In this work we are concerned with finding the best possible sample complexity when the states are preprocessed by a quantum channel that is required to be locally differentially private. We give achievability and converse bounds that nearly match the best known classical bounds. On the way, we prove several novel inequalities between quantum divergences that should be of independent interest.
AB - Quantum state discrimination is an important problem in many information processing tasks. In this work we are concerned with finding the best possible sample complexity when the states are preprocessed by a quantum channel that is required to be locally differentially private. We give achievability and converse bounds that nearly match the best known classical bounds. On the way, we prove several novel inequalities between quantum divergences that should be of independent interest.
UR - http://www.scopus.com/inward/record.url?scp=85202869645&partnerID=8YFLogxK
U2 - 10.48550/arXiv.2406.18658
DO - 10.48550/arXiv.2406.18658
M3 - Conference contribution
AN - SCOPUS:85202869645
SN - 979-8-3503-8285-3
SP - 2921
EP - 2926
BT - IEEE International Symposium on Information Theory
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2024 IEEE International Symposium on Information Theory, ISIT 2024
Y2 - 7 July 2024 through 12 July 2024
ER -