Holonomic Quantum Computation by Time dependent Decoherence Free Subspaces

Because of its geometric nature, holonomic quantum computation is fault tolerant against certain types of control errors. Although proposed more than a decade ago, the experimental realization of holonomic quantum computation is still an open challenge. In this Letter, we report the first experimental demonstration of nonadiabatic holonomic quantum computation in a liquid NMR quantum information processor. Two noncommuting one-qubit holonomic gates, rotations about x and z axes, and the two-qubit holonomic CNOT gate are realized by evolving the work qubits and an ancillary qubit nonadiabatically. The successful realizations of these universal elementary gates in nonadiabatic holonomic quantum computation demonstrates the experimental feasibility of this quantum computing paradigm.

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.

Among the many proposals for the realization of a quantum computer, holonomic\nquantum computation (HQC) is distinguished from the rest in that it is\ngeometrical in nature and thus expected to be robust against decoherence. Here\nwe analyze the realization of various quantum gates by solving the inverse\nproblem: Given a unitary matrix, we develop a formalism by which we find loops\nin the parameter space generating this matrix as a holonomy. We demonstrate for\nthe first time that such a one-qubit gate as the Hadamard gate and such\ntwo-qubit gates as the CNOT gate, the SWAP gate and the discrete Fourier\ntransformation can be obtained with a single loop.\n

A cavity QED implementation of the non-adiabatic holonomic quantum computation in decoherence-free subspaces is proposed with nitrogen-vacancy centers coupled commonly to the whispering-gallery mode of a microsphere cavity, where a universal set of quantum gates can be realized on the qubits. In our implementation, with the assistant of the appropriate driving fields, the quantum evolution is insensitive to the cavity field state, which is only virtually excited. The implemented non-adiabatic holonomies, utilizing optical transitions in the Λ type of three-level configuration of the nitrogen-vacancy centers, can be used to construct a universal set of quantum gates on the encoded logical qubits. Therefore, our scheme opens up the possibility of realizing universal holonomic quantum computation with cavity assisted interaction on solid-state spins characterized by long coherence times.

Non-adiabatic holonomic quantum gate in decoherence-free subspaces is of greatly practical importance due to its built-in fault tolerance, coherence stabilization virtues, and short run-time. Here, we propose some compact schemes to implement two- and three-qubit controlled unitary quantum gates and Fredkin gate. For the controlled unitary quantum gates, the unitary operator acting on the target qubit is an arbitrary single-qubit gate operation. The controlled quantum gates can be directly implemented by utilizing non-adiabatic holonomy in decoherence-free subspaces and the required resource for the decoherence-free subspace encoding is minimal by using only two neighboring physical qubits undergoing collective dephasing to encode a logical qubit.

We study the construction of holonomy loops numerically in a realization-independent model of holonomic quantum computation. The aim is twofold. First, we present our technique of finding the suitable loop in the control manifold for any one-qubit and two-qubit unitary gates. Second, we develop the formalism further and add a penalty term for the length of the loop, thereby aiming to minimize the execution time for the quantum computation. Our method provides a general means by which holonomy loops can be realized in an experimental setup. Since holonomic quantum computation is adiabatic, optimizing with respect to the length of the loop may prove crucial.

Semilinear operators on a complex Hilbert space are studied in a part of a program that aims to develop the theories of additive operators on complex and quaternionic Hilbert spaces for application to problems in mathematical physics. The more notable among the new results proved on the eigenvalue problem for semilinear operators are the following: (i) if α is an eigenvalue of a semilinear operator then so also is any complex number which has the same modulus as α; (ii) if a normal semilinear operator has two eigenvectors belonging to different eigenvalues, then either the two eigenvectors are orthogonal or two eigenvalues have the same moduli; and (iii) a normal semilinear operator has a complete set of eigenvectors if and only if it is self-adjoint. Further, it is shown that there exists a norm-preserving semilinear isomorphism between the spaces of bounded linear and semilinear operators on a complex Hilbert space. Finally it is demonstrated how the theory of semilinear operators can be exploited to solve the problems of finding three involutive mutually anticommuting self-adjoint two-by-two matrices and four four-by-four matrices with the same properties: the unusual and remarkably easy solution of this old familiar exercise establishes the relevance of the theory being developed here to physics.

The main obstacles to the realization of high-fidelity quantum gates are the\ncontrol errors arising from inaccurate manipulation of a quantum system and the\ndecoherence caused by the interaction between the quantum system and its\nenvironment. Nonadiabatic holonomic quantum computation allows for high-speed\nimplementation of whole-geometric quantum gates, making quantum computation\nrobust against control errors. Dynamical decoupling provides an effective\nmethod to protect quantum gates against environment-induced decoherence,\nregardless of collective decoherence or independent decoherence. In this paper,\nwe put forward a protocol of nonadiabatic holonomic quantum computation\nprotected by dynamical decoupling . Due to the combination of nonadiabatic\nholonomic quantum computation and dynamical decoupling, our protocol not only\npossesses the intrinsic robustness against control errors but also protects\nquantum gates against environment-induced decoherence.\n

