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

Explicit algorithm for generalized Euler decomposition of SU(2)

K. Ch. Chatzisavvas, Goce Chadzitaskos, C. Daskaloyannis, S. G. Schirmer

Published May 19, 2008• 0 citations
OpenAlex

Abstract

An explicit algorithm for calculating the optimized Euler angles for both qubit state transfer and gate engineering given two arbitary fixed Hamiltonians is presented. It is shown how the algorithm enables us to efficiently implement single qubit gates even if the control is severely restricted and the experimentally accessible Hamiltonians are far from orthogonal. It is further shown that using the optimized Euler angles can significantly improve the fidelity of quantum operations even for systems where the experimentally accessible Hamiltonians are nearly orthogonal. Unlike schemes such as composite pulses, the proposed scheme does not significantly increase the number of local operations or gate operation times.

Related papers

Improving quantum gate fidelities using optimized Euler angles

K. Ch. Chatzisavvas, Goce Chadzitaskos, C. Daskaloyannis +1 more

An explicit algorithm for calculating the optimized Euler angles for both qubit state transfer and gate engineering given two arbitrary fixed Hamiltonians is presented. It is shown how the algorithm enables us to efficiently implement single qubit gates even if the control is severely restricted and the experimentally accessible Hamiltonians are far from orthogonal. It is further shown that using the optimized Euler angles can significantly improve the fidelity of quantum operations even for systems where the experimentally accessible Hamiltonians are nearly orthogonal. Unlike schemes such as composite pulses, the proposed scheme does not significantly increase the number of local operations or gate operation times.

arXiv:0805.2894•Physical Review A•Nov 23, 2009•4 citations

Minimal nonorthogonal gate decomposition for qubits with limited control

Xiao‐Ming Zhang, Jianan Li, Xin Wang +1 more

In quantum control theory, a question of fundamental and practical interest is how an arbitrary unitary transformation can be decomposed into a minimum number of elementary rotations for implementation, subject to various physical constraints. Examples include the singlet-triplet (ST) and exchange-only (EO) qubits in quantum-dot systems, and gate construction in the Solovay--Kitaev algorithm. For two important scenarios, we present complete solutions to the problems of optimal decomposition of single-qubit unitary gates with non-orthogonal rotations. For each unitary gate, the criteria for determining the minimal number of pieces is given, the explicit gate construction procedure, as well as a computer code for practical uses. Our results include an analytic explanation to the four-gate decomposition of EO qubits, previously determined numerically by Divincenzo et al. [Nature (London) 408, 339 (2000)]. Furthermore, compared with the approaches of Ramon sequence and its variant [Phys. Rev. Lett. 118, 216802 (2017)], our method can reduce about 50% of gate time for ST qubits. Finally, our approach can be extended to solve the problem of optimal control of topological qubits, where gate construction is achieved through the braiding operations.

arXiv:1810.07569•Physical Review A•May 24, 2019•2 citations

Efficient implementation of arbitrary two-qubit gates using unified control

Zhen Chen, Weiyang Liu, Yanjun Ma +16 more

The set of quantum logic gates that can be easily implemented is fundamental to the performance of quantum computers, as it governs the accuracy of basic quantum operations and dictates the complexity of implementing quantum algorithms. Traditional approaches to extending gate sets often require operating devices outside the ideal parameter regimes used to realize qubits, leading to increased control complexity while offering only a limited set of gates. Here we experimentally demonstrate a unified and versatile gate scheme capable of generating arbitrary two-qubit gates using only an exchange interaction and qubit driving on a superconducting quantum processor. We achieve high fidelities averaging 99.38% across a wide range of commonly used two-qubit unitaries, enabling precise multipartite entangled state preparation. Furthermore, we successfully produce a B gate, which efficiently synthesizes the entire family of two-qubit gates. Our results establish that fully exploiting the capabilities of the exchange interaction can yield a comprehensive and highly accurate gate set. With maximum expressivity, optimal gate time, demonstrated high fidelity and easy adaption to other quantum platforms, our unified control scheme offers the prospect of improved performance in quantum hardware and algorithm development. The efficiency of a quantum computer depends on which basic operations it can implement. Now a scheme that can implement any two-qubit logic gate has been demonstrated on a superconducting architecture.

arXiv:2502.03612•Nature Physics•Aug 15, 2025•31 citations

Universal programmable quantum circuit schemes to emulate an operator

Ammar Daskin, Ananth Y. Grama, Giorgos Kollias +1 more

Unlike fixed designs, programmable circuit designs support an infinite number of operators. The functionality of a programmable circuit can be altered by simply changing the angle values of the rotation gates in the circuit. Here, we present a new quantum circuit design technique resulting in two general programmable circuit schemes. The circuit schemes can be used to simulate any given operator by setting the angle values in the circuit. This provides a fixed circuit design whose angles are determined from the elements of the given matrix-which can be non-unitary-in an efficient way. We also give both the classical and quantum complexity analysis for these circuits and show that the circuits require a few classical computations. For the electronic structure simulation on a quantum computer, one has to perform the following steps: prepare the initial wave function of the system; present the evolution operator U = e(-iHt) for a given atomic and molecular Hamiltonian H in terms of quantum gates array and apply the phase estimation algorithm to find the energy eigenvalues. Thus, in the circuit model of quantum computing for quantum chemistry, a crucial step is presenting the evolution operator for the atomic and molecular Hamiltonians in terms of quantum gate arrays. Since the presented circuit designs are independent from the matrix decomposition techniques and the global optimization processes used to find quantum circuits for a given operator, high accuracy simulations can be done for the unitary propagators of molecular Hamiltonians on quantum computers. As an example, we show how to build the circuit design for the hydrogen molecule.

