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

Communications in Theoretical Physics

Realization of Two-Qutrit Quantum Gates with Control Pulses

Jie Zhang, Yao-Min Di, Hai‐Rui Wei

Published Apr 1, 2009• 5 citations
Publisher

Abstract

We investigate the realization of 2-qutrit logic gate in a bipartite 3-level system with qusi-Ising interaction. On the basis of Cartan decomposition of matrices, the unitary matrices of 2-qutrit are factorized into products of a series of realizable matrices. It is equivalent to exerting a certain control field on the system, and the control goal is usually gained by a sequence of control pulses. The general discussion on the realization of 2-qutrit logic gate is made first, and then the realization of the ternary SWAP gate and the ternary gate are discussed specifically, and the sequences of control pulses and drift processes implementing these gates are given.

DOI
10.1088/0253-6102/51/4/15

Related papers

Realization of Two-Qutrit Quantum Gates with Control Pulses

Di Yao

We investigate the realization of 2-qutrit logic gate in a bipartite 3-level system with qusi-Ising interaction. On the basis of Cartan decomposition of matrices,the unitary matrices of 2-qutrit are factorized into products of a series of realizable matrices.It is equivalent to exerting a certain control field on the system,and the control goal is usually gained by a sequence of control pulses.The general discussion on the realization of 2-qutrit logic gate is made first,and then the realization of the ternary SWAP gate and the ternry SWAP~(1/2)gate are discussed specifically,and the sequences of control pulses and drift processes implementing these gates are given.

理论物理通讯：英文版•Jan 1, 2009•0 citations

Note on Implementation of Three-Qubit SWAP Gate

Hai‐Rui Wei, Yao-Min Di, Yan Wang +1 more

In this paper, the synthesis and implementation of three-quhit SWAP gate is discussed. The three-quhit SWAP gate can be decomposed into product of 2 two-qubit SWAP gates, and it can be realized by 6 CNOT gates. Research illustrated that although the result is very simple, the current methods of matrix decomposition for multi-qubit gate can not get that. Then the implementation of three-qubit SWAP gate in the three spin system with Ising interaction is investigated and the sequence of control pulse and drift process to implement the gate is given. It needs 23 control pulses and 12 drift processes. Since the interaction can not be switched on and off at will, the realization of three-qubit SWAP gate in specific quantum system also can not simply come down to 2 two-qubit SWAP gates.

Communications in Theoretical Physics•Jan 1, 2010•3 citations

Cartan decomposition of a two-qutrit gate

Di Yao

The decomposition of matrices corresponding to the 2-qutrit logic gate by succes-sive Cartan decomposition is investigated, and written in an exponential form based on the relationship between Lie group and Lie algebra, thus making them able to relate with the control field and the Hamiltonian of the system to perform the gate. Finally the decomposition of the ternary SWAP gate is presented in detail.

Science in China. Series G, Physics, mechanics & astronomy/Science in China. Series G, Physics, Mechanics & Astronomy•Jan 1, 2008•0 citations

Elementary gates for ternary quantum logic circuit

Yao-Min Di, Hai‐Rui Wei

In this article the elementary gates for ternary quantum logic circuit are studied. We propose the ternary controlled X (TCX) gate or ternary controlled Z (TCZ) gate as two-qutrit elementary gate, which is universal when assisted by arbitrary one-qutrit gates. It is primitive, efficient and easy to implement. Based on Cartan decomposition, we also give the one-qutrit elementary gates. Then the synthesis of some important ternary gates is investigated and the scheme of physical implementation for these ternary gates is discussed. Finally we extend these elementary gates to more general qudit case, so it provides a unified description for the synthesis of the binary and multi-valued quantum circuits.

arXiv:1105.5485•May 27, 2011•29 citations

Physically motivated decompositions of single-qutrit gates

Aryan Iliat, Mark Byrd, Sahel Ashhab +1 more

Although only two quantum states of a physical system are often used to encode quantum information in the form of qubits, many levels can in principle be used to obtain qudits and increase the information capacity of the system. To take advantage of the additional levels, a parameterization of unitary transformations in terms of experimentally realizable operations is needed. Many parameterizations of unitary 3 * 3 matrices (U(3)) exist. One decomposition of a general unitary matrix can be expressed as the product of an exponential of a diagonal matrix and an exponential of an off-diagonal matrix. This decomposition is relevant for controlling superconducting qutrits using fixed-frequency resonant control pulses. This decomposition is numerically confirmed to allow the parameterization of any element in U(3). It is shown that a simple setting of parameter ranges of parameters can easily lead to an over-parameterization, in the sense that several different sets of values for the parameters produce the same element in U(3). This fact is demonstrated using the Walsh-Hadamard (WH) matrix as an example, which is also a special qutrit gate of practical interest. The different decompositions are shown to be related, and the relationships between them are presented using general methods. The shortest path needed for the implementation of a qutrit gate is found. Other parameterizations obtained by other analytic means, which can be advantageous for various reasons, are also discussed.

arXiv:2506.17797•Physical Review A•Jun 15, 2026•0 citations

Optimal synthesis of general multi-qutrit quantum computation

Gui‐Long Jiang, Wen‐Qiang Liu, Hai‐Rui Wei

