Random measurement bases, quantum state distinction and applications to the hidden subgroup problem

Algorithmica (New York)

Volumn 55, Issue 3, 2009, Pages 490-516

  Radhakrishnan, Jaikumar ^b   Rötteler, Martin ^a   Sen, Pranab ^b  

^a NEC LABORATORIES AMERICA   (United States)

^b TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

Author keywords

Ensemble quantum state distinction; Frobenius distance; Gel'fand pairs; Hidden subgroup problem; Quantum algorithms; Quantum Fourier transforms; Random orthonormal measurement bases

Indexed keywords

ENSEMBLE QUANTUM STATE DISTINCTION; FROBENIUS DISTANCE; HIDDEN SUBGROUP PROBLEM; QUANTUM ALGORITHMS; QUANTUM FOURIER TRANSFORMS; RANDOM ORTHONORMAL MEASUREMENT BASES;

BINARY CODES; GELATION; GELS; PROBABILITY DISTRIBUTIONS; QUANTUM OPTICS; QUANTUM THEORY;

FOURIER TRANSFORMS;

EID: 67650692745     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-008-9231-x     Document Type: Article

References (28)

1. Ambainis, A., Emerson, J.: Quantum t-designs: t-wise independence in the quantum world. In: Proceedings of the 22nd Annual IEEE Conference on Computational Complexity, pp. 129-140 (2007). Also preprint at http://arxiv.org/abs/quant-ph/0701126 (Pubitemid 47485131)
2. Arora, S., Kannan, R.: Learning mixtures of arbitrary Gaussians. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 247-257 (2001)
3. Aharonov, D., Kitaev, A., Nisan, N.: Quantum circuits with mixed states. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 20-30 (1998)
4. Bacon, D., Childs, A., van Dam, W.: From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 469-478 (2005). Also preprint at http://arxiv.org/abs/ quant-ph/0504083 (Pubitemid 44375757)
5. Bacon, D., Childs, A., van Dam, W.: Optimal measurements for the dihedral hidden subgroup problem. Chic. J. Theor. Comput. Sci. 2 (2006). Also preprint at http://arxiv.org/abs/quant-ph/0501044
6. H. Barnum E. Knill 2002 Reversing quantum dynamics with near-optimal quantum and classical fidelity J. Math. Phys. 43 5 2097 2106 Also preprint at http://arxiv.org/abs/quant-ph/0004088
7. M. Ettinger P. Høyer 2000 On quantum algorithms for noncommutative hidden subgroups Adv. Appl. Math. 25 239 251 Also preprint at http://arxiv.org/abs/quant-ph/9807029
8. Ettinger, M., Høyer, P., Knill, E.: Hidden subgroup states are almost orthogonal. Preprint at http://arxiv.org/abs/quant-ph/9901034 (1999)
9. Feller, W.: Probability Theory and Its Applications, vol. 2. Wiley, New York (1971)
10. M. Grigni L. Schulman M. Vazirani U. Vazirani 2004 Quantum mechanical algorithms for the nonabelian hidden subgroup problem Combinatorica 24 1 137 154 (Pubitemid 38706506)
11. G. Gutoski J. Watrous 2005 Quantum interactive proofs with competing provers Proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science Lecture Notes in Computer Science 3404 Springer Berlin 605 616 Also preprint at http://arxiv.org/abs/cs.CC/0412102 Gutoski, G., Watrous, J.: Quantum interactive proofs with competing provers. In: Proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 3404, pp. 605-616. Springer, Berlin (2005). Also preprint at http://arxiv.org/abs/cs.CC/0412102 (Pubitemid 41241281)
12. S. Hallgren A. Russell A. Ta-Shma 2003 The hidden subgroup problem and quantum computation using group representations SIAM J. Comput. 32 4 916 934
13. P. Hausladen W. Wootters 1994 A 'pretty good' measurement for distinguishing quantum states J. Mod. Opt. 41 2385 2390
14. Harrow, A., Winter, A.: How many copies are needed for state discrimination? Preprint at http://arxiv.org/abs/quant-ph/0606131 (2006)
15. Jain, R.: Distinguishing sets of quantum states. Preprint at http://arxiv.org/abs/quant-ph/0506205 (2005)
16. G. Kuperberg 2006 Numerical cubature using error-correcting codes SIAM J. Numer. Anal. 44 897 907 Also preprint at http://arxiv.org/abs/math/0402047 (Pubitemid 47135907)
17. Matoušek, J.: Lectures on Discrete Geometry. Graduate Texts in Mathematics. Springer, Berlin (2002)
18. Mehta, M.: Random Matrices. Academic Press, San Diego (2004)
19. Moore, C., Russell, A.: For distinguishing conjugate hidden subgroups, the pretty good measurement is as good as it gets. Preprint at http://arxiv.org/abs/quant-ph/0501177 (2005)
20. Moore, C., Rockmore, D., Russell, A., Schulman, L.: The power of basis selection in Fourier sampling: hidden subgroup problems in affine groups. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1113-1122 (2004). Journal version in preparation, preprint at http://arxiv.org/abs/quant-ph/0503095
21. Moore, C., Russell, A., Schulman, L.: The symmetric group defies strong Fourier sampling. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 479-488 (2005). Also preprint at http://arxiv.org/abs/quant-ph/0501056 (Pubitemid 44375758)
22. Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
23. J. Radhakrishnan M. Rötteler P. Sen 2005 On the power of random bases in Fourier sampling: hidden subgroup problem in the Heisenberg group Proceedings of the 32nd International Colloquium on Automata, Languages and Programming Lecture Notes in Computer Science 3580 Springer Berlin 1399 1411 Also preprint at http://arxiv.org/abs/quant-ph/0503114 Radhakrishnan, J., Rötteler, M., Sen, P.: On the power of random bases in Fourier sampling: hidden subgroup problem in the Heisenberg group. In: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 3580, pp. 1399-1411. Springer, Berlin (2005). Also preprint at http://arxiv.org/abs/quant-ph/0503114 (Pubitemid 41436195)
24. Sen, P.: Random measurement bases, quantum state distinction and applications to the hidden subgroup problem. In: Proceedings of the 21st Annual IEEE Conference on Computational Complexity, pp. 274-287 (2006). Also preprint at http://arxiv.org/abs/quant-ph/0512085 (Pubitemid 46661597)
25. Serre, J.-P.: Linear Representations of Finite Groups. Graduate Texts in Mathematics. Springer, Berlin (1977)
26. I. Shiganov 1986 Refinement of the upper bound of the constant in the central limit theorem J. Sov. Math. 35 3 2545 2550
27. P. Shor 1997 Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer SIAM J. Comput. 26 5 1484 1509 (Pubitemid 127613100)
28. Tsirelson, B.: Gaussian measures and Gaussian processes. Lecture 3 of course notes available at http://www.tau.ac.il/~tsirel/Courses/Gaussian/ syllabus.html (2005)