Prior Entanglement, Message Compression and Privacy in Quantum Communication

Authors:
Rahul Jain;Jaikumar Radhakrishnan;Pranab Sen
Affiliations:
University of California at Berkeley;Tata Institute of Fundamental Research and Toyota Technological Institute;University of Waterloo
Venue:
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Year:
2005

Citing 0
Cited 8

Lower bounds for predecessor searching in the cell probe model

Journal of Computer and System Sciences
A property of quantum relative entropy with an application to privacy in quantum communication

Journal of the ACM (JACM)
A separation between divergence and Holevo information for ensembles

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
The communication complexity of correlation

IEEE Transactions on Information Theory
Optimal direct sum results for deterministic and randomized decision tree complexity

Information Processing Letters
A separation between divergence and holevo information for ensembles

Mathematical Structures in Computer Science
Strong direct product theorems for quantum communication and query complexity

Proceedings of the forty-third annual ACM symposium on Theory of computing
On the role of shared entanglement

Quantum Information & Computation

Quantified Score

Hi-index	0.06

Visualization

Abstract

We study the complexity of the isomorphism and automorphism problems for finite rings with unity. We show that both integer factorization and graph isomorphism reduce to the problem of counting automorphisms of rings. The problem is shown to be in the ...