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 belong in SU(2^n) with n<N, a procedure that can be iterated down to n=2. We show that every step reduces to solving the zeros of a matrix polynomial, obtained by truncation of the Baker-Campbell-Hausdorff formula, numerically. All computational tasks involved are straightforward and the overall truncation errors are well under control.
The work presented here extends upon the best known universal quantum circuit, the Quantum Shannon Decomposition proposed in [Vivek V. Shende, Stephen S. Bullock and Igor Markov, Synthesis of Quantum Logic Circuits, IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 25 (6): 1000-1010 (2006)]. We obtain the basis of the circuit's design in a pair of Cartan decompositions. This insight gives a simple constructive algorithm for obtaining the Quantum Shannon Decomposition of a given unitary matrix in terms of the corresponding Cartan involutions.
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.
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 describe a new and general method to obtain Cartan decompositions of the unitary group of evolutions of multipartite systems from Cartan decompositions on the single subsystems. The resulting decomposition, which we call of the odd-even type, contains, as a special case, the concurrence canonical decomposition (CCD) presented in the context of entanglemen…
This paper presents no new results; its goals are purely pedagogical. A special case of the Cartan Decomposition has found much utility in the field of quantum computing, especially in its sub-field of quantum compiling. This special case allows one to factor a general 2-qubit operation (i.e., an element of U(4)) into local operations applied before and after a three parameter, non-local operation. In this paper, we give a complete and rigorous proof of this special case of Cartan's Decomposition. From the point of view of QC programmers who might not be familiar with the subtleties of Lie Gro…
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 by a Cartan subalgebra and generally exist in su(N). In particular, the Lie algebras su(2^p) and every su(2^{p-1} < N < 2^p) share the isomorphic structure of the quotient algebra. This structure enables an efficient algorithm for the recursive and exhaustive construction of Cartan decompositions. Further with the scheme, a unitary transformation in SU(N) c…
In this paper, we consider the problem of model equivalence for quantum systems. Two models are said to be (input-output) equivalent if they give the same output for every admissible input. In the case of quantum systems, the output is the expectation value of a given observable or, more in general, a probability distribution for the result of a quantum measurement. We link the input-output equivalence of two models to the existence of a homomorphism of the underlying Lie algebra. In several cases, a Cartan decomposition of the Lie algebra su(n) is useful to find such a homomorphism and to det…
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 on the results of decomposition, we design two compact architectures to deterministically implement arbitrary two-qubit polarization-spatial and spatial-polarization collective unitary operations, respectively. The involved linear optical elements are reduced from 25 to 20 and 21 to 20, respectively. Moreover, the parameterized quantum computation can be fl…
Special Issue: Commemorating the 110th Anniversary of TANG Au-chin's Birthday Calculation of the Green's function on near-term quantum computers via Cartan decomposition
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 according to the given Cartan involution. Our algorithm contains, as its special cases, Cosine-Sine decomposition (CSD) and Khaneja-Glaser decomposition (KGD) in the sense that it derives the same quantum circuits as the ones obtained by them if we select suitable Cartan involutions and square root matrices. The selections of Cartan involutions for computin…
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 simplest form of the structure in terms of the spinor representation.
This is the sequel exposition following [1]. The framework quotient algebra partition is rephrased in the language of the s-representation. Thanks to this language, a quotient algebra partition of the simplest form is established under a minimum number of conditions governed by a bi-subalgebra of rank zero, i.e., a Cartan subalgebra. Within the framework, all Cartan subalgebras of su(N) are classified and generated recursively through the process of the subalgebra extension.
Else from the quotient algebra partition considered in the preceding episodes, two kinds of partitions on unitary Lie algebras are created by nonabelian bi-subalgebras. It is of interest that there exists a partition duality between the two kinds of partitions. With an application of an appropriate coset rule, the two partitions return to a quotient algebra partition when the generating bi-subalgebra is abelian. Procedures are proposed to merge or detach a co-quotient algebra, which help deliver type-AIII Cartan decompositions of more varieties. In addition, every Cartan decomposition is obtai…
In this work we present a method of decomposition of arbitrary unitary matrix $U\in\mathbf U(2^k)$ into a product of single-qubit negator and controlled-$\sqrt{\mbox{NOT}}$ gates. Since the product results with negator matrix, which can be treated as complex analogue if bistochastic matrix, our method can be seen as complex analogue of Sinkhorn-Knopp algorithm, where diagonal matrices are replaced by adding and removing an one-qubit ancilla. The decomposition can be found constructively and resulting circuit consists of $O(4^k)$ entangling gates, which is proved to be optimal. An example of su…
In the 3rd episode of the serial exposition, quotient algebra partitions of rank zero earlier introduced undergo further partitions generated by bi-subalgebras of higher ranks. The refined versions of quotient algebra partitions admit not only Cartan decompositions of type AI but also decompositions of types AII and AIII, resorting to systematic applications of the operation tri-addition. Details of quotient algebra partitions of higher ranks are extensively examined in this longest episode of the serial. Furthermore, the computational universality is attained taking advantage of a special for…
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 limited quantum resources remains an open problem. We tackle this problem presenting a constructive algorithm, based on Cartan decomposition of the Lie algebra generated by the Hamiltonian, that generates quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional tr…
Gauged PT quantum mechanics (PTQM) and corresponding Krein space setups are studied. For models with constant non-Abelian gauge potentials and extended parity inversions compact and noncompact Lie group components are analyzed via Cartan decompositions. A Lie triple structure is found and an interpretation as PT-symmetrically generalized Jaynes-Cummings model is possible with close relation to recently studied cavity QED setups with transmon states in multilevel artificial atoms. For models with Abelian gauge potentials a hidden Clifford algebra structure is found and used to obtain the fundam…
In semiconductor spin qubits which typically interact through short-range exchange coupling, shuttling of spin is a practical way to generate quantum operations between distant qubits. Although the exchange is often tunable through voltages applied to gate electrodes, its minimal value can be significantly large, which hinders the applicability of existing shuttling protocols to such devices, requiring a different approach. In this work, we extend our previous results for double- and triple-dot systems, and describe a method for implementing spin shuttling in long chains of quantum dots in a n…
The purpose of the paper is to point out some typos and to observe that the main result of V. Ramakrishna, K. Flores, H. Rabitz and R. J. Ober, Phys. Rev. A Volume 62, 054309, 2000 remains valid (and this validity can be verified in a constructive fashion) with only the requirement that the su(2) matrices A and B in the paper in the title be linearly independent. An interpretation of this constructive extension, in terms of Givens rotations of real Euclidean space, is given.
We establish a connection between the problem of constructing maximal collections of mutually unbiased bases (MUBs) and an open problem in the theory of Lie algebras. More precisely, we show that a collection of m MUBs in K^n gives rise to a collection of m Cartan subalgebras of the special linear Lie algebra sl_n(K) that are pairwise orthogonal with respect to the Killing form, where K=R or K=C. In particular, a complete collection of MUBs in C^n gives rise to a so-called orthogonal decomposition (OD) of sl_n(C). The converse holds if the Cartan subalgebras in the OD are also *-closed, i.e., …
Quantum bialgebras derivable from Uq(sl2) which contain idempotents and von Neumann regular Cartan-like generators are introduced and investigated. Various types of antipodes (invertible and von Neumann regular) on these bialgebras are constructed, which leads to a Hopf algebra structure and a von Neumann-Hopf algebra structure, respectively. For them, explicit forms of some particular R-matrices (also, invertible and von Neumann regular) are presented, and the latter respects the Pierce decomposition.
We present a simple and fast numerical procedure to search for good quantum codes for storing logical qubits in the presence of independent per-qubit noise. In a key departure from past work, we use the worst-case fidelity as the figure of merit for quantifying code performance, a much better indicator of code quality than, say, entanglement fidelity. Yet, our algorithm does not suffer from inefficiencies usually associated with the use of worst-case fidelity. Specifically, using a near-optimal recovery map, we are able to reduce the triple numerical optimization needed for the search to a sin…
Averaging physical quantities over Lie groups appears in many contexts across the rapidly developing branches of physics like quantum information science or quantum optics. Such an averaging process can be always represented as averaging with respect to a finite number of elements of the group, called a finite averaging set. In the previous research such sets, known as $t$-designs, were constructed only for the case of averaging over unitary groups (hence the name unitary $t$-designs). In this work we investigate the problem of constructing finite averaging sets for averaging over general non-…
We design an efficient and constructive algorithm to decompose any generalized quantum measurement into a convex combination of extremal measurements. We show that if one allows for a classical post-processing step only extremal rank-1 POVMs are needed. For a measurement with $N$ elements on a $d$-dimensional space, our algorithm will decompose it into at most $(N-1)d+1$ extremals, whereas the best previously known upper bound scaled as $d^2$. Since the decomposition is not unique, we show how to tailor our algorithm to provide particular types of decompositions that exhibit some desired prope…
