Proposal for erasure conversion in integer fluxonium qubits

• URL: http://arxiv.org/abs/2603.21003v1
• Date: Sun, 22 Mar 2026 01:33:48 GMT
• Title: Proposal for erasure conversion in integer fluxonium qubits
• Abstract summary: We propose an erasure conversion scheme on the $|erangle-|frangle$ and $|grangle-|frangle$ qubits in integer fluxonium qubits (IFQs)<n>We consider a protocol for such erasure conversion based on the dispersive readout.
• Score: 12.858099495961673
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose an erasure conversion scheme on the $|e\rangle-|f\rangle$ and $|g\rangle-|f\rangle$ qubits in integer fluxonium qubits (IFQs), which are both first-order insensitive to $1/f$ flux noise. The $|e\rangle-|f\rangle$ transition is identical to that of a usual fluxonium qubit and hence is expected to have excellent coherence time, while the $|g\rangle-|f\rangle$ transition is additionally protected from the energy relaxation by the parity symmetry. The dominant error in both qubits arises due to the energy relaxation: from $|e\rangle$ to $|g\rangle$ in the $e\text{--}f$ qubit and from $|f\rangle$ to $|e\rangle$ in the $g\text{--}f$ qubit. Such errors can be treated as erasure events, and their efficient detection improves the performance of quantum error-correcting codes. We consider a protocol for such erasure conversion based on the dispersive readout. Our main finding is that, with proper circuit parameter choice, carefully designed gate sets, and the integration of erasure conversion, IFQs promise high effective coherence times.

Related papers

• The Gain-Engineered Transmon [68.89136228609398]
  We introduce and experimentally realize a noise-biased qubit in a standard transmon-readout resonator circuit.<n>Our results open a path towards using this system as a simple building-block for hardware-efficient quantum error detection and correction schemes.
  arXiv  Detail & Related papers  (2026-08-26T17:00:42Z)
• Hardware-efficient erasure-error detection with an integer fluxonium [0.40679396090695324]
  Erasure-error detection can improve the efficiency of quantum error correction by revealing the times and locations of their error events.<n>We demonstrate erasure conversions and mid-circuit erasure detections in a single integer fluxonium.
  arXiv  Detail & Related papers  (2026-07-29T16:49:25Z)
• Precision measurements at the interface between unitary and non-unitary encoding [5.6357907888795085]
  We derive analytic precision expressions for both the unitary parameter $$ and the dissipation strength $$.<n>For unitary encoding, the optimal encoding time is independent of $N$, yielding the Heisenberg limit $propto 1 / N$.<n>For non-unitary encoding, the precision is insensitive to intrinsic dynamics and encoding time, scaling as $propto sqrt/ expval*hatLdagger hatL$.
  arXiv  Detail & Related papers  (2026-06-09T08:00:43Z)
• OAM-Induced Lattice Rotation Reveals a Fractional Optimum in Fault-Tolerant GKP Quantum Sensing [0.0]
  We establish that orbital-angular-momentum encoding and Gottesman-Kitaev-Preskill (GKP) lattice geometry are structurally coupled.<n>Using an end-to-end differentiable Strawberry Fields--TensorFlow circuit, we jointly optimise $ell$, the lattice aspect ratio $r$, and the finite-energy envelope $$ to maximise quantum Fisher information.
  arXiv  Detail & Related papers  (2026-05-13T09:49:16Z)
• Asymmetric Linear-Combination-of-Unitaries Realization of Quantum Convolution via Modular Adders [1.8228930355273179]
  Circular convolution over $mathbbZ/NmathbbZ$ can be implemented on quantum hardware within the linear-combination-of-unitaries (LCU) framework.<n>We introduce a reversal matrix $J_n=Xotimes n$ and define reflected shifts $widetildeL_i,n=L_i,nJ_n$.<n>The resulting symmetrized operator differs from circular convolution only by one known input-side $J_n$ layer.
  arXiv  Detail & Related papers  (2026-03-16T12:52:05Z)