arXiv:1204.3600•The Journal of Chemical Physics•Dec 21, 2012•31 citations

All You Need is pi: Quantum Computing with Hermitian Gates

Ben Zindorf, Sougato Bose

Universal gate sets for quantum computation, when single and two qubit operations are accessible, include both Hermitian and non-Hermitian gates. Here we utilize the fact that any single-qubit operator may be implemented as two Hermitian gates, and thus a purely Hermitian universal set is possible. This implementation can be used to prepare high fidelity single-qubit states in the presence of amplitude errors, and helps to achieve a high fidelity single-qubit gate decomposition using four Hermitian gates. An implementational convenience can be that non-identity single-qubit Hermitian gates are equivalent to π rotations up to a global phase. We show that a gate set comprised of π rotations about two fixed axes, along with the CNOT gate, is universal for quantum computation. Moreover, we show that two π rotations can transform the axis of any multi-controlled unitary, a special case being a single CNOT sufficing for any controlled π rotation. These gates simplify the process of circuit compilation in view of their Hermitian nature. We exemplify by designing efficient circuits for a variety of controlled gates, and achieving a CNOT count reduction for the four-controlled Toffoli gate in LNN-restricted qubit connectivity.

arXiv:2402.12356•Quantum•Dec 2, 2025•3 citations

Simplified approach to implementing controlled-unitary operations in a two-qubit system

Preethika Kumar, S.R. Skinner

We introduce a scheme for realizing arbitrary controlled-unitary operations in a two-qubit system. If the $2\ifmmode\times\else\texttimes\fi{}2$ unitary matrix is special unitary (has unit determinant), the controlled-unitary gate operation can be realized in a single pulse operation. The pulse in our scheme will constitute varying one of the parameters of the system between an arbitrarily maximum and a ``calculated'' minimum value. This parameter will constitute the variable parameter of the system while the other parameters, which include the coupling between the two qubits, will be treated as fixed parameters. The values of the parameters are what we solve for using our approach in order to realize an arbitrary controlled-unitary operation. We further show that the computational complexity of the operation is no greater than that required for a controlled-NOT (CNOT) gate. Since conventional schemes realize a controlled-unitary operation by breaking it into a sequence of single-qubit and CNOT gate operations, our method is an improvement because we not only require less time duration, but also fewer control lines to implement the same operation. To demonstrate improvement over other schemes, we show, as examples, how two controlled-unitary operations, one being the controlled-Hadamard gate, can be realized in a single pulse operation using our scheme. Furthermore, our method can be applied to a wide range of coupling schemes and can be used to realize gate operations between two qubits coupled via Ising, Heisenberg, and anisotropic interactions.

