Single-query quantum algorithms for symmetric problems

Given a unitary representation of a finite group on a finite-dimensional Hilbert space, we show how to find a state whose translates under the group are distinguishable with the highest probability. We apply this to several quantum oracle problems, including the GROUP MULTIPLICATION problem, in which the product of an ordered n-tuple of group elements is to be determined by querying elements of the tuple. For any finite group G, we give an algorithm to find the product of two elements of G with a single quantum query with probability 2/|G|. This generalizes Deutsch’s Algorithm from Z2 to an arbitrary finite group. We further prove that this algorithm is optimal. We also introduce the HIDDEN CONJUGATING ELEMENT PROBLEM, in which the oracle acts by conjugating by an unknown element of the group. We show that for many groups, including dihedral and symmetric groups, the unknown element can be determined with probability 1 using a single quantum query.

[1]  M. Izutsu,et al.  Quantum channels showing superadditivity in classical capacity , 1998, quant-ph/9801012.

[2]  Ronald de Wolf,et al.  Quantum lower bounds by polynomials , 2001, JACM.

[3]  Yuval Roichman.  Decomposition of the conjugacy representation of the symmetric groups , 1997 .

[4]  D. Passman,et al.  Character Theory of Finite Groups , 2010 .

[5]  Carl W. Helstrom,et al.  Detection Theory and Quantum Mechanics , 1967, Inf. Control..

[6]  Avital Frumkin.  Theorem about the conjugacy representation ofSn , 1986 .

[7]  Wim van Dam,et al.  Quantum Oracle Interrogation: Getting All Information for Almost Half the Price , 1999 .

[8]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[9]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[10]  William K. Wootters,et al.  A ‘Pretty Good’ Measurement for Distinguishing Quantum States , 1994 .

[11]  Umesh V. Vazirani,et al.  Quantum complexity theory , 1993, STOC.

[12]  M. Lax,et al.  On optimal quantum receivers for digital signal detection , 1970 .

[13]  R. Bhatia.  Positive Definite Matrices , 2007 .

[14]  K. L. Fields,et al.  On the conjugating representation of a finite group , 1975 .

[15]  Edward Formanek.  The conjugation representation and fusionless extensions , 1971 .

[16]  Yonina C. Eldar,et al.  Optimal detection of symmetric mixed quantum states , 2004, IEEE Transactions on Information Theory.

[17]  David A. Meyer,et al.  Multi-query Quantum Sums , 2011, TQC.

[18]  Yonina C. Eldar,et al.  On quantum detection and the square-root measurement , 2001, IEEE Trans. Inf. Theory.

[19]  David A. Meyer,et al.  Single query learning from abelian and non-abelian Hamming distance oracles , 2009, Chic. J. Theor. Comput. Sci..