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

arXiv:2607.11973

On the Experimental Determination of Nonlocal Characteristics of Two-Qubit Gates

M. Karthick Selvan, S. Balakrishnan

quant-phSubmitted Jul 13, 2026• Announced Jul 14, 2026• 0 citations
arXivHTMLPDF

Abstract

In this paper, we discuss the experimental determination of the nonlocal characteristics of two-qubit gates. Based on the recently derived expressions for the entangling power and gate typicality of two-qubit gates, we construct two-qubit quantum circuits to measure the entangling power and gate typicality of the two-qubit gates, which are generated by the elements of the su(4) Cartan subalgebra. These elements describe the native interactions in many quantum processors. Hence, these circuits can be used to determine the nonlocal characteristics of native gates of many quantum processors. In each circuit, the native gate is applied twice. In addition, each circuit consists of at least one CNOT gate. A set of six two-qubit circuits is constructed to measure the entangling power. The number of circuits is further reduced to three by increasing the nonlocal resources (the number of CNOT gates). To measure the gate typicality, a set of three two-qubit circuits is constructed. Measurement of gate typicality requires more nonlocal resources than the measurement of entangling power.

Comments
7 pages. Research in progress. Comments are welcome

Related papers

Nonlocal characteristics of two-qubit gates from Argand diagram geometry

M. Karthick Selvan, S. Balakrishnan

Abstract We show that the geometrical features of the unimodular squared eigenvalues of the nonlocal part of a two-qubit gate in the complex plane can be used to study the nonlocal characteristics of the two-qubit gate. It has been shown that the entangling power of a two-qubit gate can be expressed in terms of the mean squared length of the chords connecting the squared eigenvalues of the nonlocal part with each other. In this paper, we provide similar expressions for the gate typicality and the linear entropy of two-qubit gates. The expression of gate typicality involves the squared lengths of three chords connecting a squared eigenvalue of the nonlocal part with the complex conjugate of the other three squared eigenvalues. The expression of linear entropy is obtained from the expressions of entangling power and gate typicality. We also express them in terms of the linear entropies of certain two-qubit states. In addition, we show that the normalized entangling power of a two-qubit gate can be provided exact description in the Argand diagram. Finally, we analyze the simplices enclosing the origin in the convex hull of the squared eigenvalues of the nonlocal part of the perfect entangling two-qubit gates to construct a pair of orthonormal product states that can be transformed into maximally entangled states, and divide the region of perfect entanglers in the Weyl chamber into different regions based on the uniqueness of the simplices enclosing the origin.

arXiv:2502.03820•Physica Scripta•Jan 6, 2026•0 citations

Optimal Two-Qubit Gate-Cutting Cost and Measures of Nonlocality

Michael Hart

Circuit cutting enables quantum computations to be decomposed into smaller subcircuits at the cost of additional sampling overhead. Gate-cutting provides one such approach by replacing nonlocal gates with quasiprobability decompositions of local operations. Starting from the known optimal two-qubit gate-cutting formula, we derive complete sharp lower and upper envelopes relating the quasiprobability extent $γ$ to five established descriptors: entangling power, gate typicality, operator entanglement, Schmidt strength, and maximum product-input concurrence. We recast $γ$ as a Rényi-$1/2$ functional of the operator-Schmidt spectrum and show how the physical constraints on two-qubit spectra sharpen generic entropy bounds and select a small set of recurring extremal Cartan families. None of the five descriptors generically determines $γ$ alone, but each imposes exact constraints, revealing how substantially the optimal gate-cutting cost can vary between gates with similar nonlocal characteristics.

quant-pharXiv:2609.30141•Sep 25, 2026•0 citations

Geometric theory of nonlocal two-qubit operations

Jun Zhang, Jiří Vala, Shankar Sastry +1 more

We study nonlocal two-qubit operations from a geometric perspective. By applying a Cartan decomposition to su(4), we find that the geometric structure of nonlocal gates is a 3-torus. We derive the invariants for local transformations, and connect these local invariants to the coordinates of the 3-torus. Since different points on the 3-torus may correspond to the same local equivalence class, we use the Weyl group theory to reduce the symmetry. We show that the local equivalence classes of two-qubit gates are in one-to-one correspondence with the points in a tetrahedron except on the base. We then study the properties of perfect entanglers, that is, the two-qubit operations that can generate maximally entangled states from some initially separable states. We provide criteria to determine whether a given two-qubit gate is a perfect entangler and establish a geometric description of perfect entanglers by making use of the tetrahedral representation of nonlocal gates. We find that exactly half the nonlocal gates are perfect entanglers. We also investigate the nonlocal operations generated by a given Hamiltonian. We first study the gates that can be directly generated by a Hamiltonian. Then we explicitly construct a quantum circuit that contains at most three nonlocal gates generated by a two-body interaction Hamiltonian, together with at most four local gates generated by single-qubit terms. We prove that such a quantum circuit can simulate any arbitrary two-qubit gate exactly, and hence it provides an efficient implementation of universal quantum computation and simulation.

