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:2608.24084

Lifting connectivity bottlenecks in superconducting quantum processors via enriched native two-qubit gates

Hanyi Wang, Jingzhe Guo, Lijun Sun, Zhaohui Yang, Weizhi Tao, Xingye Yuan, Qiankun Wang, Bihao Guo, Chunwang Liu, Rui Yang, Yang Li, Yu Fan, Jiasheng Hu, Junhe Wang, Shuyue Zheng, Shengbin Wang, Xinfang Zhang, Feng Wu, Hantao Sun, Jianxin Chen

quant-phSubmitted Aug 25, 2026• Announced Aug 26, 2026• 0 citations
arXivHTMLPDF

Abstract

Limited qubit connectivity is a central architectural constraint in superconducting quantum processors, whose planar layouts require additional gates to mediate interactions between distant qubits. Here, we use 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, effectively transforming a sparse hardware graph into a more connected computational architecture. For the benchmark instances studied, the resulting synthesis capability enables reliable execution on constrained one- and two-dimensional lattices, with compiled two-qubit gate counts approaching those of an all-to-all-connected reference. 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 compared with controlled-Z-based compilation, respectively. Using AshN gates, we prepare an eight-qubit two-excitation Dicke state with a fidelity of $0.736$ and certify its genuine multipartite entanglement using a fully positive-partial-transpose witness, whereas the same witness does not certify entanglement for the CZ-based implementation. The state fidelity and entanglement certification remain robust across the tested lattice configurations, including those with up to three connectivity defects. Our work establishes native-gate engineering as a practical approach to mitigating connectivity constraints.

Comments
9+26 pages,4+18 figures

Related papers

Reconfigurable Bus-based Quantum Router for Modular Superconducting Processors

Benzheng Yuan, chaojie Zhang, Yangyang Fei +7 more

Scaling superconducting quantum processors requires interconnects that provide both non-local connectivity and parallel entangling operations. While current quantum routers offer greater connectivity than nearest-neighbour topologies, their support for parallel, independently addressable two-qubit gates remains fundamentally limited, imposing severe compilation overheads that constitute a critical bottleneck. Here we introduce a bus-based reconfigurable quantum router that enables parallel controlled-$Z$ (CZ) gates for modular superconducting processors. Constructed from a flux-tunable SQUID network, the router selectively connects interface qubits to two shared buses, allowing destructive interference to suppress idle interactions while supporting two disjoint CZ gates in parallel. Full-system Hamiltonian simulations yield parallel-gate infidelities ranging from $7.9\times10^{-4}$ to $1.8\times10^{-3}$ under the operating conditions considered, and an open-system analysis identifies the coherence requirements for high-fidelity operation. We further assess the circuit-level consequences using hardware-aware compilation and resource-constrained scheduling. For the 36-qubit quantum Fourier transform (QFT), QAOA-MaxCut, and random-pairing circuits, the router reduces the median SWAP count by up to $34\%$ and the native CZ count by up to $20\%$ relative to a matched two-dimensional grid. Circuit-depth reductions are workload-dependent, reaching $20\%$ for QAOA-MaxCut but remaining negligible for the QFT despite its lower gate count. These results show that enhanced connectivity and schedulable parallelism provide complementary benefits for connectivity-intensive algorithms, establishing the router as a compiler-visible hardware resource and providing a scalable architectural pathway toward constructing highly connected modular superconducting quantum processors.

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

Efficient Implementation of Arbitrary Two-Qubit Gates via Unified Control

Zhe Chen, Weiyang Liu, Yanjun Ma +16 more

The native gate set is fundamental to the performance of quantum devices, as it governs the accuracy of basic quantum operations and dictates the complexity of implementing quantum algorithms. Traditional approaches to extending gate sets often require accessing multiple transitions within an extended Hilbert space, leading to increased control complexity while offering only a limited set of gates. Here, we experimentally demonstrate a unified and highly versatile gate scheme capable of natively generating arbitrary two-qubit gates using only exchange interaction and qubit driving on a superconducting quantum processor, achieving maximum expressivity. Using a state-of-the-art transmon-coupler-transmon architecture, we achieve high fidelities averaging $99.37 \pm 0.07\%$ across a wide range of commonly used two-qubit unitaries. This outstanding performance, combined with reduced complexity, enables precise multipartite entangled state preparation, as demonstrated. To further enhance its applicability, we also show the high-fidelity realization of the unique B gate, which efficiently synthesizes the entire family of two-qubit gates. Our results highlight that fully exploiting the capabilities of a single interaction can yield a comprehensive and highly accurate gate set. With maximum expressivity, gate-time optimality, demonstrated high fidelity, and easy adaptability to other quantum platforms, our unified control scheme paves the way for optimal performance in quantum devices, offering exciting prospects for advancing quantum hardware and algorithm development.

