Recently there has been interest in the idea of quantum computing without control of the physical interactions between component qubits. This is highly appealing since the 'switching' of such interactions is a principal difficulty in creating real devices. It has been established that one can employ 'always on' interactions in a one-dimensional Heisenberg chain, provided that one can tune the Zeeman energies of the individual (pseudo-)spins. It is important to generalize this scheme to higher dimensional networks, since a real device would probably be of that kind. Such generalisations have been proposed, but only at the severe cost that the efficiency of qubit storage must *fall*. Here we propose the use of multi-qubit gates within such higher-dimensional arrays, finding a novel three-qubit gate that can in fact increase the efficiency beyond the linear model. Thus we are able to propose higher dimensional networks that can constitute a better embodiment of the 'always on' concept - a substantial step toward bringing this novel concept to full fruition.
In two-qubit gate simulations an entangling gate is used several times together with single qubit gates to simulate another two-qubit gate. We show how a two-qubit gate's simulation power is related to the simulation power of its mirror gate. And we show that an arbitrary two-qubit gate can be simulated by three applications of a super controlled gate together with single qubit gates. We also give the gates set that can be simulated by n applications of a controlled gate in a constructive way. In addition we give some gates which can be used four times to simulate an arbitrary two-qubit gate.
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.
Near-term quantum computers are limited by the decoherence of qubits to only being able to run low-depth quantum circuits with acceptable fidelity. This severely restricts what quantum algorithms can be compiled and implemented on such devices. One way to overcome these limitations is to expand the available gate set from single- and two-qubit gates to multi-qubit gates, which entangle three or more qubits in a single step. Here, we show that such multi-qubit gates can be realized by the simultaneous application of multiple two-qubit gates to a group of qubits where at least one qubit is invol…
In this work we investigate that whether one can construct single and two qubit gates for arbitrary quantum states from the principle of no signalling. We considered the problem for Pauli gates, Hadamard gate, C-Not gate.
In this paper, we propose a scheme to realize three-qubit controlled phase gate and multiqubit controlled-NOT gate of one qubit simultaneously controlling n target qubit with four level quantum system in a cavity. Adjustment of level spacing during the gates implementation is not required. Implementation time for multiqubit controlled NOT gate is independent of number of qubit. Three-qubit phase gate is generalized to n-qubit phase gate with multiple control qubit and the number of steps (complexity) reduces linearly as compare to conventional gate decomposition method. Our scheme can be appli…
In this paper, we study the optimal simulation of three-qubit unitary by using two-qubit gates. First, we give a lower bound on the two-qubit gates cost of simulating a multi-qubit gate. Secondly, we completely characterize the two-qubit gate cost of simulating a three-qubit controlled controlled gate by generalizing our result on the cost of Toffoli gate. The function of controlled controlled gate is simply a three-qubit controlled unitary gate and can be intuitively explained as follows: the gate will output the states of the two control qubit directly, and apply the given one-qubit unitary …
We propose how to realize a three-step controlled-phase gate of one superconducting qubit simultaneously controlling n qubits selected from N qubits in a cavity (1<n<N). The operation time of this gate is independent of the number n of qubits involved in the gate operation. This phase gate controlling at once n qubits is insensitive to the initial state of the cavity mode and can be used to produce an analogous CNOT gate simultaneously acting on n qubits.
We propose how to realize a three-step controlled-phase gate of one qubit simultaneously controlling $n$ qubits in a cavity or coupled to a resonator. The $n$ two-qubit controlled-phase gates, forming this multiqubit phase gate, can be performed simultaneously. The operation time of this phase gate is independent of the number $n$ of qubits. This phase gate controlling at once $n$ qubits is insensitive to the initial state of the cavity mode and can be used to produce an analogous CNOT gate simultaneously acting on $n$ qubits. We present two alternative approaches to implement this gate. One a…
We present improved circuits for the control-control-phase (Toffoli) gate and the control-swap (Fredkin) gate using three and four global two-qubit gates, respectively. This is a nearly double speed-up compared to the conventional circuits, which require five (for Toffoli) and seven (for Fredkin) conditional two-qubit gates. We apply the same approach to construct the conditional four-qubit phase gate by seven global two-qubit gates. We also present construction of the Toffoli and the Fredkin gates with five nearest-neighbour interactions. Our constructions do not employ ancilla qubits or anci…
Quantum algorithms often benefit from the ability to execute multi-qubit (>2) gates. To date such multi-qubit gates are typically decomposed into single- and two-qubit gates, particularly in superconducting qubit architectures. The ability to perform multi-qubit operations in a single step could vastly improve the fidelity and execution time of many algorithms. Here, we propose a single shot method for executing an i-Toffoli gate, a three-qubit gate gate with two control and one target qubit, using currently existing superconducting hardware. We show numerical evidence for a process fidelity o…
We demonstrate that in a coupled two-qubit system any single-qubit gate can be decomposed into two conditional two-qubit gates and that any conditional two-qubit gate can be implemented by a manipulation analogous to that used for a controlled two-qubit gate. Based on this we present a unified approach to implement universal single-qubit and two-qubit gates in a coupled two-qubit system with fixed always-on coupling. This approach requires neither supplementary circuit or additional physical qubits to control the coupling nor extra hardware to adjust the energy level structure. The feasibility…
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.
In this paper, we settle the long-standing open problem of the minimum cost of two-qubit gates for simulating a Toffoli gate. More precisely, we show that five two-qubit gates are necessary. Before our work, it is known that five gates are sufficient and only numerical evidences have been gathered, indicating that the five-gate implementation is necessary. The idea introduced here can also be used to solve the problem of optimal simulation of three-qubit control phase introduced by Deutsch in 1989.
In some quantum computing (QC) architectures, entanglement of an arbitrary number of qubits can be generated in a single operation. This property has many potential applications, and may specifically be useful for quantum error correction (QEC). Stabilizer measurements can then be implemented using a single multi-qubit gate instead of several two-qubit gates, thus reducing circuit depth. In this study, the toric code is used as a benchmark to compare the performance of two-qubit and five-qubit gates within parity-check circuits. We consider trapped ion qubits that are controlled via Raman tran…
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.
Uniformly controlled one-qubit gates are quantum gates which can be represented as direct sums of two-dimensional unitary operators acting on a single qubit. We present a quantum gate array which implements any n-qubit gate of this type using at most 2^{n-1} - 1 controlled-NOT gates, 2^{n-1} one-qubit gates and a single diagonal n-qubit gate. The circuit is based on the so-called quantum multiplexor, for which we provide a modified construction. We illustrate the versatility of these gates by applying them to the decomposition of a general n-qubit gate and a local state preparation procedure. …
Two-qubit gates are important components of quantum computing. However, unwanted interactions between qubits (so-called parasitic gates) can be particularly problematic and degrade the performance of quantum applications. In this work, we present two software methods to mitigate parasitic two-qubit gate errors. The first approach is built upon the KAK decomposition and keeps the original unitary decomposition for the error-free native two-qubit gate. It counteracts a parasitic two-qubit gate by only applying single-qubit rotations and therefore has no two-qubit gate overhead. We show the optim…
We construct a minimal robust controlled-NOT gate with an Ising-type interaction by which elementary two-qubit gates are implemented. It is robust against inaccuracy of the coupling strength and the obtained quantum circuits are constructed with the minimal number (N=3) of elementary two-qubit gates and several one-qubit gates. It is noteworthy that all the robust circuits can be mapped to one-qubit circuits robust against a pulse length error. We also prove that a minimal robust SWAP gate cannot be constructed with N=3, but requires N=6 elementary two-qubit gates.
In this Letter, we present two analytic expressions that most generally simulate $n$-qubit controlled-$U$ gates with standard one-qubit gates and CNOT gates using exponential and polynomial complexity respectively. Explicit circuits and general expressions of decomposition are derived. The exact numbers of basic operations in these two schemes are given using gate counting technique.
Recent investigations show that conservation laws limit the accuracy of gate operations in quantum computing. The inevitable error under the angular momentum conservation law has been evaluated so far for the CNOT, Hadamard, and NOT gates for spin 1/2 qubits, while the SWAP gate has no constraint. Here, we extend the above results to general single-qubit gates. We obtain an upper bound of the gate fidelity of arbitrary single-qubit gates implemented under arbitrary conservation laws, determined by the geometry of the conservation law and the gate operation on the Bloch sphere as well as the si…
The Heisenberg exchange interaction is a natural method to implement non-local (i.e., multi-qubit) quantum gates in quantum information processing. We consider quantum circuits comprising of $(SWAP)^α$ gates, which are realized through the exchange interaction, and single-qubit gates. A universal two-qubit quantum circuit is constructed from only three $(SWAP)^α$ gates and six single-qubit gates. We further show that three $(SWAP)^α$ gates are not only sufficient, but necessary. Since six single-qubit gates are known to be necessary, our universal two-qubit circuit is optimal in terms of the n…
High-quality two-qubit gate operations are crucial for scalable quantum information processing. Often, the gate fidelity is compromised when the system becomes more integrated. Therefore, a low-error-rate, easy-to-scale two-qubit gate scheme is highly desirable. Here, we experimentally demonstrate a new two-qubit gate scheme that exploits fixed-frequency qubits and a tunable coupler in a superconducting quantum circuit. The scheme requires less control lines, reduces crosstalk effect, simplifies calibration procedures, yet produces a controlled-Z gate in 30ns with a high fidelity of 99.5%, der…
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…
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…
The number of two-qubit gates required to transform deterministically a three-qubit pure quantum state into another is discussed. We show that any state can be prepared from a product state using at most three CNOT gates, and that, starting from the GHZ state, only two suffice. As a consequence, any three-qubit state can be transformed into any other using at most four CNOT gates. Generalizations to other two-qubit gates are also discussed.
Universal quantum computation requires the implementation of arbitrary control operations on the quantum register. In most cases, this is achieved by external control fields acting selectively on each qubit to drive single-qubit operations. In combination with a drift Hamiltonian containing interactions between the qubits, this allows the implementation of any required gate operation. Here, we demonstrate an alternative scheme that does not require local control for all qubits: we implement one- and two-qubit gate operations on a set of target qubits indirectly, through a combination of gates …
High-quality-factor 3D cavities in superconducting circuits are ideal candidates for bosonic logical qubits as their fidelity is limited only by the low photon loss rate. However, the transmon qubits that are used to manipulate bosonic qubits result in the emergence of additional relaxation and dephasing channels. In this work, a numerical study is performed to elucidate the effect of the various loss channels on the performance of logical gates on a bosonic qubit. A gate error model is developed that encapsulates the loss mechanisms for arbitrary gate operations and predicts experimentally ac…
We propose how to realize a multiqubit tunable phase gate of one qubit simultaneously controlling $n$ qubits with four-level quantum systems in a cavity or coupled to a resonator. Each of the $n$ two-qubit controlled-phase (CP) gates involved in this multiqubit phase gate has a shared control qubit but a {\it different} target qubit. In this propose, the two lowest levels of each system represent the two logical states of a qubit while the two higher-energy intermediate levels are used for the gate implementation. The method presented here operates essentially by creating a single photon throu…
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…
Optimal implementation of quantum gates is crucial for designing a quantum computer. The necessary condition for optimal construction of a two-qubit unitary operation is obtained. It can be proved that the B gate is the unique gate that can construct a two-qubit universal circuit with only two applications, i.e. this condition is also sufficient in the case of two applications of the elementary two-qubit gate. It is also shown that one half of perfect entanglers can not simulate an arbitrary two-qubit gate with only 3 applications.
Quantum protocols based on adiabatic evolution are remarkably robust against imperfections of control pulses and system uncertainties. While adiabatic protocols have been successfully implemented for quantum operations such as quantum state transfer and single-qubit gates, their use for geometric two-qubit gates remains a challenge. In this paper, we propose a general scheme to realize robust geometric two-qubit gates in multi-level qubit systems where the interaction between the qubits is mediated by an auxiliary system (such as a bus or coupler). While our scheme utilizes Stimulated Raman Ad…
Qubitization is a modern approach to estimate Hamiltonian eigenvalues without simulating its time evolution. While in this way approximation errors are avoided, its resource and gate requirements are more extensive: qubitization requires additional qubits to store information about the Hamiltonian, and Toffoli gates to probe them throughout the routine. Recently, it was shown that storing the Hamiltonian in a unary representation can alleviate the need for such gates in one of the qubitization subroutines. Building on that principle, we develop an entirely new decomposition of the entire algor…
We present a universal set of quantum gate operations based on exchange-only spin qubits in a double quantum dot, where each qubit is obtained by three electrons in the (2,1) filling. Gate operations are addressed by modulating electrostatically the tunneling barrier and the energy offset between the two dots, singly and doubly occupied respectively. We propose explicit gate sequences of single qubit operations for Hadamard gate and $π$/8 gate, and the two-qubit controlled NOT (CNOT) gate, to complete the universal set. The unswitchable interaction between the two electrons of the doubly occup…
We study the class of two qubit gates which can be achieved using only linear optical elements (beam splitters and phase shifters) and post-selection. We are able to exactly characterize this set, and find that it is impossible to implement most two qubit gates in this way. The proof also gives rise to an algorithm for calculating the optimal success probability of those gates which are achievable.
We study the computation power of lattices composed of two dimensional systems (qubits) on which translationally invariant global two-qubit gates can be performed. We show that if a specific set of 6 global two qubit gates can be performed, and if the initial state of the lattice can be suitably chosen, then a quantum computer can be efficiently simulated
As the size and complexity of a quantum computer increases, quantum bit (qubit) characterization and gate optimization become complex and time-consuming tasks. Current calibration techniques require complicated and verbose measurements to tune up qubits and gates, which cannot easily expand to the large-scale quantum systems. We develop a concise and automatic calibration protocol to characterize qubits and optimize gates using QubiC, which is an open source FPGA (field-programmable gate array) based control and measurement system for superconducting quantum information processors. We propose …
We demonstrate fast two-qubit gates using a parity-violated superconducting qubit consisting of a capacitively-shunted asymmetric Josephson-junction loop under a finite magnetic flux bias. The second-order nonlinearity manifesting in the qubit enables the interaction with a neighboring single-junction transmon qubit via first-order inter-qubit sideband transitions with Rabi frequencies up to 30~MHz. Simultaneously, the unwanted static longitudinal~(ZZ) interaction is eliminated with ac Stark shifts induced by a continuous microwave drive near-resonant to the sideband transitions. The average f…
Producing and maintaining entanglement reside at the heart of the optimal construction of quan- tum operations and are fundamental issues in the realization of universal quantum computation. We here introduce a setup of spin qubits that allows for geometric implementation of entangling gates between the register qubits with any arbitrary entangling power. We show this by demon- strating a circuit through a spin chain, which performs universal nonadiabatic holonomic two-qubit entanglers. The proposed gates are all electric and geometric, which would help to realize fast and robust entangling ga…
Quantum computers based on silicon are promising candidates for long term universal quantum computation due to the long coherence times of electron and nuclear spin states. Furthermore, the continuous progress of micro- and nano- electronics, also related to the scaling of Metal-Oxide-Semiconductor (MOS) systems, makes possible to control the displacement of single dopants thus suggesting their exploitation as qubit holders. Flip-flop qubit is a donor based qubit (DQ) where interactions between qubits are achievable for distance up to several hundred nanometers. In this work, a linear array of…
The prospect of computational hardware with quantum advantage relies critically on the quality of quantum gate operations. Imperfect two-qubit gates is a major bottleneck for achieving scalable quantum information processors. Here, we propose a generalizable and extensible scheme for a two-qubit coupler switch that controls the qubit-qubit coupling by modulating the coupler frequency. Two-qubit gate operations can be implemented by operating the coupler in the dispersive regime, which is non-invasive to the qubit states. We investigate the performance of the scheme by simulating a universal tw…
We show that with the assistance of a third level of the qubits an n-qubit phase gate can be constructed from $2n-4$ two-qutrit conditional swap gates, a single qutrit-qubit controlled phase gate, and two single-qutrit operations. Unlike previous schemes, our scheme uses the auxiliary level to "expose" some state to the qutrit-qubit controlled phase gate, instead of using it to "hide" states from the conditional dynamics. Neither the number of the additional levels nor that of single-qutrit operations needs to increase with $n$. We propose a physical implementation of the required elementary g…
We propose a scalable way to construct a 3D cluster state for fault-tolerant topological one-way computation (TOWC) even if the entangling two-qubit gates succeed with a small probability. It is shown that fault-tolerant TOWC can be performed with the success probability of the two-qubit gate such as 0.5 (0.1) provided that the conditional error probability of the two-qubit gate is less than 0.040% (0.016%). Furthermore, the resource usage is considerably suppressed compared to the conventional fault-tolerant schemes with probabilistic two-qubit gates.
High-fidelity single- and two-qubit gates are essential building blocks for a fault-tolerant quantum computer. While there has been much progress in suppressing single-qubit gate errors in superconducting qubit systems, two-qubit gates still suffer from error rates that are orders of magnitude higher. One limiting factor is the residual ZZ-interaction, which originates from a coupling between computational states and higher-energy states. While this interaction is usually viewed as a nuisance, here we experimentally demonstrate that it can be exploited to produce a universal set of fast single…
We introduce a simple, widely applicable formalism for designing "error-divisible" two qubit gates: a quantum gate set where fractional rotations have proportionally reduced error compared to the full entangling gate. In current noisy intermediate-scale quantum (NISQ) algorithms, performance is largely constrained by error proliferation at high circuit depths, of which two-qubit gate error is generally the dominant contribution. Further, in many hardware implementations, arbitrary two qubit rotations must be composed from multiple two-qubit stock gates, further increasing error. This work intr…
We propose a resonator-assisted entangling gate for spin qubits with high fidelity. Each spin qubit corresponds to two electrons in a nanowire double quantum dot, with the singlet and one of the triplets as the logical qubit states. The gate is effected by virtual charge dipole transitions. We include noise in our model to show feasibility of the scheme under current experimental conditions.
We present a simple method for constructing optimal fault-tolerant approximations of arbitrary unitary gates using an arbitrary discrete universal gate set. The method presented is numerical and scales exponentially with the number of gates used in the approximation. However, for the specific case of arbitrary single-qubit gates and the fault-tolerant gates permitted by the concatenated 7-qubit Steane code, we find gate sequences sufficiently long and accurate to permit the fault-tolerant factoring of numbers thousands of bits long. A general scaling law of how rapidly these fault-tolerant app…
Single-qubit operations on singlet-triplet qubits in GaAs double quantum dots have not yet reached the fidelities required for fault-tolerant quantum information processing. Considering experimentally important constraints and using measured noise spectra, we numerically minimize the effect of decoherence (including high-frequency 1/f-like noise) and show theoretically that quantum gates with fidelities higher than 99.9% are achievable. We also present a self-consistent tuning protocol which should allow the elimination of individual systematic gate errors directly in an experiment.
