Inefficiency and classical communication bounds for conversion between partially entangled pure bipartite quantum states.
Ben FortescueHoi-Kwong LoPublished in: ISIT (2005)
Keyphrases
- quantum computation
- lower bound
- upper bound
- quantum mechanics
- communication networks
- state information
- bipartite graph
- state variables
- communication protocol
- instant messaging
- lower and upper bounds
- communication technologies
- graph model
- error bounds
- information sharing
- learning algorithm
- vc dimension
- communication systems
- upper and lower bounds
- communication cost
- worst case
- quantum inspired
- optimal solution