Optimal realizations of controlled unitary gates

IBM’s quantum computers implement gates from Clifford +T gate library. All single qubit gates are implemented, but only a subset of the possible CNOT are provided. It is well known that the functionally of the missing gates can be achieved by a sequence of gates. The sequence of gates is based on SWAP gates. Up to seven elementary gates are required to implement a SWAP gate. In this paper we show how the same effect can be achieved with fewer gates. To show the potential of the proposed transformations, an example is presented where a reduction of 44% in the gate count and a 26% reduction in the number of levels for IBM’s QX5 computer is achieved. An algorithm that is considered state of the art, is used for the comparison.

The Controlled-NOT (CNOT) quantum gate associated with single qubit gates is universal for building all quantum circuits. Although CNOTs based on trapped ions and superconducting qubits have become experimentally feasible, the deterministically functioning quantum CNOT gate with photonic qubits will lead to practical realization of quantum computers in a deterministic manner, and will therefore provide an exponential increase in processing power with lowest decoherence time. Based on a previously proposed CNOT model utilizing a quantum cloner (with a fidelity of 78 %), we present in this work our design of the Compact CNOT gate providing a fidelity of 90.31 %, and give physical realization constraints for building CNOT based decomposition of the Toffoli gate and more generalized photonic CnNOT gates. The photonic qubits are encoded by circularly polarized single photons and the design of the gate is based on copying the polarization degree of freedom by quantum cloners. Our model is based on spin of electron in a quantum dot embedded in a double sided optical microcavity which behaves like a beam splitter. Circularly polarizing beam splitters, beam splitters, delay lines, photonic circulators, single qubit operations and other photonic devices are used for the design and decomposition. We show that the fidelity of the decomposed CnNOT gates is highly dependent on the errors of the non-perfect photonic devices used and more specifically to the theoretical optimal limit of 5/6 of the quantum cloners required for each CNOT in the decomposition.

There are various gate sets that can be used to describe a quantum computation. A particularly popular gate set in the literature on quantum computing consists of arbitrary single-qubit gates and two-qubit CNOT gates. A CNOT gate is however not always the natural multi-qubit interaction that can be implemented on a given physical quantum computer, necessitating a compilation step that transforms these CNOT gates to the native gate set. An especially interesting case where compilation is necessary is for ion trap quantum computers, where the natural entangling operation can act on more than two qubits and can even act globally on all qubits at once. This calls for an entirely different approach to constructing efficient circuits. In this paper we study the problem of converting a given circuit that uses two-qubit gates to one that uses global gates. Our three main contributions are as follows. First, we find an efficient algorithm for transforming an arbitrary circuit consisting of Clifford gates and arbitrary phase gates into a circuit consisting of single-qubit gates and a number of global interactions proportional to the number of non-Clifford phases present in the original circuit. Second, we find a general strategy to transform a global gate that targets all qubits into one that targets only a subset of the qubits. This approach scales linearly with the number of qubits that are not targeted, in contrast to the exponential scaling reported in (Maslov and Nam 2018 New J. Phys. 20 033018). Third, we improve on the number of global gates required to synthesise an arbitrary n-qubit Clifford circuit from the 12n − 18 reported in (Maslov and Nam 2018 New J. Phys. 20 033018) to 6n − 8.

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 Cartan’s 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 optimal choice of single-qubit mitigation gates. The second approach applies a numerical optimisation algorithm to re-compile a target unitary into the error-parasitic two-qubit gate plus single-qubit gates. We demonstrate these approaches on the CPhase-parasitic iSWAP-like gates. The KAK-based approach helps decrease unitary infidelity by a factor of 3 compared to the noisy implementation without error mitigation. When arbitrary single-qubit rotations are allowed, recompilation could completely mitigate the effect of parasitic errors but may require more native gates than the KAK-based approach. We also compare their average gate fidelity under realistic noise models, including relaxation and depolarising errors. Numerical results suggest that different approaches are advantageous in different error regimes, providing error mitigation guidance for near-term quantum computers.

