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

Physica Scripta

Construction of two-qubit gates using B Gate

M. Karthick Selvan, S. Balakrishnan

Published Feb 20, 2024• 2 citations
Publisher

Abstract

Abstract In the circuit model of quantum computation, an entangling two-qubit gate and a set of single-qubit gates are used as universal gate set or basis gates for doing quantum computation. CNOT and iSWAP gates, the perfect entanglers that can create maximally entangled two-qubit states in one application, are broadly used entangling two-qubit basis gates in quantum computers. In this paper, we analyze the potentiality of B gate, an unexplored non-perfect entangler of the form, exp i π ( σ ˆ x ⨂ σ ˆ x ) 8 + i π ( σ ˆ y ⨂ σ ˆ y ) 16 , as an entangling two-qubit basis gate in quantum computers by studying its ability to generate other two-qubit gates. We derive a necessary condition for a two-qubit gate to be generated by n applications of B gate. Using this condition, we show that the gates that can be generated by two and three applications of B gate are contained in the 50% and 92.97% of the volume of Weyl chamber of two-qubit gates, respectively. We prove that two applications of B gate can generate both SWAP and SWAP

DOI
10.1088/1402-4896/ad23b6

Related papers

Optimal Construction of Two-Qubit Gates using the Symmetries of B Gate Equivalence Class

M. Karthick Selvan, S. Balakrishnan

Two applications of gates from the B gate equivalence class can generate all two-qubit gates. This local equivalence class is invariant under the mirror (multiplication with the SWAP gate) operation, inverse (Hermitian conjugate) operation, and the combined inverse and mirror operations. The last two symmetries are associated with the ability of a two-qubit gate to generate the two-qubit local gates and the SWAP gate in two applications. No single local equivalence class of two-qubit gates, except the B gate equivalence class, has these two symmetries. Only the planar regions of the Weyl chamber, describing the mirror operation, contain the local equivalence classes with either one of the two symmetries. We show that there exist one-parameter families of local equivalence classes on these planes, with and without the B gate equivalence class, such that each of them can be used to construct a parameterized universal two-qubit quantum circuit that involves only two nonlocal two-qubit gates. We also discuss the implementation of the gates from a few families of local equivalence classes on superconducting quantum computers for optimal generation of all two-qubit gates. We provide upper bounds on the number of two-qubit gates required to generate an arbitrary $n$-qubit gate for two families, each of which is conjectured to generate all two-qubit gates in two applications. We show that there exists a positive correlation between the area of the convex hull of the squared eigenvalues of the nonlocal part of a parameterized two-qubit gate and the fractional volume of the Weyl chamber covered in two applications of the parameterized two-qubit gate for two families of local equivalence classes.

quant-pharXiv:2601.13983•Jan 21, 2026•0 citations

Entangling power of symmetric two-qubit quantum gates and three-level operations

Diego Morachis Galindo, Jesús A. Maytorena

The capacity of a quantum gate to produce entangled states on a bipartite system is quantified in terms of the entangling power. This quantity is defined as the average of the linear entropy of entanglement of the states produced after applying a quantum gate over the whole set of separable states. Here we focus on symmetric two-qubit quantum gates, acting on the symmetric two-qubit space, and calculate the entangling power in terms of the appropriate local invariant. A geometric description of the local equivalence classes of gates is given in terms of the $\text{su}(3)$ Lie algebra root vectors. These vectors define a primitive cell with hexagonal symmetry on a plane, and through the Weyl group the minimum area on the plane containing the whole set of locally equivalent quantum gates is identified. We give conditions to determine when a given quantum gate produces maximally entangled states from separable ones (perfect entanglers). We find that these gates correspond to one-fourth of the whole set of locally distinct quantum gates. The formalism developed here is applicable to general three-level systems. Via the Majorana representation, qutrit transformations can be regarded as having entangling power and hence classified as perfect and nonperfect entanglers and be grouped into local-equivalence classes of the associated symmetric two-qubit space. The results are illustrated by an anisotropic Heisenberg model, the Lipkin-Meshkov-Glick model, and two coupled quantized oscillators with cross-Kerr interaction, which we use to obtain three-level gates relevant in qutrit quantum computation.

arXiv:2107.12653•Physical Review A•Jan 3, 2022•11 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•1 citation

Quantum SWAP gate realized with CZ and iSWAP gates in a superconducting architecture

Christian Križan, Janka Biznárová, Liangyu Chen +19 more

