Quantum Computing: Coset Products & Symmetric Subgroups

Brendan Pawlowski and colleagues have classified pairs of elements within compact Lie groups, a mathematical pursuit with surprising relevance to quantum computing. A necessary condition for all simply connected groups is now established, alongside a complete classification for SU(n) groups, excluding one specific case. The findings advance understanding of symmetric subgroups and offer potential applications to optimising gate decompositions, a key element for building more efficient quantum algorithms.

Element pairings within SU(n) Lie groups are fully classified barring a specific symmetric subgroup

Complete classifications are now available for SU(n) Lie groups, except the type AIII case where the symmetric subgroup K is S(U(p) × U(n-p)) with p = n/2. Prior attempts to fully map element pairings under defined symmetry conditions were unsuccessful, making this a key advance. Element pairings within SU(n) Lie groups are fully classified, barring this specific symmetric subgroup. Pairs of elements U and V satisfying KUKVK = G are now fully characterised for all symmetric subgroups except the AIII case with p = n/2, offering a refined understanding of double cosets. This classification applies to all such subgroups, excluding the specific AIII type where K is S(U(p) × U(n-p)) with p equal to n/2, which remains an open problem. Explicit conditions are detailed; for type AI involutions, both U and V must possess characteristic polynomials of xn + (−1)n, while type AII requires polynomials of (xn/2+ (−1)n/2)2. These mathematical structures connect to quantum computing, specifically gate decompositions where unitaries can be expressed as products of simpler gates like the controlled-not (CNOT) gate or the Berkeley gate, though a practical, scalable implementation for complex quantum circuits remains elusive.

The core of this research lies in the classification of pairs (x, y) within a compact, connected Lie group G, subject to the condition K x K y K = G, where K represents a symmetric subgroup. This equation defines a specific relationship between the elements x and y, and understanding these pairings is crucial for several reasons. Lie groups are fundamental in describing symmetries in physical systems, and compact Lie groups, in particular, have well-defined topological properties. The symmetric subgroup K imposes further constraints, effectively defining a ‘symmetry’ within the larger group G. The equation K x K y K = G can be interpreted as a statement about the ‘reachability’ of elements within G via the action of K; it determines how much of the group can be accessed by combining elements x and y under the influence of the symmetry K. The concept of ‘double cosets’, sets of the form K x K’, arises naturally in this context, and the classification provides a detailed understanding of their structure. A necessary condition has been established that applies to all simply connected Lie groups, providing a foundational constraint for any such classification problem. This condition, while not sufficient to fully determine the pairings, significantly narrows down the possibilities and provides a starting point for more specific analyses.

The researchers focused specifically on the SU(n) group, the special unitary group of dimension n, which is a cornerstone of quantum mechanics and quantum information theory. Within SU(n), they considered various symmetric subgroups K, categorised by their structure. The type AI involutions, characterised by the polynomial condition xn + (−1)n, represent reflections across certain subspaces. Type AII involutions, with the polynomial (xn/2+ (−1)n/2)2, represent more complex transformations. The classification details the specific conditions that U and V must satisfy for each type of K, allowing for a complete characterisation of the pairs (U, V) that meet the defining equation. However, the type AIII case, where K is S(U(p) × U(n-p)) with p = n/2, presents a significant challenge. This specific subgroup structure appears to require different analytical tools, and a complete classification remains an open problem. The difficulty stems from the intricate interplay between the U(p) and U(n-p) components within the symmetric subgroup, leading to a more complex double coset structure.

Lie group symmetry advances efficient quantum circuit design

Refined mathematical tools for understanding symmetry within Lie groups, complex structures describing transformations, have been developed, focusing on classifying element combinations under specific conditions. This provides a pathway towards optimising ‘gate decompositions’ in quantum computing, breaking down complex calculations into simpler, more manageable steps. The persistent challenge of the type AIII case, a specific configuration of symmetric subgroups, however, highlights a fundamental limitation.

The significance of this work extends beyond pure mathematics, finding applications in the field of quantum computing. Quantum algorithms often require complex unitary transformations to manipulate quantum states. Implementing these transformations directly on quantum hardware can be challenging due to limitations in the number of available qubits and the precision of quantum gates. ‘Gate decomposition’ addresses this challenge by expressing a complex unitary as a product of simpler, more readily implementable gates. The CNOT gate and the Berkeley gate are examples of such fundamental gates. The classification of element pairings within Lie groups provides a framework for systematically optimising this decomposition process. By understanding the symmetries inherent in the unitary transformation, it becomes possible to find decompositions that require fewer gates, reducing the overall complexity and error rate of the quantum circuit. This is particularly relevant for near-term quantum devices, where minimising circuit depth is crucial for achieving meaningful results.

This research builds upon existing techniques such as block-ZXZ decomposition, a method for decomposing single-qubit unitaries into a sequence of ZXZ gates. The new findings offer avenues for further optimisation and improved quantum processing. The refined understanding of SU(n) Lie groups under specific symmetry conditions, coupled with the established necessary condition for all simply connected Lie groups, delivers a powerful theoretical foundation. While the remaining AIII case prevents a fully general solution, this research offers new tools for optimising ‘gate decompositions’, breaking down complex quantum calculations into simpler steps, and thus potentially improving quantum algorithms. Future work will likely focus on tackling the AIII case and exploring the practical implications of these mathematical results for specific quantum algorithms and hardware platforms. The development of efficient algorithms for performing these classifications, particularly for large values of n, will also be crucial for realising the full potential of this research.

The researchers classified pairs of elements within Lie groups, establishing a necessary condition applicable to all simply connected groups and a complete classification for SU(n) groups with most symmetric subgroups. This matters because understanding the symmetries within unitary transformations allows for optimisation of ‘gate decomposition’ in quantum computing, a process of breaking down complex calculations into simpler steps. The findings build upon existing decomposition methods like block-ZXZ decomposition and provide a theoretical foundation for reducing the complexity and error rates of quantum circuits. Authors suggest future work will focus on resolving the remaining AIII case and exploring practical applications for quantum algorithms.