In order to delineate which minimalistic physical primitives can enable the full power of universal quantum computing, it has been fruitful to consider various measurement based architectures which reduce or eliminate the use of coherent unitary evolution, and also involve operations that are physically natural. In this context previous works had shown that the triplet-singlet measurement of two qubit angular momentum (or equivalently two qubit exchange symmetry) yields the power of quantum computation given access to a few additional different single qubit states or gates. However, Freedman, Hastings and Shokrian-Zini1 recently proposed a remarkable conjecture, called the 'STP=BQP' conjecture, which states that the two-qubit singlet/triplet measurement is quantum computationally universal given only an initial ensemble of maximally mixed single qubits. In this work we prove this conjecture. This provides a method for quantum computing that is fully rotationally symmetric (i.e. reference frame independent), using primitives that are physically very-accessible, naturally resilient to certain forms of error, and provably the simplest possible.

We show how to implement an arbitrary two-qubit unitary operation using any of several quantum gate libraries with small a priori upper bounds on gate counts. In analogy to library-less logic synthesis, we consider circuits and gates in terms of the underlying model of quantum computation, and do not assume any particular technology. As increasing the number of qubits can be prohibitively expensive, we assume throughout that no extra qubits are available for temporary storage. Using quantum circuit identities, we improve an earlier lower bound of 17 elementary gates by Bullock and Markov to 18, and their upper bound of 23 elementary gates to 18. We also improve upon the generic circuit with six CNOT gates by Zhang et al. (our circuit uses three), and that by Vidal and Dawson with 11 basic gates (we use 10). We study the performance of our synthesis procedures on two-qubit operators that are useful in quantum algorithms and communication protocols. With additional work, we find small circuits and improve upon previously known circuits in some cases.

We show how the quantum Zeno effect can be exploited to control quantum many-body dynamics for quantum information and computation purposes. In particular, we consider a one dimensional array of three level systems interacting via a nearest-neighbour interaction. By encoding the qubit on two levels and using simple projective frequent measurements yielding the quantum Zeno effect, we demonstrate how to implement a well defined quantum register, quantum state transfer on demand, universal two-qubit gates and two-qubit parity measurements. Thus, we argue that the main ingredients for universal quantum computation can be achieved in a spin chain with an {\em always-on} and {\em constant} many-body Hamiltonian. We also show some possible modifications of the initially assumed dynamics in order to create maximally entangled qubit pairs and single qubit gates.

Quantum computing has attracted much attention in recent decades, since it is believed to solve certain problems substantially faster than traditional computing methods. Theoretically, such an advance can be obtained by networks of the quantum operators in universal gate sets, one famous example of which is formed by quantum Control‐not gate and single qubit gates. However, realizing a device that performs practical quantum computing is tricky. This is because it requires a scalable qubit system with long coherence time and good controls, which is harsh for most current platforms. Here, it is demonstrated that the information process based on a relatively stable system—classical optical system, can be considered as an analogy of universal quantum computing. By encoding the information via the polarization state of classical beams, the optical computing elements that correspond to the universal gate set are presented and their combination for a general information process is theoretically illustrated. Taking the analogy of two‐qubit processor as an example, it is experimentally verified that the proposal works well. Considering the potential of optical system for reliable and low‐energy‐consuming computation, the results open a new way toward advanced information processing with high quality and efficiency.

We propose a nonadiabatic non-Abelian geometric quantum operation scheme to realize universal quantum computation with mesoscopic Rydberg atoms. A single control atom entangles a mesoscopic ensemble of target atoms through long-range interactions between Rydberg states. We demonstrate theoretically that both the single qubit and two-qubit quantum gates can achieve high fidelities around or above 99.9% in ideal situations. Besides, to address the experimental issue of Rabi frequency fluctuation (Rabi error) in Rydberg atom and ensemble, we apply the dynamical-invariant-based zero systematic-error sensitivity (ZSS) optimal control theory to the proposed scheme. Our numerical simulations show that the average fidelity could be 99.98% for single ensemble qubit gate and 99.94% for two-qubit gate even when the Rabi frequency of the gate laser acquires 10% fluctuations. We also find that the optimized scheme can also reduce errors caused by higher-order perturbation terms in deriving the Hamiltonian of the ensemble atoms. To address the experimental issue of decoherence error between the ground state and Rydberg levels in Rydberg ensemble, we introduce a dispersive coupling regime between Rydberg and ground levels, based on which the Rydberg state is adiabatically discarded. The numerical simulation demonstrate that the quantum gate is enhanced. By combining strong Rydberg atom interactions, nonadiabatic geometric quantum computation, dynamical invariant and optimal control theory together, our scheme shows a new route to construct fast and robust quantum gates with mesoscopic atomic ensembles. Our study contributes to the ongoing effort in developing quantum information processing with Rydberg atoms trapped in optical lattices or tweezer arrays.