Abstract It is advantageous for any quantum processor to support different classes of two-qubit quantum logic gates when compiling quantum circuits, a property that is typically not present in existing platforms. In particular, access to a gate set that includes support for the CZ-, iSWAP-, and SWAP-type families of gates renders conversions between these gate families unnecessary during compilation, as any two-qubit Clifford gate can be executed using at most one two-qubit gate from this set, plus additional single-qubit gates. We experimentally demonstrate that a SWAP gate can be decomposed into one iSWAP gate followed by one CZ gate, affirming a more efficient compilation strategy over the conventional approach that relies on three iSWAP or three CZ gates to replace a SWAP gate. Our implementation makes use of a superconducting quantum processor design based on fixed-frequency transmon qubits coupled together by a parametrically modulated tunable transmon coupler, extending this platform’s native gate set so that any two-qubit Clifford unitary matrix can be realized using no more than two two-qubit gates and single-qubit gates.

arXiv:2412.15022•New Journal of Physics•Jul 1, 2025•10 citations

Constructing quantum circuits with global gates

John van de Wetering

Abstract There are various gate sets that can be used to describe a quantum computation. A particularly popular gate set in the literature on quantum computing consists of arbitrary single-qubit gates and two-qubit CNOT gates. A CNOT gate is however not always the natural multi-qubit interaction that can be implemented on a given physical quantum computer, necessitating a compilation step that transforms these CNOT gates to the native gate set. An especially interesting case where compilation is necessary is for ion trap quantum computers, where the natural entangling operation can act on more than two qubits and can even act globally on all qubits at once. This calls for an entirely different approach to constructing efficient circuits. In this paper we study the problem of converting a given circuit that uses two-qubit gates to one that uses global gates. Our three main contributions are as follows. First, we find an efficient algorithm for transforming an arbitrary circuit consisting of Clifford gates and arbitrary phase gates into a circuit consisting of single-qubit gates and a number of global interactions proportional to the number of non-Clifford phases present in the original circuit. Second, we find a general strategy to transform a global gate that targets all qubits into one that targets only a subset of the qubits. This approach scales linearly with the number of qubits that are not targeted, in contrast to the exponential scaling reported in (Maslov and Nam 2018 New J. Phys. 20 033018). Third, we improve on the number of global gates required to synthesise an arbitrary n-qubit Clifford circuit from the 12n − 18 reported in (Maslov and Nam 2018 New J. Phys. 20 033018) to 6n − 8.

arXiv:2012.09061•New Journal of Physics•Mar 24, 2021•37 citations

Entangled State Preparation for Non-Binary Quantum Computing

Kaitlin N. Smith, Mitchell Aaron Thornton

A common model of quantum computing is the gate model with binary basis states. Here, we consider the gate model of quantum computing with a non-binary radix resulting in more than two basis states to represent a quantum digit, or qudit. Quantum entanglement is an important phenomenon that is a critical component of quantum computation and communications algorithms. The generation and use of entanglement among radix-2 qubits is well-known and used often in quantum computing algorithms. Quantum entanglement exists in higher-radix systems as well although little is written regarding the generation of higher-radix entangled states. We provide background describing the feasibility of multiple-valued logic quantum systems and describe a new systematic method for generating maximally entangled states in quantum systems of dimension greater than two. This method is implemented in a synthesis algorithm that is described. Experimental results are included that demonstrate the transformations needed to create specific forms of maximally entangled quantum states.

