Upper bounds of a class of imperfect quantum sealing protocols
classification
🪐 quant-ph
keywords
betaboundsupperalphaleqslantprobabilityprotocolsquantum
read the original abstract
The model of the quantum protocols sealing a classical bit is studied. It is shown that there exist upper bounds on its security. For any protocol where the bit can be read correctly with the probability $\alpha $, and reading the bit can be detected with the probability $\beta $, the upper bounds are $% \beta \leqslant 1/2$ and $\alpha +\beta \leqslant 9/8$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.