arXiv:2502.03612•Feb 5, 2025•0 citations

Efficient nnn-qubit entangling operations via a superconducting quantum router

Xuntao Wu, Haoxiong Yan, Gustav Andersson +13 more

Quantum algorithms on near-term quantum processors are typically executed using shallow quantum circuits composed of one- and two-qubit gates. However, as circuit depth and gate number increase, gate imperfections and qubit decoherence begin to dominate, limiting algorithmic complexity. An alternative approach is to explore gates involving more than two qubits. In previous work (X. Wu et al., Physical Review X 14, 041030 (2024)), we demonstrated a new superconducting qubit architecture with user-selectable two-qubit interactions via a reconfigurable router, used to connect pairs of qubits. Here, we leverage this novel architecture to realize programmable and efficient multi-qubit operations involving more than two qubits, resulting in faster preparation of multi-qubit entangled states with good fidelities. We also successfully apply model-free reinforcement learning to perform multi-qubit gates, including training a two-qubit controlled-Z gate as well as three-qubit controlled-SWAP and controlled-controlled-phase (Fredkin and Toffoli) gates. Higher $n$th-order gates may also be feasible, using our high-connectivity router design. This could provide a more efficient and higher-fidelity implementation of complex quantum algorithms and a more practical approach to quantum computation.

quant-pharXiv:2604.15432•Apr 20, 2026•0 citations

Scalable Single-Step Generation of W States in 2D Superconducting Qubit Lattices

João H. Romeiro, Federico A. Roy, Niklas Bruckmoser +13 more

The reliable generation of multi-qubit entanglement is a prerequisite for large-scale quantum information technologies. In particular, W states are a valuable resource owing to their resilience under local loss or measurement. Nevertheless, preparing these states with sequential two-qubit gates often requires substantial time overhead. By contrast, engineered simultaneous interactions enable fast entanglement generation, even in qubit systems with limited nearest-neighbour connectivity. Here, we demonstrate a set of fast and robust operations for coherently distributing a single excitation across a lattice of arbitrary size, thereby directly generating W states from initial product states. In 2D lattices, the excitation propagates along both directions simultaneously, such that the total entanglement time scales only with the largest dimension. We exploit this property to prepare a six-qubit W state in a 3$\times$2 superconducting lattice within 99 ns, achieving a tomographic fidelity of 83.9$\pm$1.0%. We then extend the protocol to create entanglement across chains of up to seven qubits, with the largest W state generated in 264 ns with a fidelity of 79.6$\pm$1.3%.

quant-pharXiv:2605.18962•May 20, 2026•0 citations

Efficient implementation of arbitrary two-qubit gates using unified control

Zhen Chen, Weiyang Liu, Yanjun Ma +16 more

The set of quantum logic gates that can be easily implemented is fundamental to the performance of quantum computers, as it governs the accuracy of basic quantum operations and dictates the complexity of implementing quantum algorithms. Traditional approaches to extending gate sets often require operating devices outside the ideal parameter regimes used to realize qubits, leading to increased control complexity while offering only a limited set of gates. Here we experimentally demonstrate a unified and versatile gate scheme capable of generating arbitrary two-qubit gates using only an exchange interaction and qubit driving on a superconducting quantum processor. We achieve high fidelities averaging 99.38% across a wide range of commonly used two-qubit unitaries, enabling precise multipartite entangled state preparation. Furthermore, we successfully produce a B gate, which efficiently synthesizes the entire family of two-qubit gates. Our results establish that fully exploiting the capabilities of the exchange interaction can yield a comprehensive and highly accurate gate set. With maximum expressivity, optimal gate time, demonstrated high fidelity and easy adaption to other quantum platforms, our unified control scheme offers the prospect of improved performance in quantum hardware and algorithm development. The efficiency of a quantum computer depends on which basic operations it can implement. Now a scheme that can implement any two-qubit logic gate has been demonstrated on a superconducting architecture.

Nature Physics•Aug 15, 2025•18 citations

Native CCZ Gate with Fluxonium Qubits and a Microwave-Driven Coupler

Grigoriy S. Mazhorin, Tatyana A. Chudakova, Alena S. Kazmina +12 more

