Robust holonomic quantum gates via cyclic evolution protection
Nonadiabatic holonomic quantum computation provides a promising approach toward fault-tolerant quantum control, due to its simple requirements for energy level structure and intrinsic robustness stemming from non-Abelian geometric phases. However, conventional nonadiabatic holonomic quantum computat...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIP Publishing LLC
2025-03-01
|
| Series: | APL Quantum |
| Online Access: | http://dx.doi.org/10.1063/5.0249368 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Nonadiabatic holonomic quantum computation provides a promising approach toward fault-tolerant quantum control, due to its simple requirements for energy level structure and intrinsic robustness stemming from non-Abelian geometric phases. However, conventional nonadiabatic holonomic quantum computation relies on segmented evolution along a specific trajectory, which not only complicates experimental control but also exacerbates decoherence effects. Meanwhile, minor deviations in systematic parameters can directly disrupt the cyclic evolution process necessary to construct holonomic gates, leading to degraded gate robustness. To address these disadvantages, we here propose a general strategy to incorporate cyclic evolution protection into the holonomic gate construction. The aim is to design on-demand trajectories by modulating pulse shapes, thereby circumventing the detrimental impact of systematic errors on cyclic evolution. Consequently, universal holonomic gates implemented through a stable cyclic evolution process can maintain lower error sensitivity. Meanwhile, in our scheme, compressing the state population in the ancillary state ensures less energy consumption, resulting in higher gate fidelity. Therefore, our work serves as a practical solution for achieving high-fidelity and robust universal quantum gates, paving the way for large-scale quantum computation. |
|---|---|
| ISSN: | 2835-0103 |