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

• URL: http://arxiv.org/abs/2607.11973v1
• Date: Mon, 13 Jul 2026 02:15:56 GMT
• Title: On the Experimental Determination of Nonlocal Characteristics of Two-Qubit Gates
• Abstract summary: We construct two-qubit quantum circuits to measure the entangling power and gate typicality of two-qubit gates.<n>These circuits can be used to determine the nonlocal characteristics of native gates of many quantum processors.
• Score: 0.3580891736370874
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Verifiable quantum advantage in extremely low depth [52.51019642214249]
  We give a problem that is solvable by shallow quantum circuits, hard for computation in time under lattice-based assumptions.<n>We prove that shallow quantum circuits have sufficient structure to solve certain classically hard tasks whose solutions can be verified efficiently.
  arXiv  Detail & Related papers  (2026-09-01T15:54:34Z)
• Efficient $n$-qubit entangling operations via a superconducting quantum router [34.68251047419923]
  We demonstrate a new superconducting qubit architecture with user-selectable two-qubit interactions via a reconfigurable router.<n>Here, we leverage this novel architecture to realize programmable and efficient multi-qubit operations involving more than two qubits.
  arXiv  Detail & Related papers  (2026-04-16T18:00:04Z)
• Implementation of non-local arbitrary two-qubit controlled gates via geometric quantum computation with Rydberg anti-blockade [24.262104055477305]
  This paper proposes a new scheme for a high-fidelity controlled-unitary gate based on non-adiabatic holonomic quantum computation.<n> Numerical simulations show that the geometric gate maintains high fidelity even in the presence of spontaneous radiation and laser intensity errors.
  arXiv  Detail & Related papers  (2026-03-18T12:20:31Z)
• Optimizing Quantum Circuits via ZX Diagrams using Reinforcement Learning and Graph Neural Networks [38.499527873574436]
  We introduce a framework based on ZX calculus, graph-neural networks and reinforcement learning for quantum circuit optimization.<n>By combining reinforcement learning and tree search, our method addresses the challenge of selecting optimal sequences of ZX calculus rewrite rules.<n>We demonstrate our method's competetiveness with state-of-the-art circuit generalizations and capabilities on large sets of diverse random circuits.
  arXiv  Detail & Related papers  (2025-04-04T13:19:08Z)
• Optimization Driven Quantum Circuit Reduction [20.697821016522358]
  We propose three different transpilation approaches to substantially reduce circuit lengths without affecting functionality.<n>The first variant is based on a search scheme, and the other variants are driven by a database retrieval scheme and a machine learning based decision support.<n>We show that our proposed methods generate short quantum circuits for restricted gate sets, superior to the typical results obtained by using different qiskit optimization levels.
  arXiv  Detail & Related papers  (2025-02-20T16:41:10Z)
• Geometric Quantum Machine Learning with Horizontal Quantum Gates [41.912613724593875]
  We propose an alternative paradigm for the symmetry-informed construction of variational quantum circuits. We achieve this by introducing horizontal quantum gates, which only transform the state with respect to the directions to those of the symmetry. For a particular subclass of horizontal gates based on symmetric spaces, we can obtain efficient circuit decompositions for our gates through the KAK theorem.
  arXiv  Detail & Related papers  (2024-06-06T18:04:39Z)
• Error-corrected Hadamard gate simulated at the circuit level [42.002147097239444]
  We simulate the logical Hadamard gate in the surface code under a circuit-level noise model. Our paper is the first to do this for a unitary gate on a quantum error-correction code.
  arXiv  Detail & Related papers  (2023-12-18T19:00:00Z)
• Cat-qubit-inspired gate on cos($2\theta$) qubits [77.34726150561087]
  We introduce a single-qubit $Z$ gate inspired by the noise-bias preserving gate of the Kerr-cat qubit. This scheme relies on a $pi$ rotation in phase space via a beamsplitter-like transformation between a qubit and ancilla qubit.
  arXiv  Detail & Related papers  (2023-04-04T23:06:22Z)
• Decomposition of Multi-controlled Special Unitary Single-Qubit Gates [1.412197703754359]
  Multi-controlled unitary gates have been a subject of interest in quantum computing since its inception. Current state-of-the-art approach to implementing n-qubit multi-controlled gates involves the use of a quadratic number of single-qubit and CNOT gates. We present a new decomposition of n-qubit multi-controlled SU(2) gates that requires a circuit with a number of CNOT gates proportional to 20n.
  arXiv  Detail & Related papers  (2023-02-13T14:08:53Z)
• Optimizing the number of CNOT gates in one-dimensional nearest-neighbor quantum Fourier transform circuit [0.0]
  We construct a one-dimensional nearest-neighbor circuit of quantum Fourier transform (QFT) It is found that our method reduces the number of CNOT gates by 60%. Our results for the one-dimensional nearest-neighbor circuit can be applied to quantum amplitude estimation.
  arXiv  Detail & Related papers  (2022-08-30T13:24:16Z)
• Controlled Gate Networks: Theory and Application to Eigenvalue Estimation [4.730015803477772]
  We introduce a new scheme for quantum circuit design called controlled gate networks.<n>Rather than trying to reduce the complexity of individual unitary operations, the new strategy is to toggle between all of the unitary operations needed with the fewest number of gates.<n>We show that, under quite general conditions, it can significantly reduce the number of two-qubit gates needed to produce linear combinations of unitary operators.
  arXiv  Detail & Related papers  (2022-08-29T12:46:46Z)
• Extensive characterization of a family of efficient three-qubit gates at the coherence limit [0.4471952592011114]
  We implement a three-qubit gate by simultaneously applying two-qubit operations. We generate two classes of entangled states, the GHZ and W states, by applying the new gate only once. We analyze the experimental and statistical errors on the fidelity of the gates and of the target states.
  arXiv  Detail & Related papers  (2022-07-06T19:42:29Z)
• Reduction of circuit depth by mapping qubit-based quantum gates to a qudit basis [0.0]
  We present a scalable set of universal gates and multiply controlled gates in a qudit basis. We identify the set of U(2) rotations required to implement each gate for any qudit of size N. We show that multiply controlled gates are the driving factor in the reduction of circuit complexity for qudit-based system scales with D.
  arXiv  Detail & Related papers  (2021-09-21T01:18:27Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.