Native multi-qubit gates could reduce the overhead associated with decompositions into single- and two-qubit operations, but whether they can simultaneously provide high fidelity, simple control and robustness against parasitic interactions in scalable architectures remains unclear. Here we experimentally realize a 65-ns native controlled-controlled-phase operation, locally equivalent to the Toffoli gate, with a fidelity of 99.39(5)% in a three-qubit processor unit based on fluxonium qubits coupled via a microwave-driven transmon coupler. The implemented operation would require CZ fidelities of approximately 99.94% if realized through a conventional decomposition. The gate is implemented with a single control pulse, that relies on a simple calibration procedure yielding coherence-limited performance. This processor unit naturally extends to scalable two-dimensional layouts with low parasitic interactions. Altogether, these results establish native multi-qubit gates as a viable hardware-efficient primitive for scalable superconducting quantum processors.

quant-pharXiv:2607.27094•Jul 30, 2026•0 citations
Limited qubit connectivity is a central architectural constraint in superconducting quantum processors, whose planar layouts require additional gates to mediate interactions between distant qubits. Here, we use 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, effectively transforming a sparse hardware graph into a more connected computational architecture. For the benchmark instances studied, the resulting synthesis capability enables reliable execution on constrained one- and two-dimensional lattices, with compiled two-qubit gate counts approaching those of an all-to-all-connected reference. Across seven benchmark circuits on one- and two-dimensional topologies, the AshN-based implementation achieves geometric-mean reductions of 45.2%45.2\%45.2% and 43.7%43.7\%43.7% in two-qubit gate count compared with controlled-Z-based compilation, respectively. Using AshN gates, we prepare an eight-qubit two-excitation Dicke state with a fidelity of 0.7360.7360.736 and certify its genuine multipartite entanglement using a fully positive-partial-transpose witness, whereas the same witness does not certify entanglement for the CZ-based implementation. The state fidelity and entanglement certification remain robust across the tested lattice configurations, including those with up to three connectivity defects. Our work establishes native-gate engineering as a practical approach to mitigating connectivity constraints.
Scaling superconducting quantum processors requires interconnects that provide both non-local connectivity and parallel entangling operations. While current quantum routers offer greater connectivity than nearest-neighbour topologies, their support for parallel, independently addressable two-qubit gates remains fundamentally limited, imposing severe compilation overheads that constitute a critical bottleneck. Here we introduce a bus-based reconfigurable quantum router that enables parallel controlled-ZZZ (CZ) gates for modular superconducting processors. Constructed from a flux-tunable SQUID network, the router selectively connects interface qubits to two shared buses, allowing destructive interference to suppress idle interactions while supporting two disjoint CZ gates in parallel. Full-system Hamiltonian simulations yield parallel-gate infidelities ranging from 7.9×10−47.9\times10^{-4}7.9×10−4 to 1.8×10−31.8\times10^{-3}1.8×10−3 under the operating conditions considered, and an open-system analysis identifies the coherence requirements for high-fidelity operation. We further assess the circuit-level consequences using hardware-aware compilation and resource-constrained scheduling. For the 36-qubit quantum Fourier transform (QFT), QAOA-MaxCut, and random-pairing circuits, the router reduces the median SWAP count by up to 34%34\%34% and the native CZ count by up to 20%20\%20% relative to a matched two-dimensional grid. Circuit-depth reductions are workload-dependent, reaching 20%20\%20% for QAOA-MaxCut but remaining negligible for the QFT despite its lower gate count. These results show that enhanced connectivity and schedulable parallelism provide complementary benefits for connectivity-intensive algorithms, establishing the router as a compiler-visible hardware resource and providing a scalable architectural pathway toward constructing highly connected modular superconducting quantum processors.
The native gate set is fundamental to the performance of quantum devices, as it governs the accuracy of basic quantum operations and dictates the complexity of implementing quantum algorithms. Traditional approaches to extending gate sets often require accessing multiple transitions within an extended Hilbert space, leading to increased control complexity while offering only a limited set of gates. Here, we experimentally demonstrate a unified and highly versatile gate scheme capable of natively generating arbitrary two-qubit gates using only exchange interaction and qubit driving on a superconducting quantum processor, achieving maximum expressivity. Using a state-of-the-art transmon-coupler-transmon architecture, we achieve high fidelities averaging 99.37±0.07%99.37 \pm 0.07\%99.37±0.07% across a wide range of commonly used two-qubit unitaries. This outstanding performance, combined with reduced complexity, enables precise multipartite entangled state preparation, as demonstrated. To further enhance its applicability, we also show the high-fidelity realization of the unique B gate, which efficiently synthesizes the entire family of two-qubit gates. Our results highlight that fully exploiting the capabilities of a single interaction can yield a comprehensive and highly accurate gate set. With maximum expressivity, gate-time optimality, demonstrated high fidelity, and easy adaptability to other quantum platforms, our unified control scheme paves the way for optimal performance in quantum devices, offering exciting prospects for advancing quantum hardware and algorithm development.
Quantum algorithms on near-term quantum processors are typically executed using shallow quantum circuits composed of one- and two-qubit gates. However, as circuit depth and gate number increase, gate imperfections and qubit decoherence begin to dominate, limiting algorithmic complexity. An alternative approach is to explore gates involving more than two qubits. In previous work (X. Wu et al., Physical Review X 14, 041030 (2024)), we demonstrated a new superconducting qubit architecture with user-selectable two-qubit interactions via a reconfigurable router, used to connect pairs of qubits. Here, we leverage this novel architecture to realize programmable and efficient multi-qubit operations involving more than two qubits, resulting in faster preparation of multi-qubit entangled states with good fidelities. We also successfully apply model-free reinforcement learning to perform multi-qubit gates, including training a two-qubit controlled-Z gate as well as three-qubit controlled-SWAP and controlled-controlled-phase (Fredkin and Toffoli) gates. Higher nnnth-order gates may also be feasible, using our high-connectivity router design. This could provide a more efficient and higher-fidelity implementation of complex quantum algorithms and a more practical approach to quantum computation.
The reliable generation of multi-qubit entanglement is a prerequisite for large-scale quantum information technologies. In particular, W states are a valuable resource owing to their resilience under local loss or measurement. Nevertheless, preparing these states with sequential two-qubit gates often requires substantial time overhead. By contrast, engineered simultaneous interactions enable fast entanglement generation, even in qubit systems with limited nearest-neighbour connectivity. Here, we demonstrate a set of fast and robust operations for coherently distributing a single excitation across a lattice of arbitrary size, thereby directly generating W states from initial product states. In 2D lattices, the excitation propagates along both directions simultaneously, such that the total entanglement time scales only with the largest dimension. We exploit this property to prepare a six-qubit W state in a 3$\times2superconductinglatticewithin99ns,achievingatomographicfidelityof83.92 superconducting lattice within 99 ns, achieving a tomographic fidelity of 83.92superconductinglatticewithin99ns,achievingatomographicfidelityof83.9\pm1.01.0%. We then extend the protocol to create entanglement across chains of up to seven qubits, with the largest W state generated in 264 ns with a fidelity of 79.61.0\pm$1.3%.
The set of quantum logic gates that can be easily implemented is fundamental to the performance of quantum computers, as it governs the accuracy of basic quantum operations and dictates the complexity of implementing quantum algorithms. Traditional approaches to extending gate sets often require operating devices outside the ideal parameter regimes used to realize qubits, leading to increased control complexity while offering only a limited set of gates. Here we experimentally demonstrate a unified and versatile gate scheme capable of generating arbitrary two-qubit gates using only an exchange interaction and qubit driving on a superconducting quantum processor. We achieve high fidelities averaging 99.38% across a wide range of commonly used two-qubit unitaries, enabling precise multipartite entangled state preparation. Furthermore, we successfully produce a B gate, which efficiently synthesizes the entire family of two-qubit gates. Our results establish that fully exploiting the capabilities of the exchange interaction can yield a comprehensive and highly accurate gate set. With maximum expressivity, optimal gate time, demonstrated high fidelity and easy adaption to other quantum platforms, our unified control scheme offers the prospect of improved performance in quantum hardware and algorithm development. The efficiency of a quantum computer depends on which basic operations it can implement. Now a scheme that can implement any two-qubit logic gate has been demonstrated on a superconducting architecture.
Native multi-qubit gates could reduce the overhead associated with decompositions into single- and two-qubit operations, but whether they can simultaneously provide high fidelity, simple control and robustness against parasitic interactions in scalable architectures remains unclear. Here we experimentally realize a 65-ns native controlled-controlled-phase operation, locally equivalent to the Toffoli gate, with a fidelity of 99.39(5)% in a three-qubit processor unit based on fluxonium qubits coupled via a microwave-driven transmon coupler. The implemented operation would require CZ fidelities of approximately 99.94% if realized through a conventional decomposition. The gate is implemented with a single control pulse, that relies on a simple calibration procedure yielding coherence-limited performance. This processor unit naturally extends to scalable two-dimensional layouts with low parasitic interactions. Altogether, these results establish native multi-qubit gates as a viable hardware-efficient primitive for scalable superconducting quantum processors.