Abstract In this paper, based on first given Lewis–Riesenfeld invariant depicted by a unit vector in parameter space, we inverse engineering the time-dependent Hamiltonian of a system with su(2) Lie algebraic structure. The introduced method is then applied to investigate nonadiabatic Abelian geometric quantum computation. We demonstrate that, by employing the nonadiabatic Berry phase generated through nonadiabatic periodic evolution, a driven two-level system which undergoes a single cyclic evolution along a loop path in Bloch space can realize a universal set of one-qubit gates. Subsequently, under consideration of the influence of the systematic error and dissipation on nonadiabatic process, the result reveals arbitrary one-qubit gate can be implemented with a high fidelity. Moreover, to complete the universal set, arbitrary controlled-U gate is designed by utilizing a driven system consisted of a pair of coupled spin subsystems.
Abstract In this paper, based on first given Lewis–Riesenfeld invariant depicted by a unit vector in parameter space, we inverse engineering the time-dependent Hamiltonian of a system with su(2) Lie algebraic structure. The introduced method is then applied to investigate nonadiabatic Abelian geometric quantum computation. We demonstrate that, by employing the nonadiabatic Berry phase generated through nonadiabatic periodic evolution, a driven two-level system which undergoes a single cyclic evolution along a loop path in Bloch space can realize a universal set of one-qubit gates. Subsequently, under consideration of the influence of the systematic error and dissipation on nonadiabatic process, the result reveals arbitrary one-qubit gate can be implemented with a high fidelity. Moreover, to complete the universal set, arbitrary controlled-U gate is designed by utilizing a driven system consisted of a pair of coupled spin subsystems.
Abstract In this paper, we propose a protocol to realize nonadiabatic geometric quantum computation (NGQC)of W-state codes in a spin system using invariant-based reverse engineering. The Heisenberg XY interaction of spin qubits provides a two-dimensional computational subspace spanned by a pair of W states. By applying a time-dependent magnetic on the spin qubits, we realize the effective Pauli operations for the computational subspace. Assisted by the invariant-based reverse engineering, the waveform of the control field is designed and the evolution paths for the NGQC is found. The performance of the protocol under the influence of experimental imperfections is estimated by the numerical simulations with available parameters. The results demonstrate that the protocol is robust against systematic error, random noise and decoherence. Therefore, the protocol may be promising to implement fast and robust manipulation of W states in spin 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.
Different methods have been recently put forward and implemented experimentally to inverse engineer the time-dependent Hamiltonian of a quantum system and accelerate slow adiabatic processes via nonadiabatic shortcuts. In the ``transitionless quantum driving'' proposed by Berry, shortcut Hamiltonians are designed so that the system follows exactly, in an arbitrarily short time, the approximate adiabatic path defined by a reference Hamiltonian. A different approach is based on first designing a Lewis-Riesenfeld invariant to carry the eigenstates of a Hamiltonian from specified initial to final configurations, again in an arbitrary time, and then constructing from the invariant the transient Hamiltonian that connects these boundary configurations. We show that the two approaches, apparently quite different in form and so far in results, are, in fact, strongly related and potentially equivalent, so that the inverse-engineering operations in one of them can be reinterpreted and understood in terms of the concepts and operations of the other one. We study, as explicit examples, expansions of time-dependent harmonic traps and the state preparation of two-level systems.
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.
In this paper, a flexible and effective scheme is proposed to realize nonadiabatic geometric quantum gates with the invariant based reverse engineering and the nonadiabatic holonomic quantum computation (NHQC+) presented in recent work [B.-J. Liu et al., Phys. Rev. Lett. 123, 100501 (2019)] for extensible geometric quantum computation. The scheme provides variabilities for most of control parameters, and can build up multiple evolution paths with different geometric phases acquired in a cycling evolution. As the computational basis can be covered by the evolution paths, the realization of the nonadiabatic geometric quantum computation is possible without auxiliary levels. Moreover, multiple types of nonadiabatic geometric quantum gates can also be easily constructed by only adjusting boundary conditions of control parameters with the method. To show the applications of the scheme, we discuss the implementations of nonadiabatic geometric quantum gates of spin qubits in a double-quantum-dot system with numerical simulations. The results indicate that the scheme possesses robustness against the errors and noise. Therefore, the scheme may offer some interesting perspectives for the realization of the nonadiabatic geometric 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.