Fast and Robust Non-Adiabatic Holonomic Gates for Qutrit Systems
- URL: http://arxiv.org/abs/2510.05905v1
- Date: Tue, 07 Oct 2025 13:17:21 GMT
- Title: Fast and Robust Non-Adiabatic Holonomic Gates for Qutrit Systems
- Authors: Jie Lu, Jie-Dong Huang, Yang Qian, Ying Yan,
- Abstract summary: We implement non-adiabatic holonomic quantum computing (NHQC) in qutrit systems under realistic error sources.<n>We derive analytical conditions that suppress second-order Rabi errors through tailored pulse parameters.<n>Our analysis reveals the cancellation from the compensation pulse, which ensures robust gate operations.
- Score: 12.663551903289543
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Motivated by shortcuts to adiabaticity, we develop a framework that combines inverse engineering with time-dependent perturbation theory to implement non-adiabatic holonomic quantum computing (NHQC) in qutrit systems under realistic error sources. We derive analytical conditions that suppress second-order Rabi errors through tailored pulse parameters and eliminate detuning errors via a compensation pulse. Our analysis reveals the cancellation from the compensation pulse, which ensures robust gate operations. The proposed approach, broadly applicable to superconducting qubits, trapped ions, and atom-based platforms, provides a pathway to fast and error-resilient holonomic gates, potentially for scalable quantum computing.
Related papers
- Composite nonadiabatic geometric quantum gates with optimization on superconducting circuits [22.182957953733915]
We propose a scheme for optimized composite nonadiabatic geometric quantum gates (OCNGQGs)<n>Specifically, by optimizing the path parameter, our scheme effectively resists systematic errors in both directions.<n> Numerical simulations demonstrate that our scheme offers superior gate robustness against these two types of errors.
arXiv Detail & Related papers (2025-09-29T13:00:49Z) - Speeding up adiabatic holonomic quantum gates via $π$-pulse modulation [1.7675483336334565]
We propose a scheme for fast holonomic quantum gates based on the $pi$-pulse method.<n>We realize a universal set of holonomic gates beyond the conventional adiabatic limit.
arXiv Detail & Related papers (2025-06-11T01:59:14Z) - 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) - Deep Quantum Error Correction [73.54643419792453]
Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing.
In this work, we efficiently train novel emphend-to-end deep quantum error decoders.
The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
arXiv Detail & Related papers (2023-01-27T08:16:26Z) - Analytical and experimental study of center line miscalibrations in M\o
lmer-S\o rensen gates [51.93099889384597]
We study a systematic perturbative expansion in miscalibrated parameters of the Molmer-Sorensen entangling gate.
We compute the gate evolution operator which allows us to obtain relevant key properties.
We verify the predictions from our model by benchmarking them against measurements in a trapped-ion quantum processor.
arXiv Detail & Related papers (2021-12-10T10:56:16Z) - Robust Nonadiabatic Holonomic Quantum Gates on Decoherence-Protected
Qubits [4.18804572788063]
We propose a scheme for quantum manipulation by combining the geometric phase approach with the dynamical correction technique.
Our scheme is implemented on the superconducting circuits, which also simplifies previous implementations.
arXiv Detail & Related papers (2021-10-06T14:39:52Z) - Ultrafast Holonomic Quantum Gates [4.354697470999286]
We propose a nonadiabatic holonomic quantum scheme with detuned interactions on $Delta$-type three-level system.
Our numerical simulations show that the gate robustness is also stronger than previous schemes.
We present an implementation of our proposal on superconducting quantum circuits, with a decoherence-free subspace encoding.
arXiv Detail & Related papers (2021-08-03T14:31:38Z) - Intrinsic mechanisms for drive-dependent Purcell decay in
superconducting quantum circuits [68.8204255655161]
We find that in a wide range of settings, the cavity-qubit detuning controls whether a non-zero photonic population increases or decreases qubit decay Purcell.
Our method combines insights from a Keldysh treatment of the system, and Lindblad theory.
arXiv Detail & Related papers (2021-06-09T16:21:31Z) - Engineering fast bias-preserving gates on stabilized cat qubits [64.20602234702581]
bias-preserving gates can significantly reduce resource overhead for fault-tolerant quantum computing.
In this work, we apply a derivative-based leakage suppression technique to overcome non-adiabatic errors.
arXiv Detail & Related papers (2021-05-28T15:20:21Z) - Noncyclic Geometric Quantum Gates with Smooth Paths via Invariant-based
Shortcuts [4.354697470999286]
We propose a scheme to realize geometric quantum gates with noncyclic and nonadiabatic evolution via invariant-based shortcuts.
Our scheme provides a promising way to realize high-fidelity fault-tolerant quantum gates for scalable quantum computation.
arXiv Detail & Related papers (2021-02-01T15:05:29Z) - Assessment of weak-coupling approximations on a driven two-level system
under dissipation [58.720142291102135]
We study a driven qubit through the numerically exact and non-perturbative method known as the Liouville-von equation with dissipation.
We propose a metric that may be used in experiments to map the regime of validity of the Lindblad equation in predicting the steady state of the driven qubit.
arXiv Detail & Related papers (2020-11-11T22:45:57Z)
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.