Separation of Orbits under Group Actions with an Application to Quantum Systems

Abstract. Motivated by the task to decide whether two quantum states are equally entangled we consider the orbits under the action of the group of all one-qubit operations. To investigate the orbit structure of this group of local unitary operations we propose to use methods from classical invariant theory as well as new results.Two approaches are presented. The first uses the orbit separation property of invariant rings to distinguish among nonequivalent quantum states. In this context we study the Molien series which describes the structure of the invariant ring as a graded ring. We give a closed formula for the Molien series of the group of one-qubit operations.Our second approach makes use of an equivalence relation, the so-called graph of the action, which relates two points iff they are on the same orbit. For finite groups which factor, are synchronous direct sums, or tensor products we analyze the structure of the graph of the action. This yields new algorithms for the computation of the graph of the action.

[1]  I. G. MacDonald,et al.  Symmetric functions and Hall polynomials , 1979 .

[2]  N. Sloane Error-Correcting Codes and Invariant Theory: New Applications of a Nineteenth-Century Technique , 1977 .

[3]  Bernd Sturmfels,et al.  Algorithms in invariant theory , 1993, Texts and monographs in symbolic computation.

[4]  Tonny A. Springer,et al.  Aktionen Reduktiver Gruppen auf Varietäten , 1989 .

[5]  B. Sturmfels Computational Synthetic Geometry , 1989 .

[6]  S. Lang Introduction to Algebraic Geometry , 1972 .

[7]  Richard P. Stanley,et al.  Invariants of finite groups and their applications to combinatorics , 1979 .

[8]  Martin Rötteler,et al.  Computing local invariants of qubit systems , 1998 .

[9]  D. Mumford,et al.  Geometric Invariant Theory , 2011 .

[10]  Richard Brauer,et al.  On Algebras Which are Connected with the Semisimple Continuous Groups , 1937 .

[11]  Eric M. Rains Polynomial invariants of quantum codes , 2000, IEEE Trans. Inf. Theory.

[12]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[13]  R. Goodman,et al.  Representations and Invariants of the Classical Groups , 1998 .

[14]  David A. Cox,et al.  Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics) , 2007 .

[15]  Thomas Beth,et al.  Gröbner Bases and Applications: An application of Gröbner Bases to the Decomposition of Rational Mappings , 1998 .

[16]  Theo de Jong,et al.  Gröbner Bases and Applications: Gröbner Bases and Invariant Theory , 1998 .