Nonadiabatic holonomic quantum computation has 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.

We examine the validity of the rotating wave approximation (RWA) in non-adiabatic holonomic single-qubit gates [New J. Phys. {\bf 14}, 103035 (2012)]. We demonstrate that the adoption of RWA may lead to a sharp decline in fidelity for rapid gate implementation and small energy separation between the excited and computational states. The validity of the RWA in the recent experimental realization [Nature (London) {\bf 496}, 482 (2013)] of non-adiabatic holonomic quantum computation for a superconducting qubit is examined.

Building a quantum computer is a daunting challenge since it requires good control but also good isolation from the environment to minimize decoherence. It is therefore important to realize quantum gates efficiently, using as few operations as possible, to reduce the amount of required control and operation time and thus improve the quantum state coherence. Here we propose a superconducting circuit for implementing a tunable system consisting of a qutrit coupled to two qubits. This system can efficiently accomplish various quantum information tasks, including generation of entanglement of the two qubits and conditional three-qubit quantum gates, such as the Toffoli and Fredkin gates. Furthermore, the system realizes a conditional geometric gate which may be used for holonomic (non-adiabatic) quantum computing. The efficiency, robustness and universality of the presented circuit makes it a promising candidate to serve as a building block for larger networks capable of performing involved quantum computational tasks.

A fundamental requirement of quantum information processing is the protection from the adverse effects of decoherence and noise. Decoherence-free subspaces and geometric processing are important steps of quantum information protection. Here, we provide a new experimentally feasible scheme to combine decoherence-free subspaces with nonadiabatic geometric manipulations to attain a universal quantum computation. The proposed scheme is different from previous proposals and is based on the typical XY interaction coupling, which can be set up in various nano-engineered systems and therefore open up for realization of nonadiabatic holonomic quantum computation in decoherence-free subspaces.

Previous schemes of nonadiabatic holonomic quantum computation were focused mainly on realizing a universal set of elementary gates. Multiqubit controlled gates could be built by decomposing them into a series of the universal gates. In this article, we propose an approach for realizing nonadiabatic holonomic multiqubit controlled gates in which a $(n+1)$-qubit controlled-$(\boldsymbol{\mathrm{n}\cdot \mathrm{\sigma}})$ gate is realized by $(2n-1)$ basic operations instead of decomposing it into the universal gates, whereas an $(n+1)$-qubit controlled arbitrary rotation gate can be obtained by combining only two such controlled-$(\boldsymbol{\mathrm{n}\cdot \mathrm{\sigma}})$ gates. Our scheme greatly reduces the operations of nonadiabatic holonomic quantum computation.

The nonadiabatic geometric quantum computation is promising as it is robust against certain types of local noises. However, its experimental implementation is challenging due to the need of complex control on multi-level and/or multiple quantum systems. Here, we propose to implement it on a two-dimensional square superconducting qubit lattice. In the construction of our geometric quantum gates, we only use the simplest and experimentally accessible control over the qubit states of the involved quantum systems, without introducing any auxiliary state. Specifically, our scheme is achieved by parametrically tunable all-resonant interaction, which leads to high-fidelity quantum gates. Meanwhile, this simple implementation can be conveniently generalized to a composite scenario, which can further suppress the systematic error during the gate operations. In addition, universal nonadiabatic geometric quantum gates in decoherence-free subspace can also be realized based on the tunable coupling between only two transmon qubits, without consulting to multiple qubits and only using two physical qubits to encode a logical qubit. Therefore, our proposal provides a promising way of high-fidelity geometric manipulation for robust solid-state quantum computation.

In this paper, two information leakage resistant quantum dialogue (QD) protocols over a collective-noise channel are proposed. Decoherence-free subspace (DFS) is used to erase the influence from two kinds of collective noise, i.e., collective-dephasing noise and collective-rotation noise, where each logical qubit is composed of two physical qubits and free from noise. In each of the two proposed protocols, the secret messages are encoded on the initial logical qubits via two composite unitary operations. Moreover, the single-photon measurements rather than the Bell-state measurements or the more complicated measurements are needed for decoding, making the two proposed protocols easier to implement. The initial state of each logical qubit is privately shared between the two authenticated users through the direct transmission of its auxiliary counterpart. Consequently, the information leakage problem is avoided in the two proposed protocols. Moreover, the detailed security analysis also shows that Eve's several famous active attacks can be effectively overcome, such as the Trojan horse attack, the intercept-resend attack, the measure-resend attack, the entangle-measure attack and the correlation-elicitation (CE) attack.