146 research outputs found
Almost-Euclidean subspaces of via tensor products: a simple approach to randomness reduction
It has been known since 1970's that the N-dimensional -space contains
nearly Euclidean subspaces whose dimension is . However, proofs of
existence of such subspaces were probabilistic, hence non-constructive, which
made the results not-quite-suitable for subsequently discovered applications to
high-dimensional nearest neighbor search, error-correcting codes over the
reals, compressive sensing and other computational problems. In this paper we
present a "low-tech" scheme which, for any , allows to exhibit nearly
Euclidean -dimensional subspaces of while using only
random bits. Our results extend and complement (particularly) recent work
by Guruswami-Lee-Wigderson. Characteristic features of our approach include (1)
simplicity (we use only tensor products) and (2) yielding "almost Euclidean"
subspaces with arbitrarily small distortions.Comment: 11 pages; title change, abstract and references added, other minor
change
From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking
The existence of quantum uncertainty relations is the essential reason that
some classically impossible cryptographic primitives become possible when
quantum communication is allowed. One direct operational manifestation of these
uncertainty relations is a purely quantum effect referred to as information
locking. A locking scheme can be viewed as a cryptographic protocol in which a
uniformly random n-bit message is encoded in a quantum system using a classical
key of size much smaller than n. Without the key, no measurement of this
quantum state can extract more than a negligible amount of information about
the message, in which case the message is said to be "locked". Furthermore,
knowing the key, it is possible to recover, that is "unlock", the message. In
this paper, we make the following contributions by exploiting a connection
between uncertainty relations and low-distortion embeddings of L2 into L1. We
introduce the notion of metric uncertainty relations and connect it to
low-distortion embeddings of L2 into L1. A metric uncertainty relation also
implies an entropic uncertainty relation. We prove that random bases satisfy
uncertainty relations with a stronger definition and better parameters than
previously known. Our proof is also considerably simpler than earlier proofs.
We apply this result to show the existence of locking schemes with key size
independent of the message length. We give efficient constructions of metric
uncertainty relations. The bases defining these metric uncertainty relations
are computable by quantum circuits of almost linear size. This leads to the
first explicit construction of a strong information locking scheme. Moreover,
we present a locking scheme that is close to being implementable with current
technology. We apply our metric uncertainty relations to exhibit communication
protocols that perform quantum equality testing.Comment: 60 pages, 5 figures. v4: published versio
Uncertainty Principles and Vector Quantization
Given a frame in C^n which satisfies a form of the uncertainty principle (as
introduced by Candes and Tao), it is shown how to quickly convert the frame
representation of every vector into a more robust Kashin's representation whose
coefficients all have the smallest possible dynamic range O(1/\sqrt{n}). The
information tends to spread evenly among these coefficients. As a consequence,
Kashin's representations have a great power for reduction of errors in their
coefficients, including coefficient losses and distortions.Comment: Final version, to appear in IEEE Trans. Information Theory.
Introduction updated, minor inaccuracies corrected
Quantum to Classical Randomness Extractors
The goal of randomness extraction is to distill (almost) perfect randomness
from a weak source of randomness. When the source yields a classical string X,
many extractor constructions are known. Yet, when considering a physical
randomness source, X is itself ultimately the result of a measurement on an
underlying quantum system. When characterizing the power of a source to supply
randomness it is hence a natural question to ask, how much classical randomness
we can extract from a quantum system. To tackle this question we here take on
the study of quantum-to-classical randomness extractors (QC-extractors). We
provide constructions of QC-extractors based on measurements in a full set of
mutually unbiased bases (MUBs), and certain single qubit measurements. As the
first application, we show that any QC-extractor gives rise to entropic
uncertainty relations with respect to quantum side information. Such relations
were previously only known for two measurements. As the second application, we
resolve the central open question in the noisy-storage model [Wehner et al.,
PRL 100, 220502 (2008)] by linking security to the quantum capacity of the
adversary's storage device.Comment: 6+31 pages, 2 tables, 1 figure, v2: improved converse parameters,
typos corrected, new discussion, v3: new reference
Almost Euclidean sections of the N-dimensional cross-polytope using O(N) random bits
It is well known that R^N has subspaces of dimension proportional to N on
which the \ell_1 norm is equivalent to the \ell_2 norm; however, no explicit
constructions are known. Extending earlier work by Artstein--Avidan and Milman,
we prove that such a subspace can be generated using O(N) random bits.Comment: 16 pages; minor changes in the introduction to make it more
accessible to both Math and CS reader
Non-additivity of Renyi entropy and Dvoretzky's Theorem
The goal of this note is to show that the analysis of the minimum output
p-Renyi entropy of a typical quantum channel essentially amounts to applying
Milman's version of Dvoretzky's Theorem about almost Euclidean sections of
high-dimensional convex bodies. This conceptually simplifies the
(nonconstructive) argument by Hayden-Winter disproving the additivity
conjecture for the minimal output p-Renyi entropy (for p>1).Comment: 8 pages, LaTeX; v2: added and updated references, minor editorial
changes, no content change
- …