Improving gate performance is vital for scalable quantum computing. Universal quantum computing also requires gate fidelity to reach a high level. For a superconducting quantum processor, which operates in the microwave band, the single-qubit gates are usually realized with microwave driving. The crosstalk between microwave pulses is a non-negligible error source. In this article, we propose an error mitigation scheme to address this crosstalk issue for single-qubit gates. There are three steps in our method. First, by controlling the detuning between qubits, the microwave induced classical crosstalk error can be constrained within the computational subspace. Second, by applying the general decomposition procedure, the arbitrary single-qubit gate can be decomposed as a sequence of X and virtual Z gates. Finally, by optimizing the parameters in virtual Z gates, the error constrained in the computational space can be corrected. Using our method, no additional compensation signals are needed, arbitrary single-qubit gate time will not be prolonged, and the circuit depth containing simultaneous single-qubit gates will also not increase. The simulation results show that, in a specific regime of qubit–qubit detuning, the infidelities of simultaneous single-qubit gates can be as low as that without microwave crosstalk.

Estimating the eigenstate properties of quantum systems is a long-standing, challenging problem for both classical and quantum computing. Existing universal quantum algorithms typically rely on ideal and efficient query models (e.g., time evolution operator or block encoding of the Hamiltonian), which, however, become suboptimal for actual implementation at the quantum circuit level. Here, we present a full-stack design of quantum algorithms for estimating the eigenenergy and eigenstate properties, which can achieve high precision and good scaling with system size. The gate complexity per circuit for estimating generic Hamiltonians’ eigenstate properties is , which has a logarithmic dependence on the inverse precision ε. For lattice Hamiltonians, the circuit depth of our design achieves near-optimal system-size scaling, even with local qubit connectivity. Our full-stack algorithm has low overhead in circuit compilation, which thus results in a small actual gate count (cnot and non-Clifford gates) for lattice and molecular problems compared to advanced eigenstate algorithms. The algorithm is implemented on IBM quantum devices using up to 2000 two-qubit gates and 20,000 single-qubit gates and achieves high-precision eigenenergy estimation for Heisenberg-type Hamiltonians, demonstrating its noise robustness.

We propose a different scheme to realize holonomic quantum computation with rf superconducting quantum interference device (SQUID) qubits in a microwave cavity. In this scheme associated with the non-Abelian holonomies, the single-qubit gates and a two-qubit controlled-PHASE gate as well as a controlled-NOT gate can be easily constructed by tuning adiabatically the Rabi frequencies of classical microwave pulses coupled to the SQUIDs. The fidelity of these gates is estimated to be possibly higher than 90% with the current technology. © 2005 The American Physical Society.

Anyons can be used to realize quantum computation, because they are two-level systems in two dimensions. In this paper, we propose a scheme to simulate single-qubit gates and CNOT gate using Abelian anyons in the Kitaev model. Two pairs of anyons (six spins) are used to realize single-qubit gates, while ten spins are needed for the CNOT gate. Based on these quantum gates, we show how to realize the Grover algorithm in a two-qubit system.

We demonstrate how gradient ascent pulse engineering optimal control methods can be implemented on donor electron spin qubits in Si semiconductors with an architecture complementary to the original Kane's proposal. We focus on the high-fidelity controlled-NOT (CNOT) gate and explicitly find its digitized control sequences by optimizing its fidelity over the external controls of the hyperfine A and exchange J interactions. This high-fidelity CNOT gate has an error of about $10^{-6}$, below the error threshold required for fault-tolerant quantum computation, and its operation time of 100ns is about 3 times faster than 297ns of the proposed global control scheme. It also relaxes significantly the stringent distance constraint of two neighboring donor atoms of 10~20nm as reported in the original Kane's proposal to about 30nm in which surface A and J gates may be built with current fabrication technology. The effects of the control voltage fluctuations, the dipole-dipole interaction and the electron spin decoherence on the CNOT gate fidelity are also discussed.

We propose a scheme for quantum computing using high-Q cavities in which the qubits are represented by single cavity modes restricted in the space spanned by the two lowest Fock states. We show that single qubit operations and universal multiple qubit gates can be implemented using atoms sequentially crossing the cavities.