Scalable Fluxonium-Transmon Architecture for Error Corrected Quantum Processors

• URL: http://arxiv.org/abs/2508.09267v1
• Date: Tue, 12 Aug 2025 18:20:05 GMT
• Title: Scalable Fluxonium-Transmon Architecture for Error Corrected Quantum Processors
• Authors: Lukas Heunisch, Longxiang Huang, Stephan Tasler, Johannes Schirk, Florian Wallner, Verena Feulner, Bijita Sarma, Klaus Liegener, Christian M. F. Schneider, Stefan Filipp, Michael J. Hartmann,
• Abstract summary: We propose a hybrid quantum computing architecture composed of alternating fluxonium and transmon qubits.<n>We show that this system offers excellent scaling properties, characterized by engineered zero $ZZ$-crosstalk in the idle regime.<n>For the implementation of error correcting codes, our approach can leverage the long coherence times and large non-linearities of fluxoniums as data qubits.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We propose a hybrid quantum computing architecture composed of alternating fluxonium and transmon qubits, that are coupled via transmon tunable couplers. We show that this system offers excellent scaling properties, characterized by engineered zero $ZZ$-crosstalk in the idle regime, a substantial reduction of level-crowding challenges through the alternating arrangement of different qubit types within the lattice, and parameter regimes that circumvent the capacitive loading problem commonly associated with fluxoniums. In numerical simulations, we show a parametrically driven CZ-gate that achieves a closed-system infidelity that is orders of magnitude below the coherence limit for gate durations $\gtrsim 30\,\rm{ns}$ using a two-tone flux pulse on the tunable coupler. Furthermore, we show that this gate scheme retains its fidelity in the presence of spectator qubits, making it a scalable solution for large lattices. Moreover, for the implementation of error correcting codes, our approach can leverage the long coherence times and large non-linearities of fluxoniums as data qubits, while fixed-frequency transmons with established readout techniques can serve as measurement ancillas.

Related papers

• Parallel Quantum Gates via Scalable Subsystem-Optimized Robust Control [9.72599396930123]
  Crosstalk between qubits impedes the achievement of high gate fidelities and renders full Hilbert-space control optimization prohibitively difficult.<n>Here, we overcome this challenge by reducing the full-system optimization to crosstalk-robust control over constant-sized subsystems.<n>Within this framework, we construct analytical pulse solutions for parallel single-qubit gates and numerical pulses for parallel multi-qubit operations.
  arXiv  Detail & Related papers  (2026-01-05T10:50:40Z)
• Cross-Resonant Gates in Hybrid Fluxonium-Transmon Systems [2.1564237522129335]
  We propose a scalable fluxonium-transmon-fluxonium (FTF) system that utilizes a central transmon to mediate high-fidelity gates and parity checks between two fluxonium qubits.<n>This approach suppresses unwanted long-range interactions, which is critical for developing larger quantum processors.
  arXiv  Detail & Related papers  (2025-09-09T17:18:27Z)
• A microwave-activated high-fidelity three-qubit gate scheme for fixed-frequency superconducting qubits [18.285015455084935]
  We propose a microwave-activated three-qubit gate protocol for fixed-frequency transmon qubits in the large-detuning regime.<n> numerical simulations demonstrate a high average gate fidelity exceeding $99.9%$.<n>This strategy advances scalable quantum computing systems by improving coherence properties, reducing spectral congestion, and expanding the experimental toolkit for error-resilient quantum operations.
  arXiv  Detail & Related papers  (2025-04-30T06:16:16Z)
• Scalable fluxonium qubit architecture with tunable interactions between non-computational levels [21.16783987031157]
  We introduce a scalable fluxonium architecture that enables decoupling of qubit states while maintaining tunable couplings between non-computational states.<n>We demonstrate that the issue can be mitigated by implementing tunable couplings for fluxonium plasmon transitions, meanwhile enabling fast, high-fidelity gates with passive ZZ suppression.
  arXiv  Detail & Related papers  (2025-04-14T05:31:47Z)
• Realization of two-qubit gates and multi-body entanglement states in an asymmetric superconducting circuits [3.9488862168263412]
  We propose a tunable fluxonium-transmon-transmon (FTT) cou pling scheme. The asymmetric structure composed of fluxonium and transmon will optimize the frequency space and form a high fidelity two-qubit quantum gate. We study the performance of this scheme by simulating the general single-qubit Xpi/2 gate and two-qubit (iSWAP) gate.
  arXiv  Detail & Related papers  (2024-04-12T08:44:21Z)
• Optimal control in large open quantum systems: the case of transmon readout and reset [44.99833362998488]
  We present a framework that combines the adjoint-state method together with reverse-time backpropagation to solve prohibitively large open-system quantum control problems.<n>We apply this framework to optimize two inherently dissipative operations in superconducting qubits.<n>Our results show that while standard pulses for dispersive readout are nearly optimal, adding a transmon drive during the protocol can yield 2x improvements in fidelity and duration.
  arXiv  Detail & Related papers  (2024-03-21T18:12:51Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Fast ZZ-Free Entangling Gates for Superconducting Qubits Assisted by a Driven Resonator [42.152052307404]
  We propose a simple scheme to cancel stray interactions between qubits. We numerically show that such a scheme can enable short and high-fidelity entangling gates. Our architecture is not only ZZ free but also contains no extra noisy components.
  arXiv  Detail & Related papers  (2023-11-02T15:42:02Z)
• Charge-parity switching effects and optimisation of transmon-qubit design parameters [0.0]
  We identify optimal ranges for qubit design parameters, grounded in comprehensive noise modeling. A charge-parity switch can be the dominant quasiparticle-related error source of a two-qubit gate. We present a performance metric for quantum circuit execution.
  arXiv  Detail & Related papers  (2023-09-29T12:05:27Z)
• High-fidelity parallel entangling gates on a neutral atom quantum computer [41.74498230885008]
  We report the realization of two-qubit entangling gates with 99.5% fidelity on up to 60 atoms in parallel. These advances lay the groundwork for large-scale implementation of quantum algorithms, error-corrected circuits, and digital simulations.
  arXiv  Detail & Related papers  (2023-04-11T18:00:04Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• High fidelity two-qubit gates on fluxoniums using a tunable coupler [47.187609203210705]
  Superconducting fluxonium qubits provide a promising alternative to transmons on the path toward large-scale quantum computing. A major challenge for multi-qubit fluxonium devices is the experimental demonstration of a scalable crosstalk-free multi-qubit architecture. Here, we present a two-qubit fluxonium-based quantum processor with a tunable coupler element.
  arXiv  Detail & Related papers  (2022-03-30T13:44:52Z)

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.