Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Super-robust nonadiabatic geometric quantum control (2008.02176v3)

Published 5 Aug 2020 in quant-ph

Abstract: Nonadiabatic geometric quantum computation (NGQC) and nonadiabatic holonomic quantum computation (NHQC) have been proposed to reduce the run time of geometric quantum gates. However, in terms of robustness against experimental control errors, the existing NGQC and NHQC scenarios have no advantage over standard dynamical gates in most cases. Here, we give the reasons why nonadiabatic geometric gates are sensitive to the control errors and, further, we propose a scheme of super-robust nonadiabatic geometric quantum control, in which the super-robust condition can guarantee both high speed and robustness of the geometric gate. To illustrate the working mechanism of super-robust geometric quantum gates, we give two simple examples of SR-NGQC and SR-NHQC for two- and three-level quantum systems, respectively. Theoretical and numerical results with the experimental parameters indicate that our scheme can significantly improve the gate performance compared to the previous NGQC, NHQC, and standard dynamical schemes. Super-robust geometric quantum computation can be applied to various physical platforms such as superconducting qubits, quantum dots, and trapped ions. All of these sufficiently show that our scheme provides a promising way towards robust geometric quantum computation.

Summary

We haven't generated a summary for this paper yet.