arXiv:quant-ph/0209120•Physical Review A•Apr 18, 2003•436 citations

Entangling power, gate typicality, and measurement-induced phase transitions

Sourav Manna, Vaibhav Madhok, Arul Lakshminarayan

When subject to a nonlocal unitary evolution, qubits in a quantum circuit become increasingly entangled. Conversely, measurements applied to individual qubits lead to their disentanglement from the collective system. The extent of entanglement reduction depends on the frequency of local projective measurements. A delicate balance emerges between unitary evolution, which enhances entanglement, and measurements which diminish it. In the thermodynamic limit, there is a phase transition from volume law entanglement to area law entanglement at a critical value of measurement frequency. This phenomenon, occurring in hybrid quantum circuits with both unitary gates and measurements, is termed as measurement-induced phase transition (MIPT). We study the behavior of MIPT in circuits comprising of two-qubit unitary gates parameterized by Cartan decomposition. We show that the entangling power and gate typicality of the two-qubit local unitaries employed in the circuit can be used to explain the behavior of global bipartite entanglement the circuit can sustain. When the two-qubit gate throughout the circuit is the identity and measurements are the sole driver of the entanglement behavior, we obtain an analytical estimate for the entanglement entropy that shows remarkable agreement with numerical simulations. We also find that the entangling power and gate typicality enable the classification of the two-qubit unitaries by different universality classes of phase transitions that can occur in the hybrid circuit. For all unitaries in a particular universality class, the transition from volume to area law of entanglement occurs with the same exponent that characterizes the phase transition.

arXiv:2407.17776•Physical Review A•Dec 23, 2024•8 citations

Optimal Two-Qubit Gate-Cutting Cost and Measures of Nonlocality — E8 Intelligence Research

Andrew Stewart Caldin

