A single physical interaction might not be universal for quantum computation in general. It has been shown, however, that in some cases it can generate universal quantum computation over a subspace. For example, by encoding logical qubits into arrays of multiple physical qubits, a single isotropic or anisotropic exchange interaction can generate a universal logical gate-set. Recently, encoded universality for the exchange interaction was explicitly demonstrated on three-qubit arrays, the smallest nontrivial encoding. We now present the exact specification of a discrete universal logical gate-set on four-qubit arrays. We show how to implement the single qubit operations exactly with at most 3 nearest neighbor exchange operations and how to generate the encoded controlled-not with 29 parallel nearest neighbor exchange interactions or 54 serial gates, obtained from extensive numerical optimization using genetic algorithms and Nelder-Mead searches. Our gate-sequences are immediately applicable to implementations of quantum circuits with the exchange interaction.
The Heisenberg exchange interaction is a natural method to implement non-local (i.e., multi-qubit) quantum gates in quantum information processing. We consider quantum circuits comprising of $(SWAP)^α$ gates, which are realized through the exchange interaction, and single-qubit gates. A universal two-qubit quantum circuit is constructed from only three $(SWAP)^α$ gates and six single-qubit gates. We further show that three $(SWAP)^α$ gates are not only sufficient, but necessary. Since six single-qubit gates are known to be necessary, our universal two-qubit circuit is optimal in terms of the n…
A crucial requirement for quantum information processing is the realization of multiple-qubit quantum gates. Here, we demonstrate an electron spin based all-electrical two-qubit gate consisting of single spin rotations and inter-dot spin exchange in a double quantum dot. A partially entangled output state is obtained by the application of the two-qubit gate to an initial, uncorrelated state. We find that the degree of entanglement is controllable by the exchange operation time. The approach represents a key step towards the realization of universal multiple qubit gates.
We present a universal set of quantum gate operations based on exchange-only spin qubits in a double quantum dot, where each qubit is obtained by three electrons in the (2,1) filling. Gate operations are addressed by modulating electrostatically the tunneling barrier and the energy offset between the two dots, singly and doubly occupied respectively. We propose explicit gate sequences of single qubit operations for Hadamard gate and $π$/8 gate, and the two-qubit controlled NOT (CNOT) gate, to complete the universal set. The unswitchable interaction between the two electrons of the doubly occup…
We extend recent work on a leakage-protected, adiabatic entangling gate for exchange-only spin qubits [Doherty and Wardrop, PRL 111, 050503 (2013)] by adapting to a setting where single spins are not assumed to be polarized on preparation. Previous gate constructions do not function correctly when "gauge spins" are uninitialized, because the entangling gate has different, non-trivial action in different gauge subspaces. Our construction inherits many of the desirable features of the previous work while addressing the gauge-dependent behavior. Using numerical simulation, we show that the result…
An investigation of an optimal universal unitary Controlled-NOT gate that performs a specific operation on two unknown states of qubits taken from a great circle of the Bloch sphere is presented. The deep analogy between the optimal universal C-NOT gate and the `equatorial' quantum cloning machine (QCM) is shown. In addition, possible applications of the universal C-NOT gate are briefly discussed.
The universal quantum cloning machine and the universal NOT gate acting on a single qubit can be implemented very generally by slightly modifying the protocol of quantum state teleportation. The experimental demonstration of the 1 to 2 cloning process according to the above scheme has been realized for a qubit encoded in photon polarization.
We construct a Universal Quantum Entanglement Concentration Gate (QEC-Gate). Special times operations of QEC-Gate can transform a pure 2-level bipartite entangled state to nearly maximum entanglement. The transformation can attain any required fidelity with optimal probability by adjusting concentration step. We also generate QEC-Gate to the Schmidt decomposable multi-partite system.
Constructing a set of universal quantum gates is a fundamental task for quantum computation. The existence of noises, disturbances and fluctuations is unavoidable during the process of implementing quantum gates for most practical quantum systems. This paper employs a sampling-based learning method to find robust control pulses for generating a set of universal quantum gates. Numerical results show that the learned robust control fields are insensitive to disturbances, uncertainties and fluctuations during the process of realizing universal quantum gates.
The three-spin-$1/2$ decoherence-free subsystem defines a logical qubit protected from collective noise and supports exchange-only universal gates. Such logical qubits are well-suited for implementation with electrically-defined quantum dots. Exact exchange-only entangling logical gates exist but are challenging to construct and understand. We use a decoupling strategy to obtain straightforward approximate entangling gates. A benefit of the strategy is that if the physical spins are aligned, then it can implement evolution under entangling Hamiltonians. Hamiltonians expressible as linear combi…
We prove the existence of a class of two--input, two--output gates any one of which is universal for quantum computation. This is done by explicitly constructing the three--bit gate introduced by Deutsch [Proc.~R.~Soc.~London.~A {\bf 425}, 73 (1989)] as a network consisting of replicas of a single two--bit gate.
A universal quantum gate is introduced for tensors of vector spaces. By using integer powers of such a gate and by using classical reversible gates one can approximate any element of the unitary group to any accuracy needed. The proof uses a version of Kronecker's theory and the structure of the Bloch sphere for tensors.
By a significant modification of the standard protocol of quantum state Teleportation two processes ''forbidden'' by quantum mechanics in their exact form, the Universal NOT gate and the Universal Optimal Quantum Cloning Machine, have been implemented contextually and optimally by a fully linear method. In particular, the first experimental demonstration of the Tele-UNOT Gate, a novel quantum information protocol has been reported (cfr. quant-ph/0304070). A complete experimental realization of the protocol is presented here.
To generate arbitrary one- and two-qubit gates, the universal decompositions are usually used in quantum computing, and the universality of these decompositions has been demonstrated. However, in realistic experiments, gate errors may affect the universality of the universal decompositions. Here, we focus on the single-qubit-gate decomposition scheme and study the coherent-error effects on universality. We prove that, in the parameter space which we studied, some kinds of coherent errors will not affect the original universality, but some others will destroy it. We provide the definition and a…
We show that, for any n > 0, the Heisenberg interaction among 2n qubits (as spin-1/2 particles) can be used to exactly implement an n-qubit parity gate, which is equivalent in constant depth to an n-qubit fanout gate. Either isotropic or nonisotropic versions of the interaction can be used. We generalize our basic results by showing that any Hamiltonian (acting on suitably encoded logical qubits), whose eigenvalues depend quadratically on the Hamming weight of the logical qubit values, can be used to implement generalized Mod_q gates for any q > 1. This paper is a sequel to quant-ph/0309163, a…
The controlled-NOT gate and controlled square-root NOT gate play an important role in quantum algorithm. This article reports the experimental results of these two universal quantum logic gates (controlled square-root NOT gate and controlled-NOT gate) on a 7-qubit NMR quantum computer. Further, we propose a simple experimental method to measure and correct the error in the controlled phase-shift gate, which is helpful to construct a more perfect phase-shift gate experimentally and can also be used in more qubits discrete Fourier transformation.
Transversal implementations of encoded unitary gates are highly desirable for fault-tolerant quantum computation. Though transversal gates alone cannot be computationally universal, they can be combined with specially distilled resource states in order to achieve universality. We show that "triorthogonal" stabilizer codes, introduced for state distillation by Bravyi and Haah [Phys. Rev. A 86 052329 (2012)], admit transversal implementation of the controlled-controlled-Z gate. We then construct a universal set of fault-tolerant gates without state distillation by using only transversal controll…
Unitary gates are an interesting resource for quantum communication in part because they are always invertible and are intrinsically bidirectional. This paper explores these two symmetries: time-reversal and exchange of Alice and Bob. We will present examples of unitary gates that exhibit dramatic separations between forward and backward capacities (even when the back communication is assisted by free entanglement) and between entanglement-assisted and unassisted capacities, among many others. Along the way, we will give a general time-reversal rule for relating the capacities of a unitary gat…
Twisted rapid passage is a type of non-adiabatic rapid passage that gives rise to controllable quantum interference effects that were first observed experimentally in 2003. We show that twisted rapid passage sweeps can be used to implement a universal set of quantum gates that operate with high-fidelity. For each gate in the universal set, sweep parameter values are provided which simulations indicate will yield a quantum gate with error probability P_{e} < 10**(-4). Note that all gates in this universal set are driven by a **single** type of control field (twisted rapid passage), and the erro…
Universal quantum gates lie at the heart of designing quantum computer. We construct two compact quantum circuits to implement post-selected controlled-phase-flip (CPF) gate and Toffoli gate with linear optics assisted by one and two single photons, respectively. The current existing maximum success probability of 1/4 for linear optical CPF gate is achieved by resorting to an ancillary single photon rather than an entangled photon pair or two single photons. Remarkably, our Toffoli gate is accomplished with current maximum success probability of 1/30 without using additional entangled photon p…
Twisted rapid passage is a type of non-adiabatic rapid passage that generates controllable quantum interference effects that were first observed experimentally in 2003. It is shown that twisted rapid passage sweeps can be used to implement a universal set of quantum gates that operate with high-fidelity. The gate set consists of the Hadamard and NOT gates, together with variants of the phase, pi/8, and controlled-phase gates. For each gate g in the universal set, sweep parameter values are provided which numerical simulations indicate will produce a unitary operation that approximates g with e…
We implement a non-adiabatic universal set of holonomic quantum gates based on abelian holonomies using dynamical invariants, by Lie-algebraic methods. Unlike previous implementations, presented scheme does not rely on secondary methods such as double-loop or spin-echo and avoids associated experimental difficulties. It turns out that such gates exist purely in the non-adiabatic regime for these systems.
We show, within the circuit model, how any quantum computation can be efficiently performed using states with only real amplitudes (a result known within the Quantum Turing Machine model). This allows us to identify a 2-qubit (in fact 2-rebit) gate which is universal for quantum computing, although it cannot be used to perform arbitrary unitary transformations.
A universal set of quantum gates is constructed for the recently developed jump-error correcting quantum codes. These quantum codes are capable of correcting errors arising from the spontaneous decay of distinguishable qubits into statistically independent reservoirs. The proposed universal quantum gates are constructed with the help of Heisenberg- and Ising-type Hamiltonians acting on these physical qubits. This way it is guaranteed that the relevant error correcting code space is not left at any time even during the application of one of these quantum gates. The proposed entanglement gate is…
In this paper we study universality for quantum gates acting on qudits.Qudits are states in a Hilbert space of dimension d where d is at least two. We determine which 2-qudit gates V have the properties (i) the collection of all 1-qudit gates together with V produces all n-qudit gates up to arbitrary precision, or (ii) the collection of all 1-qudit gates together with V produces all n-qudit gates exactly. We show that (i) and (ii) are equivalent conditions on V, and they hold if and only if V is not a primitive gate. Here we say V is primitive if it transforms any decomposable tensor into a de…
We establish the non-existence of a universal Hadamard gate for arbitrary unknown qubits, by considering two different principles; namely, no-superluminal signalling and non-increase of entanglement under LOCC. It is also shown that these principles are not violated if and only if the qubit states are of a special form obtained in our recent work [ IJQI (in press), quant-ph/0505068 ].
We find exact solutions for a universal set of quantum gates on a scalable candidate for quantum computers, namely an array of two level systems. The gates are constructed by a combination of dynamical and geometrical (non-Abelian) phases. Previously these gates have been constructed mostly on non-scalable systems and by numerical searches among the loops in the manifold of control parameters of the Hamiltonian.
A new approach to single-qubit operations using exchange interactions of single electrons in gate-defined quantum dots has recently been demonstrated: the resonant exchange qubit. We show that two-qubit operations, specifically the CPHASE gate, can be performed between resonant exchange qubits very straightforwardly, using a single exchange pulse. This is in marked contrast to the best known protocols for exchange qubits where such a gate requires many pulses so that leakage processes arising from the exchange interaction can be overcome. For resonant exchange qubits a simple two-qubit gate is…
We consider the implementation of two-qubit unitary transformations by means of CNOT gates and single-qubit unitary gates. We show, by means of an explicit quantum circuit, that together with local gates three CNOT gates are necessary and sufficient in order to implement an arbitrary unitary transformation of two qubits. We also identify the subset of two-qubit gates that can be performed with only two CNOT gates.
It is an oft-cited fact that no quantum code can support a set of fault-tolerant logical gates that is both universal and transversal. This no-go theorem is generally responsible for the interest in alternative universality constructions including magic state distillation. Widely overlooked, however, is the possibility of non-transversal, yet still fault-tolerant, gates that work directly on small quantum codes. Here we demonstrate precisely the existence of such gates. In particular, we show how the limits of non-transversality can be overcome by performing rounds of intermediate error-correc…
We present a nonlocal construction of universal gates by means of holonomic (geometric) quantum teleportation. The effect of the errors from imperfect control of the classical parameters, the looping variation of which builds up holonomic gates, is investigated. Additionally, the influence of quantum decoherence on holonomic teleportation used as a computational primitive is studied. Advantages of the holonomic implementation with respect to control errors and dissipation are presented.
In this paper is shown an application of Clifford algebras to the construction of computationally universal sets of quantum gates for $n$-qubit systems. It is based on the well-known application of Lie algebras together with the especially simple commutation law for Clifford algebras, which states that all basic elements either commute or anticommute.
Recently Shi proved that Toffoli and Hadamard are universal for quantum computation. This is perhaps the simplest universal set of gates that one can hope for, conceptually; It shows that one only needs to add the Hadamard gate to make a 'classical' set of gates quantum universal. In this note we give a few lines proof of this fact relying on Kitaev's universal set of gates, and discuss the meaning of the result.
What additional gates are needed for a set of classical universal gates to do universal quantum computation? We answer this question by proving that any single-qubit real gate suffices, except those that preserve the computational basis. The result of Gottesman and Knill[quant-ph/9807006] implies that any quantum circuit involving only the Controlled-NOT and Hadamard gates can be efficiently simulated by a classical circuit. In contrast, we prove that Controlled-NOT plus any single-qubit real gate that does not preserve the computational basis and is not Hadamard (or its alike) are universal f…
We numerically study the implementation of a universal two-qubit gate set, composed of CNOT, Hadamard, phase and $π/8$ gates, for transmon-based systems. The control signals to implement such gates are obtained using the Chopped Random Basis optimal control technique, with a target gate infidelity of $10^{-2}$. During the optimization processes we account for the leakage toward non-computational states, an important non-ideality affecting transmon qubits. We also test and benchmark the optimal control solutions against the introduction of Gaussian white noise and spectral distortion, two key n…
We present some deterministic schemes to construct universal quantum gates, that is, controlled- NOT, three-qubit Toffoli, and Fredkin gates, between flying photon qubits and stationary electron-spin qubits assisted by quantum dots inside double-sided optical microcavities. The control qubit of our gates is encoded on the polarization of the moving single photon and the target qubits are encoded on the confined electron spins in quantum dots inside optical microcavities. Our schemes for these universal quantum gates on a hybrid system have some advantages. First, all the gates are accomplished…
We show that in quantum computation almost every gate that operates on two or more bits is a universal gate. We discuss various physical considerations bearing on the proper definition of universality for computational components such as logic gates.
We propose a scheme to realize universal quantum gates between nitrogen-vacancy (NV) centers in an optically trapped nanodiamond, through uniform magnetic field induced coupling between the NV centers and the torsional mode of the levitated nanodiamond. The gates are tolerant to the thermal noise of the torsional mode. By combining the scheme with dynamical decoupling technology, it is found that the high fidelity quantum gates are possible for the present experimental conditions. The proposed scheme is useful for NV-center-based quantum network and distributed quantum computation
Resonant exchange qubits are a promising addition to the family of experimentally implemented encodings of single qubits using semiconductor quantum dots. We have shown previously that it ought to be straightforward to perform a CPHASE gate between two resonant exchange qubits with a single exchange pulse. This approach uses energy gaps to suppress leakage rather than conventional pulse sequences. In this paper we present analysis and simulations of our proposed two-qubit gate subject to charge and Overhauser field noise at levels observed in current experiments. Our main result is that we exp…
The gate version of quantum computation exploits several quantum key resources as superposition and entanglement to reach an outstanding performance. In the way, this theory was constructed adopting certain supposed processes imitating classical computer gates. As for optical as well as magnetic systems, those gates are obtained as quantum evolutions. Despite, in certain cases they are attained as an asymptotic series of evolution effects. The current work exploits the direct sum of the evolution operator on a non-local basis for the driven bipartite Heisenberg-Ising model to construct a set o…
Stark shift on a superconducting qubit in circuit quantum electrodynamics (QED) has been used to construct universal quantum entangling gates on superconducting resonators in previous works. It is a second-order coupling effect between the resonator and the qubit in the dispersive regime, which leads to a slow state-selective rotation on the qubit. Here, we present two proposals to construct the fast universal quantum gates on superconducting resonators in a microwave-photon quantum processor composed of multiple superconducting resonators coupled to a superconducting transmon qutrit, that is,…
A large-scalable quantum computer model, whose qubits are represented by the subspace subtended by the ground state and the single exciton state on semiconductor quantum dots, is proposed. A universal set of quantum gates in this system may be achieved by a mixed approach, composed of dynamic evolution and nonadibatic geometric phase.
We demonstrate the applicability of a universal gate set in the parity encoding, which is a dual to the standard gate model, by exploring several quantum gate algorithms such as the quantum Fourier transform and quantum addition. Embedding these algorithms in the parity encoding reduces the circuit depth compared to conventional gate-based implementations while keeping the multiqubit gate counts comparable. We further propose simple implementations of multiqubit gates in tailored encodings and an efficient strategy to prepare graph states.
We propose a feasible scheme to implement a universal set of quantum gates based on geometric phases and superadiabatic quantum control. Consolidating the advantages of both strategies, the proposed quantum gates are robust and fast. The diamond nitrogen-vacancy center system is adopted as a typical example to illustrate the scheme. We show that these gates can be realized in a simple two-level configuration by appropriately controlling the amplitude, phase, and frequency of just one microwave field. The gate's robust and fast features are confirmed by comparing the fidelity of the proposed su…
A simultaneous realization of the Universal Optimal Quantum Cloning Machine (UOQCM) and of the Universal-NOT gate by a quantum injected optical parametric amplification (QIOPA), is reported. The two processes, forbidden in their exact form for fundamental quantum limitations, are found universal and optimal, and the measured fidelity F<1 is found close to the limit values evaluated by quantum theory. This work may enlighten the yet little explored interconnections of fundamental axiomatic properties within the deep structure of quantum mechanics.
In order to achieve universal quantum computation using continuous variables, one needs to jump out of the set of Gaussian operations and have a non-Gaussian element, such as the cubic phase gate. However, such a gate is currently very difficult to implement in practice. Here we introduce an experimentally viable 'repeat-until-success' approach to generating the cubic phase gate, which is achieved using sequential photon subtractions and Gaussian operations. We find that our scheme offers benefits in terms of the expected time until success, although we require a primitive quantum memory.
We show how one can implement any local quantum gate on specific qubits in an array of qubits by carrying adiabatically a Hamiltonian around a closed loop. We find the exact form of the loop and the Hamiltonian for implementing general one and two qubits gates. Our method is analytical and is not based on numerical search in the space of all loops.
We show how to construct quantum gate arrays that can be programmed to perform different unitary operations on a data register, depending on the input to some program register. It is shown that a universal quantum gate array - a gate array which can be programmed to perform any unitary operation - exists only if one allows the gate array to operate in a probabilistic fashion. The universal quantum gate array we construct requires an exponentially smaller number of gates than a classical universal gate array.
Many well-known and well-studied four by four universal quantum logic gates in the literature are of a specific form, the so called eight-vertex form \eqref{8vertexform} \cite{kaufman etal 05-1,kaufman etal 05-2}, or {\it similar} to it. We present a formalism for universal quantum logic gates of such a form. First, we provide explicit formulas in terms of matrix entries, which are the necessary and sufficient conditions for such a matrix to be a solution to the Yang-Baxter equation \eqref{byb}. Then, combining this with the conditions needed for being unitary \eqref{unitarycond} and being ent…
We propose a scalable scheme for optical quantum computing using measurement-induced continuous-variable quantum gates in a loop-based architecture. Here, time-bin-encoded quantum information in a single spatial mode is deterministically processed in a nested loop by an electrically programmable gate sequence. This architecture can process any input state and an arbitrary number of modes with almost minimum resources, and offers a universal gate set for both qubits and continuous variables. Furthermore, quantum computing can be performed fault-tolerantly by a known scheme for encoding a qubit …
Large optical nonlinearities occurring in a coherently prepared atomic system are shown to produce phase shifts of order $π$. Such an effect may be observed in ultracold rubidium atoms where it could be feasibly exploited toward the realization of a polarization phase gate.
We say that collection of $n$-qudit gates is universal if there exists $N_0\geq n$ such that for every $N\geq N_0$ every $N$-qudit unitary operation can be approximated with arbitrary precision by a circuit built from gates of the collection. Our main result is an upper bound on the smallest $N_0$ with the above property. The bound is roughly $d^8 n$, where $d$ is the number of levels of the base system (the '$d$' in the term qu$d$it.) The proof is based on a recent result on invariants of (finite) linear groups.
Fernando Galve \emph{et al.} $[Phys. Rev. Lett. \textbf{110}, 010501 (2013)]$ introduced discording power for a two-qubit unitary gate to evaluate its capability to produce quantum discord, and found that a $π/8$ gate has maximal discording power. This work analyzes the entangling power of a two-qubit unitary gate, which reflects its ability to generate quantum entanglement in another way. Based on the renowned Cartan decomposition of two-qubit unitary gates, we show that the magic power of the $π/8$ gate produces maximal entanglement for a general value of purities for two-qubit states.
We demonstrate a quadratic phase gate for one-way quantum computation in the continuous-variable regime. This canonical gate, together with phase-space displacements and Fourier rotations, completes the set of universal gates for realizing any single-mode Gaussian transformation such as arbitrary squeezing. As opposed to previous implementations of measurement-based squeezers, the current gate is fully controlled by the local oscillator phase of the homodyne detector. Verifying this controllability, we give an experimental demonstration of the principles of one-way quantum computation over con…
Universal quantum entangling gates are a crucial building block in the large-scale quantum computation and quantum communication, and it is an important task to find simple ways to implement them. Here an effective quantum circuit for the implementation of a controlled-NOT (CNOT) gate is constructed by introducing a non-computational quantum state in the auxiliary space. Furthermore, the method is extended to the construction of a general n-control-qubit Toffoli gate with (2n-1) qubit-qudit gates and (2n-2) single-qudit gates. Based on the presented quantum circuits, the polarization CNOT and …
