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

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 2006, Issue , 2006, Pages 274-287

  Sen, Pranab ^a  

^a NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE ELEMENT METHOD; FOURIER TRANSFORMS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; RANDOM PROCESSES; VARIATIONAL TECHNIQUES;

FROBENIUS DISTANCE; HIDDEN SUBGROUP PROBLEM; QUANTUM STATE DISTINCTION; UNIVERSAL CONSTANT TIMES;

RANDOM VARIABLES;

EID: 34247498307     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2006.37     Document Type: Conference Paper

References (24)

1. D. Bacon, A. Childs, and W. van Dam. 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, 2005. Also arxiv preprint quant-ph/0504083.
2. D. Bacon, A. Childs, and W. van Dam. Optimal measurements for the dihedral hidden subgroup problem. Arxiv preprint quant-ph/0501044, 2005.
3. H. Barnum and E. Knill. Reversing quantum dynamics with near-optimal quantum and classical fidelity. Journal of Mathematical Physics, 43(5):2097-2106, 2002. Also quant-ph/0004088.
4. M. Ettinger and P. Høyer. On quantum algorithms for noncommutative hidden subgroups. Advances in Applied Mathematics, 25(3):239-251, 2000.
5. J. Emerson, E. Livine, and S. Lloyd. Convergence conditions for random quantum circuits. Arxiv preprint quant-ph/0503210,2005.
6. J. Emerson, Y. Weinstein, M. Saraceno, S. Lloyd, and D. Cory. Pseudo-random unitary operators for quantum information processing. Science, 302:2098-2100, 2003.
7. W. Feller. Probability Theory and its Applications, volume 2. John Wiley and Sons, 1971.
8. M. Grigni, L. Schulman, M. Vazirani, and U. Vazirani. Quantum mechanical algorithms for the nonabelian hidden subgroup problem. Combinatorica, pages 137-154, 2004.
9. G. Gutoski and J. Watrous. 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, pages 605-616. Springer-Verlag, 2005. Also arxiv preprint cs.CC/0412102.
10. S. Hallgren, A. Russell, and A. Ta-Shma. The hidden subgroup problem and quantum computation using group representations. SIAM Journal on Computing, 32(4):916-934, 2003.
11. P. Hausladen and W. Wootters. A 'pretty good' measurement for distinguishing quantum states. Journal of Modern Optics, 41:2385-2390, 1994.
12. A. Harrow and A. Winter. Personal communication, March 2006.
13. R. Jain. Distinguishing sets of quantum states. Arxiv preprint quant-ph/0506205, 2005.
14. J. Matoušek. Lectures on Discrete Geometry. Graduate Texts in Mathematics. Springer-Verlag, 2002.
15. M. Mehta. Random matrices. Academic Press, 2004.
16. C. Moore and A. Russell. For distinguishing conjugate hidden subgroups, the pretty good measurement is as good as it gets. Arxiv preprint quant-ph/0501177, 2005.
17. C. Moore, D. Rockmore, A. Russell, and L. Schulman. 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, pages 1113-1122, 2004. Journal version in preparation. Also arxiv preprint quant-ph/0503095.
18. C. Moore, A. Russell, and L. Schulman. The symmetric group defies strong Fourier sampling. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pages 479-488, 2005. Also arxiv preprint quant-ph/0501056.
19. M. Nielsen and I. Chuang. Quantum computation and quantum information. Cambridge University Press, 2000.
20. J. Radhakrishnan, M. Rötteler, and P. Sen. 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, pages 1399-1411. Springer-Verlag, 2005. Also arxiv preprint quant-ph/0503114.
21. J-P. Serre. Linear representations of finite groups. Graduate Texts in Mathematics. Springer-Verlag, 1977.
22. I. Shiganov. Refinement of the upper bound of the constant in the central limit theorem. Journal of Soviet Mathematics, pages 2545-2550, 1986.
23. P. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5): 1484-1509, 1997.
24. B. Tsirelson. Gaussian measures and Gaussian processes. Lecture 3. Available at http://www.tau.ac.il/~tsirel/Courses/Gaussian/syllabus.html, 2005.