Approximate randomization of Quantum states with fewer bits of key

AIP Conference Proceedings

Volumn 864, Issue , 2006, Pages 18-36

  Dickinson, Paul A ^a   Nayak, Ashwin ^a,b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b PERIMETER INSTITUTE FOR THEORETICAL PHYSICS   (Canada)

Author keywords

Almost uniform distribution; Approximate randomization; Encryption; Epsilon biased distribution; Key length; Lower bounds; Private key; Quantum cryptography; Quantum states; Stabilizer states

Indexed keywords

EID: 51749111737     PISSN: 0094243X     EISSN: 15517616     Source Type: Conference Proceeding    
DOI: 10.1063/1.2400876     Document Type: Conference Paper

References (15)

1. P. Hay den, D. Leung, P. W. Shor, and A. Winter, Communications in Mathematical Physics 250, 371-391 (2004).
2. A. Ambainis, and A. Smith, "Small Pseudo-Random Families of Matrices: Derandomizing Approximate Quantum Encryption," in Proceedings of RANDOM, 2004, pp. 249-260.
3. P. O. Boykin, and V. Roychowdhury, Physical Review A 67 (2003), article no. 042317.
4. A. Ambainis, M. Mosca, A. Tapp, and R. de Wolf, "Private Quantum channels," in Proceedings of the 41st Annual Symposium on Foundations of Computer Science, IEEE Press, Los Alamitos, CA, USA, 2000, pp. 547-553.
5. R. Jain, Resource requirements of private Quantum channels, Pre-print quant-ph/0507075, ArXiv. http://ArXiv.orge-printArchive, (2005).
6. A. Nayak, and P. Sen, Quantum Information and Computation, to appear. Also Technical Report quant-ph/0605041, ArXiv.org Preprint Archive, http: //www. arxiv.org/abs/quant-ph/, May 2006.
7. J. Naor, and M. Naor, SIAM Journal on Computing 22, 838-856 (1993).
8. I. Kerenidis, and D. Nagaj, Journal of Mathematical Physics, to appear. Also Technical Report quant-ph/0509169, ArXiv.org Preprint Archive, http : / /www. arxiv. org/abs/quant-ph/, September 2005.
9. N. Alon, O. Goldreich, J. Håstad, and R. Peralta, Random Structures and Algorithms 3, 289-304 (1992), addendum in Random Structures and Algorithms 4 (1993), pages 119-120.
10. V. Shoup, Removing Randomness from Computational Number Theory, Ph.D. thesis, University of Wisconsin, Madison, WI (1989), available at http://shoup.net/papers/
11. M. A. Nielsen, and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, UK, 2000.
12. J. Preskill, Quantum computation, Lecture Notes, available at http: //www.theorycaltech.edu/people/preskill/ph229/, California Institute of Technology, Pasadena, CA (1998).
13. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley Series in Computer Science and Information, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1974, 1st edn.
14. C. McDiarmid, Surveys in Combinatorics 141, 148-188 (1989), invited papers at the Twelfth British Combinatorial Conference.
15. N. Alon, On ε-biased random variables, manuscript.