• Robust Sublinear Convergence Rates for Iterative Bregman Projections [21.689846521201588]
  We use entropic regularization to approximate linear programs whose constraints split into two (or more) tractable blocks.<n>We derive the flow-Sinkhorn algorithm for the Wasserstein-1 distance on graphs.
  arXiv  Detail & Related papers  (2026-02-01T18:20:19Z)
• Robust Layerwise Scaling Rules by Proper Weight Decay Tuning [50.11170157029911]
  In modern scale-invariant architectures, training quickly enters an degrading-governed steady state.<n>We introduce a weight-decay scaling rule for AdamW that preserves sublayer gain across widths.<n>Our results extend $mu$P beyond the near-init regime by explicitly controlling the steady-state scales set by parameters.
  arXiv  Detail & Related papers  (2025-10-17T02:58:35Z)
• Sequential quantum processes with group symmetries [0.23332469289621782]
  We show a canonical circuit decomposition of a $(G times H)$-invariant quantum comb for compact groups $G$ and $H$.<n>We derive the optimal quantum comb which transforms an unknown unitary operation $U in mathrmSU(d)$ to its inverse $Udagger$ or transpose $Utop$.
  arXiv  Detail & Related papers  (2025-10-08T14:58:08Z)
• Corner Gradient Descent [13.794391803767617]
  We show that rates up to $O(t-2zeta)$ can be achieved by a generalized stationary SGD with infinite memory.<n>We show that ideal corner algorithms can be efficiently approximated by finite-memory algorithms.
  arXiv  Detail & Related papers  (2025-04-16T22:39:41Z)
• Beyond likelihood ratio bias: Nested multi-time-scale stochastic approximation for likelihood-free parameter estimation [49.78792404811239]
  We study inference in simulation-based models where the analytical form of the likelihood is unknown.<n>We use a ratio-free nested multi-time-scale approximation (SA) method that simultaneously tracks the score and drives the parameter update.<n>We show that our algorithm can eliminate the original bias $Obig(sqrtfrac1Nbig)$ and accelerate the convergence rate from $Obig(beta_k+sqrtfracalpha_kNbig)$.
  arXiv  Detail & Related papers  (2024-11-20T02:46:15Z)
• Decoherence induced by a sparse bath of two-level fluctuators: peculiar features of $1/f$ noise in high-quality qubits [0.0]
  We show that large variability is a characteristic feature of a qubit dephased by a sparse bath. Our findings help theoretical understanding and further improvements in the coherence properties of semiconductor and superconductor qubits.
  arXiv  Detail & Related papers  (2024-04-29T12:46:32Z)
• Chain of Thought Empowers Transformers to Solve Inherently Serial Problems [57.58801785642868]
  Chain of thought (CoT) is a highly effective method to improve the accuracy of large language models (LLMs) on arithmetics and symbolic reasoning tasks. This work provides a theoretical understanding of the power of CoT for decoder-only transformers through the lens of expressiveness.
  arXiv  Detail & Related papers  (2024-02-20T10:11:03Z)
• On the $O(\frac{\sqrt{d}}{T^{1/4}})$ Convergence Rate of RMSProp and Its Momentum Extension Measured by $\ell_1$ Norm [54.28350823319057]
  This paper considers the RMSProp and its momentum extension and establishes the convergence rate of $frac1Tsum_k=1T.<n>Our convergence rate matches the lower bound with respect to all the coefficients except the dimension $d$.<n>Our convergence rate can be considered to be analogous to the $frac1Tsum_k=1T.
  arXiv  Detail & Related papers  (2024-02-01T07:21:32Z)
• Determination of Chain Strength induced by Embedding in D-Wave Quantum Annealer [0.0]
  D-wave quantum annealer requires embedding with ferromagnetic (FM) chains connected by several qubits. determination of the chain strength $J_c$ required to sustain FM order of qubits in the chains is crucial for the accuracy of quantum annealing.
  arXiv  Detail & Related papers  (2022-09-25T06:59:10Z)
• Spectral density estimation with the Gaussian Integral Transform [91.3755431537592]
  spectral density operator $hatrho(omega)=delta(omega-hatH)$ plays a central role in linear response theory. We describe a near optimal quantum algorithm providing an approximation to the spectral density.
  arXiv  Detail & Related papers  (2020-04-10T03:14:38Z)

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.