Andris Ambainis, Adam Smith. Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption. In Klaus Jansen, Sanjeev Khanna, José D. P. Rolim, Dana Ron, editors, Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Compu. Volume 3122 of Lecture Notes in Computer Science, pages 249-260, Springer, 2004. [doi]
@inproceedings{AmbainisS04,
title = {Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption},
author = {Andris Ambainis and Adam Smith},
year = {2004},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3122&spage=249},
researchr = {https://researchr.org/publication/AmbainisS04},
cites = {0},
citedby = {0},
pages = {249-260},
booktitle = {Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Compu},
editor = {Klaus Jansen and Sanjeev Khanna and José D. P. Rolim and Dana Ron},
volume = {3122},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-22894-2},
}