2021/02/28 by Li‐Na Ji, Li-Na Ji, Cheng‐Yun Ding +4
Computer Science · Physics and Astronomy · #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Turing machine #Quantum algorithm #Quantum and electron transport phenomena #Quantum circuit #Quantum computer #Quantum decoherence #Quantum error correction #Quantum gate #Realization (probability) #quant-ph
paper · pdf · doi:10.1002/qute.202100019
published as Adv. Quantum Technol. 4, 2100019 (2021) · 9 pages, 7 figures
openalex publication_date 2021/04/29 · openalex created_date 2021/05/10 · arxiv created 2021/06/10 · arxiv updated 2021/06/14 · openalex updated_date 2026/08/05
Abstract Nonadiabatic geometric quantum computation is dedicated to the realization of high‐fidelity and robust quantum gates, which are necessary for fault‐tolerant quantum computation. However, it is limited by cyclic and mutative evolution path, which usually requires longer gate‐time and abrupt pulse control, weakening the gate performance. Here, a scheme to realize geometric quantum gates with noncyclic and nonadiabatic evolution via invariant‐based shortcuts is proposed, where universal quantum gates can be induced in one step without path mutation and the gate time is also effectively shortened. Our numerical simulations show that, comparing with the conventional dynamical gates, the constructed geometric gates have stronger resistance not only to systematic errors, induced by both qubit‐frequency drift and the deviation of the amplitude of the driving fields, but also to environment‐induced decoherence effect. In addition, this scheme can also be implemented on a superconducting circuit platform, with the fidelities of single‐qubit and two‐qubit gates higher than 99.97% and 99.84%, respectively. Therefore, this scheme provides a promising way to realize high‐fidelity fault‐tolerant quantum gates for scalable quantum computation.