Related papers: Low-rank geometry of two-qubit gates

Low-rank geometry of two-qubit gates

URL: http://arxiv.org/abs/2604.15102v1
Date: Thu, 16 Apr 2026 14:59:22 GMT
Title: Low-rank geometry of two-qubit gates
Abstract summary: We present a framework based on the determinantal geometry of two-qubit gates.<n>We show that the square root iSWAP gate is the closest perfect entangler to the variety of local operations.
Score: 0.0
License: http://creativecommons.org/licenses/by/4.0/
Abstract: We present a framework based on the determinantal geometry of two-qubit gates. Combining the Weyl chamber representation with operator Schmidt theory, we interpret gate synthesis as a distance problem to determinantal varieties. This gives an operational geometry to the Weyl chamber, quantifying nonlocal complexity. We show that the square root iSWAP gate is the closest perfect entangler to the variety of local operations, and that no perfect entangler can be approximated by a local gate with average gate fidelity above 79.8%. The three different determinantal costs form a synthesis-adapted coordinate system that encodes nonlocal complexity and generally reconstructs the Weyl chamber.

Related papers

Unitary Designs from Doped Matchgate Circuits [0.0]
We study a controlled route by doping matchgate circuits with non-Gaussian gates-physically.<n>We find approximate parity-preserving $2$-designs in polylogarithmic depth with a sparse non-Gaussian gate count.<n>Our results establish doped matchgate circuits as a controlled, analytically tractable route from free fermions to interaction-generated quantum designs.
arXiv Detail & Related papers (2026-06-22T18:00:04Z)
Untangling Surface Codes: Bridging Braids and Lattice Surgery [51.748182660642776]
We present a systematic method for translating fault-tolerant quantum circuits between their braiding and lattice surgery representations within the surface code.<n>Our framework provides a foundation for the automated verification, compilation, and benchmarking of large-scale surface code computations.
arXiv Detail & Related papers (2025-11-27T10:12:38Z)
Universal fault tolerant quantum computation in 2D without getting tied in knots [1.796950496605906]
We show how to perform fault-tolerant non-Clifford gates in two dimensions.<n>We formulate a path framework which provides both a macroscopic picture for different logical gates as well as a way to derive the associated microscopic circuits.
arXiv Detail & Related papers (2025-03-19T23:59:46Z)
Nonlocal characteristics and argand diagram of two-qubit gates [0.0]
The entangling power of a two-qubit gate can be expressed in terms of the squared lengths of the first set of chords.<n>The linear entropy of a two-qubit gate can be expressed using the squared lengths of both sets of chords.
arXiv Detail & Related papers (2025-02-06T07:15:24Z)
Geometric two-qubit gates in silicon-based double quantum dots [0.0]
We propose strategy to implement geometric two-qubit gates for silicon-based spin qubits. It is found that the implemented geometric gates can obtain fidelities surpassing 99% for the noise level related to the experiments.
arXiv Detail & Related papers (2024-09-01T03:39:22Z)
A T-depth two Toffoli gate for 2D square lattice architectures [49.88310438099143]
We present a novel Clifford+T decomposition of a Toffoli gate. Our decomposition requires no SWAP gates in order to be implemented on 2D square lattices of qubits. This decomposition enables shallower, more fault-tolerant quantum computations on both NISQ and error-corrected architectures.
arXiv Detail & Related papers (2023-11-21T10:33:51Z)
Quantum control landscape for generation of $H$ and $T$ gates in an open qubit with both coherent and environmental drive [57.70351255180495]
An important problem in quantum computation is generation of single-qubit quantum gates such as Hadamard ($H$) and $pi/8$ ($T$) Here we consider the problem of optimal generation of $H$ and $T$ gates using coherent control and the environment as a resource acting on the qubit via incoherent control.
arXiv Detail & Related papers (2023-09-05T09:05:27Z)
Efficient variational synthesis of quantum circuits with coherent multi-start optimization [1.3108652488669734]
We consider the problem of synthesis into a gate set consisting of the CNOT gate and arbitrary single-qubit (1q) gates. A key idea we propose is to use parametrized two-qubit (2q) controlled phase gates, which can interpolate between the identity gate and the CNOT gate. This coherent optimization of the architecture together with 1q gates appears to work surprisingly well in practice.
arXiv Detail & Related papers (2022-05-02T18:00:03Z)
Software mitigation of coherent two-qubit gate errors [55.878249096379804]
Two-qubit gates are important components of quantum computing. But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications. We present two software methods to mitigate parasitic two-qubit gate errors.
arXiv Detail & Related papers (2021-11-08T17:37:27Z)
Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z)
Solving correlation clustering with QAOA and a Rydberg qudit system: a full-stack approach [94.37521840642141]
We study the correlation clustering problem using the quantum approximate optimization algorithm (QAOA) and qudits. Specifically, we consider a neutral atom quantum computer and propose a full stack approach for correlation clustering. We show the qudit implementation is superior to the qubit encoding as quantified by the gate count.
arXiv Detail & Related papers (2021-06-22T11:07:38Z)

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