Fidelity sweet spot in transmon qubit rings under strong connectivity noise

• URL: http://arxiv.org/abs/2511.08267v1
• Date: Wed, 12 Nov 2025 01:49:48 GMT
• Title: Fidelity sweet spot in transmon qubit rings under strong connectivity noise
• Authors: Quan Fu, Xin Wang, Rui Xiong,
• Abstract summary: We investigate the fidelity of quantum operations in transmon qubit systems, focusing on both SWAP and general gate operations.<n>Our results reveal a distinct fidelity sweet spot that emerges even under strong noise, indicating that optimal circuit depth can enhance gate performance.<n>We introduce a supervised machine-learning framework capable of predicting the positions of fidelity sweet spots, enabling efficient optimization of circuit durations across different device configurations.
• Score: 4.302324547544988
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We investigate the fidelity of quantum operations in transmon qubit systems, focusing on both SWAP and general gate operations. Our results reveal a distinct fidelity sweet spot that emerges even under strong noise, indicating that optimal circuit depth can enhance gate performance. We further demonstrate that specific initial states, particularly those with favorable symmetry or entanglement structure, yield higher fidelity, reaching levels compatible with quantum error-correction thresholds. Finally, we introduce a supervised machine-learning framework capable of predicting the positions of fidelity sweet spots, enabling efficient optimization of circuit durations across different device configurations.

Related papers

• Quantum-Channel Matrix Optimization for Holevo Bound Enhancement [87.57725685513088]
  We propose a unified projected gradient ascent algorithm to optimize the quantum channel given a fixed input ensemble.<n> Simulation results demonstrate that the proposed quantum channel optimization yields higher Holevo bounds than input ensemble optimization.
  arXiv  Detail & Related papers  (2026-02-19T04:15:03Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Experimental characterization of the Toffoli gate via channel spectrum benchmarking [0.0]
  Channel spectrum benchmarking (CSB) provides a robust framework for characterizing quantum gate fidelities.<n>We introduce an extended CSB model together with a fidelity estimate interval (FEI) -- an interval-valued estimate of the target gate fidelity.<n>We further validate the protocol on a trapped-ion quantum processor by benchmarking two implementations of the three-qubit Toffoli gate.
  arXiv  Detail & Related papers  (2025-12-23T17:38:57Z)
• Above 99.9% Fidelity Single-Qubit Gates, Two-Qubit Gates, and Readout in a Single Superconducting Quantum Device [58.154405222706146]
  tuning of qubit-coupler coupling strengths in a superconducting circuit with two transmon qubits coupled via a tunable coupler enables high-fidelity single- and two-qubit gates.<n>We achieve a 40h-averaged CZ gate fidelity of 99.93%, simultaneous single-qubit gate fidelities of 99.98%, and readout fidelities over 99.94% in a single device.
  arXiv  Detail & Related papers  (2025-08-22T14:49:47Z)
• Optimal and robust error filtration for quantum information processing [0.0]
  Error filtration is a hardware scheme that mitigates noise by exploiting auxiliary qubits and entangling gates.<n>We benchmark our approach against figures of merit that correspond to different applications.
  arXiv  Detail & Related papers  (2024-09-02T17:58:44Z)
• 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)
• Reinforcement learning pulses for transmon qubit entangling gates [0.0]
  We utilize a continuous-control reinforcement learning algorithm to design entangling two-qubit gates for superconducting qubits. We demonstrate the capability to generate novel pulse sequences that outperform the standard cross-resonance gates.
  arXiv  Detail & Related papers  (2023-11-07T03:19:19Z)
• 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)
• Hamiltonian Switching Control of Noisy Bipartite Qubit Systems [7.094462708097975]
  We develop a Hamiltonian switching ansatz for bipartite control inspired by the Quantum Approximate Optimization Algorithm (QAOA) We demonstrate effective suppression of both coherent and dissipative noise, with numerical studies achieving target gate implementations with fidelities over 0.9999 (four nines) We analyze how the control depth, total evolution time, number of environmental TLS, and choice of optimization method affect the fidelity achieved by the optimal protocols.
  arXiv  Detail & Related papers  (2023-04-11T20:12:57Z)
• Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
  We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence. We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
  arXiv  Detail & Related papers  (2023-03-07T22:15:43Z)
• Robustness of a universal gate set implementation in transmon systems via Chopped Random Basis optimal control [50.591267188664666]
  We numerically study the implementation of a universal two-qubit gate set, composed of CNOT, Hadamard, phase and $pi/8$ gates, for transmon-based systems. The control signals to implement such gates are obtained using the Chopped Random Basis optimal control technique, with a target gate infidelity of $10-2$.
  arXiv  Detail & Related papers  (2022-07-27T10:55:15Z)
• Optimal quantum control via genetic algorithms for quantum state engineering in driven-resonator mediated networks [68.8204255655161]
  We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator. We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
  arXiv  Detail & Related papers  (2022-06-29T14:34:00Z)
• 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)

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.