Fetching the paper…
Reading the bibliography…
The existence of quantum uncertainty relations is the essential reason that some classically impossible cryptographic primitives become possible when quantum communication is allowed.
Über den anschaulichen Inhalt der quantentheoretischen Kinematik und Mechanik
Heisenberg, W · 1927
Earlier work this paper cites.
The uncertainty principle
Robertson, H. P · 1929
Earlier work this paper cites.
Exposé de la théorie des chaınes simples constantes de markov á un nombre fini d’états
Doeblin, W · 1938
Earlier work this paper cites.
Some results on convex bodies and Banach spaces
Dvoretzky, A · 1961
Earlier work this paper cites.
New proof of the theorem of A. Dvoretzky on intersections of convex bodies
Milman, V. D · 1971
Earlier work this paper cites.
A continuity property of the entropy density for spin lattice systems
Fannes, M · 1973
Earlier work this paper cites.
Uncertainty relations for information entropy in wave mechanics
Bialynicki-Birula, I · 1975
Earlier work this paper cites.
The dimension of almost spherical sections of convex bodies
Figiel, T · 1977
Earlier work this paper cites.
Sections of some finite dimensional sets and classes of smooth functions
Kashin, B · 1977
Earlier work this paper cites.
Uncertainty in quantum measurements
Deutsch, D · 1983
Earlier work this paper cites.
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H · 1984
Earlier work this paper cites.
Unconditional security from noisy quantum storage
König, R · 1984
Earlier work this paper cites.
Asymptotic theory of finite dimensional normed spaces
Milman, V. D · 1986
Earlier work this paper cites.
Ramanujan graphs
Lubotzky, A · 1988
Earlier work this paper cites.
Generalized entropic uncertainty relations
Maassen, H · 1988
Earlier work this paper cites.
Identification via channels
Ahlswede, R · 1989
Earlier work this paper cites.
Pseudo-random generation from one-way functions
Impagliazzo, R · 1989
Earlier work this paper cites.
The volume of convex bodies and Banach space geometry
Pisier, G · 1989
Earlier work this paper cites.
Optimal state-determination by mutually unbiased measurements
Wootters, W. K · 1989
Earlier work this paper cites.
New algorithms for finding irreducible polynomials over finite fields
Shoup, V · 1990
Earlier work this paper cites.
Searching for primitive roots in finite fields
Shoup, V · 1992
Earlier work this paper cites.
Mixed-state entanglement and quantum error correction
Bennett, C. H · 1996
Earlier work this paper cites.
An elementary introduction to modern convex geometry
Ball, K · 1997
Earlier work this paper cites.
Tiny families of functions with random properties: A quality-size trade-off for hashing
Goldreich, O · 1997
Earlier work this paper cites.
Communication Complexity
Kushilevitz, E · 1997
Earlier work this paper cites.
Is quantum bit commitment really possible?
Lo, H. K · 1997
Earlier work this paper cites.
Unconditionally secure quantum bit commitment is impossible
Mayers, D · 1997
Earlier work this paper cites.
Randomness-optimal oblivious sampling
Zuckerman, D · 1997
Earlier work this paper cites.
Extracting all the randomness and reducing the error in Trevisan’s extractors
Raz, R · 1999
Earlier work this paper cites.
Modern computer algebra
von zur Gathen, J · 1999
Cited alongside, same era.
Private quantum channels
Ambainis, A · 2000
Cited alongside, same era.
Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors
Reingold, O · 2000
Cited alongside, same era.
Quantum fingerprinting
Buhrman, H · 2001
Cited alongside, same era.
The concentration of measure phenomenon
Ledoux, M · 2001
Cited alongside, same era.
Degrees of concealment and bindingness in quantum bit commitment protocols
Spekkens, R. W · 2001
Cited alongside, same era.
Lectures on discrete geometry
Matoušek, J · 2002
A tight high-order entropic quantum uncertainty relation with applications
Damgård, I · 2007
Later among the works it cites.
Uncertainty principles, extractors, and explicit embeddings of L2 into L1
Indyk, P · 2007
Later among the works it cites.
Small accessible quantum information does not imply security
König, R · 2007
Later among the works it cites.
The unified theory of pseudorandomness: guest column
Vadhan, S · 2007
Later among the works it cites.
Possibility, impossibility, and cheat sensitivity of quantum-bit string commitment
Buhrman, H · 2008
Later among the works it cites.
Computational complexity: a conceptual perspective
Goldreich, O · 2008
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
How to fool an unbounded adversary with a short key
Russell, A · 2002
Cited alongside, same era.
Recent developments in explicit constructions of extractors
Shaltiel, R · 2002
Cited alongside, same era.
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
Ambainis, A · 2004
Cited alongside, same era.
On the key-uncertainty of quantum ciphers and the computational security of one-way quantum transmission
Damgård, I · 2004
Cited alongside, same era.
Locking classical correlations in quantum states
DiVincenzo, D. P · 2004
Cited alongside, same era.
Almost Euclidean subspaces of ℓ N 1 via expander codes
Guruswami, V · 2008
Later among the works it cites.
Counterexamples to the maximal p p -norm multiplicativity conjecture for all p > 1 p>1
Hayden, P · 2008
Later among the works it cites.
Exact and approximate unitary 2-designs and their application to fidelity estimation
Dankert, C · 2009
Later among the works it cites.
Entropic security in quantum cryptography
Desrosiers, S. P · 2009
Later among the works it cites.
Unbalanced expanders and randomness extractors from Parvaresh–Vardy codes
Guruswami, V · 2009
Later among the works it cites.
Superadditivity of communication capacity using entangled inputs
Hastings, M. B · 2009
Later among the works it cites.
A survey on locking of bipartite correlations
Leung, D · 2009
Later among the works it cites.
Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem
Radhakrishnan, J · 2009
Later among the works it cites.
Limits on entropic uncertainty relations
Ambainis, A · 2010
Closest in time.
Nonadditivity of Rényi entropy and Dvoretzky’s theorem
Aubrun, G · 2010
Closest in time.
Quantum entropic security and approximate quantum encryption
Desrosiers, S. P · 2010
Closest in time.
A decoupling approach to quantum information theory
Dupuis, F · 2010
Closest in time.
Locking classical information
Dupuis, F · 2010
Closest in time.
A nullspace analysis of the nuclear norm heuristic for rank minimization
Dvijotham, K · 2010
Closest in time.
Quantum Fingerprints that Keep Secrets
Gavinsky, D · 2010
Closest in time.
Limitations of quantum coset states for graph isomorphism
Hallgren, S · 2010
Closest in time.
Almost-euclidean subspaces of ℓ 1 n \ell_{1}^{n} via tensor products: A simple approach to randomness reduction
Indyk, P · 2010
Closest in time.
Entropic uncertainty relations—a survey
Wehner, S · 2010
Closest in time.
Hastings’s Additivity Counterexample via Dvoretzky’s Theorem
Aubrun, G · 2011
Closest in time.
Uncertainty relation for smooth entropies
Tomamichel, M · 2011
Closest in time.
Quantum to classical randomness extractors
Berta, M · 2012
Closest in time.
Weak decoupling duality and quantum identification
Hayden, P · 2012
Closest in time.
Tight finite-key analysis for quantum cryptography
Tomamichel, M · 2012
Closest in time.