Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Chinese Journal of Quantum Electronics

Decomposition of matrix in quantum state control

Hai‐Rui Wei

Published Jan 1, 2008• 0 citations
OpenAlex

Abstract

The relationship between quantum state control and matrix decomposition is reviewed.The matrix decomposition newly applied in quantum information science,i.e.Cartan decomposition based on group theory and cosine-sine decomposition based on numerical linear algebra,is introduced firstly.Then the current research situation and the results in this area are reviewed.These results play important roles in quantum entanglement dynamics,the control of quantum states and optimization of quantum circuit Finally,the Cartan decomposition of a 2-qutrit logic gate is given.

Related papers

Lie Group Decompositions and Control

Domenico D’Alessandro

This chapter discusses in detail the case of two-level systems and the associated Lie group. It gives an example of a general decomposition of SU(n), namely the decomposition into planar rotation, which is quite simple and can be obtained by straightforward computations. This decomposition gives a direct way to parametrize the special unitary group. The chapter presents the basics of Cartan decompositions of semisimple Lie groups. It gives some examples of applications of Lie group decompositions and introduces some notions of Lie group and Lie algebra theory. The chapter discusses Cartan decompositions of Lie groups. Cartan decompositions appear to be ubiquitous in quantum control and dynamics and in quantum information theory.

Chapman & Hall/CRC eBooks•Jul 13, 2021•0 citations

From the control of quantum systems to multiqubit logic

Ville Bergholm

Quantum computing and quantum information science are two recently discovered and rapidly growing fields of physics that show substantial promise in providing new and valuable technologies in the foreseeable future. Large-scale quantum computers, if ever realized experimentally, are likely to outperform their classical counterparts in a number of important computational tasks, the most important of which may be the accurate simulation of many-body quantum systems such as the ones encountered in physics, chemistry and life sciences. This thesis investigates the problem of controlling quantum systems for the purpose of performing quantum information processing tasks. The problem is approached from a theoretical and simulational viewpoint. The work contained here encompasses a range of levels of abstraction. Firstly, we discuss the decomposition of abstract multiqubit logic gates into sequences of simple elementary gates. Secondly, we study the local commutational properties of two-qubit gates using local gate invariants. Thirdly, we develop methods for the physical implementation of the elementary gates through the control of specific quantum systems, possibly in the presence of noise and decoherence. We present a new, almost optimal n-qubit gate decomposition based on the cosine-sine decomposition, which utilizes a likewise new intermediate quantum circuit structure we call a uniformly controlled gate. We then show how they can be used in constructing a general state transformation circuit. Both of the resulting circuits can be efficiently implemented using nearest-neighbor gates which makes their physical realization simpler. A local gate invariant is introduced which can be used to assess the suitability of two-qubit gates for serving as the entangling gate in elementary gate libraries. Finally, we develop numerical optimization methods for finding near-optimal control sequences for generating oneand two-qubit gates, both in closed quantum systems and in the presence of Markovian noise.

•Dec 4, 2007•0 citations

A new algorithm for producing quantum circuits using KAK decompositions

M.Y. Nakajima, Y. Kawano, Hiroshi Sekigawa

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 computing CSD and KGD will be shown explicitly. As an example, we show explicitly that our method can automatically reproduce the well-known efficient quantum circuit for the $n$-qubit quantum Fourier transform.

arXiv:quant-ph/0509196•Quantum Information and Computation•Jan 1, 2006•59 citations

Decompositions of unitary evolutions and dynamics of quantum systems

Domenico D’Alessandro, Raffaele Romano

Decompositions of the Lie group of unitary matrices are very useful tools in the control and analysis of quantum dynamics. In this paper, we survey recent results on decompositions, concerning their significance in terms of symmetries, entanglement, and their applications to control and dynamics. Several decompositions can be obtained by recursively applying the Cartan classification of the symmetric spaces of the classical Lie groups. The emphasis is on a novel recursive procedure to decompose the unitary evolution of bipartite quantum systems of arbitrary dimensions, in simpler factors. This procedure makes transparent the contributions of the entangling and non entangling transformations

IEEE Conference on Decision and Control (CDC)•Dec 1, 2006•0 citations

Synthesis of Ternary Quantum Logic Circuits by Decomposition

Khan, Faisal Shah, Perkowski, Marek

Recent research in multi-valued logic for quantum computing has shown practical advantages for scaling up a quantum computer. Multivalued quantum systems have also been used in the framework of quantum cryptography, and the concept of a qudit cluster state has been proposed by generalizing the qubit cluster state. An evolutionary algorithm based synthesizer for ternary quantum circuits has recently been presented, as well as a synthesis method based on matrix factorization.In this paper, a recursive synthesis method for ternary quantum circuits based on the Cosine-Sine unitary matrix decomposition is presented.

arXiv:quant-ph/0511041•Nov 4, 2005•28 citations

Decompositions of general quantum gates

Mikko Möttönen, Juha J. Vartiainen

