Cartan Decomposition of SU(2^n), Constructive Controllability of Spin systems and Universal Quantum Computing

Abstract

In this paper we provide an explicit parameterization of arbitrary unitary transformation acting on n qubits, in terms of one and two qubit quantum gates. The construction is based on successive Cartan decompositions of the semi-simple Lie group, SU(2^n). The decomposition highlights the geometric aspects of building an arbitrary unitary transformation out of quantum gates and makes explicit the choice of pulse sequences for the implementation of arbitrary unitary transformation on $n coupled spins. Finally we make observations on the optimality of the design procedure.

17 Pages

References in corpus (1)

• Quantum Mechanics helps in searching for a needle in a haystack

Cited by in corpus (14)

• Training Schrödinger's cat: quantum optimal control
• Quantum Computation as Geometry
• The entanglement membrane in chaotic many-body systems
• Generalized Euler Angle Paramterization for SU(N)
• The Complexity Geometry of a Single Qubit
• Minimizing State Preparations in Variational Quantum Eigensolver by Partitioning into Commuting Families
• Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics
• An Introduction to Cartan's KAK Decomposition for QC Programmers
• QFAST: Quantum Synthesis Using a Hierarchical Continuous Circuit Space
• A Scheme of Cartan Decomposition for su(N)
• Testing quantum computers with the protocol of quantum state matching
• A new algorithm for producing quantum circuits using KAK decompositions
• On the Quantum Circuit Complexity Equivalence
• Fine Entanglement and State Manipulation of Two Spin Coupled Qubits: A Lie Theoretic Overview