We investigate the set of quantum channels acting on a single qubit. We provide an alternative, compact generalization of the Fujiwara-Algoet conditions for complete positivity to non-unital qubit channels, which we then use to characterize the possible geometric forms of the pure output of the channel. We provide universal sets of quantum channels for all unital qubit channels as well as for all extremal (not necessarily unital) qubit channels, in the sense that all qubit channels in these sets can be obtained by concatenation of channels in the corresponding universal set. We also show that our universal sets are essentially minimal.
We address the problem of the robustness of entanglement of bipartite systems (qubits) interacting with dynamically independent environments. In particular, we focus on characterization of so-called local entanglement-annihilating two-qubit channels, which set the maximum permissible noise level allowing to perform entanglement-enabled experiments. The differences, but also subtle relations between entanglement-breaking and local entanglement-annihilating channels are emphasized. A detailed characterization of latter ones is provided for a variety of channels including depolarizing, unital, (g…
We show that any incoherent qubit channel could be decomposed into four incoherent Kraus operators. The proof consists in showing existence of four incoherent Kraus operators by decomposing the corresponding Choi-Jamiołkowski-Sudarshan matrix. We mention some applications of this optimal decomposition. We also show that the Kraus rank and incoherent rank are different even for qubit channel.
This paper continues the study of stochastic maps, or channels, which break entanglement. We give a detailed description of entanglement-breaking qubit channels, and show that such maps are precisely the convex hull of those known as classical-quantum channels. We also review the complete positivity conditions in a canonical parameterization and show how they lead to entanglement-breaking conditions.
Port-based teleportation (PBT) is a teleportation protocol that employs a number of Bell pairs and a joint measurement to enact an approximate input-output identity channel. Replacing the Bell pairs with a different multi-qubit resource state changes the enacted channel and allows the PBT protocol to simulate qubit channels beyond the identity. The channel resulting from PBT using a general resource state is consequently of interest. In this work, we fully characterise the Choi matrix of the qubit channel simulated by the PBT protocol in terms of its resource state. We also characterise the PB…
We investigate minimum output (Rényi) entropy of qubit channels and unital quantum channels. We obtain an exact formula for the minimum output entropy of qubit channels, and bounds for unital quantum channels. Interestingly, our bounds depend only on the operator norm of the matrix representation of the channels on the space of trace-less Hermitian operators. Moreover, since these bounds respect tensor products, we get bounds for the capacity of unital quantum channels, which is saturated by the Werner-Holevo channel. Furthermore, we construct an orthonormal basis, besides the Gell-Mann basis,…
Quantum operations, or quantum channels cannot be inverted in general. An arbitrary state passing through a quantum channel looses its fidelity with the input. Given a quantum channel ${\cal E}$, we introduce the concept of its quasi-inverse as a map ${\cal E}^{qi}$ which when composed with ${\cal E}$ increases its average input-output fidelity in an optimal way. The channel ${\cal E}^{qi}$ comes as close as possible to the inverse of a quantum channel. We give a complete classification of such maps for qubit channels and provide quite a few illustrative examples.
Suppose we can apply a given 2-qubit Hamiltonian H to any (ordered) pair of qubits. We say H is n-universal if it can be used to approximate any unitary operation on n qubits. While it is well known that almost any 2-qubit Hamiltonian is 2-universal (Deutsch, Barenco, Ekert 1995; Lloyd 1995), an explicit characterization of the set of non-universal 2-qubit Hamiltonians has been elusive. Our main result is a complete characterization of 2-non-universal 2-qubit Hamiltonians. In particular, there are three ways that a 2-qubit Hamiltonian H can fail to be universal: (1) H shares an eigenvector wit…
Superconducting quantum circuit is a promising system for building quantum computer. With this system we demonstrate the universal quantum computations, including the preparing of initial states, the single-qubit operations, the two-qubit universal gate operations between arbitrary qubits, the multiple pairs of two-qubit gate operations in parallel, the coupling operations on a group of qubits in parallel, the coupling operations on multiple groups of qubits in parallel, the coupling operations on multiple pairs and multiple groups of qubits in parallel. Within available technology, a universa…
It is shown that efficient and robust universal quantum computation is possible using the stimulated Raman adiabatic passage with a qubit chain as a pointer register.
We show that any unital qubit channel can be implemented by letting the input system interact unitarily with a $4$-dimensional environment in the maximally mixed state and then tracing out the environment. We also provide an example where the dimension of such an environment has to be at least $3$.
We propose to implement tunable interfaces for realizing universal quantum computation with topological qubits. One interface is between the topological and superconducting qubits, which can realize arbitrary single-qubit gate on the topological qubit. When two qubits are involved, the interface between the topological qubits and a microwave cavity can induce a nontrivial two-qubit gate, which can not be constructed based on braiding operations. The two interfaces, being tunable via an external magnetic flux, may serve as the building blocks towards universal quantum computation with topologic…
Nielsen [quant-ph/0108020] showed that universal quantum computation is possible given quantum memory and the ability to perform projective measurements on up to 4-qubits. We describe an improved method that requires only 2-qubit measurements, which are both sufficient and necessary. We present a method to partially collapse the $C_k$-hierarchy in the indirect construction of unitary gates [Gottesman and Chuang, Nature, {\bf 402} 309 (1999)], and apply the method to find discrete universal sets of 2-qubit measurements.
We consider two-qubit undergoing local dissipation and subject to local driving. We then determine the optimal Markovian feedback action to preserve initial entanglement as well as to create stationary entanglement with the help of an XY interaction Hamiltonian. Such feedback actions are worked out in a way not depending on the initial two-qubit state, whence called universal.
The relative entropy description of Holevo-Schumacher-Westmoreland (HSW) classical channel capacity is applied to single qubit channels. A simple formula for the relative entropy of qubit density matrices in the Bloch sphere representation is derived. This formula is combined with the King-Ruskai-Szarek-Werner qubit channel ellipsoid picture to analyze several unital and non-unital qubit channels in detail. An alternate proof that the optimal HSW signalling states for single qubit unital channels are those states with the minimum channel output entropy is presented. The derivation is based on …
We construct optimized implementations of the CNOT and other universal two-qubit gates that, unlike many of the previously proposed protocols, are carried out in a single step. The new protocols require tunable inter-qubit couplings but, in return, show a significant improvements in the quality of gate operations. Our optimization procedure can be further extended to the combinations of elementary two-qubit as well as irreducible many-qubit gates.
We present a new experimental protocol for performing universal gates in a register of superconducting qubits coupled by fixed on-chip linear reactances. The qubits have fixed, detuned Larmor frequencies and can remain, during the entire gate operation, biased at their optimal working point where decoherence due to fluctuations in control parameters is suppressed to first order. Two-qubit gates are performed by simultaneously irradiating two qubits at their respective Larmor frequencies with appropriate amplitude and phase, while one-qubit gates are performed by the usual single-qubit irradiat…
Classical capacity of unital qubit channels is well known, whereas that of nonunital qubit channels is not. We find lower and upper bounds on classical capacity of nonunital qubit channels by using a recently developed decomposition technique relating nonunital and unital positive qubit maps.
We show how to control and perform universal three-qubit quantum computation with trapped electron quantum states. The three qubits are the electron spin, and the first two quantum states of the cyclotron and axial harmonic oscillators. We explicitly show how the universal gates can be performed. As an example of a non-trivial quantum algorithm, we outline the implementation of the Deutsch-Jozsa algorithm in this system.
We propose channel matrices by using unfolding matrices from their reduced density matrices. These channel matrices can be a criterion for a channel whether the channel can teleport or not any qubit state. We consider a special case, teleportation of the arbitrary two-qubit state by using the four-qubit channel. The four-qubit channel can only teleport if the rank of the related channel matrix is four.
The quantum degeneracy point approach [D. Vion et al., Science 296, 886 (2002)] effectively protects superconducting qubits from low-frequency noise that couples with the qubits as transverse noise. However, low-frequency noise in superconducting qubits can originate from various mechanisms and can couple with the qubits either as transverse or as longitudinal noise. Here, we present a quantum circuit containing a universal quantum degeneracy point that protects an encoded qubit from arbitrary low-frequency noise. We further show that universal quantum logic gates can be performed on the encod…
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 present a finite set of projective measurements that, together with quantum memory and preparation of the |0> state, suffice for universal quantum computation. This extends work of Nielsen [quant-ph/0108020], who proposed a scheme in which an arbitrary unitary operation on n qubits can be simulated using only projective measurements on at most 2n qubits. All measurements in our set involve two qubits, except two measurements which involve three qubits. Thus we improve by one the upper bound, implied by Nielsen's results, on the maximum number of qubits needed to participate in any single me…
A field configuration utilizing local static and oscillating fields is constructed to achieve universal (but low-order) protection of two-qubit states. That is, two-qubit states can be protected against arbitrary system-environment coupling if the driving field frequency, as compared with the cutoff frequency of the environment, is sufficiently large. Equally important, we show that it is possible to construct driving fields to protect two-qubit entangling gates against decoherence, without assuming any particular form of system-environment coupling. Using a non-Markovian master equation, we f…
We demonstrate that in a coupled two-qubit system any single-qubit gate can be decomposed into two conditional two-qubit gates and that any conditional two-qubit gate can be implemented by a manipulation analogous to that used for a controlled two-qubit gate. Based on this we present a unified approach to implement universal single-qubit and two-qubit gates in a coupled two-qubit system with fixed always-on coupling. This approach requires neither supplementary circuit or additional physical qubits to control the coupling nor extra hardware to adjust the energy level structure. The feasibility…
We show that there does not exist any universal quantum cloning machine that can broadcast an arbitrary mixed qubit with a constant fidelity. Based on this result, we investigate the dependent quantum cloner in the sense that some parameter of the input qubit $ρ_s(θ,ω,λ)$ is regarded as constant in the fidelity. For the case of constant $ω$, we establish the $1\to2$ optimal symmetric dependent cloner with a fidelity 1/2. It is also shown that the $1\to M$ optimal quantum cloning machine for pure qubits is also optimal for mixed qubits, when $λ$ is the unique parameter in the fidelity. For gene…
We study the Chern-Simons approach to the topological quantum computing. We use quantum $\mathcal{R}$-matrices as universal quantum gates and study the approximations of some one-qubit operations. We make some modifications to the known Solovay-Kitaev algorithm suitable for our particular problem.
In this paper, we present the experimental realization of multi-qubit gates $% Λ_n(not) $ in macroscopic ensemble of three-qubit and four-qubit molecules. Instead of depending heavily on the two-bit universal gate, which served as the basic quantum operation in quantum computing, we use pulses of well-defined frequency and length that simultaneously apply to all qubits in a quantum register. It appears that this method is experimentally convenient when this procedure is extended to more qubits on some quantum computation, and it can also be used in other physical systems.
Reliable quantum information processing requires high-fidelity universal manipulation of quantum systems within the characteristic coherence times. Non-adiabatic holonomic quantum computation offers a promising approach to implement fast, universal, and robust quantum logic gates particularly useful in nano-fabricated solid-state architectures, which typically have short coherence times. Here, we propose an experimentally feasible scheme to realize high-speed universal geometric quantum gates in nano-engineered pseudo-spin charge qubits. We use a system of three coupled quantum dots containing…
Additivity of the Holevo capacity is proved for product channels, under the condition that one of the channels is in a certain class of unital qubit channels, with the other completely arbitrary. This qubit class includes the depolarizing channel. As a byproduct this proves that the Holevo bound is the ultimate information capacity of such qubit channels (assuming no prior entanglement between sender and receiver). Additivity of minimal entropy and multiplicativity of p-norms are also proved under the same assumptions.
We show that an n-th root of the Walsh-Hadamard transform (obtained from the Hadamard gate and a cyclic permutation of the qubits), together with two diagonal matrices, namely a local qubit-flip (for a fixed but arbitrary qubit) and a non-local phase-flip (for a fixed but arbitrary coefficient), can do universal quantum computation on n qubits. A quantum computation, making use of n qubits and based on these operations, is then a word of variable length, but whose letters are always taken from an alphabet of cardinality three. Therefore, in contrast with other universal sets, no choice of qubi…
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 propose a scheme to realize $1\to 2$ universal quantum cloning machine (UQCM) with superconducting quantum interference device (SQUID) qubits, embeded in a high-Q cavity. CNOT operations are derived to present our scheme, and the two-photon Raman resonance processes are used to increase the operation rate. Compared with previous works, our scheme has advantages in the experimental realization and further utilization.
We analyze the class of single qubit channels with the environment modeled by a one-qubit mixed state. The set of affine transformations for this class of channels is computed analytically, employing the canonical form for the two-qubit unitary operator. We demonstrate that, 3/8 of the generalized depolarizing channels can be simulated by the one-qubit mixed state environment by explicitly obtaining the shape of the volume occupied by this class of channels within the tetrahedron representing the generalized depolarizing channels. Further, as a special case, we show that the two-Pauli Channel …
We review our recent work on the universal (i.e. input state independent) optimal quantum copying (cloning) of qubits. We present unitary transformations which describe the optimal cloning of a qubit and we present the corresponding quantum logical network. We also present network for an optimal quantum copying ``machine'' (transformation) which produces N+1 identical copies from the original qubit. Here again the quality (fidelity) of the copies does not depend on the state of the original and is only a function of the number of copies, N. In addition, we present the machine which universaly …
Quantum control of systems plays important roles in modern science and technology. The ultimate goal of quantum control is to achieve high fidelity universal control in the time-optimal way. Although high fidelity universal control has been reported in various quantum systems, experimental implementation of time-optimal universal control remains elusive. Here we report the experimental realization of time-optimal universal control of spin qubits in diamond. By generalizing a recent method for solving quantum brachistochrone equations [X. Wang, et al., Phys. Rev. Lett. 114, 170501 (2015)], we o…
We consider the problem of discriminating qubit states that are sent over a quantum channel and derive a necessary and sufficient condition for an optimal measurement to be preserved by the channel. We apply the result to the characterization of optimal measurement preserving (OMP) channels for a given qubit ensemble, e.g., a set of two states or a set of multiple qubit states with equal a priori probabilities. Conversely, we also characterize qubit ensembles for which a given channel is OMP, such as unitary and depolarization channels. Finally, we show how the sets of OMP channels for a given…
This paper provides a characterization for the set of antidegradable qubit channels. The characterization arises from the correspondence between the antidegradability of a channel and the symmetric extendibility of its Choi operator. Using an inequality derived to describe the set of bipartite qubit states which admit symmetric extension, we are able to characterize the set of all antidegradable qubit channels. Using the characterization we investigate the antidegradability of unital qubit channels and arbitrary qubit channels with respect to the dimension of the environment. We additionally p…
Low-frequency noise can induce serious decoherence in superconducting qubits. Due to its diverse physical origin, such noise can couple with the qubits either as transverse or as longitudinal noise. Here, we present a universal quantum degeneracy point approach that can protect an encoded qubit from arbitrary low-frequency noise. We further show that universal quantum logic gates can be performed on the encoded qubits with high fidelity. The proposed scheme can be readily implemented with superconducting flux qubits or with a qubit coupling with a superconducting resonator. Meanwhile, the sche…
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.
We describe a general framework to study covariant symmetric broadcasting maps for mixed qubit states. We explicitly derive the optimal N to M superbroadcasting maps, achieving optimal purification of the single-site output copy, in both the universal and the phase covariant cases. We also study the bipartite entanglement properties of the superbroadcast states.
Uhrig's dynamical decoupling pulse sequence has emerged as one universal and highly promising approach to decoherence suppression. So far both the theoretical and experimental studies have examined single-qubit decoherence only. This work extends Uhrig's universal dynamical decoupling from one-qubit to two-qubit systems and even to general multi-level quantum systems. In particular, we show that by designing appropriate control Hamiltonians for a two-qubit or a multi-level system, Uhrig's pulse sequence can also preserve a generalized quantum coherence measure to the order of $1+O(T^{N+1})$, w…
In this paper, we show that the ability to switch globally between two 2-local Hamiltonians on n qubits is sufficient for achieving universal unitary dynamics on those n qubits. Of the two Hamiltonians used in the construction, one is comprised of nearest-neighbour two-qubit interactions on a one-dimensional chain, the other is comprised of single-qubit interactions. We describe a scheme for choosing the switching times in order to generate arbitrary one- and two-qubit gates on the n qubits. However the switching scheme is inefficient, and we leave as an open problem the question of whether th…
Decoherence-induced leakage errors can couple a physical or encoded qubit to other levels, thus potentially damaging the qubit. They can therefore be very detrimental in quantum computation and require special attention. Here we present a general method for removing such errors by using simple decoupling and recoupling pulse sequences. The proposed gates are experimentally accessible in a variety of promising quantum computing proposals.
We study the entanglement evolution of photonic orbital angular momentum qubit states with opposite azimuthal indices $l_0$, in a weakly turbulent atmosphere. Using asymptotic methods, we deduce analytical expressions for the amplitude of turbulence-induced crosstalk between the modes $l_0$ and $-l_0$. Furthermore, we analytically establish distinct, universal entanglement decay laws for Kolmogorov's turbulence model and for two approximations thereof.
Inspired by the Solovay-Kitaev decomposition for approximating unitary operations as a sequence of operations selected from a universal quantum computing gate set, we introduce a method for approximating any single-qubit channel using single-qubit gates and the controlled-NOT (CNOT). Our approach uses the decomposition of the single-qubit channel into a convex combination of "quasiextreme" channels. Previous techniques for simulating general single-qubit channels would require as many as 20 CNOT gates, whereas ours only needs one, bringing it within the range of current experiments.
We derive the optimal curve satisfied by the reduction factors, in the case of universal disentangling machine which uses only local operations. Impossibility of constructing a better disentangling machine, by using non-local operations, is discussed.
We investigate how to carry out universal quantum computation deterministically with free electrons in decoherence-free subspace by using polarizing beam splitters, charge detectors, and single-spin rotations. Quantum information in our case is encoded in spin degrees of freedom of the electron-pairs which construct a decoherence-free subspace. We design building blocks for two noncommutable single-logic-qubit gates and a logic controlled phase gate, based on which a universal and scalable quantum information processing robust to dephasing is available in a deterministic way.
We give a careful proof that a parallelized version of adiabatic quantum computation can efficiently simulate universal gate model quantum computation. The proof specifies an explicit parameter-dependent Hamiltonian $H(λ)$ that is based on ground state quantum computation [1]. We treat both a 1-dimensional configuration in which qubits on a line undergo nearest neighbor 2-qubit gates and an all-to-all configuration in which every qubit undergoes 2-qubit gates with every other qubit in the system.
Majorana bound states have been a focus of condensed matter research for their potential applications in topological quantum computation. Here we utilize two charge-qubit arrays to explicitly simulate a DIII class one-dimensional superconductor model where Majorana end states can appear. Combined with one braiding operation, universal single-qubit operations on a Majorana-based qubit can be implemented by a controllable inductive coupling between two charge qubits at the ends of the arrays. We further show that in a similar way, a controlled-NOT gate for two topological qubits can be simulated…
We provide an analytic way to implement any arbitrary two-qubit unitary operation, given an entangling two-qubit gate together with local gates. This is shown to provide explicit construction of a universal quantum circuit that exactly simulates arbitrary two-qubit operations in SU(4). Each block in this circuit is given in a closed form solution. We also provide a uniform upper bound of the applications of the given entangling gates, and find that exactly half of all the Controlled-Unitary gates satisfy the same upper bound as the CNOT gate. These results allow for the efficient implementatio…
Recently, Yeo and Chua [Phys. have given an explicit protocol for faithfully teleporting an arbitrary two-qubit state via a genuine four-qubit entangled state, which is not reducible to a pair of Bell states. Here, we present a transformation operator to give the criterion of for faithfully teleporting arbitrary two-qubit states. The theoretical explanations of some quantum channels are given by transformation operators. Furthermore, a new four-qubit entangled state quantum channel is presented.
Beyond the no-cloning theorem, the universal symmetric quantum cloning machine was first addressed by Buzek and Hillery. Here, we realized the one-to-two qubits Buzek-Hillery cloning machine with linear optical devices. This method relies on the representation of several qubits by a single photon. We showed that, the fidelities between the two output qubits and the original qubit are both 5/6 (which proved to be the optimal fidelity of one-to-two qubits universal cloner) for arbitrary input pure states.
We present a simple quantum circuit that allows for the universal and deterministic manipulation of the quantum state of confined harmonic oscillators. The scheme is based on the selective interactions of the referred oscillator with an auxiliary three-level system and a classical external driving source, and enables any unitary operations on Fock states, two-by-two. One circuit is equivalent to a single qubit unitary logical gate on Fock states qubits. Sequences of similar protocols allow for complete, deterministic and state-independent manipulation of the harmonic oscillator quantum state.
In this article we develop, step by step, the framework for universal dynamical control of two-level systems (TLS) or qubits experiencing amplitude- or phase-noise (AN or PN) due to coupling to a thermal bath. A comprehensive arsenal of modulation schemes is introduced and applied to either AN or PN, resulting in completely analogous formulae for the decoherence rates, thus underscoring the unified nature of this universal formalism. We then address the extension of this formalism to multipartite decoherence control, where symmetries are exploited to overcome decoherence.
