Large Deviations in Quantum Information Theory
Problems of Information Transmission
Quantum privacy and quantum wiretap channels
Problems of Information Transmission
A Randomness-Efficient Sampler for Matrix-valued Functions and Applications
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales
Random Structures & Algorithms
Channel simulation with quantum side information
IEEE Transactions on Information Theory
Proceedings of the forty-second ACM symposium on Theory of computing
Fast SDP algorithms for constraint satisfaction problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Quantum and classical message protect identification via quantum channels
Quantum Information & Computation
Full length article: Approximation properties of certain operator-induced norms on Hilbert spaces
Journal of Approximation Theory
Low rank matrix-valued chernoff bounds and approximate matrix multiplication
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Large families of pseudorandom sequences of k symbols and their complexity: Part I
General Theory of Information Transfer and Combinatorics
Large families of pseudorandom sequences of k symbols and their complexity: part II
General Theory of Information Transfer and Combinatorics
Identification via quantum channels in the presence of prior correlation and feedback
General Theory of Information Transfer and Combinatorics
A Simpler Approach to Matrix Completion
The Journal of Machine Learning Research
Restricted strong convexity and weighted matrix completion: optimal bounds with noise
The Journal of Machine Learning Research
A matrix hyperbolic cosine algorithm and applications
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Loose laplacian spectra of random hypergraphs
Random Structures & Algorithms
Towards large scale continuous EDA: a random matrix theory perspective
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Secrecy results for compound wiretap channels
Problems of Information Transmission
Simple and deterministic matrix sketching
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Strong secrecy for multiple access channels
Information Theory, Combinatorics, and Search Theory
Identification via quantum channels
Information Theory, Combinatorics, and Search Theory
Bibliography of publications by Rudolf Ahlswede
Information Theory, Combinatorics, and Search Theory
| Hi-index | 754.90 |
We present a simple proof of the strong converse for identification via discrete memoryless quantum channels, based on a novel covering lemma. The new method is a generalization to quantum communication channels of Ahlswede's (1979, 1992) approach to classical channels. It involves a development of explicit large deviation estimates to the case of random variables taking values in self-adjoint operators on a Hilbert space. This theory is presented separately in an appendix, and we illustrate it by showing its application to quantum generalizations of classical hypergraph covering problems