Circuit cutting enables quantum computations to be decomposed into smaller subcircuits at the cost of additional sampling overhead. Gate-cutting provides one such approach by replacing nonlocal gates with quasiprobability decompositions of local operations. Starting from the known optimal two-qubit gate-cutting formula, we derive complete sharp lower and upper envelopes relating the quasiprobability extent $γ$ to five established descriptors: entangling power, gate typicality, operator entanglement, Schmidt strength, and maximum product-input concurrence. We recast $γ$ as a Rényi-$1/2$ functional of the operator-Schmidt spectrum and show how the physical constraints on two-qubit spectra sharpen generic entropy bounds and select a small set of recurring extremal Cartan families. None of the five descriptors generically determines $γ$ alone, but each imposes exact constraints, revealing how substantially the optimal gate-cutting cost can vary between gates with similar nonlocal character Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 13, 2026•0 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•44 citations
In this paper, we discuss the experimental determination of the nonlocal characteristics of two-qubit gates. Based on the recently derived expressions for the entangling power and gate typicality of two-qubit gates, we construct two-qubit quantum circuits to measure the entangling power and gate typicality of the two-qubit gates, which are generated by the elements of the su(4) Cartan subalgebra. These elements describe the native interactions in many quantum processors. Hence, these circuits can be used to determine the nonlocal characteristics of native gates of many quantum processors. In each circuit, the native gate is applied twice. In addition, each circuit consists of at least one CNOT gate. A set of six two-qubit circuits is constructed to measure the entangling power. The number of circuits is further reduced to three by increasing the nonlocal resources (the number of CNOT gates). To measure the gate typicality, a set of three two-qubit circuits is constructed. Measurement of gate typicality requires more nonlocal resources than the measurement of entangling power.
Abstract We show that the geometrical features of the unimodular squared eigenvalues of the nonlocal part of a two-qubit gate in the complex plane can be used to study the nonlocal characteristics of the two-qubit gate. It has been shown that the entangling power of a two-qubit gate can be expressed in terms of the mean squared length of the chords connecting the squared eigenvalues of the nonlocal part with each other. In this paper, we provide similar expressions for the gate typicality and the linear entropy of two-qubit gates. The expression of gate typicality involves the squared lengths of three chords connecting a squared eigenvalue of the nonlocal part with the complex conjugate of the other three squared eigenvalues. The expression of linear entropy is obtained from the expressions of entangling power and gate typicality. We also express them in terms of the linear entropies of certain two-qubit states. In addition, we show that the normalized entangling power of a two-qubit gate can be provided exact description in the Argand diagram. Finally, we analyze the simplices enclosing the origin in the convex hull of the squared eigenvalues of the nonlocal part of the perfect entangling two-qubit gates to construct a pair of orthonormal product states that can be transformed into maximally entangled states, and divide the region of perfect entanglers in the Weyl chamber into different regions based on the uniqueness of the simplices enclosing the origin.
Circuit cutting enables quantum computations to be decomposed into smaller subcircuits at the cost of additional sampling overhead. Gate-cutting provides one such approach by replacing nonlocal gates with quasiprobability decompositions of local operations. Starting from the known optimal two-qubit gate-cutting formula, we derive complete sharp lower and upper envelopes relating the quasiprobability extent γγγ to five established descriptors: entangling power, gate typicality, operator entanglement, Schmidt strength, and maximum product-input concurrence. We recast γγγ as a Rényi-1/21/21/2 functional of the operator-Schmidt spectrum and show how the physical constraints on two-qubit spectra sharpen generic entropy bounds and select a small set of recurring extremal Cartan families. None of the five descriptors generically determines γγγ alone, but each imposes exact constraints, revealing how substantially the optimal gate-cutting cost can vary between gates with similar nonlocal characteristics.
We study nonlocal two-qubit operations from a geometric perspective. By applying a Cartan decomposition to su(4), we find that the geometric structure of nonlocal gates is a 3-torus. We derive the invariants for local transformations, and connect these local invariants to the coordinates of the 3-torus. Since different points on the 3-torus may correspond to the same local equivalence class, we use the Weyl group theory to reduce the symmetry. We show that the local equivalence classes of two-qubit gates are in one-to-one correspondence with the points in a tetrahedron except on the base. We then study the properties of perfect entanglers, that is, the two-qubit operations that can generate maximally entangled states from some initially separable states. We provide criteria to determine whether a given two-qubit gate is a perfect entangler and establish a geometric description of perfect entanglers by making use of the tetrahedral representation of nonlocal gates. We find that exactly half the nonlocal gates are perfect entanglers. We also investigate the nonlocal operations generated by a given Hamiltonian. We first study the gates that can be directly generated by a Hamiltonian. Then we explicitly construct a quantum circuit that contains at most three nonlocal gates generated by a two-body interaction Hamiltonian, together with at most four local gates generated by single-qubit terms. We prove that such a quantum circuit can simulate any arbitrary two-qubit gate exactly, and hence it provides an efficient implementation of universal quantum computation and simulation.
When subject to a nonlocal unitary evolution, qubits in a quantum circuit become increasingly entangled. Conversely, measurements applied to individual qubits lead to their disentanglement from the collective system. The extent of entanglement reduction depends on the frequency of local projective measurements. A delicate balance emerges between unitary evolution, which enhances entanglement, and measurements which diminish it. In the thermodynamic limit, there is a phase transition from volume law entanglement to area law entanglement at a critical value of measurement frequency. This phenomenon, occurring in hybrid quantum circuits with both unitary gates and measurements, is termed as measurement-induced phase transition (MIPT). We study the behavior of MIPT in circuits comprising of two-qubit unitary gates parameterized by Cartan decomposition. We show that the entangling power and gate typicality of the two-qubit local unitaries employed in the circuit can be used to explain the behavior of global bipartite entanglement the circuit can sustain. When the two-qubit gate throughout the circuit is the identity and measurements are the sole driver of the entanglement behavior, we obtain an analytical estimate for the entanglement entropy that shows remarkable agreement with numerical simulations. We also find that the entangling power and gate typicality enable the classification of the two-qubit unitaries by different universality classes of phase transitions that can occur in the hybrid circuit. For all unitaries in a particular universality class, the transition from volume to area law of entanglement occurs with the same exponent that characterizes the phase transition.
Circuit cutting enables quantum computations to be decomposed into smaller subcircuits at the cost of additional sampling overhead. Gate-cutting provides one such approach by replacing nonlocal gates with quasiprobability decompositions of local operations. Starting from the known optimal two-qubit gate-cutting formula, we derive complete sharp lower and upper envelopes relating the quasiprobability extent γγγ to five established descriptors: entangling power, gate typicality, operator entanglement, Schmidt strength, and maximum product-input concurrence. We recast γγγ as a Rényi-1/21/21/2 functional of the operator-Schmidt spectrum and show how the physical constraints on two-qubit spectra sharpen generic entropy bounds and select a small set of recurring extremal Cartan families. None of the five descriptors generically determines γγγ alone, but each imposes exact constraints, revealing how substantially the optimal gate-cutting cost can vary between gates with similar nonlocal character Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
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.