Nonadiabatic holonomic quantum computation has a robust feature in suppressing control errors because of its holonomic feature. However, this kind of robust feature is challenged since the usual way of realizing nonadiabatic holonomic gates introduces errors due to systematic errors in the control parameters. To resolve this problem, we here propose a composite scheme to realize nonadiabatic holonomic gates. Our scheme can suppress systematic errors while preserving holonomic robustness. It is particularly useful when the evolution period is shorter than the coherence time. We further show that our composite scheme can be protected by decoherence-free subspaces. In this case, the strengthened robust feature of our composite gates and the coherence stabilization virtue of decoherence-free subspaces are combined.
Nonadiabatic holonomic quantum computation has a robust feature in suppressing control errors because of its holonomic feature. However, this kind of robust feature is challenged since the usual way of realizing nonadiabatic holonomic gates introduces errors due to systematic errors in the control parameters. To resolve this problem, we here propose a composite scheme to realize nonadiabatic holonomic gates. Our scheme can suppress systematic errors while preserving holonomic robustness. It is particularly useful when the evolution period is shorter than the coherence time. We further show that our composite scheme can be protected by decoherence-free subspaces. In this case, the strengthened robust feature of our composite gates and the coherence stabilization virtue of decoherence-free subspaces are combined.
Quantum computation that combines the coherence stabilization virtues of decoherence-free subspaces and the fault tolerance of geometric holonomic control is of great practical importance. Some schemes of adiabatic holonomic quantum computation in decoherence-free subspaces have been proposed in the past few years. However, nonadiabatic holonomic quantum computation in decoherence-free subspaces, which avoids a long run-time requirement but with all the robust advantages, remains an open problem. Here, we demonstrate how to realize nonadiabatic holonomic quantum computation in decoherence-free subspaces. By using only three neighboring physical qubits undergoing collective dephasing to encode one logical qubit, we realize a universal set of quantum gates.
Nonadiabatic holonomic quantum computation in decoherence-free subspaces has attracted increasing attention recently, as it allows for high-speed implementation and combines both the robustness of holonomic gates and the coherence stabilization of decoherence-free subspaces. Since the first protocol of nonadiabatic holonomic quantum computation in decoherence-free subspaces, a number of schemes for its physical implementation have been put forward. However, all previous schemes require two noncommuting gates to realize an arbitrary one-qubit gate, which doubles the exposure time of gates to error sources as well as the resource expenditure. In this paper, we propose an alternative protocol for nonadiabatic holonomic quantum computation in decoherence-free subspaces, in which an arbitrary one-qubit gate in decoherence-free subspaces is realized by a single-shot implementation. The present protocol not only maintains the merits of the original protocol but also avoids the extra work of combining two gates to implement an arbitrary one-qubit gate and thereby reduces the exposure time to various error sources.
Nonadiabatic holonomic quantum computation (NHQC) based on non-Abelian geometric phases can possess potential robustness advantages due to its intrinsic error-resilient features. However, rigorous geometric conditions, including cyclic evolution and parallel transport conditions, typically demand complex and error-prone control and also involve additional auxiliary resources. Moreover, the limitations of optional evolution paths in previous NHQC schemes make it difficult to avoid path segments that are heavily affected by systematic errors, thereby weakening the error resilience of holonomic gates. To address this problem, we propose a multipath NHQC scheme, which can sufficiently improve the robustness of quantum gates by flexibly correcting geometric evolution paths. Numerical simulation results show that our scheme surpasses previous NHQC schemes in suppressing systematic errors for arbitrary gate types. In addition, we provide a physical implementation based on superconducting quantum circuits, with the decoherence-free-subspace encoding and an experiment-friendly two-body exchange interaction, demonstrating the excellent compatibility of our scheme. Therefore, our scheme offers a promising alternative for future fault-tolerant quantum computation.
Quantum computation is much more effective than classical computation in solving many problems such as factoring large integers and searching unsorted databases. However, such effectiveness relies on the ability to perform universal high-fidelity quantum gates. One main challenge in achieving such high-fidelity gates is to reduce control errors of a quantum system. To overcome this problem, various proposals of fault-tolerant quantum computation are proposed. A promising one of such proposals is nonadiabatic holonomic quantum computation. Nonadiabatic holonomic quantum computation is realized by using a quantum system with a subspace satisfying both the cyclic evolution and parallel transport conditions. For an N dimensional quantum system with Hamiltonian H(t) and evolution operator U(t)=Texp[−i∫0tH(t')dt'] , if there exists a time-dependent L dimensional subspace S(t) spanned by the orthonormal vectors {|ϕk(t)〉=U(t)|ϕk(0)〉}k=1L that satisfy the two conditions: (1) ∑k=1L|ϕk(τ)〉〈ϕk(τ)|= ∑k=1L|ϕk(0)〉〈ϕk(0)| , with τ being the evolution period, and (2) 〈ϕk(t)|H(t)|ϕl(t)〉=0, k,l=1,2,⋯,L, then the unitary transformation U(τ) is a holonomic gate on the L dimensional subspace S(0) spanned by {|ϕk(0)〉}k=1L . The work of realizing nonadiabatic holonomic gate is to build a physical system with a Hamiltonian satisfying both the cyclic evolution condition and the parallel transport condition. Nonadiabatic holonomic quantum computation is based on nonadiabatic non-Abelian geometric phases. Since nonadiabatic non-Abelian geometric phases are only dependent on evolution paths but independent of evolution details, nonadiabatic holonomic gates are robust against control errors. Besides, nonadiabatic holonomic gates do not require the long run-time evolution that is necessary for adiabatic holonomic gates. Due to the merits of both robustness against control errors and high-speed realization, nonadiabatic holonomic quantum computation has received increasing attention in theory and experiment. Various schemes of nonadiabatic holonomic quantum computation have been proposed based on different physical systems, and a number of these schemes have been experimentally demonstrated with nuclear magnetic resonance systems, nitrogen-vacancy center systems, and superconducting systems. The progress of nonadiabatic holonomic quantum computation is also reflected in the improvement of the methods of designing quantum gates. The single-shot scheme, single-loop multiple-pulse scheme and composite gate scheme of nonadiabatic quantum gate are based on the improved methods. In particular, the single-shot scheme simplifies the operation of the one-qubit gate, so that the operation of any one-qubit gate, which needs to be realized by combining two non-commuting π-rotation gate in the original scheme, can be simply realized by a single-shot operation. In this paper, we propose a scheme of nonadiabatic holonomic quantum computation with atom-cavity system. The universal set of quantum gates in our scheme consists of an arbitrary one-qubit nonadiabatic holonomic gate and a two-qubit nonadiabatic holonomic controlled-PHASE gate. To realize the arbitrary one-qubit gate, we use two resonant laser pulses and an off-resonant laser pulse to drive a single four-level atom. With the aid of Stark shifts, the one-qubit gate can be performed in one-step only by changing the Rabi frequencies and the phases of the laser pulses. To realize the two-qubit controlled-PHASE gate, we use two off-resonant laser pulses to drive the two four-level atoms in the cavity. The transitions between the two-atom ground state and the two-atom auxiliary state is facilitated by exchanging virtual photons through a common cavity mode. In this process, the effective two-atom transition is disentangled from the cavity mode and therefore the two-qubit gate is insensitive to the cavity decay.
Control errors and decoherence are two main obstacles for realization of quantum computation. Nonadiabatic holonomic quantum computation in decoherence-free subspaces can protect quantum gates from both control errors and decoherence, and, therefore, it has received increasing attention. The original protocol of nonadiabatic holonomic quantum computation in decoherence-free subspaces needs two loops in the Grassmann manifold to generate an arbitrary nonadiabatic holonomic one-qubit gate. In this paper, we proposed a protocol of nonadiabatic holonomic quantum computation in decoherence-free subspaces, where an arbitrary one-qubit gate is generated by only a single loop in the Grassmann manifold and an entangling two-qubit gate assisted by two single-qubit gates can be used to construct a two-qubit controlled unitary gate. In addition, the encoding of our protocol for nonadiabatic holonomic gates requires a lower number of physical qubits compared with previous schemes. Our scheme not only maintains the merits of the original protocol but it also avoids the extra work of combining two gates to realize an arbitrary one-qubit gate.
The challenge in building high-fidelity quantum gates lies in overcoming control errors and decoherence effects caused by the coupling between the quantum system and the external environment. Nonadiabatic holonomic quantum computation uses the topological protection of the cyclic evolution of the computational subspace to make holonomic gates highly robust to control errors. Therefore, our main goal is to accelerate this evolution. Here we propose a general reverse engineering approach to combine the unconventional geometric quantum computation with optimized holonomic quantum computation [Bao-Jie Liu et al. Phys.Rev.Lett.123,100501 (2019)]. Our approach allows us to select evolution paths that require less time. Consequently, the proposed scheme is highly flexible and promising for achieving robust quantum computation in the future.