It is known that every two-qubit unitary operation has Schmidt rank one, two or four, and the construction of three-qubit unitary gates in terms of Schmidt rank remains an open problem. We explicitly construct the gates of Schmidt rank from one to seven. It turns out that the three-qubit Toffoli and Fredkin gate respectively have Schmidt rank two and four. As an application, we implement the gates using quantum circuits of CNOT gates and local Hadamard and flip gates. In particular, the collective use of three CNOT gates can generate a three-qubit unitary gate of Schmidt rank seven in terms of the known Strassen tensor from multiplicative complexity. Our results imply the connection between the number of CNOT gates for implementing multiqubit gates and their Schmidt rank.
It is known from Schmidt decomposition that Schmidt number of nonlocal two-qubit quantum gates is 2 or 4. We identify conditions on geometrical points of a gate to have Schmidt number 2. A simple analysis reveals that Schmidt number 2 corresponds to controlled unitary gates with CNOT being the only perfect entangler. Further, it is shown that Schmidt strength and entangling power are maximum only for CNOT in the controlled unitary family.
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.
A quantum compiler is a software program for decomposing ("compiling") an arbitrary unitary matrix into a sequence of elementary operations (SEO). The author of this paper is also the author of a quantum compiler called Qubiter. Qubiter uses a matrix decomposition called the Cosine-Sine Decomposition (CSD) that is well known in the field of Computational Linear Algebra. One way of measuring the efficiency of a quantum compiler is to measure the number of CNOTs it uses to express an unstructured unitary matrix (a unitary matrix with no special symmetries). We will henceforth refer to this numbe…
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.
Implementing nonlocal unitary operators is an important and hard question in quantum computing and cryptography. We show that any bipartite nonlocal unitary operator of Schmidt rank three on the $(d_A \times d_B)$-dimensional system is locally equivalent to a controlled unitary when $d_A$ is at most three. This operator can be locally implemented assisted by a maximally entangled state of Schmidt rank $r=\min\{d_A^2,d_B\}$. We further show that stochastic-equivalent nonlocal unitary operators are indeed locally equivalent, and propose a sufficient condition on which nonlocal and controlled uni…
In the framework of ion-trap quantum computing, we develop a characterization of experimentally realistic imperfections which may affect the Cirac-Zoller implementation of the CNOT gate. The CNOT operation is performed by applying a protocol of five laser pulses of appropriate frequency and polarization. The laser-pulse protocol exploits auxiliary levels, and its imperfect implementation leads to unitary as well as non-unitary errors affecting the CNOT operation. We provide a characterization of such imperfections, which are physically realistic and have never been considered before to the bes…
We study when a non--local unitary operation acting on two $d$--level systems can probabilistically simulate another one when arbitrary local operations and classical communication are allowed. We provide necessary and sufficient conditions for the simulation to be possible. Probabilistic interconvertability is used to define an equivalence relation between gates. We show that this relation induces a finite number of classes, that we identify. In the case of two qubits, two classes of non--local operations exist. We choose the CNOT and SWAP as representatives of these classes. We show how the …
We prove that every unitary acting on any multipartite system and having operator Schmidt rank equal to 2 can be diagonalized by local unitaries. This then implies that every such multipartite unitary is locally equivalent to a controlled unitary with every party but one controlling a set of unitaries on the last party. We also prove that any bipartite unitary of Schmidt rank 2 is locally equivalent to a controlled unitary where either party can be chosen as the control, and at least one party can control with two terms, which implies that each such unitary can be implemented using local opera…
Quantum Compiling Algorithms decompose (exactly, without approximations) an arbitrary $2^\nb$ unitary matrix acting on $\nb$ qubits, into a sequence of elementary operations (SEO). There are many possible ways of decomposing a unitary matrix into a SEO, and some of these decompositions have shorter length (are more efficient) than others. Finding an optimum (shortest) decomposition is a very hard task, and is not our intention here. A less ambitious, more doable task is to find methods for optimizing small segments of a SEO. Call these methods piecewise optimizations. Piecewise optimizations i…
We prove, using a new method based on map-state duality, lower bounds on entanglement resources needed to deterministically implement a bipartite unitary using separable (SEP) operations, which include LOCC (local operations and classical communication) as a particular case. It is known that the Schmidt rank of an entangled pure state resource cannot be less than the Schmidt rank of the unitary. We prove that if these ranks are equal the resource must be uniformly (maximally) entangled: equal nonzero Schmidt coefficients. Higher rank resources can have less entanglement: we have found numerica…
We consider the CNOT quantum gate as a physical action, i.e. as unitary in time evolution of the two-qubit system. This points to the modeling of the interaction Hamiltonian of the two-qubit system which would correspond to the CNOT transformation; the analysis naturally generalizes to the Toffoli gate. Despite nonuniqueness of the model of the interaction Hamiltonian, the analysis distinguishes that the interaction Hamiltonian does not posses any global (rotational) symmetry. This forces us to conclude that the direct (non-mediated) interaction in the two-qubit system does not suffice for imp…
A quantum compiling algorithm is an algorithm for decomposing ("compiling") an arbitrary unitary matrix into a sequence of elementary operations (SEO). Suppose $U_{in}$ is an $\nb$-bit unstructured unitary matrix (a unitary matrix with no special symmetries) that we wish to compile. For $\nb>10$, expressing $U_{in}$ as a SEO requires more than a million CNOTs. This calls for a method for finding a unitary matrix that: (1)approximates $U_{in}$ well, and (2) is expressible with fewer CNOTs than $U_{in}$. The purpose of this paper is to propose one such approximation method. Various quantum compi…
We review some results on the equivalence of quantum states under local unitary transformations (LUT). In particular, the classification of two-qubit Schmidt correlated (SC) states under LUT is investigated. By presenting the standard form of quantum states under LUT, the sufficient and necessary conditions of whether two different SC states are local unitary equivalent are provided. The correlations of SC states are also discussed.
Quantum circuit model is the most popular paradigm for implementing complex quantum computation. Based on Cartan decomposition, we show that $2(N-1)$ generalized controlled-$X$ (GCX) gates, $6$ single-qubit rotations about the $y$- and $z$-axes, and $N+5$ single-partite $y$- and $z$-rotation-types which are defined in this paper are sufficient to simulate a controlled-unitary gate $\mathcal{U}_{cu(2\otimes N)}$ with $A$ controlling on $\mathbb{C}^2\otimes \mathbb{C}^N$. In the scenario of the unitary gate $\mathcal{U}_{cd(M\otimes N)}$ with $M\geq3$ that is locally equivalent to a diagonal uni…
We give analytical solutions for the time-optimal synthesis of entangling gates between indirectly coupled qubits 1 and 3 in a linear spin chain of three qubits subject to an Ising Hamiltonian interaction with equal coupling $J$ plus a local magnetic field acting on the intermediate qubit. The energy available is fixed, but we relax the standard assumption of instantaneous unitary operations acting on single qubits. The time required for performing an entangling gate which is equivalent, modulo local unitary operations, to the $\mathrm{CNOT}(1, 3)$ between the indirectly coupled qubits 1 and 3…
Constructing four six-dimensional mutually unbiased bases (MUBs) is an open problem in quantum physics and measurement. We investigate the existence of four MUBs including the identity, and a complex Hadamard matrix (CHM) of Schmidt rank three. The CHM is equivalent to a controlled unitary operation on the qubit-qutrit system via local unitary transformation $I_2\otimes V$ and $I_2\otimes W$. We show that $V$ and $W$ have no zero entry, and apply it to exclude examples as members of MUBs. We further show that the maximum of entangling power of controlled unitary operation is $\log_2 3$ ebits. …
Multi-controlled unitary gates have been a subject of interest in quantum computing since its inception, and are widely used in quantum algorithms. The current state-of-the-art approach to implementing n-qubit multi-controlled gates involves the use of a quadratic number of single-qubit and CNOT gates. However, linear solutions are possible for the case where the controlled gate is a special unitary SU(2). The most widely-used decomposition of an n-qubit multi-controlled SU(2) gate requires a circuit with a number of CNOT gates proportional to 28n. In this work, we present a new decomposition …
This paper considers the control landscape of quantum transitions in multi-qubit systems driven by unitary transformations with single-qubit interaction terms. The two-qubit case is fully analyzed to reveal the features of the landscape including the nature of the absolute maximum and minimum, the saddle points and the absence of traps. The results permit calculating the Schmidt state starting from an arbitrary two-qubit state following the local gradient flow. The analysis of multi-qubit systems is more challenging, but the generalized Schmidt states may also be located by following the local…
Unitary operations are physically implementable. We further the understanding of such operations by studying the possible forms of nonlocal unitary operators, which are bipartite or multipartite unitary operators that are not tensor product operators. They are of broad relevance in quantum information processing. We prove that any nonlocal unitary operator of Schmidt rank three on a $d_A\times d_B$ bipartite system is locally equivalent to a controlled unitary. This operator can be locally implemented assisted by a maximally entangled state of Schmidt rank $\min\{d_A^2,d_B\}$ when $d_A\le d_B$…
It is known that any bipartite unitary operator of Schmidt rank three is equivalent to a controlled unitary under local unitaries. We propose a standard form of such operators. Using the form we improve the upper bound for the entanglement cost to implement such operators under local operations and classical communications (LOCC), and provide a corresponding protocol. A part of our protocol is based on a recursive-control protocol which is helpful for implementing other unitary operators. We show that any bipartite permutation unitary of Schmidt rank three can be implemented using LOCC and two…
We perform optimal-control-theory calculations to determine the minimum number of two-qubit CNOT gates needed to perform quantum state preparation and unitary operator synthesis for few-qubit systems. By considering all possible gate configurations, we determine the maximum achievable fidelity as a function of quantum circuit size. This information allows us to identify the minimum circuit size needed for a specific target operation and enumerate the different gate configurations that allow a perfect implementation of the operation. We find that there are a large number of configurations that …
A system of unitary transformations providing two optimal copies of an arbitrary input cubit is obtained. An algorithm based on classical Boolean algebra and allowing one to find any unitary transformation realized by the quantum CNOT operators is proposed.
We study the entangling power and perfect entangler nature of (SWAP)1/m, for m>=1, and controlled unitary (CU) gates. It is shown that (SWAP)1/2 is the only perfect entangler in the family. On the other hand, a subset of CU which is locally equivalent to CNOT is identified. It is shown that the subset, which is a perfect entangler, must necessarily possess the maximum entangling power.
We introduce a scheme for realizing arbitrary controlled-unitary operations in a two qubit system. If the 2 \times 2 unitary matrix is special unitary (has unit determinant), the controlled-unitary gate operation can be realized in a single pulse operation. The pulse, in our scheme, will constitute varying one of the parameters of the system between an arbitrarily maximum and a "calculated" minimum value. This parameter will constitute the variable parameter of the system while the other parameters, which include the coupling between the two qubits, will be treated as fixed parameters. The val…
Crosstalk and several sources of operational interference are invisible when qubit or a gate is calibrated or benchmarked in isolation. These are unlocked during the execution of full quantum circuit applying entangling gates to several qubits simultaneously. Unwanted Z-Z coupling on superconducting cross-resonance CNOT gates, is a commonly occurring unitary crosstalk noise that severely limits the state fidelity. This work presents (1) method of tracing unitary errors, which exploits their sensitivity to the arrangement of CNOT gates in the circuit and (2) correction scheme that modifies orig…
Bias-preserving cat-cat CNOT gate via vacuum-conditional beam-splitter
Amazon Center for Quantum Computing（亚马逊量子计算中心）；Institute for Quantum Information and Matter, California Institute of Technology（加州理工学院量子信息与物质研究所）；Thomas J. Watson, Sr., Laboratory of Applied Physics, California Institute of Technology（加州理工学院托马斯·J·沃森Sr.应用物理实验室）；NVIDIA Corporation（英伟达公司）
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…
Hypergraph states form a family of multiparticle quantum states that generalizes cluster states and graph states. We study the action and graphical representation of nonlocal unitary transformations between hypergraph states. This leads to a generalization of local complementation and graphical rules for various gates, such as the CNOT gate and the Toffoli gate. As an application, we show that already for five qubits local Pauli operations are not sufficient to check local equivalence of hypergraph states. Furthermore, we use our rules to construct entanglement witnesses for three-uniform hype…
In this paper we propose and analyze a feasible scheme where the detection of a single scattered photon from two trapped atoms or ions performs a conditional unitary operation on two qubits. As examples we consider the preparation of all four Bell states, the reverse operation that is a Bell measurement, and a CNOT gate. We study the effect of atomic motion and multiple scattering, by evaluating Bell inequalities violations, and by calculating the CNOT gate fidelity.
In order to demonstrate non-trivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to understand how to decompose a desired quantum computation into the shortest possible sequence of one-qubit and two-qubit gates. We contribute to this effort by providing a method to construct an optimal quantum circuit for a general two-qubit gate that requires at most 3 CNOT gates and 15 elementary one-qubit gates. Moreover, if the desired two-qubit gate corresponds to a purely real unitary transformation, we provide a construction that requires at…
A self-contained approach to studying the unitary evolution of coupled qubits is introduced, capable of addressing a variety of physical systems described by exchange Hamiltonians containing Rabi terms. The method automatically determines both the Weyl chamber steering trajectory and the accompanying local rotations. Particular attention is paid to the case of anisotropic exchange with tracking controls, which is solved analytically. It is shown that, if computational subspace is well isolated, any exchange interaction can always generate high-fidelity, single-step controlled-NOT (CNOT) logic,…
We show that if a set of four mutually unbiased bases (MUBs) in $\mathbb{C}^6$ exists and contains the identity, then any other basis in the set contains at most two product states and at the same time has Schmidt rank at least three. Here both the product states and the Schmidt rank are defined over the bipartite space $\mathbb{C}^2\otimes\mathbb{C}^3$. We also investigate the connection of the Sinkhorn normal form of unitary matrices to the fact that there is at least one vector unbiased to any two orthonormal bases in any dimension.
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.
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…
In quantum computation every unitary operation can be decomposed into quantum circuits-a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-NOT (CNOT) gates. Two measures are important when judging the complexity of the circuit: the total number of CNOT gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparation of arbitrary quantum states, which can directly utilize any decomposition scheme for arbitr…
Modern applications in quantum computation and quantum communication require the precise characterization of quantum states and quantum channels. In practice, this means that one has to determine the quantum capacity of a physical system in terms of measurable quantities. Witnesses, if properly constructed, succeed in performing this task. We derive a method that is capable to compute witnesses for identifying deterministic evolutions and measurement-induced collapse processes. At the same time, applying the Choi-Jamiolkowski isomorphism, it uncovers the entanglement characteristics of biparti…
The exact number of CNOT and single qubit gates needed to implement a Quantum Algorithm in a given architecture is one of the central problems of Quantum Computation. In this work we study the importance of concise realizations of Partially defined Unitary Transformations for better circuit construction using the case study of Dicke State Preparation. The Dicke States $(\left|D^n_k \right>)$ are an important class of entangled states with uses in many branches of Quantum Information. In this regard we provide the most efficient Deterministic Dicke State Preparation Circuit in terms of CNOT and…
Efficient quantum circuits are necessary for realizing quantum algorithms on noisy intermediate-scale quantum devices. Fermionic excitations entering unitary coupled-cluster (UCC) ansätze give rise to quantum circuits containing CNOT "staircases" whose number scales exponentially with the excitation rank. Recently, Yordanov et al. [Phys. Rev. A 102, 062612 (2020); Commun. Phys. 4, 228 (2021)] constructed CNOT-efficient quantum circuits for both fermionic- (FEB) and qubit-excitation-based (QEB) singles and doubles and illustrated their usefulness in adaptive derivative-assembled pseudo-Trotteri…
In our earlier work we posited that simple quantum gates and quantum algorithms can be designed utilizing the diffraction phenomena of a photon within a multiplexed holographic element. The quantum eigenstates we use are the photon's transverse linear momentum (LM) as measured by the number of waves of tilt across the aperture. Two properties of linear optical quantum computing (LOQC) within the circuit model make this approach attractive. First, any conditional measurement can be commuted in time with any unitary quantum gate; and second, photon entanglement can be encoded as a superposition …
We propose a Lyapunov control design to achieve specific (or a family of) unitary time-evolution operators, i.e., quantum gates in the Schrödinger picture by tracking control. Two examples are presented. In the first, we illustrate how to realize the Hadamard gate in a single-qubit system, while in the second, the controlled-NOT (CNOT) gate is implemented in two-qubit systems with the Ising and Heisenberg interactions. Furthermore, we demonstrate that the control can drive the time-evolution operator into the local equivalence class of the CNOT gate and the operator keeps in this class forever…
We develop a unitary dependence theory to characterize the behaviors of quantum circuits and states in terms of how quantum gates manipulate qubits and determine their measurement probabilities. A qubit has dependence on a 1-qubit unitary gate if its measurement probabilities depend on the parameters of the gate. A 1-qubit unitary creates such a dependence onto the target qubit, and a CNOT gate copies all the dependences from the control qubit to the target qubit. The complete dependence picture of the output state details the connections qubits may have when being manipulated or measured. Com…
In the report we analyze the indicator/measure of classicality of quantum states defined as the probability to find a state with a positive Wigner function within a unitary invariant random ensemble. The indicators of classicality of three ensembles associated with the Hilbert-Schmidt, Bures and Bogoliubov-Kubo-Mori metrics on the space of quantum states of 3-level system are computed. Their dependence on a moduli parameter of the Wigner function is studied for all strata of a qutrit state space stratified in accordance with the unitary group action.
Nonlocal unitary operations can create quantum entanglement between distributed particles, and the quantification of created entanglement is a hard problem. It corresponds to the concepts of entangling and assisted entangling power when the input states are, respectively, product and arbitrary pure states. We analytically derive them for Schmidt-rank-two bipartite unitary and some complex bipartite permutation unitaries. In particular, the entangling power of permutation unitary of Schmidt rank three can take only one of two values: $\log_2 9 - 16/9$ or $\log_2 3$ ebits. The entangling power, …
Quantum Wasserstein distance between unitary operations
Beihang University（北京航空航天大学）；LMIB(Beihang University), Ministry of education（教育部数学基础与计算科学重点实验室（北京航空航天大学））；School of Mathematical Sciences, Beihang University（北京航空航天大学数学科学学院）；International Research Institute for Multidisciplinary Science, Beihang University（北京航空航天大学多学科交叉研究院）
The isoholonomic problem in a homogeneous bundle is formulated and solved exactly. The problem takes a form of a boundary value problem of a variational equation. The solution is applied to the optimal control problem in holonomic quantum computer. We provide a prescription to construct an optimal controller for an arbitrary unitary gate and apply it to a $ k $-dimensional unitary gate which operates on an $ N $-dimensional Hilbert space with $ N \geq 2k $. Our construction is applied to several important unitary gates such as the Hadamard gate, the CNOT gate, and the two-qubit discrete Fourie…
We present a scheme to store unitary operators with self-inverse generators in quantum states and a general circuit to retrieve them with definite success probability. The continuous variable of the operator is stored in a single-qubit state and the information about the kind of the operator is stored in classical states with finite dimension. The probability of successful retrieval is always 1/2 irrespective of the kind of the operator, which is proved to be maximum. In case of failure, the result can be corrected with additional quantum states. The retrieving circuit is almost as simple as t…
We show that any unitary operator on the $d_A\times d_B$ system ($d_A\ge 2$) can be decomposed into the product of at most $4d_A-5$ controlled unitary operators. The number can be reduced to $2d_A-1$ when $d_A$ is a power of two. We also prove that three controlled unitaries can implement a bipartite complex permutation operator, and discuss the connection to an analogous result on classical reversible circuits. We further show that any $n$-partite unitary on the space $\mathbb{C}^{d_1}\otimes...\otimes\mathbb{C}^{d_n}$ is the product of at most $[2\prod^{n-1}_{j=1}(2d_j-2)-1]$ controlled unit…
The inevitable existence of static internal imperfections and residual interactions in some quantum computer architectures result in internal decoherence, dissipation, and destructive unitary shifts of active algorithms. By exact numerical simulations we determine the relative importance and origin of these errors for a Josephson charge qubit quantum computer. In particular we determine that the dynamics of a CNOT gate interacting with its idle neighboring qubits via native residual coupling behaves much like a perturbed kicked top in the exponential decay regime, where fidelity decay is only …
