Strong converse for identification via quantum channels

DOI10.1109/18.985947zbMath1071.94530arXivquant-ph/0012127OpenAlexW2134348739WikidataQ55954276 ScholiaQ55954276MaRDI QIDQ4544814

Andreas Winter

Publication date: 4 August 2002

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0012127

Mathematics Subject Classification ID

Quantum computation (81P68) Cryptography (94A60) Foundations, quantum information and its processing, quantum axioms, and philosophy (81P99)

Related Items (89)

The Araki-Lieb-Thirring inequality and the Golden-Thompson inequality in Euclidean Jordan algebras ⋮ Randomized numerical linear algebra: Foundations and algorithms ⋮ On Azuma-type inequalities for Banach space-valued martingales ⋮ Secure certification of mixed quantum states with application to two-party randomness generation ⋮ A Hoeffding inequality for Markov chains ⋮ On the Banach-Space-Valued Azuma Inequality and Small-Set Isoperimetry of Alon–Roichman Graphs ⋮ Convenient tail bounds for sums of random tensors ⋮ Improved recovery guarantees for phase retrieval from coded diffraction patterns ⋮ Relaxation schemes for the joint linear chance constraint based on probability inequalities ⋮ Dimension-free bounds for largest singular values of matrix Gaussian series ⋮ Secrecy results for compound wiretap channels ⋮ On some extensions of Bernstein's inequality for self-adjoint operators ⋮ Thin \(\text{II}_1\) factors with no Cartan subalgebras ⋮ Guarantees of Riemannian optimization for low rank matrix completion ⋮ Tensor Bernstein concentration inequalities with an application to sample estimators for high-order moments ⋮ Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity ⋮ On the stability and accuracy of least squares approximations ⋮ A theoretical study of COmpRessed SolvING for advection-diffusion-reaction problems ⋮ High-dimensional covariance matrix estimation with missing observations ⋮ Identification over quantum broadcast channels ⋮ Time-uniform Chernoff bounds via nonnegative supermartingales ⋮ Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points ⋮ Randomized algorithms in numerical linear algebra ⋮ Compressed sensing and matrix completion with constant proportion of corruptions ⋮ One-way protocol for two-bit intrinsic random key distribution with entangled photon pairs ⋮ On the distribution of random words in a compact Lie group ⋮ Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1. ⋮ Stable low-rank matrix recovery via null space properties ⋮ Learning functions of few arbitrary linear parameters in high dimensions ⋮ Noncommutative Bennett and Rosenthal inequalities ⋮ Random Quantum Codes from Gaussian Ensembles and an Uncertainty Relation ⋮ RIPless compressed sensing from anisotropic measurements ⋮ Von Neumann entropy penalization and low-rank matrix estimation ⋮ Four deviations suffice for rank 1 matrices ⋮ Unnamed Item ⋮ LSV-Based Tail Inequalities for Sums of Random Matrices ⋮ Sufficient ensemble size for random matrix theory-based handling of singular covariance matrices ⋮ Matrix concentration inequalities via the method of exchangeable pairs ⋮ On the spectra of general random mixed graphs ⋮ On the uniform convergence of empirical norms and inner products, with application to causal inference ⋮ Simultaneous transmission of classical and quantum information under channel uncertainty and jamming attacks ⋮ Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion ⋮ Spectral thresholding quantum tomography for low rank states ⋮ Random tensor theory: Extending random matrix theory to mixtures of random product states ⋮ Universal superposition codes: Capacity regions of compound quantum broadcast channel with confidential messages ⋮ Forecasting using random subspace methods ⋮ Concentration inequalities for matrix martingales in continuous time ⋮ Simplicial faces of the set of correlation matrices ⋮ Sub-Gaussian estimators of the mean of a random matrix with heavy-tailed entries ⋮ Multivariate trace inequalities ⋮ Strong Secrecy for Multiple Access Channels ⋮ Identification via Quantum Channels ⋮ The Golden-Thompson inequality: Historical aspects and random matrix applications ⋮ User-friendly tail bounds for sums of random matrices ⋮ Unnamed Item ⋮ Relevant sampling of band-limited functions ⋮ From Poincaré inequalities to nonlinear matrix concentration ⋮ Bernstein-type inequality for a class of dependent random matrices ⋮ The spectra of multiplicative attribute graphs ⋮ Optimal pointwise sampling for \(L^2\) approximation ⋮ Quantum data locking for high-rate private communication ⋮ Distillation of secret-key from a class of compound memoryless quantum sources ⋮ Frequent Directions: Simple and Deterministic Matrix Sketching ⋮ Concentration inequalities for random matrix products ⋮ Generating an equidistributed net on a sphere using random rotations ⋮ The locking-decoding frontier for generic dynamics ⋮ Adaptive Approximation by Optimal Weighted Least-Squares Methods ⋮ Solving Local Linear Systems with Boundary Conditions Using Heat Kernel Pagerank ⋮ Approximation properties of certain operator-induced norms on Hilbert spaces ⋮ Nonmalleable encryption of quantum information ⋮ Low Rank Estimation of Similarities on Graphs ⋮ Nonparametric estimation of low rank matrix valued function ⋮ An elementary analysis of ridge regression with random design ⋮ Random Schreier graphs and expanders ⋮ An achievable rate for private classical information over a quantum broadcast channel ⋮ Statistically efficient tomography of low rank states with incomplete measurements ⋮ Small-deviation inequalities for sums of random matrices ⋮ Universal coding for transmission of private information ⋮ Quantum privacy and quantum wiretap channels ⋮ Matrix concentration for products ⋮ Large families of pseudorandom sequences of k symbols and their complexity, Part II ⋮ Large families of pseudorandom sequences of k symbols and their complexity, Part I ⋮ Sparse learning via Boolean relaxations ⋮ Fast state tomography with optimal error bounds ⋮ Statistical analysis of compressive low rank tomography with random measurements ⋮ Loose laplacian spectra of random hypergraphs ⋮ Robust and computationally feasible community detection in the presence of arbitrary outlier nodes ⋮ Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem ⋮ T-square tensors. I: Inequalities

This page was built for publication: Strong converse for identification via quantum channels