arXiv:1202.2053•Physical Review A•Aug 30, 2007•11 citations
An explicit algorithm for calculating the optimized Euler angles for both qubit state transfer and gate engineering given two arbitary fixed Hamiltonians is presented. It is shown how the algorithm enables us to efficiently implement single qubit gates even if the control is severely restricted and the experimentally accessible Hamiltonians are far from orthogonal. It is further shown that using the optimized Euler angles can significantly improve the fidelity of quantum operations even for systems where the experimentally accessible Hamiltonians are nearly orthogonal. Unlike schemes such as composite pulses, the proposed scheme does not significantly increase the number of local operations or gate operation times.
An explicit algorithm for calculating the optimized Euler angles for both qubit state transfer and gate engineering given two arbitrary fixed Hamiltonians is presented. It is shown how the algorithm enables us to efficiently implement single qubit gates even if the control is severely restricted and the experimentally accessible Hamiltonians are far from orthogonal. It is further shown that using the optimized Euler angles can significantly improve the fidelity of quantum operations even for systems where the experimentally accessible Hamiltonians are nearly orthogonal. Unlike schemes such as composite pulses, the proposed scheme does not significantly increase the number of local operations or gate operation times.
In quantum control theory, a question of fundamental and practical interest is how an arbitrary unitary transformation can be decomposed into a minimum number of elementary rotations for implementation, subject to various physical constraints. Examples include the singlet-triplet (ST) and exchange-only (EO) qubits in quantum-dot systems, and gate construction in the Solovay--Kitaev algorithm. For two important scenarios, we present complete solutions to the problems of optimal decomposition of single-qubit unitary gates with non-orthogonal rotations. For each unitary gate, the criteria for determining the minimal number of pieces is given, the explicit gate construction procedure, as well as a computer code for practical uses. Our results include an analytic explanation to the four-gate decomposition of EO qubits, previously determined numerically by Divincenzo et al. [Nature (London) 408, 339 (2000)]. Furthermore, compared with the approaches of Ramon sequence and its variant [Phys. Rev. Lett. 118, 216802 (2017)], our method can reduce about 50% of gate time for ST qubits. Finally, our approach can be extended to solve the problem of optimal control of topological qubits, where gate construction is achieved through the braiding operations.
The set of quantum logic gates that can be easily implemented is fundamental to the performance of quantum computers, as it governs the accuracy of basic quantum operations and dictates the complexity of implementing quantum algorithms. Traditional approaches to extending gate sets often require operating devices outside the ideal parameter regimes used to realize qubits, leading to increased control complexity while offering only a limited set of gates. Here we experimentally demonstrate a unified and versatile gate scheme capable of generating arbitrary two-qubit gates using only an exchange interaction and qubit driving on a superconducting quantum processor. We achieve high fidelities averaging 99.38% across a wide range of commonly used two-qubit unitaries, enabling precise multipartite entangled state preparation. Furthermore, we successfully produce a B gate, which efficiently synthesizes the entire family of two-qubit gates. Our results establish that fully exploiting the capabilities of the exchange interaction can yield a comprehensive and highly accurate gate set. With maximum expressivity, optimal gate time, demonstrated high fidelity and easy adaption to other quantum platforms, our unified control scheme offers the prospect of improved performance in quantum hardware and algorithm development. The efficiency of a quantum computer depends on which basic operations it can implement. Now a scheme that can implement any two-qubit logic gate has been demonstrated on a superconducting architecture.
Unlike fixed designs, programmable circuit designs support an infinite number of operators. The functionality of a programmable circuit can be altered by simply changing the angle values of the rotation gates in the circuit. Here, we present a new quantum circuit design technique resulting in two general programmable circuit schemes. The circuit schemes can be used to simulate any given operator by setting the angle values in the circuit. This provides a fixed circuit design whose angles are determined from the elements of the given matrix-which can be non-unitary-in an efficient way. We also give both the classical and quantum complexity analysis for these circuits and show that the circuits require a few classical computations. For the electronic structure simulation on a quantum computer, one has to perform the following steps: prepare the initial wave function of the system; present the evolution operator U = e(-iHt) for a given atomic and molecular Hamiltonian H in terms of quantum gates array and apply the phase estimation algorithm to find the energy eigenvalues. Thus, in the circuit model of quantum computing for quantum chemistry, a crucial step is presenting the evolution operator for the atomic and molecular Hamiltonians in terms of quantum gate arrays. Since the presented circuit designs are independent from the matrix decomposition techniques and the global optimization processes used to find quantum circuits for a given operator, high accuracy simulations can be done for the unitary propagators of molecular Hamiltonians on quantum computers. As an example, we show how to build the circuit design for the hydrogen molecule.
Universal gate sets for quantum computation, when single and two qubit operations are accessible, include both Hermitian and non-Hermitian gates. Here we utilize the fact that any single-qubit operator may be implemented as two Hermitian gates, and thus a purely Hermitian universal set is possible. This implementation can be used to prepare high fidelity single-qubit states in the presence of amplitude errors, and helps to achieve a high fidelity single-qubit gate decomposition using four Hermitian gates. An implementational convenience can be that non-identity single-qubit Hermitian gates are equivalent to π rotations up to a global phase. We show that a gate set comprised of π rotations about two fixed axes, along with the CNOT gate, is universal for quantum computation. Moreover, we show that two π rotations can transform the axis of any multi-controlled unitary, a special case being a single CNOT sufficing for any controlled π rotation. These gates simplify the process of circuit compilation in view of their Hermitian nature. We exemplify by designing efficient circuits for a variety of controlled gates, and achieving a CNOT count reduction for the four-controlled Toffoli gate in LNN-restricted qubit connectivity.
We introduce a scheme for realizing arbitrary controlled-unitary operations in a two-qubit system. If the $2\ifmmode\times\else\texttimes\fi{}2$ unitary matrix is special unitary (has unit determinant), the controlled-unitary gate operation can be realized in a single pulse operation. The pulse in our scheme will constitute varying one of the parameters of the system between an arbitrarily maximum and a ``calculated'' minimum value. This parameter will constitute the variable parameter of the system while the other parameters, which include the coupling between the two qubits, will be treated as fixed parameters. The values of the parameters are what we solve for using our approach in order to realize an arbitrary controlled-unitary operation. We further show that the computational complexity of the operation is no greater than that required for a controlled-NOT (CNOT) gate. Since conventional schemes realize a controlled-unitary operation by breaking it into a sequence of single-qubit and CNOT gate operations, our method is an improvement because we not only require less time duration, but also fewer control lines to implement the same operation. To demonstrate improvement over other schemes, we show, as examples, how two controlled-unitary operations, one being the controlled-Hadamard gate, can be realized in a single pulse operation using our scheme. Furthermore, our method can be applied to a wide range of coupling schemes and can be used to realize gate operations between two qubits coupled via Ising, Heisenberg, and anisotropic interactions.