pith. sign in

arxiv: quant-ph/0302108 · v1 · submitted 2003-02-13 · 🪐 quant-ph

The Quantumness of a Set of Quantum States

classification 🪐 quant-ph
keywords quantumstatesquantumnessalphabetapplicationsarisearticlebeen
0
0 comments X
read the original abstract

This article is an introduction to quant-ph/0302092. We propose to quantify how "quantum" a set of quantum states is. The quantumness of a set is the worst-case difficulty of transmitting the states through a classical communication channel. Potential applications of this measure arise in quantum cryptography, where one might like to use an alphabet of states most sensitive to quantum eavesdropping, and in lab demonstrations of quantum teleportation, where it is necessary to check that entanglement has indeed been used.

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.