Quantum algorithms may be described by sequences of unitary transformations called quantum gates and measurements applied to the quantum register of n quantum bits, qubits. A collection of quantum gates is called universal if it can be used to construct any n-qubit gate. In 1995, the universality of the set of one-qubit gates and controlled NOT gate was shown by Barenco et al. using QR decomposition of unitary matrices. Almost ten years later the decomposition was improved to include essentially fewer elementary gates. In addition, the cosine-sine matrix decomposition was applied to efficiently implement decompositions of general quantum gates. In this chapter, we review the different types of general gate decompositions and slightly improve the best known gate count for the controlled NOT gates to (23/48)4^n in the leading order. In physical realizations, the interaction strength between the qubits can decrease strongly as a function of their distance. Therefore, we also discuss decompositions with the restriction to nearest-neighbor interactions in a linear chain of qubits.

arXiv:quant-ph/0504100•Apr 14, 2005•123 citations
The relationship between quantum state control and matrix decomposition is reviewed.The matrix decomposition newly applied in quantum information science,i.e.Cartan decomposition based on group theory and cosine-sine decomposition based on numerical linear algebra,is introduced firstly.Then the current research situation and the results in this area are reviewed.These results play important roles in quantum entanglement dynamics,the control of quantum states and optimization of quantum circuit Finally,the Cartan decomposition of a 2-qutrit logic gate is given.
This chapter discusses in detail the case of two-level systems and the associated Lie group. It gives an example of a general decomposition of SU(n), namely the decomposition into planar rotation, which is quite simple and can be obtained by straightforward computations. This decomposition gives a direct way to parametrize the special unitary group. The chapter presents the basics of Cartan decompositions of semisimple Lie groups. It gives some examples of applications of Lie group decompositions and introduces some notions of Lie group and Lie algebra theory. The chapter discusses Cartan decompositions of Lie groups. Cartan decompositions appear to be ubiquitous in quantum control and dynamics and in quantum information theory.
Quantum computing and quantum information science are two recently discovered and rapidly growing fields of physics that show substantial promise in providing new and valuable technologies in the foreseeable future. Large-scale quantum computers, if ever realized experimentally, are likely to outperform their classical counterparts in a number of important computational tasks, the most important of which may be the accurate simulation of many-body quantum systems such as the ones encountered in physics, chemistry and life sciences. This thesis investigates the problem of controlling quantum systems for the purpose of performing quantum information processing tasks. The problem is approached from a theoretical and simulational viewpoint. The work contained here encompasses a range of levels of abstraction. Firstly, we discuss the decomposition of abstract multiqubit logic gates into sequences of simple elementary gates. Secondly, we study the local commutational properties of two-qubit gates using local gate invariants. Thirdly, we develop methods for the physical implementation of the elementary gates through the control of specific quantum systems, possibly in the presence of noise and decoherence. We present a new, almost optimal n-qubit gate decomposition based on the cosine-sine decomposition, which utilizes a likewise new intermediate quantum circuit structure we call a uniformly controlled gate. We then show how they can be used in constructing a general state transformation circuit. Both of the resulting circuits can be efficiently implemented using nearest-neighbor gates which makes their physical realization simpler. A local gate invariant is introduced which can be used to assess the suitability of two-qubit gates for serving as the entangling gate in elementary gate libraries. Finally, we develop numerical optimization methods for finding near-optimal control sequences for generating oneand two-qubit gates, both in closed quantum systems and in the presence of Markovian noise.
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 computing CSD and KGD will be shown explicitly. As an example, we show explicitly that our method can automatically reproduce the well-known efficient quantum circuit for the nnn-qubit quantum Fourier transform.
Decompositions of the Lie group of unitary matrices are very useful tools in the control and analysis of quantum dynamics. In this paper, we survey recent results on decompositions, concerning their significance in terms of symmetries, entanglement, and their applications to control and dynamics. Several decompositions can be obtained by recursively applying the Cartan classification of the symmetric spaces of the classical Lie groups. The emphasis is on a novel recursive procedure to decompose the unitary evolution of bipartite quantum systems of arbitrary dimensions, in simpler factors. This procedure makes transparent the contributions of the entangling and non entangling transformations
Recent research in multi-valued logic for quantum computing has shown practical advantages for scaling up a quantum computer. Multivalued quantum systems have also been used in the framework of quantum cryptography, and the concept of a qudit cluster state has been proposed by generalizing the qubit cluster state. An evolutionary algorithm based synthesizer for ternary quantum circuits has recently been presented, as well as a synthesis method based on matrix factorization.In this paper, a recursive synthesis method for ternary quantum circuits based on the Cosine-Sine unitary matrix decomposition is presented.
Quantum algorithms may be described by sequences of unitary transformations called quantum gates and measurements applied to the quantum register of n quantum bits, qubits. A collection of quantum gates is called universal if it can be used to construct any n-qubit gate. In 1995, the universality of the set of one-qubit gates and controlled NOT gate was shown by Barenco et al. using QR decomposition of unitary matrices. Almost ten years later the decomposition was improved to include essentially fewer elementary gates. In addition, the cosine-sine matrix decomposition was applied to efficiently implement decompositions of general quantum gates. In this chapter, we review the different types of general gate decompositions and slightly improve the best known gate count for the controlled NOT gates to (23/48)4^n in the leading order. In physical realizations, the interaction strength between the qubits can decrease strongly as a function of their distance. Therefore, we also discuss decompositions with the restriction to nearest-neighbor interactions in a linear chain of qubits.