We will present a few new generalizations of the multi-controlled X (MCX) gate that uses the quantum Fourier transform (QFT). Firstly, we will optimize QFT-MCX and prove that it is equivalent to a stair MCX gates array. This stair-wise structure will allow us to devise a method for adding an arbitrary phase factor to each qubit. The first MCX generalization into multi-controlled unitary gates (MCU) relies on replacing phase gates acting on the target qubit with controlled unitary gates. We will employ alternative single-qubit gate notation to minimize the complexities of these gates and show how to expand the circuit straightforwardly to the multi-controlled multi-target (MCMT) gate. The second generalization relies on the ZYZ-like decomposition. We will show that by extending one QFT-MCX circuit we implement the two multi-controlled X gates needed for the decomposition. Finally, we will split control wirelines into groups and use iterative ZYZ-like decomposition on QFT-MCU to obtain "deep decomposed" (DD) MCU which employs a lower number of C-NOTs than the previous two, thus making DD-MCU less prone to decoherence and noise. The supremacy of our implementations over the best-known optimized algorithm will be demonstrated by emulating noisy quantum calculations.
We propose a simple formalism to design unitary gates robust against given systematic errors. This formalism generalizes our previous observation [Y. Kondo and M. Bando, J. Phys. Soc. Jpn. 80, 054002 (2011)] that vanishing dynamical phase in some composite gates is essential to suppress amplitude errors. By employing our formalism, we naturally derive a new composite unitary gate which can be seen as a concatenation of two known composite unitary operations. The obtained unitary gate has high fidelity over a wider range of the error strengths compared to existing composite gates.
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…
Quantum states obey an asymptotic no-cloning theorem, stating that no deterministic machine can reliably replicate generic sequences of identically prepared pure states. In stark contrast, we show that generic sequences of unitary gates can be replicated deterministically at nearly quadratic rates, with an error vanishing on most inputs except for an exponentially small fraction. The result is not in contradiction with the no-cloning theorem, since the impossibility of deterministically transforming pure states into unitary gates prevents the application of the gate replication protocol to sta…
We show that the Hadamard and Unitary gates could be implemented by a unitary evolution together with a measurement for any unknown state chosen from a set $A = {{| {Ψ_i} > ,| {\bar Ψ_i} >}}({i = 1,2})$ if and only if $| {Ψ_1} > ,| {Ψ_2} > ,| {\bar Ψ_1} > ,| {\bar Ψ_2} >$ are linearly independent. We also derive the best transformation efficiencies.
An unknown unitary gates, which is secretly chosen from several known ones, can always be distinguished perfectly. In this paper, we implement such a task on IBM's quantum processor. More precisely, we experimentally demonstrate the discrimination of two qubit unitary gates, the identity gate and the $\frac{2}{3}π$-phase shift gate, using two discrimination schemes -- the parallel scheme and the sequential scheme. We program these two schemes on the \emph{ibmqx4}, a $5$-qubit superconducting quantum processor via IBM cloud, with the help of the $QSI$ modules [S. Liu et al.,~arXiv:1710.09500, 2…
We study the entangling properties of multipartite unitary gates with respect to the measure of entanglement called one-tangle. Putting special emphasis on the case of three parties, we derive an analytical expression for the entangling power of an $n$-partite gate as an explicit function of the gate, linking the entangling power of gates acting on $n$-partite Hilbert space of dimension $d_1 \ldots d_n$ to the entanglement of pure states in the Hilbert space of dimension $(d_1 \ldots d_n)^2$. Furthermore, we evaluate its mean value averaged over the unitary and orthogonal groups, analyze the m…
We introduce a twisted Heisenberg-type interaction Hamiltonian, a Heisenberg-type spin interaction where the coordinates of the second qubit are twisted according to a unitary gate. We develop parallelizable adiabatic gate teleportation (PAGT) where a sequence of unitary gates is performed in a single step of the adiabatic process. In PAGT, numeric calculations suggest the necessary time for the adiabatic evolution implementing a sequence of $L$ unitary gates increases at most as $O(L^5)$. However, we show that it has the interesting property that it can map the temporal order of gates to the …
In all the various proposals for quantum computers, a common feature is that the quantum circuits are expected to be made of cascades of unitary transformations acting on the quantum states. A framework is proposed to express these elementary quantum gates directly in terms of the control inputs entering into the continuous time forced Schrodinger equation.
Local implementation of non-local quantum gates is necessary in a distributed quantum computer. Here, we demonstrate the non-local implementation of controlled-unitary quantum gates proposed by Eisert et al. (Phys Rev A 62:052317, 2000) using the five-qubit IBM quantum computer. We verify the fidelity and accuracy of the implementation through the techniques of quantum state and process tomographies.
The controlled-not gate and the single qubit gates are considered elementary gates in quantum computing. It is natural to ask how many such elementary gates are needed to implement more elaborate gates or circuits. Recall that a controlled-U gate can be realized with two controlled-not gates and four single qubit gates. We prove that this implementation is optimal if and only if the matrix U satisfies the conditions tr U != 0, tr UX != 0, and det U != 1. We also derive optimal implementations in the non-generic cases.
We show that it is possible to reduce the number of two-qubit gates needed for the construction of an arbitrary controlled-unitary transformation by up to two times using a tunable controlled-phase gate. On the platform of linear optics, where two-qubit gates can only be achieved probabilistically, our method significantly reduces the amount of components and increases success probability of a two-qubit gate. The experimental implementation of our technique presented in this paper for a controlled single-qubit unitary gate demonstrates that only one tunable controlled-phase gate is needed inst…
Long time behavior of a unitary quantum gate $U$, acting sequentially on two subsystems of dimension $N$ each, is investigated. We derive an expression describing an arbitrary iteration of a two-qubit gate making use of a link to the dynamics of a free particle in a $3D$ billiard. Due to ergodicity of such a dynamics an average along a trajectory $V^t$ stemming from a generic two-qubit gate $V$ in the canonical form tends for a large $t$ to the average over an ensemble of random unitary gates distributed according to the flat measure in the Weyl chamber - the minimal $3D$ set containing points…
We propose a robust scheme involving atoms fixed in an optical cavity to directly implement the universal controlled-unitary gate. The present technique based on adiabatic passage uses novel dark states well suited for the controlled-rotation operation. We show that these dark states allow the robust implementation of a gate that is a generalisation of the controlled-unitary gate to the case where the control qubit can be selected to be an arbitrary state. This gate has potential applications to the rapid implementation of quantum algorithms such as of the projective measurement algorithm. Thi…
We concretely construct an extension of the controlled-U gate in qudit from some elementary gates. We also construct unitary transformation in two-qudit by means of the extended controlled-U gate and show the universality of it.
The construction of unitary operator bases in a finite-dimensional Hilbert space is reviewed through a nonstandard approach combinining angular momentum theory and representation theory of SU(2). A single formula for the bases is obtained from a polar decomposition of SU(2) and analysed in terms of cyclic groups, quadratic Fourier transforms, Hadamard matrices and generalized Gauss sums. Weyl pairs, generalized Pauli operators and their application to the unitary group and the Pauli group naturally arise in this approach.
We characterize all maximally entangling bipartite unitary operators, acting on systems $A,B$ of arbitrary finite dimensions $d_A\le d_B$, when use of ancillary systems by both parties is allowed. Several useful and interesting consequences of this characterization are discussed, including an understanding of why the entangling and disentangling capacities of a given (maximally entangling) unitary can differ and a proof that these capacities must be equal when $d_A=d_B$.
The implementation of a high-fidelity two-qubit quantum logic gate remains an outstanding challenge for isolated solid-state qubits such as Nitrogen-Vacancy (NV) centers in diamond. In this work, we show that by driving pairs of NV centers to undergo photon scattering processes that flip their qubit state simultaneously, we can achieve a unitary two-qubit gate conditioned upon a single photon detection event. Further, by exploiting quantum interference between the optical transitions of the NV centers electronic states, we realize the existence of two special drive frequencies: a `magic' point…
Unitary gates are an interesting resource for quantum communication in part because they are always invertible and are intrinsically bidirectional. This paper explores these two symmetries: time-reversal and exchange of Alice and Bob. We will present examples of unitary gates that exhibit dramatic separations between forward and backward capacities (even when the back communication is assisted by free entanglement) and between entanglement-assisted and unassisted capacities, among many others. Along the way, we will give a general time-reversal rule for relating the capacities of a unitary gat…
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 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.
A general scheme is presented to decompose a $d$-by-$d$ unitary matrix as the product of two-level unitary matrices with additional structure and prescribed determinants. In particular, the decomposition can be done by using two-level matrices in $d-1$ classes, where each class is isomorphic to the group of $2\times 2$ unitary matrices. The proposed scheme is easy to apply, and useful in treating problems with the additional structural restrictions. A Matlab program is written to implement the scheme, and the result is used to deduce the fact that every quantum gate acting on $n$-qubit registe…
We study efficient generations of random diagonal-unitary matrices, an ensemble of unitary matrices diagonal in a given basis with randomly distributed phases for their eigenvalues. Despite the simple algebraic structure, they cannot be achieved by quantum circuits composed of a few-qubit diagonal gates. We introduce diagonal-unitary $t$-designs and present two quantum circuits that implement diagonal-unitary $2$-designs with the computational basis in $N$-qubit systems. One is composed of single-qubit diagonal gates and controlled-phase gates with randomized phases, which achieves an exact di…
With improved gate calibrations reducing unitary errors, we achieve a benchmarked single-qubit gate fidelity of 99.95% with superconducting qubits in a circuit quantum electrodynamics system. We present a method for distinguishing between unitary and non-unitary errors in quantum gates by interleaving repetitions of a target gate within a randomized benchmarking sequence. The benchmarking fidelity decays quadratically with the number of interleaved gates for unitary errors but linearly for non-unitary, allowing us to separate systematic coherent errors from decoherent effects. With this protoc…
We investigate the synthesis of continuous-variable two-mode unitary gates in the setting where two modes A and B are coupled by a fixed quadratic Hamiltonian H. The gate synthesis consists of a sequence of evolutions governed by Hamiltonian H interspaced by local phase shifts applied to A and B. We concentrate on protocols that require the minimum necessary number of steps and we show how to implement the beam splitter and the two-mode squeezer in just three steps. Particular attention is paid to the Hamiltonian x_A p_B that describes the effective off-resonant interaction of light with the c…
We perform a functional expansion of the fidelity between two unitary matrices in order to find the necessary conditions for the robust implementation of a target gate. Comparison of these conditions with those obtained from the Magnus expansion and Dyson series shows that they are equivalent in first order. By exploiting techniques from robust design optimization, we account for issues of experimental feasibility by introducing an additional criterion to the search for control pulses. This search is accomplished by exploring the competition between the multiple objectives in the implementatio…
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…
Quantum Fourier gates (QFG) constitute a family of quantum gates that result from an exact combination of the quantum Fourier transform (QFT) and the SWAP gate. As a direct consequence of this, the Feynman gate is a particular case of that family, just as the Bell states are particular cases of the states that are also derived from the aforementioned family. Besides, this new tool will allow us to demonstrate that teleportation is not something that happens exclusively thanks to some level of entanglement, but that it is also possible with an incomplete form of entanglement known as rough enta…
The recently demonstrated possibility of entangling opposite values of the orbital angular momentum (OAM) of a photon with its spin enables the realization of nontrivial one-photon spinorbit four-dimensional states for quantum information purposes. Hitherto, however, an optical device able to perform arbitrary unitary transformations on such spinorbit photon states has not been proposed yet. In this work we show how to realize such a ``universal unitary gate'' device, based only on existing optical technology, and describe its operation. Besides the quantum information field, the proposed devi…
A universal quantum processor is a device that takes as input a (quantum) program, containing an encoding of an arbitrary unitary gate, and a (quantum) data register, on which the encoded gate is applied. While no perfect universal quantum processor can exist, approximate processors have been proposed in the past two decades. A fundamental open question is how the size of the smallest quantum program scales with the approximation error. Here we answer the question, by proving a bound on the size of the program and designing a concrete protocol that attains the bound in the asymptotic limit. Ou…
Any bipartite nonlocal unitary operation can be carried out by teleporting a quantum state from one party to the other, performing the unitary gate locally, and teleporting a state back again. This paper investigates unitaries which can be carried out using less prior entanglement and classical communication than are needed for teleportation. Large families of such unitaries are constructed using (projective) representations of finite groups. Among the tools employed are: a diagrammatic approach for representing entangled states, a theorem on the necessary absence of information at certain tim…
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 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…
Upon entangling a spatial binary alternative of a photon with its polarization, one can use single photons to study arbitrary 2-qubit states. Sending the photon through a Mach-Zehnder interferometer, equipped with sets of wave plates that change the polarization, amounts to performing a unitary transformation on the 2-qubit state. We show that any desired unitary gate can be realized by a judicious choice of the parameters of the set-up and discuss a number of applications. They include the diagnosis of an unknown 2-qubit state, an optical Grover search, and the realization of a thought experi…
We analyze a discrimination problem of a single-qubit unitary gate with two candidates, where the candidates are not provided with their classical description, but their quantum sample is. More precisely, there are three unitary quantum gates -- one target and one sample for each of the two candidates -- whose classical description is unknown except for their dimension. The target gate is chosen equally among the candidates. We obtain the optimal protocol that maximizes the expected success probability, assuming the Haar distribution for the candidates. This problem is originally introduced in…
Non-local properties of ensembles of quantum gates induced by the Haar measure on the unitary group are investigated. We analyze the entropy of entanglement of a unitary matrix U equal to the Shannon entropy of the vector of singular values of the reshuffled matrix. Averaging the entropy over the Haar measure on U(N^2) we find its asymptotic behaviour. For two--qubit quantum gates we derive the induced probability distribution of the interaction content and show that the relative volume of the set of perfect entanglers reads 8/3 π\approx 0.85. We establish explicit conditions under which a giv…
We consider the effects of plane-wave states scattering off finite graphs, as an approach to implementing single-qubit unitary operations within the continuous-time quantum walk framework of universal quantum computation. Four semi-infinite tails are attached at arbitrary points of a given graph, representing the input and output registers of a single qubit. For a range of momentum eigenstates, we enumerate all of the graphs with up to $n=9$ vertices for which the scattering implements a single-qubit gate. As $n$ increases, the number of new unitary operations increases exponentially, and for …
As we are approaching actual application of quantum technology, it is essential to exploit the current quantum resources in the best possible way. With this in mind, it might not be beneficial to use the usual standard gate sets, inspired from classical logic gates, when compiling quantum algorithms when other less standardized gates currently perform better. We, therefore, consider a promising native gate, which occurs naturally in superconducting circuits, known as the diamond gate. We show how the diamond gate can be decomposed into standard gates and, using single-qubit gates, can work as …
The physical limitations of quantum hardware often require nearest-neighbor qubit structures, in which two-qubit gates are required to construct nearest-neighbor quantum circuits. However, two-qubit gates are considered a major cost of quantum circuits because of their high error rate as compared with single-qubit gates. The controlled-not (CNOT) gate is the typical choice of a two-qubit gate for universal quantum circuit implementation together with the set of single-qubit gates. In this study, we construct a one-dimensional nearest-neighbor circuit of quantum Fourier transform (QFT), which i…
The processing of quantum information always has a cost in terms of physical resources such as energy or time. Determining the resource requirements is not only an indispensable step in the design of practical devices - the resources need to be actually provided - but may also yield fundamental constraints on the class of processes that are physically possible. Here we study how much energy is required to implement a desired unitary gate on a quantum system with a non-trivial energy spectrum. We derive a general lower bound on the energy requirement, extending the main result of Ref. [1] from …
By using an ancilla qubit as a mediator, two distant qubits can undergo a non-local entangling unitary operation. This is desirable for when attempting to scale up or distribute quantum computation by combining fixed static local sets of qubits with ballistic mediators. Using a model driven by measurements on the ancilla, it is possible to generate a maximally entangling CZ gate while only having access to a less entangling gate between the pair qubits and the ancilla. However this results in a stochastic process of generating control phase rotation gates where the expected time for success do…
We consider interactions as bidirectional channels. We investigate the capacities for interaction Hamiltonians and nonlocal unitary gates to generate entanglement and transmit classical information. We give analytic expressions for the entanglement generating capacity and entanglement-assisted one-way classical communication capacity of interactions, and show that these quantities are additive, so that the asymptotic capacities equal the corresponding 1-shot capacities. We give general bounds on other capacities, discuss some examples, and conclude with some open questions.
Fernando Galve \emph{et al.} $[Phys. Rev. Lett. \textbf{110}, 010501 (2013)]$ introduced discording power for a two-qubit unitary gate to evaluate its capability to produce quantum discord, and found that a $π/8$ gate has maximal discording power. This work analyzes the entangling power of a two-qubit unitary gate, which reflects its ability to generate quantum entanglement in another way. Based on the renowned Cartan decomposition of two-qubit unitary gates, we show that the magic power of the $π/8$ gate produces maximal entanglement for a general value of purities for two-qubit states.
Quantum computation is a continuously growing research area which is based on nature and resources of quantum mechanics, as superposition and entanglement. In its quantum circuits version, the use of convenient and appropriate gates is essential. But while those gates adopt convenient forms for computational algorithms, their design depends on specific quantum systems and stu? being used. These gates need manage quantum systems based on physical interactions ruled by quantum Hamiltonians. With this, gates design is restricted to properties and limitations of interactions and physical elements …
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 …
We developed a general framework for synthesizing target gates by using a finite set of basic gates, which is a crucial step in quantum compilation. When approximating a gate in SU($n$), a naive brute-force search requires a computational complexity of $O(1/\varepsilon^{(n^2 - 1)})$ to achieve an approximation with error $\varepsilon$. In contrast, by using our method, the complexity can be reduced to $O(-n^2 \log\varepsilon/\varepsilon^{((n^2 - 1)/2)})$. This method requires almost no assumptions and can be applied to a variety of gate sets, including Clifford+$T$ and Clifford+$V$. Further, w…
We show that the Randomized Benchmarking (RB) protocol is a convolution amenable to Fourier space analysis. By adopting the mathematical framework of Fourier transforms of matrix-valued functions on groups established in recent work from Gowers and Hatami [Sbornik: Mathematics 208, 1784 (2017)], we provide an alternative proof of Wallman's [Quantum 2, 47 (2018)] and Proctor's [Phys. Rev. Lett. 119, 130502 (2017)] bounds on the effect of gate-dependent noise on randomized benchmarking. We show explicitly that as long as our faulty gate-set is close to the targeted representation of the Clifford…
Non-adiabatic holonomic quantum gate in decoherence-free subspaces is of greatly practical importance due to its built-in fault tolerance, coherence stabilization virtues, and short run-time. Here we propose some compact schemes to implement two- and three-qubit controlled unitary quantum gates and Fredkin gate. For the controlled unitary quantum gates, the unitary operator acting on the target qubit is an arbitrary single-qubit gate operation. The controlled quantum gates can be directly implemented using non-adiabatic holonomy in decoherence-free subspaces and the required resource for the d…
Fourier states are multi-qubit registers that facilitate phase rotations in fault-tolerant quantum computing. We propose distillation protocols for constructing the fundamental, $n$-qubit Fourier state with error $O(2^{-n})$ at a cost of $O(n \log n)$ Toffoli gates and Clifford gates, or any arbitrary Fourier state using $O(n^2)$ gates. We analyze these protocols with methods from digital signal processing. These results suggest that phase kickback, which uses Fourier states, could be the current lowest-overhead method for generating arbitrary phase rotations.
