Evidence for the robustness of geometric quantum computation

Tao Chen, Zheng‐Yuan Xue

Yifu Zhang, Lei Ma

Shi-Liang Zhu, Paolo Zanardi A

The realistic application of geometric quantum computation is crucially dependent on an unproved robustness conjecture, claiming that geometric quantum gates are more resilient against random noise than dynamic gates. We propose a suitable model that allows a direct and fair comparison between geometrical and dynamical operations. In the presence of stochastic control errors we find that the maximum of gate fidelity corresponds to quantum gates with a vanishing dynamical phase. This is a clear evidence for the robustness of nonadiabatic geometric quantum computation. The predictions here presented can be experimentally tested in almost all of the already existing quantum computer candidates.

Erik Sjöqvist, Vahid Azimi Mousolou, Carlo M. Canali

Jiawei Zhang, L.-L. Yan, J. C. Li +6 more

Quantum gates induced by geometric phases are intrinsically robust against noise due to the global properties of their evolution paths. Compared to conventional nonadiabatic geometric quantum computation, the recently proposed nonadiabatic noncyclic geometric quantum computation (NNGQC) works in a faster fashion while still remaining the robust feature of the geometric operations. Here, we experimentally implement the NNGQC in a single trapped ultracold ^{40}Ca^{+} ion to verify the noise-resilient and fast feature. By performing unitary operations under imperfect conditions, we witness the advantages of the NNGQC with measured fidelities by quantum process tomography in comparison to other two quantum gates by conventional nonadiabatic geometric quantum computation and by straightforward dynamical evolution. Our results provide the first evidence confirming the possibility of accelerated quantum information processing with limited systematic errors even in an imperfect situation.

Eduardo Jose Bayro-Corrochano