Strong converse for identification via quantum channels

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

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

81P68: Quantum computation

94A60: Cryptography

81P99: Foundations, quantum information and its processing, quantum axioms, and philosophy

Related Items

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