Quantum circuits of a general quantum gate acting on multiple $d$-level quantum systems play a prominent role in multi-valued quantum computation. We first propose a new recursive Cartan decomposition of semi-simple unitary Lie group $U(3^n)$ (arbitrary $n$-qutrit gate). Note that the decomposition completely decomposes an n-qutrit gate into local and non-local operations. We design an explicit quantum circuit for implementing arbitrary two-qutrit gates, and the cost of our construction is 21 generalized controlled X (GCX) and controlled increment (CINC) gates less than the earlier best result of 26 GGXs. Moreover, we extend the program to the $n$-qutrit system, and the quantum circuit of generic $n$-qutrit gates contained $\frac{41}{96}\cdot3^{2n}-4\cdot3^{n-1}-(\frac{n^2}{2}+\frac{n}{4}-\frac{29}{32})$ GGXs and CINCs is presented. Such asymptotically optimal structure is the best known result so far.

arXiv:2310.11996•Oct 18, 2023•0 citations
We investigate the realization of 2-qutrit logic gate in a bipartite 3-level system with qusi-Ising interaction. On the basis of Cartan decomposition of matrices, the unitary matrices of 2-qutrit are factorized into products of a series of realizable matrices. It is equivalent to exerting a certain control field on the system, and the control goal is usually gained by a sequence of control pulses. The general discussion on the realization of 2-qutrit logic gate is made first, and then the realization of the ternary SWAP gate and the ternary gate are discussed specifically, and the sequences of control pulses and drift processes implementing these gates are given.
We investigate the realization of 2-qutrit logic gate in a bipartite 3-level system with qusi-Ising interaction. On the basis of Cartan decomposition of matrices,the unitary matrices of 2-qutrit are factorized into products of a series of realizable matrices.It is equivalent to exerting a certain control field on the system,and the control goal is usually gained by a sequence of control pulses.The general discussion on the realization of 2-qutrit logic gate is made first,and then the realization of the ternary SWAP gate and the ternry SWAP~(1/2)gate are discussed specifically,and the sequences of control pulses and drift processes implementing these gates are given.
In this paper, the synthesis and implementation of three-quhit SWAP gate is discussed. The three-quhit SWAP gate can be decomposed into product of 2 two-qubit SWAP gates, and it can be realized by 6 CNOT gates. Research illustrated that although the result is very simple, the current methods of matrix decomposition for multi-qubit gate can not get that. Then the implementation of three-qubit SWAP gate in the three spin system with Ising interaction is investigated and the sequence of control pulse and drift process to implement the gate is given. It needs 23 control pulses and 12 drift processes. Since the interaction can not be switched on and off at will, the realization of three-qubit SWAP gate in specific quantum system also can not simply come down to 2 two-qubit SWAP gates.
In this article the elementary gates for ternary quantum logic circuit are studied. We propose the ternary controlled X (TCX) gate or ternary controlled Z (TCZ) gate as two-qutrit elementary gate, which is universal when assisted by arbitrary one-qutrit gates. It is primitive, efficient and easy to implement. Based on Cartan decomposition, we also give the one-qutrit elementary gates. Then the synthesis of some important ternary gates is investigated and the scheme of physical implementation for these ternary gates is discussed. Finally we extend these elementary gates to more general qudit case, so it provides a unified description for the synthesis of the binary and multi-valued quantum circuits.
Although only two quantum states of a physical system are often used to encode quantum information in the form of qubits, many levels can in principle be used to obtain qudits and increase the information capacity of the system. To take advantage of the additional levels, a parameterization of unitary transformations in terms of experimentally realizable operations is needed. Many parameterizations of unitary 3 * 3 matrices (U(3)) exist. One decomposition of a general unitary matrix can be expressed as the product of an exponential of a diagonal matrix and an exponential of an off-diagonal matrix. This decomposition is relevant for controlling superconducting qutrits using fixed-frequency resonant control pulses. This decomposition is numerically confirmed to allow the parameterization of any element in U(3). It is shown that a simple setting of parameter ranges of parameters can easily lead to an over-parameterization, in the sense that several different sets of values for the parameters produce the same element in U(3). This fact is demonstrated using the Walsh-Hadamard (WH) matrix as an example, which is also a special qutrit gate of practical interest. The different decompositions are shown to be related, and the relationships between them are presented using general methods. The shortest path needed for the implementation of a qutrit gate is found. Other parameterizations obtained by other analytic means, which can be advantageous for various reasons, are also discussed.
Quantum circuits of a general quantum gate acting on multiple ddd-level quantum systems play a prominent role in multi-valued quantum computation. We first propose a new recursive Cartan decomposition of semi-simple unitary Lie group U(3n)U(3^n)U(3n) (arbitrary nnn-qutrit gate). Note that the decomposition completely decomposes an n-qutrit gate into local and non-local operations. We design an explicit quantum circuit for implementing arbitrary two-qutrit gates, and the cost of our construction is 21 generalized controlled X (GCX) and controlled increment (CINC) gates less than the earlier best result of 26 GGXs. Moreover, we extend the program to the nnn-qutrit system, and the quantum circuit of generic nnn-qutrit gates contained 4196⋅32n−4⋅3n−1−(n22+n4−2932)\frac{41}{96}\cdot3^{2n}-4\cdot3^{n-1}-(\frac{n^2}{2}+\frac{n}{4}-\frac{29}{32})9641​⋅32n−4⋅3n−1−(2n2​+4n​−3229​) GGXs and CINCs is presented. Such asymptotically optimal structure is the best known result so far.