IEEE International Conference on Rebooting Computing (ICRC)•Nov 1, 2019•3 citations
Abstract In the circuit model of quantum computation, an entangling two-qubit gate and a set of single-qubit gates are used as universal gate set or basis gates for doing quantum computation. CNOT and iSWAP gates, the perfect entanglers that can create maximally entangled two-qubit states in one application, are broadly used entangling two-qubit basis gates in quantum computers. In this paper, we analyze the potentiality of B gate, an unexplored non-perfect entangler of the form, exp i π ( σ ˆ x ⨂ σ ˆ x ) 8 + i π ( σ ˆ y ⨂ σ ˆ y ) 16 , as an entangling two-qubit basis gate in quantum computers by studying its ability to generate other two-qubit gates. We derive a necessary condition for a two-qubit gate to be generated by n applications of B gate. Using this condition, we show that the gates that can be generated by two and three applications of B gate are contained in the 50% and 92.97% of the volume of Weyl chamber of two-qubit gates, respectively. We prove that two applications of B gate can generate both SWAP and SWAP
Two applications of gates from the B gate equivalence class can generate all two-qubit gates. This local equivalence class is invariant under the mirror (multiplication with the SWAP gate) operation, inverse (Hermitian conjugate) operation, and the combined inverse and mirror operations. The last two symmetries are associated with the ability of a two-qubit gate to generate the two-qubit local gates and the SWAP gate in two applications. No single local equivalence class of two-qubit gates, except the B gate equivalence class, has these two symmetries. Only the planar regions of the Weyl chamber, describing the mirror operation, contain the local equivalence classes with either one of the two symmetries. We show that there exist one-parameter families of local equivalence classes on these planes, with and without the B gate equivalence class, such that each of them can be used to construct a parameterized universal two-qubit quantum circuit that involves only two nonlocal two-qubit gates. We also discuss the implementation of the gates from a few families of local equivalence classes on superconducting quantum computers for optimal generation of all two-qubit gates. We provide upper bounds on the number of two-qubit gates required to generate an arbitrary nnn-qubit gate for two families, each of which is conjectured to generate all two-qubit gates in two applications. We show that there exists a positive correlation between the area of the convex hull of the squared eigenvalues of the nonlocal part of a parameterized two-qubit gate and the fractional volume of the Weyl chamber covered in two applications of the parameterized two-qubit gate for two families of local equivalence classes.
The capacity of a quantum gate to produce entangled states on a bipartite system is quantified in terms of the entangling power. This quantity is defined as the average of the linear entropy of entanglement of the states produced after applying a quantum gate over the whole set of separable states. Here we focus on symmetric two-qubit quantum gates, acting on the symmetric two-qubit space, and calculate the entangling power in terms of the appropriate local invariant. A geometric description of the local equivalence classes of gates is given in terms of the su(3)\text{su}(3)su(3) Lie algebra root vectors. These vectors define a primitive cell with hexagonal symmetry on a plane, and through the Weyl group the minimum area on the plane containing the whole set of locally equivalent quantum gates is identified. We give conditions to determine when a given quantum gate produces maximally entangled states from separable ones (perfect entanglers). We find that these gates correspond to one-fourth of the whole set of locally distinct quantum gates. The formalism developed here is applicable to general three-level systems. Via the Majorana representation, qutrit transformations can be regarded as having entangling power and hence classified as perfect and nonperfect entanglers and be grouped into local-equivalence classes of the associated symmetric two-qubit space. The results are illustrated by an anisotropic Heisenberg model, the Lipkin-Meshkov-Glick model, and two coupled quantized oscillators with cross-Kerr interaction, which we use to obtain three-level gates relevant in qutrit quantum computation.
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.
Abstract It is advantageous for any quantum processor to support different classes of two-qubit quantum logic gates when compiling quantum circuits, a property that is typically not present in existing platforms. In particular, access to a gate set that includes support for the CZ-, iSWAP-, and SWAP-type families of gates renders conversions between these gate families unnecessary during compilation, as any two-qubit Clifford gate can be executed using at most one two-qubit gate from this set, plus additional single-qubit gates. We experimentally demonstrate that a SWAP gate can be decomposed into one iSWAP gate followed by one CZ gate, affirming a more efficient compilation strategy over the conventional approach that relies on three iSWAP or three CZ gates to replace a SWAP gate. Our implementation makes use of a superconducting quantum processor design based on fixed-frequency transmon qubits coupled together by a parametrically modulated tunable transmon coupler, extending this platform’s native gate set so that any two-qubit Clifford unitary matrix can be realized using no more than two two-qubit gates and single-qubit gates.
Abstract There are various gate sets that can be used to describe a quantum computation. A particularly popular gate set in the literature on quantum computing consists of arbitrary single-qubit gates and two-qubit CNOT gates. A CNOT gate is however not always the natural multi-qubit interaction that can be implemented on a given physical quantum computer, necessitating a compilation step that transforms these CNOT gates to the native gate set. An especially interesting case where compilation is necessary is for ion trap quantum computers, where the natural entangling operation can act on more than two qubits and can even act globally on all qubits at once. This calls for an entirely different approach to constructing efficient circuits. In this paper we study the problem of converting a given circuit that uses two-qubit gates to one that uses global gates. Our three main contributions are as follows. First, we find an efficient algorithm for transforming an arbitrary circuit consisting of Clifford gates and arbitrary phase gates into a circuit consisting of single-qubit gates and a number of global interactions proportional to the number of non-Clifford phases present in the original circuit. Second, we find a general strategy to transform a global gate that targets all qubits into one that targets only a subset of the qubits. This approach scales linearly with the number of qubits that are not targeted, in contrast to the exponential scaling reported in (Maslov and Nam 2018 New J. Phys. 20 033018). Third, we improve on the number of global gates required to synthesise an arbitrary n-qubit Clifford circuit from the 12n − 18 reported in (Maslov and Nam 2018 New J. Phys. 20 033018) to 6n − 8.
A common model of quantum computing is the gate model with binary basis states. Here, we consider the gate model of quantum computing with a non-binary radix resulting in more than two basis states to represent a quantum digit, or qudit. Quantum entanglement is an important phenomenon that is a critical component of quantum computation and communications algorithms. The generation and use of entanglement among radix-2 qubits is well-known and used often in quantum computing algorithms. Quantum entanglement exists in higher-radix systems as well although little is written regarding the generation of higher-radix entangled states. We provide background describing the feasibility of multiple-valued logic quantum systems and describe a new systematic method for generating maximally entangled states in quantum systems of dimension greater than two. This method is implemented in a synthesis algorithm that is described. Experimental results are included that demonstrate the transformations needed to create specific forms of maximally entangled quantum states.