CyberIntel ⬡ News
★ Saved ◆ Cyber Reads
← Back ◌ Quantum Computing Mar 26, 2026

Experimental Demonstration of a Brachistochrone Nonadiabatic Holonomic Quantum-Gate Scheme in a Trapped Ion

arXiv Quantum Archived Mar 26, 2026 ✓ Full text saved

arXiv:2603.23999v1 Announce Type: new Abstract: Nonadiabatic holonomic quantum computation (NHQC) offers intrinsic resilience to certain control imperfections. However, conventional nonadiabatic holonomic protocols are constrained by the fixed-pulse-area condition, which limits flexibility and prolongs duration of small-angle gates. Here we experimentally demonstrate a universal brachistochrone nonadiabatic holonomic quantum gate scheme in a trapped 40Ca+ ion, and realized the construction of pX

Full text archived locally
✦ AI Summary · Claude Sonnet


    Quantum Physics [Submitted on 25 Mar 2026] Experimental Demonstration of a Brachistochrone Nonadiabatic Holonomic Quantum-Gate Scheme in a Trapped Ion Xi Wang, Hui Ren, L.-N. Sun, K.-F. Cui, J.-T. Bu, S.-L. Su, L.-L. Yan, G. Chen Nonadiabatic holonomic quantum computation (NHQC) offers intrinsic resilience to certain control imperfections. However, conventional nonadiabatic holonomic protocols are constrained by the fixed-pulse-area condition, which limits flexibility and prolongs duration of small-angle gates. Here we experimentally demonstrate a universal brachistochrone nonadiabatic holonomic quantum gate scheme in a trapped 40Ca+ ion, and realized the construction of pX gate under the conventional NHQC, brachistochrone NHQC (BNHQC) and composite BNHQC (CBNHQC) protocols. By characterizing the performance of gate performance in the presence of dissipation, Rabi-frequency errors and detuning errors, we show that BNHQC and CBNHQC outperform conventional NHQC, and BNHQC can offer a favorable balance between operation speed and robustness. It further shows that keeping high fidelity and strong robustness need decrease the accumulated population of excited state in the evolution process. These results highlight nonadiabatic holonomic computation as a practical route toward fast and robust quantum gates in trapped-ion platforms. Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2603.23999 [quant-ph]   (or arXiv:2603.23999v1 [quant-ph] for this version)   https://doi.org/10.48550/arXiv.2603.23999 Focus to learn more Submission history From: LeiLei Yan [view email] [v1] Wed, 25 Mar 2026 06:56:18 UTC (405 KB) Access Paper: HTML (experimental) view license Current browse context: quant-ph < prev   |   next > new | recent | 2026-03 References & Citations INSPIRE HEP NASA ADS Google Scholar Semantic Scholar Export BibTeX Citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Demos Related Papers About arXivLabs Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
    💬 Team Notes
    Article Info
    Source
    arXiv Quantum
    Category
    ◌ Quantum Computing
    Published
    Mar 26, 2026
    Archived
    Mar 26, 2026
    Full Text
    ✓ Saved locally
    Open Original ↗