Related papers: An Introduction to Cartan's KAK Decomposition for …
The KAK decomposition is a fundamental tool in Lie theory and quantum computing. Despite its widespread use, the mathematical foundations remain incomplete, particularly regarding the precise conditions for the decomposition and the…
Unitary operation is an essential step for quantum information processing. We first propose an iterative procedure for decomposing a general unitary operation without resorting to controlled-NOT gate and single-qubit rotation library. Based…
We show the applicability of the Cartan decomposition of Lie algebras to quantum circuits. This approach can be used to synthesize circuits that can efficiently implement any desired unitary operation. Our method finds explicit quantum…
A scheme to perform the Cartan decomposition for the Lie algebra su(N) of arbitrary finite dimensions is introduced. The schme is based on two algebraic structures, the conjugate partition and the quotient algebra, that are easily generated…
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…
An algebraic structure, Quotient Algebra Partition or QAP, is introduced in a serial of articles. The structure QAP is universal to Lie Algebras and enables algorithmic and exhaustive Cartan decompositions. The first episode draws the…
A rigid framework for the Cartan calculus of Lie derivatives, inner derivations, functions, and forms is proposed. The construction employs a semi-direct product of two graded Hopf algebras, the respective super-extensions of the deformed…
Decompositions of the unitary group U(n) are useful tools in quantum information theory as they allow one to decompose unitary evolutions into local evolutions and evolutions causing entanglement. Several recursive decompositions have been…
We provide a new algorithm that translates a unitary matrix into a quantum circuit according to the G=KAK theorem in Lie group theory. With our algorithm, any matrix decomposition corresponding to type-AIII KAK decompositions can be derived…
Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary set of quantum gates. Efficient implementation of this decomposition allows for translation of bigger unitary gates into elementary quantum operations,…
A critical step in developing circuits for quantum simulation is to synthesize a desired unitary operator using the circuit building blocks. Studying unitaries and their generators from the Lie algebraic perspective has given rise to…
We present an explicit numerical method to obtain the Cartan-Khaneja-Glaser decomposition of a general element G of SU(2^N) in terms of its `Cartan' and `non-Cartan' components. This effectively factors G in terms of group elements that…
Simulating quantum dynamics on classical computers is challenging for large systems due to the significant memory requirements. Simulation on quantum computers is a promising alternative, but fully optimizing quantum circuits to minimize…
We investigate a class of actions of real Lie groups on complex spaces. Using moment map techniques we establish the existence of a quotient and a version of Luna's slice theorem as well as a version of the Hilbert-Mumford criterion. A…
We investigate the relation between Cartan decompositions of the unitary group and discrete quantum symmetries. To every Cartan decomposition there corresponds a quantum symmetry which is the identity when applied twice. As an application,…
We construct a one parameter deformation of the group of $2\times 2$ upper triangular matrices with determinant 1 using the twisting construction. An interesting feature of this new example of a locally compact quantum group is that the…
A general scheme is presented to decompose a $d$-by-$d$ unitary matrix as the product of two-level unitary matrices with additional structure and prescribed determinants. In particular, the decomposition can be done by using two-level…
We present a novel algorithm for performing the Cartan-Khaneja-Glaser decomposition of unitary matrices in $SU(2^n)$, a critical task for efficient quantum circuit design. Building upon the approach introduced by S\'a Earp and Pachos…
The two-qubit canonical decomposition SU(4) = [SU(2) \otimes SU(2)] Delta [SU(2) \otimes SU(2)] writes any two-qubit quantum computation as a composition of a local unitary, a relative phasing of Bell states, and a second local unitary.…
Most quantum computer realizations require the ability to apply local fields and tune the couplings between qubits, in order to realize single bit and two bit gates which are necessary for universal quantum computation. We present a scheme…