High-fidelity quantum gates are essential for large-scale quantum computation. However, any quantum manipulation will inevitably affected by noises, systematic errors and decoherence effects, which lead to infidelity of a target quantum task. Therefore, implementing high-fidelity, robust and fast quantum gates is highly desired. Here, we propose a fast and robust scheme to construct high-fidelity holonomic quantum gates for universal quantum computation based on resonant interaction of three-level quantum systems via shortcuts to adiabaticity. In our proposal, the target Hamiltonian to induce noncyclic non-Abelian geometric phases can be inversely engineered with less evolution time and demanding experimentally, leading to high-fidelity quantum gates in a simple setup. Besides, our scheme is readily realizable in physical system currently pursued for implementation of quantum computation. Therefore, our proposal represents a promising way towards fault-tolerant geometric quantum computation.
High-fidelity quantum gates are essential for large-scale quantum computation. However, any quantum manipulation will inevitably affected by noises, systematic errors and decoherence effects, which lead to infidelity of a target quantum task. Therefore, implementing high-fidelity, robust and fast quantum gates is highly desired. Here, we propose a fast and robust scheme to construct high-fidelity holonomic quantum gates for universal quantum computation based on resonant interaction of three-level quantum systems via shortcuts to adiabaticity. In our proposal, the target Hamiltonian to induce noncyclic non-Abelian geometric phases can be inversely engineered with less evolution time and demanding experimentally, leading to high-fidelity quantum gates in a simple setup. Besides, our scheme is readily realizable in physical system currently pursued for implementation of quantum computation. Therefore, our proposal represents a promising way towards fault-tolerant geometric quantum computation.
Quantum computation based on geometric phase is generally believed to be more robust against certain errors or noises than the conventional dynamical strategy. However, the gate error caused by the decoherence effect is inevitable, and thus faster gate operations are highly desired. Here, we propose a nonadiabatic holonomic quantum-computation (NHQC) scheme with detuned interactions on a $\mathrm{\ensuremath{\Delta}}$-type three-level system, which combines the time-optimal control technique with the time-independent detuning adjustment to further accelerate universal gate operations, so that the gate time can be greatly shortened within the hardware limitation, and thus high-fidelity gates can be obtained. Meanwhile, our numerical simulations show that the gate robustness is also stronger than previous schemes. Finally, we present an implementation of our proposal on superconducting quantum circuits, with a decoherence-free subspace encoding, based on the experimentally demonstrated parametrically tunable coupling technique, which simplifies previous investigations. Therefore, our protocol provides a more promising alternative for future fault-tolerant quantum computation.
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.
Quantum computation has been shown to be superior to classical computation in solving some problems, and therefore can substantially change our life. However, the realization of quantum computation is still challenging, even if quantum technologies have been improved significantly. Two main obstacles to the realization of practical quantum computation are control errors and decoherence. Control errors are caused by inaccurate manipulations of quantum systems and decoherence is caused by the inevitable interaction between the system and its environment. Geometric phases are only dependent on evolution paths of quantum systems but independent of the evolution details and therefore quantum computation based on geometric phases, i.e., geometric quantum computation, is robust against control errors, benefiting the realization of practical quantum computation. The early proposals of geometric quantum computation are based on adiabatic geometric phases. These proposals require quantum systems to undergo adiabatic evolution, which makes quantum systems evolve for a long time. To circumvent this, nonadiabatic geometric quantum computation based on nonadiabatic Abelian geometric phases was proposed soon after. In 2012, nonadiabatic holonomic quantum computation based on nonadiabatic non-Abelian geometric phases was proposed, which also circumvents long-time evolutions. Moreover, compared with nonadiabatic geometric quantum computation that uses the geometric phase as one parameter of a quantum gate, nonadiabatic holonomic quantum computation uses the holonomic matrix itself as a quantum gate. This makes nonadiabatic holonomic quantum computation possess whole-geometric property. Due to the merits of both geometric robustness and high-speed implementation without the limit of adiabatic evolution, nonadiabatic holonomic quantum computation has been attracting much attention. Until now, much progress has been achieved in the field of nonadiabatic holonomic quantum computation. On one hand, various methods have been proposed to design more efficient nonadiabatic holonomic gates. Nonadiabatic holonomic gates were first realized by using resonant laser fields to drive a three-level system. After this, the single-shot proposal and the single-loop proposal were proposed, allowing us to realize one-qubit gates by a shorter path and thereby reducing the exposure time of nonadiabatic holonomic gates to the environment. To further shorten the exposure time, the path-shortening protocol was put forward, where nonadiabatic holonomic gates can be realized based on a class of extended evolution paths that are shorter than the former ones. Recently, a general approach of constructing Hamiltonians for nonadiabatic holonomic quantum computation was put forward, by using which one can easily find a Hamiltonian making the quantum system evolve along a desired path so that nonadiabatic holonomic gates can be realized with an economical evolution time. On the other hand, various methods have been proposed to combine nonadiabatic holonomic gates and various decoherence-resilient methods, making the resulting schemes robust against both control errors and decoherence. The first proposal in this aspect is combining nonadiabatic holonomic gates and decoherence-free subspaces. Gradually, proposals combining nonadiabatic holonomic gates with noiseless subsystems, dynamical decoupling and surface codes were put forward. Last but not least, various proposals suitable for specific physical systems have been proposed and particularly various experimental platforms have been used to demonstrate nonadiabatic holonomic gates. This also significantly improves the development of nonadiabatic holonomic quantum computation. In this paper, we review the above research advances on nonadiabatic holonomic quantum computation, aiming to help readers understand the main developments of nonadiabatic holonomic quantum computation.
When a quantum system is driven slowly through a parametric cycle in a degenerate Hilbert space, the state would acquire a non-Abelian geometric phase, which is stable and forms the foundation for holonomic quantum computation (HQC). However, in the adiabatic limit, the environmental decoherence becomes a significant source of errors. Recently, various nonadiabatic holonomic quantum computation (NHQC) schemes have been proposed, but all at the price of increased sensitivity to control errors. Alternatively, there exist theoretical proposals for speeding up HQC by the technique of "shortcut to adiabaticity" (STA), but no experimental demonstration has been reported so far, as these proposals involve a complicated control of four energy levels simultaneously. Here, we propose and experimentally demonstrate that HQC via shortcut to adiabaticity can be constructed with only three energy levels, using a superconducting qubit in a scalable architecture. With this scheme, all holonomic single-qubit operations can be realized nonadiabatically through a single cycle of state evolution. As a result, we are able to experimentally benchmark the stability of STA+HQC against NHQC in the same platform. The flexibility and simplicity of our scheme makes it also implementable on other systems, such as nitrogen-vacancy center, quantum dots, and nuclear magnetic resonance. Finally, our scheme can be extended to construct two-qubit holonomic entangling gates, leading to a universal set of STAHQC gates.
Fast and robust quantum gates are the cornerstones of fault-tolerance quantum computation. In this paper, as opposed to the previous proposals which use cyclic geometric phases, we propose to realize quantum computation based on noncyclic geometric evolution. The superiority of the noncyclic scheme is that the operation time is proportional to the rotation angle of the quantum state. Therefore, the noncyclic scheme becomes fairly fast in the case of quantum gates with small rotation angle, which will be more insensitive to the decoherence and the leakage to the states outside the computational basis. Similar to the cyclic version of geometric quantum computation, dynamical phases here during the evolution are canceled by spin-echo process and the adiabatic control can be sped up through shortcut to adiabaticity. The proposed scheme is robust against random noise due to the geometric characteristic of projective Hilbert space. Since the proposed scheme is fast and robust, it is a particularly suitable way to manipulate the physical systems with weak nonlinearity, such as superconducting systems.
Geometric phases are used to construct quantum gates since it naturally resists local noises, acting as the modularized units of geometric quantum computing. Meanwhile, fast nonadiabatic geometric gates are required for reducing the information loss induced by decoherence. Here, we propose a digital simulation of nonadiabatic geometric quantum gates in terms of shortcuts to adiabaticity (STA). More specifically, we combine the invariant-based inverse engineering with optimal control theory for designing the fast and robust Abelian geometric gates against systematic error, in the context of two-level qubit systems. We exemplify X and T gates, in which the fidelities and robustness are evaluated by simulations in ideal quantum circuits. Our results can also be extended to constructing two-qubit gates, for example, a controlled-PHASE gate, which shares the equivalent effective Hamiltonian with rotation around the Z-axis of a single qubit. These STA-inspired nonadiabatic geometric gates can realize quantum error correction physically, leading to fault-tolerant quantum computing in the Noisy Intermediate-Scale Quantum (NISQ) era.