Fetching the paper…
Reading the bibliography…
We initiate the study of computational entropy in the quantum setting.
A single quantum cannot be cloned
W. K. Wootters and W. H. Zurek · 1982
Earlier work this paper cites.
Quantum cryptography: Public key distribution and coin tossing
C. H. Bennett and G. Brassard · 1984
Earlier work this paper cites.
Matrix Analysis
Roger A. Horn and Charles R. Johnson, editors · 1986
Earlier work this paper cites.
Hard-core distributions for somewhat hard problems
Russell Impagliazzo · 1995
Earlier work this paper cites.
Optimal quantum cloning machines
Nicolas Gisin and Serge Massar · 1997
Earlier work this paper cites.
Adaptive game playing using multiplicative weights
Yoav Freund and Robert E Schapire · 1999
Earlier work this paper cites.
A pseudorandom generator from any one-way function
Johan Håstad, Russell Impagliazzo, Leonid A. Levin, and Michael Luby · 1999
Earlier work this paper cites.
Quantum Computation and Quantum Information
Michel A. Nielsen and Isaac L. Chuang · 2000
Earlier work this paper cites.
Extractors and pseudorandom generators
Luca Trevisan · 2001
Earlier work this paper cites.
Computational analogues of entropy
Boaz Barak, Ronen Shaltiel, and Avi Wigderson · 2003
Earlier work this paper cites.
Physically observable cryptography (extended abstract)
Silvio Micali and Leonid Reyzin · 2004
Earlier work this paper cites.
Polynomial time quantum computation with advice
Harumichi Nishimura and Tomoyuki Yamakami · 2004
Earlier work this paper cites.
Cryptography in the bounded quantum-storage model
Ivan Damgård, Serge Fehr, Louis Salvail, and Christian Schaffner · 2005
Earlier work this paper cites.
Quantum arthur—merlin games
Chris Marriott and John Watrous · 2005
Earlier work this paper cites.
Security of quantum key distribution
Renato Renner · 2005
Earlier work this paper cites.
Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
Renato Renner and Stefan Wolf · 2005
Earlier work this paper cites.
Synthesis of quantum logic circuits
V. V. Shende, S. S. Bullock, and I. L. Markov · 2005
Earlier work this paper cites.
Matrix exponentiated gradient updates for on-line learning and bregman projection
Koji Tsuda, Gunnar Rätsch, and Manfred K. Warmuth · 2005
Earlier work this paper cites.
Intrusion-resilient secret sharing
Stefan Dziembowski and Krzysztof Pietrzak · 2007
Earlier work this paper cites.
Conditional computational entropy, or toward separating pseudoentropy from compressibility
Chun-Yuan Hsiao, Chi-Jen Lu, and Leonid Reyzin · 2007
Earlier work this paper cites.
Efficient algorithms using the multiplicative weights update method
S. Kale · 2007
Earlier work this paper cites.
Fuzzy extractors: How to generate strong keys from biometrics and other noisy data
Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, and Adam D. Smith · 2008
Earlier work this paper cites.
Leakage-resilient cryptography
Stefan Dziembowski and Krzysztof Pietrzak · 2008
Earlier work this paper cites.
The primes contain arbitrarily long arithmetic progressions
Ben Green and Terence Tao · 2008
Earlier work this paper cites.
The bounded-storage model in the presence of a quantum adversary
Robert T. König and Barbara M. Terhal · 2008
Earlier work this paper cites.
Dense subsets of pseudorandom sets
Omer Reingold, Luca Trevisan, Madhur Tulsiani, and Salil P. Vadhan · 2008
Cited alongside, same era.
The primes contain arbitrarily long polynomial progressions
Terence Tao and Tamar Ziegler · 2008
Cited alongside, same era.
Composable security in the bounded-quantum-storage model
Stephanie Wehner and Jürg Wullschleger · 2008
Cited alongside, same era.
The uniform hardcore lemma via approximate bregman projections
Boaz Barak, Moritz Hardt, and Satyen Kale · 2009
Cited alongside, same era.
Are random pure states useful for quantum computation?
Michael J Bremner, Caterina Mora, and Andreas Winter · 2009
Cited alongside, same era.
Most quantum states are too entangled to be useful as computational resources
David Gross, Steve T Flammia, and Jens Eisert · 2009
Cited alongside, same era.
Trevisan’s extractor in the presence of quantum side information
Anindya De, Christopher Portmann, Thomas Vidick, and Renato Renner · 2012
Later among the works it cites.
A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
Benjamin Fuller, Adam O’Neill, and Leonid Reyzin · 2012
Later among the works it cites.
Computational entropy and information leakage
Benjamin Fuller and Leonid Reyzin · 2012
Later among the works it cites.
Quantum proofs of knowledge
Dominique Unruh · 2012
Later among the works it cites.
Introduction to the non-asymptotic analysis of random matrices
Roman Vershynin · 2012
Later among the works it cites.
Certifiable quantum dice: or, true random number generation secure against quantum adversaries
Umesh V. Vazirani and Thomas Vidick · 2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Inaccessible entropy
Iftach Haitner, Omer Reingold, Salil P. Vadhan, and Hoeteck Wee · 2009
Cited alongside, same era.
Parallel approximation of non-interactive zero-sum quantum games
R. Jain and J. Watrous · 2009
Cited alongside, same era.
The operational meaning of min- and max-entropy
Robert König, Renato Renner, and Christian Schaffner · 2009
Cited alongside, same era.
Tomography of quantum detectors
J. S. Lundeen, A. Feito, H. Coldenstrodt-Ronge, K. L. Pregnell, Ch. Silberhorn, T. C. Ralph, J. Eisert, M. B. Plenio, and I. A. Walmsley · 2009
Cited alongside, same era.
Computational differential privacy
Ilya Mironov, Omkant Pandey, Omer Reingold, and Salil P. Vadhan · 2009
Cited alongside, same era.
A leakage-resilient mode of operation
Krzysztof Pietrzak · 2009
Cited alongside, same era.
Later among the works it cites.
Characterizing pseudoentropy
Salil P. Vadhan and Colin Jia Zheng · 2012
Later among the works it cites.
Online variance minimization
Manfred K. Warmuth and Dima Kuzmin · 2012
Later among the works it cites.
How to construct quantum random functions
Mark Zhandry · 2012
Later among the works it cites.
Parallel approximation of min-max problems
Gus Gutoski and Xiaodi Wu · 2013
Later among the works it cites.
A counterexample to the chain rule for conditional HILL entropy - and what deniable encryption has to do with it
Stephan Krenn, Krzysztof Pietrzak, and Akshay Wadia · 2013
Later among the works it cites.
Modulus computational entropy
Maciej Skorski · 2013
Later among the works it cites.
A uniform min-max theorem with applications in cryptography
Salil P. Vadhan and Colin Jia Zheng · 2013
Later among the works it cites.
Physical randomness extractors
Kai-Min Chung, Yaoyun Shi, and Xiaodi Wu · 2014
Later among the works it cites.
How to fake auxiliary input
Dimitar Jetchev and Krzysztof Pietrzak · 2014
Later among the works it cites.
Carl A. Miller and Yaoyun Shi · 2014
Later among the works it cites.
A note on quantum security for post-quantum cryptography
Fang Song · 2014
Later among the works it cites.
Fully device independent quantum key distribution
Umesh Vazirani and Thomas Vidick · 2014
Later among the works it cites.
From weak to strong zero-knowledge and applications
Kai-Min Chung, Edward Lui, and Rafael Pass · 2015
Later among the works it cites.
A unified approach to deterministic encryption: New constructions and a connection to computational entropy
Benjamin Fuller, Adam O’Neill, and Leonid Reyzin · 2015
Later among the works it cites.
Quantum speedup of monte carlo methods
Ashley Montanaro · 2015
Later among the works it cites.
Epsilon-net method for optimizations over separable states
Yaoyun Shi and Xiaodi Wu · 2015
Later among the works it cites.
Efficient quantum pseudorandomness
Fernando GSL Brandão, Aram W Harrow, and Michał Horodecki · 2016
Later among the works it cites.
Leakage chain rule and superdense coding
Yi-Hsiu Chen, Kai-Min Chung, Ching-Yi Lai, and Xiaodi Wu · 2017
Closest in time.