When More Becomes Less: Topology-Reversed Three-Qubit Gate Performance on IBM Quantum Processors

• URL: http://arxiv.org/abs/2608.21004v1
• Date: Fri, 21 Aug 2026 11:48:16 GMT
• Title: When More Becomes Less: Topology-Reversed Three-Qubit Gate Performance on IBM Quantum Processors
• Abstract summary: We show that a circuit with more abstract two-qubit gates can yield the better physical implementation of an exact decomposition.<n>We compare these circuits on sampled linear triples of the 156-qubit IBM Quantum Heron processors textttibm_fez and textttibm_kingston.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The exact Toffoli gate admits a six-CX decomposition, denoted by $CCX_6$, that is optimal under unrestricted two-qubit connectivity. On a linear three-qubit topology, however, $CCX_6$ contains 4 nearest-neighbor CX gates and 2 non-nearest-neighbor CX gates. By contrast, an alternative exact decomposition, denoted by $CCX_8$, uses only 8 nearest-neighbor CX gates. Because CCX is locally equivalent to CCZ, we perform the experiments using the corresponding $\cczs$ and $\cczl$ circuits. We compare these circuits on sampled linear triples of the 156-qubit IBM Quantum Heron processors \texttt{ibm\_fez} and \texttt{ibm\_kingston}. Under the compilation protocol, the nominal $\cczs$ circuit becomes a twelve-CZ implementation, whereas the linear-nearest-neighbor circuit retains eight native CZ gates. Experimentally measured ensemble-feature-selection estimates favor the eight-CZ realization on nearly all retained triples. We test the same ordering by preparing a three-qubit hypergraph state, which probes the coherent conditional phase rather than only computational-basis populations. The measured hypergraph-state infidelity is lower for the $\cczl$ circuit for most triples on both processors. Phase-altered interleaved randomized benchmarking provides a complementary comparison of Clifford surrogates preserving the two compiled entangling structures. Within the scope of the tested circuits and phase-sensitive input state, the results demonstrate that hardware connectivity can reverse the operational ranking of exact decompositions: a circuit with more abstract two-qubit gates can yield the better physical implementation.

Related papers

• Link-middle-cut lower bounds for Clifford circuit synthesis [0.0]
  Minimizing the number of CNOT gates required to synthesize a Clifford operator is a central problem in quantum circuit optimization.<n>We extend the link--middle-cut (LMC) framework for linear circuits to Clifford operators represented by binary symplectic tableaux.
  arXiv  Detail & Related papers  (2026-09-14T18:42:19Z)
• Lifting connectivity bottlenecks in superconducting quantum processors via enriched native two-qubit gates [34.19474515722751]
  We introduce the AshN control scheme, where rich two-qubit control on every nearest-neighbour pair allows a logical interaction and the required qubit routing to be merged into a single native operation.<n>For the benchmark instances studied, the resulting synthesis capability enables reliable execution on constrained one- and two-dimensional lattices.<n>Across seven benchmark circuits on one- and two-dimensional topologies, the AshN-based implementation achieves geometric-mean reductions of $45.2%$ and $43.7%$ in two-qubit gate count.
  arXiv  Detail & Related papers  (2026-08-25T05:31:25Z)
• Good Stabilizer Codes from Shallow Clifford Circuits with Random Matchings [1.0171167503994478]
  We show that random circuits on two-qubit Clifford gates provide encoders that achieve the quantum Gilbert-Varshamov rate-distance tradeoff with depth.<n>We show that the same tradeoff is attained in optimal $O(log n)$ depth under a gate distribution with a more restricted support.<n>These regularity conditions allow us to reduce the second-moment dynamics of our random circuits to a reversible Markov chain on binary support strings.
  arXiv  Detail & Related papers  (2026-08-19T04:39:23Z)
• Towards logical entanglement creation in trivalent planar architectures [0.8051523919648371]
  Low-overhead quantum error-correction schemes are essential for enabling quantum computation on registers containing multiple logical qubits.<n>Recent work has shown that a physical-qubit connectivity of degree three is sufficient to implement fault-tolerant quantum error correction.<n>We study lattice surgery in the context of such trivalent architectures and introduce scalable circuit constructions to implement it.
  arXiv  Detail & Related papers  (2026-07-16T14:22:32Z)
• Quantum-Adaptive KS($\varphi$): A Parameterized Three-Qubit Gate Family Embedding Toffoli with Measurement-Free Phase Kickback and Intrinsic Error Non-Amplification [0.0]
  Quantum-Adaptive KS($varphi$) ($K$ = kickback, $S$ = sandwich) is a parameterized three-qubit gate family that structurally embeds the Toffoli (CCX) gate.<n>Gate preserves the three-qubit footprint of CCX with no qubit overhead.
  arXiv  Detail & Related papers  (2026-05-22T20:15:26Z)
• Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators [36.94429692322632]
  Finite local Hilbert-space truncations arise naturally in quantum simulations of lattice field theories and motivate qudit encodings.<n>We compare the non-Clifford cost of implementing diagonal evolutions, exemplified by $U=e-it_x2$ in a uniform field-amplitude discretization of a real scalar field, using either one logical $d$-level qudit or $n_b=eil log drceil$ logical qubits.
  arXiv  Detail & Related papers  (2026-04-29T15:25:08Z)
• 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)
• Reducing T Gates with Unitary Synthesis [0.41873449350124814]
  This work presents a novel FT synthesis algorithm that directly synthesizes arbitrary single-qubit unitaries.<n>By leveraging tensor network-based search, our approach enables native $U3$ synthesis, reducing the $T$ count, Clifford gate count, and approximation error.
  arXiv  Detail & Related papers  (2025-03-20T04:53:54Z)
• On the Constant Depth Implementation of Pauli Exponentials [49.48516314472825]
  We decompose $Zotimes n$ exponentials of arbitrary length into circuits of constant depth using $mathcalO(n)$ ancillae and two-body XX and ZZ interactions.<n>We prove the correctness of our approach, after introducing novel rewrite rules for circuits which benefit from qubit recycling.
  arXiv  Detail & Related papers  (2024-08-15T17:09:08Z)
• Fault-tolerant compiling of classically hard IQP circuits on hypercubes [34.225996865725605]
  We develop a hardware-efficient, fault-tolerant approach to realizing quantum sampling circuits.<n>We develop a theory of second-moment properties of degree-$D$ IQP circuits for analyzing hardness and verification of random sampling.<n>Our results highlight fault-tolerant compiling as a powerful tool in co-configurable algorithms with specific error-correcting codes and realistic hardware.
  arXiv  Detail & Related papers  (2024-04-29T18:00:03Z)
• 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)
• Realization of high-fidelity CZ and ZZ-free iSWAP gates with a tunable coupler [40.456646238780195]
  Two-qubit gates at scale are a key requirement to realize the full promise of quantum computation and simulation. We present a systematic approach that goes beyond the dispersive approximation to exploit the engineered level structure of the coupler and optimize its control. We experimentally demonstrate CZ and $ZZ$-free iSWAP gates with two-qubit interaction fidelities of $99.76 pm 0.07$% and $99.87 pm 0.23$%, respectively.
  arXiv  Detail & Related papers  (2020-11-02T19:09:43Z)

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.