We study the feasibility of implementing a quantum NOT gate (approximate) when the quantum state lies between two latitudes on the Bloch's sphere and present an analytical formula for the optimized 1-to-$M$ quantum NOT gate. Our result generalizes previous results concerning quantum NOT gate for a quantum state distributed uniformly on the whole Bloch sphere as well as the phase covariant quantum state. We have also shown that such 1-to-$M$ optimized NOT gate can be implemented using a sequential generation scheme via matrix product states (MPS).
The parameter-shift rule is an approach to measuring gradients of quantum circuits with respect to their parameters, which does not require ancilla qubits or controlled operations. Here, I discuss applying this approach to a wider range of parameterize quantum gates by decomposing gates into a product of standard gates, each of which is parameter-shift rule differentiable.
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 …
We give a quantum gate construction - composed entirely from incidents of the CNOT gate - that generalises the qubit SWAP gate to higher dimensions. This new construction is more regular than and is an improvement on the WilNOT quantum gate construction.
CALA-$n$: A Quantum Library for Realizing Cost-Effective 2-, 3-, 4-, and 5-bit Gates on IBM Quantum Computers using Bloch Sphere Approach, Clifford+T Gates, and Layouts
We show how to construct quantum gate arrays that can be programmed to perform different unitary operations on a data register, depending on the input to some program register. It is shown that a universal quantum gate array - a gate array which can be programmed to perform any unitary operation - exists only if one allows the gate array to operate in a probabilistic fashion. The universal quantum gate array we construct requires an exponentially smaller number of gates than a classical universal gate array.
We offer an alternative to the conventional network formulation of quantum computing. We advance the analog approach to quantum logic gate/circuit construction. As an illustration, we consider the spatially extended NOT gate as the first step in the development of this approach. We derive an explicit form of the interaction Hamiltonian corresponding to this gate and analyze its properties. We also discuss general extensions to the case of certain time-dependent interactions which may be useful for practical realization of quantum logic gates.
While quantum information processing by nuclear magnetic resonance (NMR) with small number of qubits is well established, implementation of lengthy computations have proved to be difficult due to decoherence/relaxation. In such circumstances, shallow circuits (circuits using parallel computation) may prove to be realistic. Parity and fanout gates are essential to create shallow circuits. In this article we implement inversion-on-equality gate, followed by parity gate and fanout gate in 3-qubit systems by NMR, using evolution under indirect exchange coupling Hamiltonian.
We describe a method for achieving arbitrary 1-qubit gates and controlled-NOT gates within the context of the Single Cooper Pair Box (SCB) approach to quantum computing. Such gates are sufficient to support universal quantum computation. Quantum gate operations are achieved by applying sequences of voltages and magnetic fluxes to single qubits or pairs of qubits. Neither the temporal duration, nor the starting time, of a gate operation is used as a control parameter. As a result, the quantum gates have a constant and known duration, and depend upon standard control parameter sequences regardle…
We propose three core ideas: 1. the wave-particle duality of the qudit quantum space; 2. the classification of all elementary quantum gates by ordered pairs of qudit functionals; 3. a new type of quantum gates called the "quantum wave gates". We first study the quantum functionals whose relation to the quantum states is analogous to that between the momentum and position wavefunctions in fundamental quantum physics: a Fourier transform and an entropic uncertainty principle can be defined between the dual representations. The quantum functionals are not just mathematical constructs but have cle…
A historical review is given of the emergence of the idea of the quantum logic gate from the theory of reversible Boolean gates. I highlight the quantum XOR or controlled NOT as the fundamental two-bit gate for quantum computation. This gate plays a central role in networks for quantum error correction.
We construct a quantum gate entangler based on selective phase rotation transform. In particular, we established a relation between quantum integral transform and quantum gates entangler in terms of universal controlled gates for multi-qubit states. Our construction is also related to the geometrical structure of multipartite quantum systems.
This is a brief overview of quantum holonomies in the context of quantum computation. We choose an adequate set of quantum logic gates, namely, a phase gate, the Hadamard gate, and a conditional-phase gate and show how they can be implemented by purely geometric means. Such gates may be more resilient to certain types of errors.
Quantum process tomography of each directly implementable quantum gate used in the IBM quantum processors is performed to compute gate error in order to check viability of complex quantum operations in the superconductivity-based quantum computers introduced by IBM and to compare the quality of these gates with the corresponding gates implemented using other technologies. Quantum process tomography (QPT) of C-NOT gates have been performed for three configurations available in IBM QX4 processor. For all the other allowed gates QPT have been performed for every allowed position (i.e., by placing…
Ying conceived of using two or more small-capacity quantum computers to produce a larger-capacity quantum computing system by quantum parallel programming ([M. S. Ying, Morgan-Kaufmann, 2016]). In doing so, the main obstacle is separating the quantum gates in the whole circuit to produce a tensor product of the local gates. It has been showed that there are few separable multipartite quantum gates, so the approximate separation problem involves finding local quantum gates that approximate a given inseparable gate. We propose and study a problem involving the approximate separation of multipart…
We demonstrate a probabilistic entangling quantum gate between two distant trapped ytterbium ions. The gate is implemented between the hyperfine "clock" state atomic qubits and mediated by the interference of two emitted photons carrying frequency encoded qubits. Heralded by the coincidence detection of these two photons, the gate has an average fidelity of 90+-2%. This entangling gate together with single qubit operations is sufficient to generate large entangled cluster states for scalable quantum computing.
It is well-known that any quantum gate can be decomposed into the universal gate set {T, H, CNOT}, and recent results have shown that each of these gates can be implemented using a dynamic quantum walk, which is a continuous-time quantum walk on a sequence of graphs. This procedure for converting a quantum gate into a dynamic quantum walk, however, can result in long sequences of graphs. To alleviate this, in this paper, we develop a length-3 dynamic quantum walk that implements any single-qubit gate. Furthermore, we extend this result to give length-3 dynamic quantum walks that implement any …
We propose to design multispin quantum gates in which the input and output two-state systems (spins) are not necessarily identical. We describe the motivations for such studies and then derive an explicit general two-spin interaction Hamiltonian which accomplishes the quantum XOR gate function for a system of three spins: two input and one output.
Teleportation of quantum gates is a critical step for implementation of quantum networking and teleportation-based models of quantum computation. We report an experimental demonstration of teleportation of the prototypical quantum controlled-NOT (CNOT) gate. Assisted with linear optical manipulations, photon entanglement produced from parametric down conversion, and coincidence measurements, we teleport the quantum CNOT gate from acting on local qubits to acting on remote qubits. The quality of the quantum gate teleportation is characterized through the method of quantum process tomography, wi…
The SWAP gate plays a central role in network designs for qubit quantum computation. However, there is a view to generalize qubit quantum computing to higher dimensional quantum systems. In this paper we construct a generalized SWAP gate using only instances of the generalized controlled-NOT gate to cyclically permute the states of $d$ qudits for $d$ prime.
We show how to fully characterize a quantum process in an open quantum system. We particularize the procedure to the case of a universal two-qubit gate in a quantum computer. We illustrate the method with a numerical simulation of a quantum gate in the ion trap quantum computer.
We propose a method to achieve scalable quantum computation based on fast quantum gates on an array of trapped ions, without the requirement of ion shuttling. Conditional quantum gates are obtained for any neighboring ions through spin-dependent acceleration of the ions from periodic photon kicks. The gates are shown to be robust to influence of all the other ions in the array and insensitive to the ions' temperature.
We analyze analytically and numerically quantum logic gates in a one-dimensional spin chain with Heisenberg interaction. Analytic solutions for basic one-qubit gates and swap gate are obtained for a quantum computer based on logical qubits. We calculated the errors caused by imperfect pulses which implement the quantum logic gates. It is numerically demonstrated that the probability error is proportional to $ε^4$, while the phase error is proportional to $ε$, where $ε$ is the characteristic deviation from the perfect pulse duration.
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 analyze a scheme for quantum computation where quantum gates can be continuously changed from standard dynamic gates to purely geometric ones. These gates are enacted by controlling a set of parameters that are subject to unwanted stochastic fluctuations. This kind of noise results in a departure from the ideal case that can be quantified by a gate fidelity. We find that the maximum of this fidelity corresponds to quantum gates with a vanishing dynamical phase.
One of the biggest challenges for implementing quantum devices is the requirement to perform accurate quantum gates. The destructive effects of interactions with the environment present some of the most difficult obstacles that must be overcome for precise quantum control. In this work we implement a proof of principle experiment of quantum gates protected against a fluctuating environment using dynamical decoupling techniques. We show that decoherence can be reduced during the application of quantum gates. High fidelity quantum gates can be achieved even if the gate time exceeds the decoheren…
We prove that a generic three-qubit quantum logic gate can be implemented using at most 98 one-qubit rotations about the $y$- and $z$-axes and 40 CNOT gates, beating an earlier bound of 64 CNOT gates.
We analyse the design and optimisation of quantum logic circuits suitable for the experimental demonstration of a three-qubit quantum computation prototype based on optically-controlled, solid-state quantum logic gates. In these gates, the interaction between two qubits carried by the electron-spin of donors is mediated by the optical excitation of a control particle placed in their proximity. First, we use a geometrical approach for analysing the entangling characteristics of these quantum gates. Then, using a genetic programming algorithm, we develop circuits for the refined Deutsch-Jozsa al…
We present an n-bit Toffoli gate quantum circuit based on the realization proposed by Barenco, where some of the Toffoli gates in their construction are replaced with Peres gates. This results in a significant cost reduction. Our main contribution is a quantum circuit which simulates the (m+1)-bit Toffoli gate with 32m-96 elementary quantum gates and one garbage bit which is passed unchanged. This paper is a corrected and expanded version of our recent journal publication.
A generalization of the quantum XOR-gate is presented which operates in arbitrary dimensional Hilbert spaces. Together with one-particle Fourier transforms this gate is capable of performing a variety of tasks which are important for quantum information processing in arbitrary dimensional Hilbert spaces. Among these tasks are the preparation of Bell states, quantum teleportation and quantum state purification. A physical realization of this generalized XOR-gate is proposed which is based on non-linear optical elements.
To employ a quantum device, the performance of the quantum gates in the device needs to be evaluated first. Since the dimensionality of a quantum gate grows exponentially with the number of qubits, evaluating the performance of a quantum gate is a challenging task. Recently, a scheme called quantum gate verification (QGV) has been proposed, which can verifies quantum gates with near-optimal efficiency. In this paper, we implement a proof-of-principle optical experiment to demonstrate this QGV scheme. We show that for a single-qubit quantum gate, only $\sim300$ samples are needed to confirm the…
Quantum interrogation can be used as a basic resource for quantum information. This paper presents its applications to entanglement creation and to optical quantum computation. The starting point will be a photon to particle quantum interrogation CZ gate, from which three families of optical CNOT gates will be derived. These gates are nondestructive and can work with probabilities arbitrarily close to 1. A possible experimental implementation with atomic ensembles is also discussed.
The physical implementation of the quantum Control-Not gate for a two-spin system is investigated numerically. The concept of a generalized quantum Control-Not gate, with arbitrary phase shift, is introduced. It is shown that a resonant $π$-pulse provides a simple example of a generalized quantum Control-Not gate.
Constructing a set of universal quantum gates is a fundamental task for quantum computation. The existence of noises, disturbances and fluctuations is unavoidable during the process of implementing quantum gates for most practical quantum systems. This paper employs a sampling-based learning method to find robust control pulses for generating a set of universal quantum gates. Numerical results show that the learned robust control fields are insensitive to disturbances, uncertainties and fluctuations during the process of realizing universal quantum gates.
The most general structure (in matrix form) of a single-qubit gate is presented. Subsequently, used that to obtain a set of conditions for testing (a) whether a given 2-qubit gate is genuinely a 2-qubit gate, i.e., not decomposable into two single qubit gates and (b) whether a given single qubit gate is self-inverse? Relevance of the results reported here is discussed in the context of optimization of reversible and quantum circuits, especially for the optimization of quantum cost. A systematic procedure is developed for the identification of the non-decomposable 2-qubit gates. Such a non-deco…
Quantum logic operations can be implemented using nonlinear phase shifts (the Kerr effect) or the quantum Zeno effect based on strong two-photon absorption. Both approaches utilize three-level atoms, where the upper level is tuned on resonance for the Zeno gates and off-resonance for the nonlinear phase gates. The performance of nonlinear phase gates and Zeno gates are compared under conditions where the parameters of the resonant cavities and three-level atoms are the same in both cases. It is found that the expected performance is comparable for the two approaches, despite the apparent diffe…
We propose a scheme to implement quantum controlled SWAP gates by directing single-photon pulses to a two-sided cavity with a single trapped atom. The resultant gates can be used to realize quantum fingerprinting and universal photonic quantum computation. The performance of the scheme is characterized under realistic experimental noise with the requirements well within the reach of the current technology.
Quantum teleportation is a powerful protocol with applications in several schemes of quantum communication, quantum cryptography and quantum computing. The present work shows the required conditions for a two-qubit quantum gate to be deterministically and probabilistically teleported by a quantum gate teleportation scheme using different basis of measurement. Additionally, we present examples of teleportation of two-qubit gates that do not belong to Clifford group as well the limitations of the quantum gate teleportation scheme employing a four-qubit state with genuine four-way entanglement.
I describe the use of techniques based on composite rotations to combat systematic errors in controlled phase gates, which form the basis of two qubit quantum logic gates. Although developed and described within the context of Nuclear Magnetic Resonanace (NMR) quantum computing these sequences should be applicable to any implementation of quantum computation based on Ising couplings. In combination with existing single qubit gates this provides a universal set of robust quantum logic gates.
In this paper, elementary quantum gate operations, such as the phase gate, the controlled-NOT gate, the swap and the Fredkin gate are constructed using joint measurement and pairs of entangled qubit pairs. The relation between the state of the entangled pair and the joint measurement basis is discussed. Some other generalization is also discussed.
A universal set of quantum gates is constructed for the recently developed jump-error correcting quantum codes. These quantum codes are capable of correcting errors arising from the spontaneous decay of distinguishable qubits into statistically independent reservoirs. The proposed universal quantum gates are constructed with the help of Heisenberg- and Ising-type Hamiltonians acting on these physical qubits. This way it is guaranteed that the relevant error correcting code space is not left at any time even during the application of one of these quantum gates. The proposed entanglement gate is…
This is an exposition of some basic mathematical aspects of quantum logic gates. At first we established some general formulas for the case of arbitrary quantum gate A with unique restriction A^2=I. The explicit form of the generators and roots of matrix A have been found . Then we apply general results to the particular cases of one-qubit and multi-qubit quantum gates. Some interesting properties of square roots of basic Pauli and Hadamard gates are demonstrated.
Constructing compact quantum circuits for universal quantum gates on solid-state systems is crucial for quantum computing. We present some compact quantum circuits for a deterministic solid-state quantum computing, including the CNOT, Toffoli, and Fredkin gates on the diamond nitrogen-vacancy centers confined inside cavities, achieved by some input-output processes of a single photon. Our quantum circuits for these universal quantum gates are simple and economic. Moreover, additional electron qubits are not employed, but only a single-photon medium. These gates have a long coherent time. We di…
In this article the elementary gates for ternary quantum logic circuit are studied. We propose the ternary controlled X (TCX) gate or ternary controlled Z (TCZ) gate as two-qutrit elementary gate, which is universal when assisted by arbitrary one-qutrit gates. It is primitive, efficient and easy to implement. Based on Cartan decomposition, we also give the one-qutrit elementary gates. Then the synthesis of some important ternary gates is investigated and the scheme of physical implementation for these ternary gates is discussed. Finally we extend these elementary gates to more general qudit ca…
We present a full quantum treatment of a five-level atomic system coupled to two quantum and two classical light fields. The two quantum fields undergo a cross-phase modulation induced by electro-magnetically induced transparency. The performance of this configuration as a two-qubit quantum phase gate for travelling single-photons is examined. A trade-off between the size of the conditional phase shift and the fidelity of the gate is found. Nonetheless, a satisfactory gate performance is still found to be possible in the transient regime, corresponding to a fast gate operation.
We study the minimum time to implement an arbitrary two-qubit gate in two heteronuclear spins systems. We give a systematic characterization of two-qubit gates based on the invariants of local equivalence. The quantum gates are classified into four classes, and for each class the analytical formula of the minimum time to implement the quantum gates is explicitly presented. For given quantum gates, by calculating the corresponding invariants one easily obtains the classes to which the quantum gates belong. In particular, we analyze the effect of global phases on the minimum time to implement th…
We provide several schemes to construct the continuous-variable SWAP gate and present a Hermitian generalized many-body continuous controlled^n-NOT gate. We introduce and study the hybrid controlled-NOT gate and controlled-SWAP gate, and physical realizations of them are discussed in trapped-ion systems. These continuous-variable and hybrid quantum gates may be used in the corresponding continuous-variable and hybrid quantum computations.
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…
We propose a scheme to implement quantum controlled NOT gate and quantum phase gate in an optomechanical system based on phonon blockade. For appropriate choices of system parameters, fidelities of both the quantum gate operations are very close to unity in the absence of dissipation. Using recently achieved experimental values in a mechanical resonator coupled to a microwave cavity, we show that the quantum gate can be realized experimentally with very high fidelity.
The gate version of quantum computation exploits several quantum key resources as superposition and entanglement to reach an outstanding performance. In the way, this theory was constructed adopting certain supposed processes imitating classical computer gates. As for optical as well as magnetic systems, those gates are obtained as quantum evolutions. Despite, in certain cases they are attained as an asymptotic series of evolution effects. The current work exploits the direct sum of the evolution operator on a non-local basis for the driven bipartite Heisenberg-Ising model to construct a set o…
We construct a Universal Quantum Entanglement Concentration Gate (QEC-Gate). Special times operations of QEC-Gate can transform a pure 2-level bipartite entangled state to nearly maximum entanglement. The transformation can attain any required fidelity with optimal probability by adjusting concentration step. We also generate QEC-Gate to the Schmidt decomposable multi-partite system.
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.
