Canonical forms of two-qubits under the action of stochastic local operations and classical communications (SLOCC) offer great insight for understanding non-locality and entanglement shared by them. They also enable geometric picture of two-qubit states within the Bloch ball. It has been shown (Verstraete et.al. {Phys. Rev. A, 64, 010101(R) (2001)) that an arbitrary two-qubit state gets transformed under SLOCC into one of the {\em two} different canonical forms. One of these happens to be the Bell diagonal form of two-qubit states and the other non-diagonal canonical form is obtained for a family of rank deficient two-qubit states. The method employed by Verstraete et.al. required highly non-trivial results on matrix decompositions in $n$ dimensional spaces with indefinite metric. Here we employ an entirely different approach -- inspired by the methods developed by Rao et. al., (J. Mod. Opt. 45, 955 (1998)) in classical polarization optics -- which leads naturally towards the identification of two inequivalent SLOCC invariant canonical forms for two-qubit states. In addition, our approach results in a simple geometric visualization of two-qubit states in terms of their SLOCC canonical forms.
Given an arbitrary single-qubit operation, an important task is to efficiently decompose this operation into an (exact or approximate) sequence of fault-tolerant quantum operations. We derive a depth-optimal canonical form for single-qubit quantum circuits, and the corresponding rules for exactly reducing an arbitrary single-qubit circuit to this canonical form. We focus on the single-qubit universal H,T basis due to its role in fault-tolerant quantum computing, and show how our formalism might be extended to other universal bases. We then extend our canonical representation to the family of S…
In this paper we analyze the canonical forms into which any pure three-qubit state can be cast. The minimal forms, i.e. the ones with the minimal number of product states built from local bases, are also presented and lead to a complete classification of pure three-qubit states. This classification is related to the values of the polynomial invariants under local unitary transformations by a one-to-one correspondence.
Dissipative and stochastic effects in the geometric phase of a qubit are taken into account using a geometrical description of the corresponding open--system dynamics within a canonical Langevin framework based on a Caldeira--Leggett like Hamiltonian. By extending the Hopf fibration $S^{3}\to S^{2}$ to include such effects, the exact geometric phase for a dissipative qubit is obtained, whereas numerical calculations are used to include finite temperature effects on it.
Recently, Agrawal and Pati [Phys. Rev. A 74, 062320 (2006)] have given a class of W-states that can be used for perfect teleportation. Here, two canonical forms of perfect quantum channel are presented by transformation operator and the GHZ state and the W state are special case of those two canonical forms of perfect quantum channel. Furthermore, the orthogonal complete measurement bases are given.
We construct a canonical form for pure states in $\bwe^3(\bC^6)$, the three-fermion system with six single particle states, under local unitary (LU) transformations, i.e., the unitary group $\Un(6)$. We also construct a minimal set of generators of the algebra of polynomial $\Un(6)$-invariants on $\bwe^3(\bC^6)$. It turns out that this algebra is isomorphic to the algebra of polynomial LU-invariants of three-qubits which are additionally invariant under qubit permutations. As a consequence of this surprising fact, we deduce that there is a one-to-one correspondence between the $\Un(6)$-orbits …
The block canonical coset decomposition is developed as a universal algorithmic tool to synthesize n-qubit quantum gates out of experimentally realizable NMR elements. The two-, three-, and four-qubit quantum Fourier transformations are worked out as examples. The proposed decomposition bridges the state of the art numerical analysis with NMR quantum gate synthesis.
Universal quantum computing relies on high-fidelity entangling operations. Here we demonstrate that four coupled qubits can operate as a quantum gate, where two qubits control the operation on two target qubits (a four-qubit gate). This configuration can implement four different controlled two-qubit gates: two different entangling swap and phase operations, a phase operation distinguishing states of different parity, and the identity operation (idle quantum gate), where the choice of gate is set by the state of the control qubits. The device exploits quantum interference to control the operati…
The structure of all completely positive quantum operations is investigated which transform pure two-qubit input states of a given degree of entanglement in a covariant way. Special cases thereof are quantum NOT operations which transform entangled pure two-qubit input states of a given degree of entanglement into orthogonal states in an optimal way. Based on our general analysis all covariant optimal two-qubit quantum NOT operations are determined. In particular, it is demonstrated that only in the case of maximally entangled input states these quantum NOT operations can be performed perfectl…
The two-qubit canonical decomposition SU(4) = [SU(2) \otimes SU(2)] Delta [SU(2) \otimes SU(2)] writes any two-qubit quantum computation as a composition of a local unitary, a relative phasing of Bell states, and a second local unitary. Using Lie theory, we generalize this to an n-qubit decomposition, the concurrence canonical decomposition (C.C.D.) SU(2^n)=KAK. The group K fixes a bilinear form related to the concurrence, and in particular any computation in K preserves the tangle |<phi^*|(-i sigma^y_1)...(-i sigma^y_n)|phi>|^2 for n even. Thus, the C.C.D. shows that any n-qubit quantum compu…
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…
A six-qubit quantum network consisting of conditional unitary gates is presented which is capable of implementing a large class of covariant two-qubit quantum operations. Optimal covariant NOT operations for one and two-qubit systems are special cases contained in this class. The design of this quantum network exploits basic algebraic properties which also shed new light onto these covariant quantum processes.
Large-scale universal quantum computing requires the implementation of quantum error correction (QEC). While the implementation of QEC has already been demonstrated for quantum memories, reliable quantum computing requires also the application of nontrivial logical gate operations to the encoded qubits. Here, we present examples of such operations by implementing, in addition to the identity operation, the NOT and the Hadamard gate to a logical qubit encoded in a five qubit system that allows correction of arbitrary single qubit errors. We perform quantum process tomography of the encoded gate…
A scheme of universal quantum computation on a chain of qubits is described that does not require local control. All the required operations, an Ising-type interaction and spatially uniform simultaneous one-qubit gates, are translation-invariant.
For n an even number of qubits and v a unitary evolution, a matrix decomposition v=k1 a k2 of the unitary group is explicitly computable and allows for study of the dynamics of the concurrence entanglement monotone. The side factors k1 and k2 of this Concurrence Canonical Decomposition (CCD) are concurrence symmetries, so the dynamics reduce to consideration of the a factor. In this work, we provide an explicit numerical algorithm computing v=k1 a k2 for n odd. Further, in the odd case we lift the monotone to a two-argument function, allowing for a theory of concurrence dynamics in odd qubits.…
We show that the entanglement of a $2\times 2$ bipartite state can be improved and maximized probabilistically through single-qubit operations only. An experiment is proposed and it is numerically simulated.
L. Lamata et al. have presented an entanglement classification of four qubits under stochastic local operation and classical communication (SLOCC) based on inductive approach [Phys. Rev. A \textbf{75}, 022318 (2007)]. While it works well for three qubits, we show that some of the families for four qubits have overlaps and hence this approach is not valid for entanglement classification of four or more qubits under SLOCC.
We present a fast quantum entangling operation on superconducting qubits assisted by a resonator in the quasi-dispersive regime with a new effect --- the selective resonance coming from the amplified qubit-state-dependent resonator transition frequency and the tunable period relation between a wanted quantum Rabi oscillation and an unwanted one. This operation does not require any kind of drive fields and the interaction between qubits. More interesting, the non-computational third excitation states of the charge qubits can play an important role in shortening largely the operation time of the…
Optimal construction of quantum operations is a fundamental problem in the realization of quantum computation. We here introduce a newly discovered quantum gate, B, that can implement any arbitrary two-qubit quantum operation with minimal number of both two- and single-qubit gates. We show this by giving an analytic circuit that implements a generic nonlocal two-qubit operation from just two applications of the B gate. We also demonstrate that for the highly scalable Josephson junction charge qubits, the B gate is also more easily and quickly generated than the CNOT gate for physically feasibl…
Unifying Qubit Routing Across Diverse Quantum ISAs via Canonical Representation
The Hong Kong University of Science and Technology（香港科技大学）；Tsinghua University（清华大学）；Pengcheng Laboratory（鹏城实验室）；The University of Edinburgh（爱丁堡大学）；Leiden University（莱顿大学）；Shenzhen Polytechnic University（深圳职业技术大学）；Fudan University（复旦大学）；Shanghai Institute for Mathematics and Interdisciplinary Sciences（上海数学与交叉学科研究院）
We obtain the most general ensemble of qubits, for which it is possible to design a universal Hadamard gate. These states when geometrically represented on the Bloch sphere, give a new trajectory. We further consider some Hadamard `type' of operations and find ensembles of states for which such transformations hold. Unequal superposition of a qubit and its orthogonal complement is also investigated.
Bipartite operations underpin both classical communication and entanglement generation. Using a superposition of classical messages, we show that the capacity of a two-qubit operation for error-free entanglement-assisted bidirectional classical communication can not exceed twice the entanglement capability. In addition we show that any bipartite two-qubit operation can increase the communication that may be performed using an ensemble by twice the entanglement capability.
In a recent paper [Phys. Rev. A 76, 032304(2007)], Li et al. proposed the definition of the residual entanglement for n qubits by means of the Stochastic local operations and classical communication. Here we argue that their definition is not suitable for the case of odd-n qubits.
In a superconducting quantum processor with nearest neighbor coupling, the dispersive interaction between adjacent qubits can result in an effective next-nearest-neighbor coupling whose strength depends on the state of the intermediary qubit. Here, we theoretically explore the possibility of engineering this next-nearest-neighbor coupling to implement controlled two-qubit operations where the intermediary qubit controls the operation on the next-nearest neighbor pair of qubits. In particular, in a system comprising two types of superconducting qubits with anharmonicities of opposite-sign arran…
Operator entanglement of two-qubit joint unitary operations is revisited. Schmidt number is an important attribute of a two-qubit unitary operation, and may have connection with the entanglement measure of the unitary operator. We found the entanglement measure of two-qubit unitary operators is classified by the Schmidt number of the unitary operators. The exact relation between the operator entanglement and the parameters of the unitary operator is clarified too.
We obtain, analytically, the global negativity, partial $K-$way negativities (K=2, 3), Wooter's tangle and three tangle for the generic three qubit canonical state. It is found that the product of global negativity and partial three way negativity is equal to three tangle, while the partial two way negativity is related to tangle of qubit pairs. We also calculate similar quantities for the state canonical to a single parameter (0<q<1) pure state which is a linear combination of a GHZ state and a W state. In this case for q=0.62685, the state has zero three tangle and zero three-way negativity,…
By constructing the recovery operations of the protocol of remote implementation of partially unknown quantum operation of two qubits [An Min Wang: PRA, \textbf{74}, 032317(2006)], we present a scheme to implement it in cavity QED. Long-lived Rydberg atoms are used as qubits, and the interaction between the atoms and the field of cavity is a nonresonant one. Finally, we analyze the experimental feasibility of this scheme.
We discuss a protected quantum computation process based on a hexagon Josephson junction array. Qubits are encoded in the punctured array, which is topologically protected. The degeneracy is related to the number of holes. The topological degeneracy is lightly shifted by tuning the flux through specific hexagons. We also show how to perform single qubit operation and basic quantum gate operations in this system.
We introduce a two-qubit engine that is powered by entangling operations and projective local quantum measurements. Energy is extracted from the detuned qubits coherently exchanging a single excitation. This engine, which uses the information and back-action of the measurement, is generalized to an N-qubit chain. We show that by gradually increasing the energy splitting along the chain, the initial low energy of the first qubit can be up-converted deterministically to an arbitrarily high energy at the last qubit by successive neighbor swap operations and local measurements. Modeling the local …
Two-qubit operations may be characterized by their capacities for communication, both with and without free entanglement, and their capacity for creating entanglement. We establish a set of inequalities that give an ordering to the capacities of two-qubit unitary operations. Specifically, we show that the capacities for entanglement creation and bidirectional communication without entanglement assistance are at least as great as half the bidirectional communication capacity with entanglement assistance. In addition, we show that the bidirectional communication that can be performed using an en…
We show a certain kind of non-local operations can be simulated by sampling a set of local operations with a quasi-probability distribution when the task of a quantum circuit is to evaluate an expectation value of observables. Utilizing the result, we describe a strategy to decompose a two-qubit gate to a sequence of single-qubit operations. Required operations are projective measurement of a qubit in Pauli basis, and $π/2$ rotation around x, y, and z axes. The required number of sampling to get an expectation value of a target observable within an error of $ε$ is roughly $O(9^k/ε^2)$, where $…
A novel approach is proposed for realizing an arbitrary-operation gate with a SQUID qubit via pulsed-microwave manipulation. In this approach, the two logical states of the qubit are represented by the two lowest levels of the SQUID and an intermediate level is utilized for the gate manipulation. The method does not involve population in the intermediate level or tunneling between the two logical qubit states during the gate operation. Morever, we show that the gate can be much faster than the conventional two-level gate. In addition, to take the advantage of geometric quantum computing, we fu…
A quantum algorithm for the calculation of $π$ is proposed and implemented on the five-qubit IBM quantum computer with superconducting qubits. We find $π=3.157\pm0.017$. The error is due to the noise of quantum one-qubit operations and measurements. The results can be used for estimating the errors of the quantum computer and suggest that the errors are purely random.
Universal quantum computation requires the implementation of arbitrary control operations on the quantum register. In most cases, this is achieved by external control fields acting selectively on each qubit to drive single-qubit operations. In combination with a drift Hamiltonian containing interactions between the qubits, this allows the implementation of any required gate operation. Here, we demonstrate an alternative scheme that does not require local control for all qubits: we implement one- and two-qubit gate operations on a set of target qubits indirectly, through a combination of gates …
In this paper we study the swap operation in a two-qubit anisotropic XXZ model in the presence of an inhomogeneous magnetic field. We establish the range of anisotropic parameter within which the swap operation is feasible. The swap errors caused by the inhomogeneous field are evaluated.
We solve the entanglement classification under stochastic local operations and classical communication (SLOCC) for all multipartite symmetric states in the general $N$-qubit case. For this purpose, we introduce 2 parameters playing a crucial role, namely the \emph{diversity degree} and the \emph{degeneracy configuration} of a symmetric state. Those parameters give rise to a simple method of identifying operational families of SLOCC entanglement classes of all symmetric $N$-qubit states, where the number of families grows as the partition function of the number of qubits.
We investigate a non-adiabatic holonomic operation that enables us to entangle two fixed-frequency superconducting transmon qubits attached to a common bus resonator. Two coherent microwave tones are applied simultaneously to the two qubits and drive transitions between the first excited resonator state and the second excited state of each qubit. The cyclic evolution within this effective 3-level $Λ$-system gives rise to a holonomic operation entangling the two qubits. Two-qubit states with 95\% fidelity, limited mainly by charge-noise of the current device, are created within $213~\rm{ns}$. T…
Here, we numerically simulate probabilistic elementary entangling operations between rail-encoded photons for the purpose of scalable universal quantum computation or communication. We propose grouping logical qubits into single-photon blocks wherein single-qubit rotations and the CNOT gate are fully deterministic and simple to implement. Inter-block communication is then allowed through said probabilistic entangling operations. We find a promising trend in the increasing probability of successful inter-block communication as we increase the number of optical modes operated on by our elementar…
We prove that the entangling capacity of a two-qubit unitary operator without local ancillas, both with and without the restriction to initial product states, as quantified by the maximum attainable concurrence, is directly related to the distinguishability of a closely related pair of two-qubit unitary operators. These operators are the original operator transformed into its canonical form and the adjoint of this canonical form. The distinguishability of these operators is quantified by the minimum overlap of the output states over all possible input probe states. The entangling capacity of t…
We consider a two-qubit unitary operation along with arbitrary local unitary operations acts on a two-qubit pure state, whose entanglement is C_0. We give the conditions that the final state can be maximally entangled and be non-entangled. When the final state can not be maximally entangled, we give the maximal entanglement C_max it can reach. When the final state can not be non-entangled, we give the minimal entanglement C_min it can reach. We think C_max and C_min represent the entanglement changing power of two-qubit unitary operations. According to this power we define an order of gates.
We propose a protocol for Alice to implement a multiqubit quantum operation from the restricted sets on distant qubits possessed by Bob, and then we investigate the communication complexity of the task in different communication scenarios. By comparing with the previous work, our protocol works without prior sharing of entanglement, and requires less communication resources than the previous protocol in the qubit-transmission scenario. Furthermore, we generalize our protocol to $d$-dimensional operations.
Universal single-qubit operations based on purely geometric phase factors in adiabatic processes are demonstrated by utilizing a four-level system in a trapped single $^{40}$Ca$^+$ ion connected by three oscillating fields. Robustness against parameter variations is studied. The scheme demonstrated here can be employed as a building block for large-scale holonomic quantum computations, which may be useful for large qubit systems with statistical variations in system parameters.
We investigate the single qubit transformations under several typical coherence-free operations, such as, incoherent operation (IO), strictly incoherent operation (SIO), physically incoherent operation (PIO), and coherence preserving operation (CPO). Quantitative connection has been built between IO and SIO in single qubit systems. Moreover, these coherence-free operations have a clear hierarchical relationship in single qubit systems: CPO $\subset$ PIO $\subset$ SIO=IO. A new and explicit proof for the necessary and sufficient condition of single qubit transformation via IO or SIO has been pr…
Engineering quantum operations is one of the main abilities we need for developing quantum technologies and designing new fundamental tests. Here we propose a scheme for realising a controlled operation acting on a travelling quantum field, whose functioning is determined by an input qubit. This study introduces new concepts and methods in the interface of continuous- and discrete-variable quantum optical systems.
High-quality-factor 3D cavities in superconducting circuits are ideal candidates for bosonic logical qubits as their fidelity is limited only by the low photon loss rate. However, the transmon qubits that are used to manipulate bosonic qubits result in the emergence of additional relaxation and dephasing channels. In this work, a numerical study is performed to elucidate the effect of the various loss channels on the performance of logical gates on a bosonic qubit. A gate error model is developed that encapsulates the loss mechanisms for arbitrary gate operations and predicts experimentally ac…
A scheme for coupling superconducting charge qubits via a one-dimensional superconducting transmission line resonator is proposed. The qubits are working at their optimal points, where they are immune to the charge noise and possess long decoherence time. Analysis on the dynamical time evolution of the interaction is presented, which is shown to be insensitive to the initial state of the resonator field. This scheme enables fast gate operation and is readily scalable to multiqubit scenario.
We present a direct algebraic decoupling approach to generate arbitrary single-qubit operations in the presence of a constant interaction by applying local control signals. To overcome the difficulty of undesirable entanglement generated by the untunable interaction, we derive local control fields that are designed to both drive the qubit systems back to unentangled states at the end of the time interval over which the desired single-qubit operation is completed. This approach is seen to be particularly relevant for the physical implementation of solid-state quantum computation and for the des…
The current work investigates the performance of dual-gate GaAs-nanowire FET as a charge-qubit device operating at room temperature. In compatibility with the state-of-the-art classical bit technology, it is shown that the single gate of a nanowire FET can be replaced by two localized gates to achieve such charge-qubit operation. On application of relevant biases to the localized gates, two voltage tunable quantum dots are created within the nanowire channel with electrostatically controlled single-state-occupancy and inter-dot coupling leading to charge-qubit operation at room temperature. Th…
We report the first simulations of the dynamics of quantum logic operations with a large number of qubits (up to 1000). A nuclear spin chain in which selective excitations of spins is provided by the gradient of the external magnetic field is considered. The spins interact with their nearest neighbors. We simulate the quantum control-not (CN) gate implementation for remote qubits which provides the long-distance entanglement. Our approach can be applied to any implementation of quantum logic gates involving a large number of qubits.
We solve the entanglement classification under stochastic local operations and classical communication (SLOCC) for general n-qubit states. For two arbitrary pure n-qubit states connected via local operations, we establish an equation between the two coefficient matrices associated with the states. The rank of the coefficient matrix is preserved under SLOCC and gives rise to a simple way of partitioning all the pure states of n qubits into different families of entanglement classes, as exemplified here. When applied to the symmetric states, this approach reveals that all the Dicke states |l,n> …
Fault-tolerant quantum computing demands many qubits with long lifetimes to conduct accurate quantum gate operations. However, external noise limits the computing time of physical qubits. Quantum error correction codes may extend such limits, but imperfect gate operations introduce errors to the correction procedure as well. The additional gate operations required due to the physical layout of qubits exacerbate the situation. Here, we use density-matrix simulations to investigate the performance change of logical qubits according to quantum error correction codes and qubit layouts and the expe…
Spin qubits are very valuable and scalable candidates in the area of quantum computation and simulation applications. In the last decades, they have been deeply investigated from a theoretical point of view and realized on the scale of few devices in the laboratories. In semiconductors, spin qubits can be built confining the spin of electrons in electrostatically defined quantum dots. Through this approach it is possible to create different implementations: single electron spin qubit, singlet-triplet spin qubit, or a three electrons architecture, e. g. the hybrid qubit. For each qubit type, we…
We provide a systematic analysis of the physical generation of single- and two-qubit quantum operations from Hamiltonians available in various quantum systems for scalable quantum information processing. We show that generation of one-qubit operations can be transformed into a steering problem on the Bloch sphere, whereas the two-qubit problem can be generally transformed into a steering problem in a tetrahedron representing all the local equivalence classes of two-qubit operations (the Weyl chamber). We use this approach to investigate several physical examples for the generation of two-qubit…
