Probably approximately correct quantum source coding - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2022

Probably approximately correct quantum source coding

Armando Angrisani
Brian Coyle
  • Fonction : Auteur
Elham Kashefi

Résumé

Information-theoretic lower bounds are often encountered in several branches of computer science, including learning theory and cryptography. In the quantum setting, Holevo's and Nayak's bounds give an estimate of the amount of classical information that can be stored in a quantum state. Previous works have shown how to combine information-theoretic tools with a counting argument to lower bound the sample complexity of distribution-free quantum probably approximately correct (PAC) learning. In our work, we establish the notion of Probably Approximately Correct Source Coding and we show two novel applications in quantum learning theory and delegated quantum computation with a purely classical client. In particular, we provide a lower bound of the sample complexity of a quantum learner for arbitrary functions under the Zipf distribution, and we improve the security guarantees of a classically-driven delegation protocol for measurement-based quantum computation (MBQC).

Mots clés

Dates et versions

hal-03509335 , version 1 (04-01-2022)

Identifiants

Citer

Armando Angrisani, Brian Coyle, Elham Kashefi. Probably approximately correct quantum source coding. 2022. ⟨hal-03509335⟩
93 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More