DeepAI AI Chat
Log In Sign Up

Commitment capacity of classical-quantum channels

by   Masahito Hayashi, et al.
Southern University of Science & Technology
Indian Statistical Instiute, Kolkata

We study commitment scheme for classical-quantum channels. To accomplish this we define various notions of commitment capacity for these channels and prove matching upper and lower bound on it in terms of the conditional entropy. Our achievability (lower bound) proof is quantum generalisation of the work of one of the authors (arXiv:2103.11548) which studied the problem of secure list decoding and its application to bit-string commitment. The techniques we use in the proof of converse (upper bound) is similar in spirit to the techniques introduced by Winter, Nascimento and Imai (Cryptography and Coding 2003) to prove upper bound on the commitment capacity of classical channels. However, generalisation of this technique to the quantum case is not so straightforward and requires some new constructions, which can be of independent interest.


page 1

page 2

page 3

page 4


Unital Qubit Queue-channels: Classical Capacity and Product Decoding

Quantum queue-channels arise naturally in the context of buffering in qu...

On the Capacity of Waveform Channels Under Square-Law Detection of Time-Limited Signals

Capacity bounds for waveform channels under square-law detection of time...

Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings

The purpose of this article is to study the algorithmic complexity of th...

An Upper Bound for Wiretap Multi-way Channels

A general model for wiretap multi-way channels is introduced that includ...

No-go for quantum seals

We introduce the concept of a quantum "seal" and investigate its feasibi...

Mosaics of Combinatorial Designs for Semantic Security on Quantum Wiretap Channels

We study semantic security for classical-quantum channels. Our security ...

Tight List-Sizes for Oblivious AVCs under Constraints

We study list-decoding over adversarial channels governed by oblivious a...