Problem of classification of parallel quantum channels for information transfer is studied by method of ladder operators.
Detailed compared to http://arxiv.org/abs/quant-ph/0702076 presentation of method of ladder operators is given. Examples of paired channel and qubit-qunit pair are added. Relations between eigenvalues of density matrices of composite channel and its subchannels determining presence/absence of entanglement of arbitrary mixed state of channel are obtained.
Tests of local realism vs quantum mechanics based on Bell's inequality employ two entangled qubits. We investigate the general case of two entangled quNits, i.e. quantum systems defined in an N-dimensional Hilbert space. Via a numerical linear optimization method we show that violations of local realism are stronger for two maximally entangled quNits (N=3,4,...,9), than for two qubits and that they increase with N. The two quNit measurements can be experimentally realized using entangled photons and unbiased multiport beamsplitters.
We consider a generalisation of Ekert's entanglement-based quantum cryptographic protocol where qubits are replaced by qu$N$its (i.e., N-dimensional systems). In order to study its robustness against optimal incoherent attacks, we derive the information gained by a potential eavesdropper during a cloning-based individual attack. In doing so, we generalize Cerf's formalism for cloning machines and establish the form of the most general cloning machine that respects all the symmetries of the problem. We obtain an upper bound on the error rate that guarantees the confidentiality of quNit generali…
How to find universal sets quantum gates (gates whose composition can form any othergate within a given range) is an important part of the development of quantum computation science that has been explored in the past with success. However, there has not been much development in extending this very same theory to a generalization of qubits known as quregisters or as we call them here qunits (quantum units of information analogous to qubits that use any natural number n of basis states instead of 2 as qubits do). In this paper we will first do a review of the theory behind some essential proofs …
We present a dynamic learning paradigm for "programming" a general quantum computer. A learning algorithm is used to find the control parameters for a coupled qubit system, such that the system at an initial time evolves to a state in which a given measurement corresponds to the desired operation. This can be thought of as a quantum neural network. We first apply the method to a system of two coupled superconducting quantum interference devices (SQUIDs), and demonstrate learning of both the classical gates XOR and XNOR. Training of the phase produces a gate congruent to the CNOT modulo a phase…
The decomposition of matrices associated to two-qubit and three-qubit orthogonal gates is studied, and based on the decomposition the synthesis of these gates is investigated. The optimal synthesis of general two-qubit orthogonal gate is obtained. For two-qubit unimodular orthogonal gate, it requires at most 2 CNOT gates and 6 one-qubit Ry gates. For the general three-qubit unimodular orthogonal gate, it can be synthesized by 16 CNOT gates and 36 one-qubit Ry and Rz gates in the worst case.
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 propose a method of the Bell bases decomposition to teleport an arbitrary unknown N-qubit state through a nonmaximally entangled quantum channel, and give the universal decomposition matrix of N-qubit. Using the decomposition matrix, we can easily obtain the collapsed state at the receiver site. The inverse matrix that the decomposition matrix is just the transformation matrix that the receiver can manipulate. The decomposition matrix is a function of the parameters of the quantum channel. After defining the sub-matrix of the quantum channel, we find that the decomposition matrix is a tenso…
Separability and entanglement for n-qubits systems are quantified by using Hilbert-Schmidt (HS) decompositions in which the density matrices are decomposed into various terms representing certain one qubit, two-qubits,and larger qubits measurements. The present method is more general than previous methods for bipartite systems as it can be used for quantification of entanglement for large n-qubits systems.We demonstrate the use of such method by analyzing three qubits GHZ states, and three qubits general Bell states produced by a certain multiplications of Braid operators, operating on the com…
The spectral decomposition is given for the N-qubit Bell operators with two observables per qubit. It is found that the eigenstates (when non-degenerate) are N-qubit GHZ states even for those operators that do not allow the maximal violation of the corresponding inequality. We present two applications of this analysis. In particular, we discuss the existence of pure entangled states that do not violate any Mermin-Klyshko inequality for $N\geq 3$.
In this paper, we demonstrate that higher order singular value decomposition (HOSVD) can be used to identify special states in three qubits by local unitary (LU) operations. Since the matrix unfoldings of three qubits are related to their reduced density matrices, HOSVD simultaneously diagonalizes the one-body reduced density matrices of three qubits. From the all-orthogonality conditions of HOSVD, we computed the special states of three qubits. Furthermore, we showed that it is possible to construct a polytope that encapsulates all the special states of three qubits by LU operations with HOSV…
The CANDECOMP/PARAFAC (CP) decomposition is a generalization of the spectral decomposition of matrices to higher-order tensors. In this paper we use the CP decomposition to study unitary equivalence of higher order tensors and construct several invariants of local unitary equivalence for general higher order tensors. Based on this new method, we study the coefficient tensors of $3$-qubit states and obtain a necessary and sufficient criterion for local unitary equivalence of general tripartite states in terms of the CP decomposition. We also generalize this method to obtain some invariants of l…
The Solovay-Kitaev theorem allows us to approximate any single-qubit gate to arbitrary accuracy with a finite sequence of fundamental operations from a universal set of gates. Inspired by this decomposition, we present a quantum channel simulator capable of implementing any completely positive trace-preserving map. Our realization consists of one ancillary qubit, encoded in the transverse mode of a laser beam (orbital degree of freedom), one qubit system, encoded in its polarization (spin), one spin-orbit CNOT gate and four single-qubit operations performed with prisms and polarization compone…
It is known that any two-outcome quantum measurement can be decomposed into a continuous stochastic process using a feedback loop. In this article, we characterize which of these decompositions are possible when each iteration of the feedback loop consists of a weak measurement caused by an interaction with a probe system. We restrict ourselves to the case when the probe is a qubit and the interaction Hamiltonian between the probe and system is constant. We find that even given the ability to perform arbitrary unitary pulses throughout the continuous decomposition, only generalized measurement…
Hilbert-Schmidt (HS) decompositions and Frobenius norms are used to analyze biseparability of 3-qubit systems, with particular emphasis on density matrices with maximally disordered subsystems (MDS) and on the W state mixed with white noise. The biseparable form of a MDS density matrix is obtained by using the Bell states of a 2-qubit subsystem, multiplied by density matrices of the third qubit, which include the relevant HS parameters. Using our methods a sufficient condition and explicit biseparability of the W state mixed with white noise are given. They are compared with the sufficient con…
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…
Nonlocal two-qubit quantum gates are represented by canonical decomposition or equivalently by operator-Schmidt decomposition. The former decomposition results in geometrical representation such that all the two-qubit gates form tetrahedron within which perfect entanglers form a polyhedron. On the other hand, it is known from the later decomposition that Schmidt number of nonlocal gates can be either 2 or 4. In this work, some aspects of later decomposition are investigated. It is shown that two gates differing by local operations possess same set of Schmidt coefficients. Employing geometrical…
We construct one parameter families of three qubit separable states with length ten, which is strictly greater than the whole dimension eight. These states are located on the boundary of the convex set of all separable states, but they are in the interior of the convex set of all states with positive partial transposes. They are also decomposed into the convex sum of ten pure product states in a unique way.
We use the language of semidefinite programming and duality to derive necessary and sufficient conditions for the optimal Lewenstein-Sanpera Decomposition (LSD) of 2-qubit states. We first provide a simple and natural derivation of the Wellens-Kus equations for full-rank states. Then, we obtain a set of necessary and sufficient conditions for the optimal decomposition of rank-3 states. This closes the gap between the full-rank case, where optimality conditions are given by the Wellens-Kus equations, and the rank-2 case, where the optimal decomposition is analytically known. We also give an ana…
Environmental effects on the transmission of a state result, in general, in a change in the information carried by it. To mitigate this, many techniques such as quantum error--correcting codes, decoherence--free--subspaces [Rev Mod Phys, 88(4):041001, 2016] are employed. The basic idea underlying them is to protect/recover the state. These techniques require multi-party entanglement, whose generation is a difficult task. Further, retrieval of information would require complete tomography, which inevitably requires a large number of copies. Taking this into account, in this work, a formalism ha…
Hilbert-Schmidt (HS) decompositions are employed for analyzing systems of n-qubits, and a qubit with a qudit. Negative eigenvalues, obtained by partial-transpose (PT) plus local unitary transformations (PTU) for one qubit from the whole system, are used for indicating inseparability. A sufficient criterion for full separability of the n-qubits and qubit-qudit systems is given. We use the singular value decomposition (SVD) for improving the criterion for full separability. General properties of entanglement and separability are analyzed for a system of a qubit and a qudit and n-qubits systems, …
All mixed states of two qubits can be brought into normal form by the action of SLOCC operations of the kind $ρ'=(A\otimes B)ρ(A\otimes B)^\dagger$. These normal forms can be obtained by considering a Lorentz singular value decomposition on a real parameterization of the density matrix. We show that the Lorentz singular values are variationally defined and give rise to entanglement monotones, with as a special case the concurrence. Next a necessary and sufficient criterion is conjectured for a mixed state to be convertible into another specific one with a non-zero probability. Finally the form…
Quantum algorithms may be described by sequences of unitary transformations called quantum gates and measurements applied to the quantum register of n quantum bits, qubits. A collection of quantum gates is called universal if it can be used to construct any n-qubit gate. In 1995, the universality of the set of one-qubit gates and controlled NOT gate was shown by Barenco et al. using QR decomposition of unitary matrices. Almost ten years later the decomposition was improved to include essentially fewer elementary gates. In addition, the cosine-sine matrix decomposition was applied to efficientl…
A recurrence scheme is presented to decompose an $n$-qubit unitary gate to the product of no more than $N(N-1)/2$ single qubit gates with small number of controls, where $N = 2^n$. Detailed description of the recurrence steps and formulas for the number of $k$-controlled single qubit gates in the decomposition are given. Comparison of the result to a previous scheme is presented, and future research directions are discussed.
Efficient decompositions of multi-qubit gates are essential in NISQ applications, where the number of gates or the circuit depth is limited. This paper presents efficient decompositions of CCZ and CCCZ gates, typical multi-qubit gates, under several qubit connectivities. We can construct the CCZ gate with only four CZ-depth when the qubit is square-shaped, including one auxiliary qubit. In T-shaped qubit connectivity, which has no closed loop, we can decompose the CCCZ gate with 17 CZ gates. While previous studies have shown a CCCZ gate decomposition with 14 CZ gates for the fully connected ca…
We present a decomposition technique that uses non-deterministic circuits to approximate an arbitrary single-qubit unitary to within distance $ε$ and requires significantly fewer non-Clifford gates than existing techniques. We develop "Repeat-Until-Success" (RUS) circuits and characterize unitaries that can be exactly represented as an RUS circuit. Our RUS circuits operate by conditioning on a given measurement outcome and using only a small number of non-Clifford gates and ancilla qubits. We construct an algorithm based on RUS circuits that approximates an arbitrary single-qubit $Z$-axis rota…
We derive an exact and explicit Kraus decomposition for the reduced density of a quantum system simultaneously interacting with time-dependent external fields and a chaotic environment of thermodynamic dimension. We test the accuracy of the Kraus decomposition against exact numerical results for a CNOT gate performed on two qubits of an $(N+2)$-qubit statically flawed isolated quantum computer. Here the $N$ idle qubits comprise the finite environment. We obtain very good agreement even for small $N$.
We introduce a new decomposition of the multiqubit states of the form $ρ^{\otimes N}$ and employ it to construct the optimal single qubit purification procedure. The same decomposition allows us to study optimal quantum cloning and state estimation of mixed states.
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…
Qubits, which are quantum counterparts of classical bits, are used as basic information units for quantum information processing, whereas underlying physical information carriers, e.g. (artificial) atoms or ions, admit encoding of more complex multilevel states -- qudits. Recently, significant attention is paid to the idea of using qudit encoding as a way for further scaling quantum processors. In this work, we present an efficient decomposition of the generalized Toffoli gate on the five-level quantum systems, so-called ququints, that uses ququints' space as the space of two qubits with a joi…
By considering the decomposition of a generic two qubit density matrix presented by Wootters [W. K. Wootters, Phys. Rev. Lett. {\bf 80} 2245 (1998)], the robustness of entanglement for any mixed state of two qubit systems is obtained algebraically. It is shown that the robustness of entanglement is proportional to concurrence and in Bell decomposable density matrices it is equal to the concurrence. We also give an analytic expression for two separable states which wipe out all entanglement of these states. Since thus obtained robustness is function of the norm of the vectors in the decompositi…
In the current era of Noisy Intermediate-Scale Quantum (NISQ) technology, the practical use of quantum computers remains inhibited by our inability to aptly decouple qubits from their environment to mitigate computational errors. In this work, we introduce an approach by which knowledge of a qubit's initial quantum state and the standard parameters describing its decoherence can be leveraged to mitigate the noise present during the execution of a single-qubit gate. We benchmark our protocol using cloud-based access to IBM quantum processors. On ibmq_rome, we demonstrate a reduction of the sing…
We present a method to find the decompositions of tripartite entangled pure states which are smaller than two successive Schmidt decompositions. The method becomes very simple when one of the subsystems is a qubit. In this particular case, we get a classification of states according to their decompositions. Furthermore, we also use this method to classify the entangled states that can be inter-converted through stochastic local operations and classical communication (SLOCC). More general tripartite systems are briefly discussed.
We analyze mixed multi-qubit states composed of a W class state and a product state with all qubit in |0>. We find the optimal pure state decomposition and convex roofs for higher-tangle with bipartite partition between one qubit and the rest qubits for those mixed states. The optimality of the decomposition is ensured by the Coffman-Kundu-Wootters (CKW) inequality which describes the monogamy of quantum entanglement. The generalized monogamy inequality is found to be true for W class states with arbitrary partitions between one qubit and multi-qubit.
Quantum computation is conventionally performed using quantum operations acting on two-level quantum bits, or qubits. Qubits in modern quantum computers suffer from inevitable detrimental interactions with the environment that cause errors during computation, with multi-qubit operations often being a primary limitation. Most quantum devices naturally have multiple accessible energy levels beyond the lowest two traditionally used to define a qubit. Qudits offer a larger state space to store and process quantum information, reducing complexity of quantum circuits and improving efficiency of quan…
In this work we propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count very close to the current theoretical lower bounds. In particular, it turns out that $15$ and $63$ $CNOT$ gates are sufficient to decompose a general $3$- and $4$-qubit unitary, respectively, with high numerical accuracy. Our approach is based on a sequential optimization of parameters related to the single-qubit rotation gates involved in a pre-designed quantum circuit used for the decomposition. In addition, the algorithm can be ado…
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 develop the first constructive algorithms for compiling single-qubit unitary gates into circuits over the universal $V$ basis. The $V$ basis is an alternative universal basis to the more commonly studied $\{H,T\}$ basis. We propose two classical algorithms for quantum circuit compilation: the first algorithm has expected polynomial time (in precision $\log(1/ε)$) and offers a depth/precision guarantee that improves upon state-of-the-art methods for compiling into the $\{H,T\}$ basis by factors ranging from 1.86 to $\log_2(5)$. The second algorithm is analogous to direct search and yields ci…
Explicitly separable density matrices are constructed for all separable two-qubits states based on Hilbert-Schmidt (HS) decompositions. For density matrices which include only two-qubits correlations the number of HS parameters is reduced to 3 by using local rotations, and for two-qubits states which include single qubit measurements, the number of parameters is reduced to 4 by local Lorentz transformations. For both cases we related the absolute values of the HS parameters to probabilities, and the outer products of various Pauli matrices were transformed to pure states density matrices produ…
Great advances have been achieved in studying characteristics of entanglement for fundamentals of quantum mechanics and quantum information processing. However, even for N-qubit systems, the problem of entanglement criterion has not been well solved. In this Letter, using the method of state decomposition and high order singular value decomposition (HOSVD), we propose a necessary and sufficient entanglement criterion for general N-qubit systems. As an example, we apply our method to study the multi-qubit W state with white noise. We not only obtain the separability critical point, which is tig…
In this paper we provide an explicit parameterization of arbitrary unitary transformation acting on n qubits, in terms of one and two qubit quantum gates. The construction is based on successive Cartan decompositions of the semi-simple Lie group, SU(2^n). The decomposition highlights the geometric aspects of building an arbitrary unitary transformation out of quantum gates and makes explicit the choice of pulse sequences for the implementation of arbitrary unitary transformation on $n coupled spins. Finally we make observations on the optimality of the design procedure.
We demonstrate that any pure bipartite state of two qubits may be decomposed into a superposition of a maximally entangled state and an orthogonal factorizable one. Although there are many such decompositions, the weights of the two superposed states are, remarkably, unique. We propose a measure of entanglement based on this decomposition. We also demonstrate that this measure is connected to three measures of entanglement previously set forth: maximal violation of Bell's inequality, concurrence, and two-particle visibility.
