CNOT Research Articles

Quantum Circuit Transformation: A Monte Carlo Tree Search Framework

In the noisy intermediate-scale quantum era, quantum processing units suffer from, among others, highly limited connectivity between physical qubits. To make a quantum circuit effectively executable, a circuit transformation process is necessary to transform it, with overhead cost the smaller the better, into a functionally equivalent one so that the connectivity constraints imposed by the quantum processing unit are satisfied. Although several algorithms have been proposed for this goal, the overhead costs are often very high, which degenerates the fidelity of the obtained circuits sharply. One major reason for this lies in that, due to the high branching factor and vast search space, almost all of these algorithms only search very shallowly, and thus, very often, only (at most) locally optimal solutions can be reached. In this article, we propose a Monte Carlo Tree Search (MCTS) framework to tackle the circuit transformation problem, which enables the search process to go much deeper. The general framework supports implementations aiming to reduce either the size or depth of the output circuit through introducing SWAP or remote CNOT gates. The algorithms, called MCTS-Size and MCTS-Depth , are polynomial in all relevant parameters. Empirical results on extensive realistic circuits and IBM Q Tokyo show that the MCTS-based algorithms can reduce the size (respectively, depth) overhead by, on average, 66% (respectively, 84%) when compared with t \( \left| {\mathrm{ket}} \right\rangle \) , an industrial-level compiler.

DFT with Universal Test Set for All Missing Gate Faults in Reversible Circuits

The design of reversible logic circuits has received considerable attention in recent times for their potential use in implementing quantum computers. A fault model, namely, the Missing-Gate Fault (MGF) model, has been found to be more suitable for modeling defects in quantum circuits as compared to the classical fault models used for testing conventional CMOS circuits. In this paper, we propose two design-for-testability techniques with universal test set to detect MGFs in a reversible circuit. In these techniques, an [Formula: see text] reversible circuit implemented with [Formula: see text]-CNOT gates is transformed to a testable design with addition of two extra inputs lines and some additional gates, which uses a universal test set of size [Formula: see text] to detect the MGFs. The proposed DFT techniques are compared with earlier works and it has been shown that these techniques outperform the earlier techniques with respect to quantum cost overhead and percentage detection of the different MGFs.

Single-step implementation of a hybrid controlled-not gate with one superconducting qubit simultaneously controlling multiple target cat-state qubits

Hybrid quantum gates have recently drawn considerable attention. They play significant roles in connecting quantum information processors with qubits of different encoding and have important applications in the transmission of quantum states between a quantum processor and a quantum memory. In this work, we propose a single-step implementation of a multi-target-qubit controlled-NOT gate with one superconducting (SC) qubit simultaneously controlling $n$ target cat-state qubits. In this proposal, the gate is implemented with $n$ microwave cavities coupled to a three-level SC qutrit. The two logic states of the control SC qubit are represented by the two lowest levels of the qutrit, while the two logic states of each target cat-state qubit are represented by two quasi-orthogonal cat states of a microwave cavity. This proposal operates essentially through the dispersive coupling of each cavity with the qutrit. The gate realization is quite simple because it requires only a single-step operation. There is no need of applying a classical pulse or performing a measurement. The gate operation time is independent of the number of target qubits, thus it does not increase as the number of target qubits increases. Moreover, because the third higher energy level of the qutrit is not occupied during the gate operation, decoherence from the qutrit is greatly suppressed. As an application of this hybrid multi-target-qubit gate, we further discuss the generation of a hybrid Greenberger-Horne-Zeilinger (GHZ) entangled state of SC qubits and cat-state qubits. As an example, we numerically analyze the experimental feasibility of generating a hybrid GHZ state of one SC qubit and three cat-state qubits within present circuit QED technology.

Universal quantum circuits for quantum chemistry

Universal gate sets for quantum computing have been known for decades, yet no universal gate set has been proposed for particle-conserving unitaries, which are the operations of interest in quantum chemistry. In this work, we show that controlled single-excitation gates in the form of Givens rotations are universal for particle-conserving unitaries. Single-excitation gates describe an arbitrary U(2) rotation on the two-qubit subspace spanned by the states |01⟩,|10⟩, while leaving other states unchanged – a transformation that is analogous to a single-qubit rotation on a dual-rail qubit. The proof is constructive, so our result also provides an explicit method for compiling arbitrary particle-conserving unitaries. Additionally, we describe a method for using controlled single-excitation gates to prepare an arbitrary state of a fixed number of particles. We derive analytical gradient formulas for Givens rotations as well as decompositions into single-qubit and CNOT gates. Our results offer a unifying framework for quantum computational chemistry where every algorithm is a unique recipe built from the same universal ingredients: Givens rotations.

Quantum teleportation between the narrow armchair graphene nanoribbons with zigzag ends

We study quantum teleportation between the narrow armchair graphene nanoribbons (GNRs) with zigzag ends. Several influences including Coulomb repulsion among electrons, temperature and ribbon length on the output state and teleportation fidelity are discussed in detail. Moreover, we derive the entanglement of the output state and corresponding fidelity as a function of the input and channel entanglement. For practical applications, we also propose a scheme for implementing the single-qubit gates (X, Z and H gates) and two-qubit controlled-NOT gate in GNRs, based on the Bang-Bang control strategy and synchronous step magnetic field.

A quantum steganography scheme using quantum wavelet transforms

Quantum steganography is a technology which can hide information effectively for achieving copyright protection. In this paper, a quantum steganography scheme using quantum wavelet transform and the novel enhanced quantum representation for quantum image is proposed, and this scheme can embed the secret text of size [Formula: see text] into a [Formula: see text] gray-scale carrier image. In the scrambling operation, the text is scrambled by the scrambling circuit including bit-reverse, quantum equal and CNOT gate to improve its security. Before embedding, the carrier image is first transformed by 1-level quantum Haar wavelet transform, and then its low-frequency part is divided into blocks. The simulation results suggest that the proposed scheme has good performance in visual quality and robustness. Finally, through the analysis of circuit complexity, the scheme has low complexity O(n).

The Classification of Clifford Gates over Qubits

We examine the following problem: given a collection of Clifford gates, describe the set of unitaries generated by circuits composed of those gates. Specifically, we allow the standard circuit operations of composition and tensor product, as well as ancillary workspace qubits as long as they start and end in states uncorrelated with the input, which rule out common "magic state injection" techniques that make Clifford circuits universal. We show that there are exactly 57 classes of Clifford unitaries and present a full classification characterizing the gate sets which generate them. This is the first attempt at a quantum extension of the classification of reversible classical gates introduced by Aaronson et al., another part of an ambitious program to classify all quantum gate sets. The classification uses, at its center, a reinterpretation of the tableau representation of Clifford gates to give circuit decompositions, from which elementary generators can easily be extracted. The 57 different classes are generated in this way, 30 of which arise from the single-qubit subgroups of the Clifford group. At a high level, the remaining classes are arranged according to the bases they preserve. For instance, the CNOT gate preserves the X and Z bases because it maps X-basis elements to X-basis elements and Z-basis elements to Z-basis elements. The remaining classes are characterized by more subtle tableau invariants; for instance, the T_4 and phase gate generate a proper subclass of Z-preserving gates.

Demonstration of fault-tolerant universal quantum gate operations.

Quantum computers can be protected from noise by encoding the logical quantum information redundantly into multiple qubits using error-correcting codes1,2. When manipulating the logical quantum states, it is imperative that errors caused by imperfect operations do not spread uncontrollably through the quantum register. This requires that all operations on the quantum register obey a fault-tolerant circuit design3-5, which, in general, increases the complexity of the implementation. Here we demonstrate a fault-tolerant universal set of gates on two logical qubits in a trapped-ion quantum computer. In particular, we make use of the recently introduced paradigm of flag fault tolerance, where the absence or presence of dangerous errors is heralded by the use of auxiliary flag qubits6-10. We perform a logical two-qubit controlled-NOT gate between two instances of the seven-qubit colour code11,12, and fault-tolerantly prepare a logical magic state8,13. We then realize a fault-tolerant logical T gate by injecting the magic state by teleportation from one logical qubit onto the other14. We observe the hallmark feature of fault tolerance-a superior performance compared with a non-fault-tolerant implementation. In combination with recently demonstrated repeated quantum error-correction cycles15,16, these results provide a route towards error-corrected universal quantum computation.

Quantum-Logic Gate between Two Optical Photons with an Average Efficiency above 40%

Optical qubits uniquely combine information transfer in optical fibers with a good processing capability and are therefore attractive tools for quantum technologies. A large challenge, however, is to overcome the low efficiency of two-qubit logic gates. The experimentally achieved efficiency in an optical controlled not (cnot) gate reached approximately 11% in 2003 and has seen no increase since. Here, we report on a new platform that was designed to surpass this long-standing record. The new scheme avoids inherently probabilistic protocols and, instead, combines aspects of two established quantum nonlinear systems: atom-cavity systems and Rydberg electromagnetically induced transparency. We demonstrate a cnot gate between two optical photons with an average efficiency of 41.7(5)% at a postselected process fidelity of 81(2)%. Moreover, we extend the scheme to a cnot gate with multiple target qubits and produce entangled states of presently up to five photons. All these achievements are promising and have the potential to advance optical quantum information processing in which almost all advanced protocols would profit from high-efficiency logic gates.1 MoreReceived 8 December 2021Accepted 20 April 2022DOI:https://doi.org/10.1103/PhysRevX.12.021035Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article’s title, journal citation, and DOI. Open access publication funded by the Max Planck Society.Published by the American Physical SocietyPhysics Subject Headings (PhySH)Research AreasElectromagnetically induced transparencyQuantum gatesQuantum information with atoms & lightPhysical SystemsRydberg atoms & moleculesAtomic, Molecular & OpticalQuantum Information

Speed limits for two-qubit gates with weakly anharmonic qubits

We consider the implementation of two-qubit gates when the physical systems used to realize the qubits possess additional quantum states in the accessible energy range. We use optimal control theory to determine the maximum achievable gate speed for two-qubit gates in the qubit subspace of the many-level Hilbert space, and we analyze the effect of the additional quantum states on the gate speed. We identify two competing mechanisms. On one hand, higher energy levels are generally more strongly coupled to each other. Under suitable conditions, this stronger coupling can be utilized to make two-qubit gates significantly faster than the reference value based on simple qubits. On the other hand, a weak anharmonicity constrains the speed at which the system can be adequately controlled: according to the intuitive picture, faster operations require stronger control fields, which are more likely to excite higher levels in a weakly anharmonic system, which in turn leads to faster decoherence and uncontrolled leakage outside the qubit space. In order to account for this constraint, we modify the pulse optimization algorithm to avoid pulses that lead to appreciable population of the higher levels. In this case we find that the presence of the higher levels can lead to a significant reduction in the maximum achievable gate speed. We also compare the optimal-control gate speeds with those obtained using the cross-resonance/selective-darkening gate protocol. We find that the latter, with some parameter optimization, can be used to achieve a relatively fast implementation of the CNOT gate. These results can help the search for optimized gate implementations in realistic quantum computing architectures, such as those based on superconducting circuits. They also provide guidelines for desirable conditions on anharmonicity that allow optimal utilization of the higher levels to achieve fast quantum gates.

About the possibility for using graphene layers 12 C–13 C for quantum computation

We used a graphene 12 C matrix doped with 13 C atoms in a squared and center-triangular configuration, where only the interaction 13 C–13 C with their magnetic moments are considered. This is done in the presence of a constant magnetic field parallel to the layers and a transverse rf-magnetic field in order to simulate the NOT gate (single layer), controlled-not quantum gate (two layers), and controlled-controlled-not quantum gate (three layers). However, as it would be explained in more detail throughout this article, a single qubit rotation defined by a single graphene layer was not possible to construct. We found that frequencies needed to perform this transitions do not depend on the number of 13 C atoms on each layer, which means that we can make transitions between two distant states with big separation of energy levels (m and n states) with lower frequency pulses .

Deterministic one-way logic gates on a cloud quantum computer

One-way quantum computing is a promising candidate for fault-tolerant quantum computing. Here, we propose new protocols to realize a deterministic one-way CNOT gate and one-way $X$-rotations on quantum-computing platforms. By applying a delayed-choice scheme, we overcome a limit of most currently available quantum computers, which are unable to implement further operations on measured qubits or operations conditioned on measurement results from other qubits. Moreover, we decrease the error rate of the one-way logic gates, compared to the original protocol using local operations and classical communication (LOCC). In addition, we apply our deterministic one-way CNOT gate in the Deutsch-Jozsa algorithm to show the feasibility of our proposal. We demonstrate all these one-way gates and algorithms by running experiments on the cloud quantum-computing platform IBM Quantum Experience.

Computationally Efficient Quantum Expectation with Extended Bell Measurements

Evaluating an expectation value of an arbitrary observable A∈C2n×2n through naïve Pauli measurements requires a large number of terms to be evaluated. We approach this issue using a method based on Bell measurement, which we refer to as the extended Bell measurement method. This analytical method quickly assembles the 4n matrix elements into at most 2n+1 groups for simultaneous measurements in O(nd) time, where d is the number of non-zero elements of A. The number of groups is particularly small when A is a band matrix. When the bandwidth of A is k=O(nc), the number of groups for simultaneous measurement reduces to O(nc+1). In addition, when non-zero elements densely fill the band, the variance is O((nc+1/2n)tr(A2)), which is small compared with the variances of existing methods. The proposed method requires a few additional gates for each measurement, namely one Hadamard gate, one phase gate and at most n−1 CNOT gates. Experimental results on an IBM-Q system show the computational efficiency and scalability of the proposed scheme, compared with existing state-of-the-art approaches. Code is available at https://github.com/ToyotaCRDL/extended-bell-measurements.

Graph-|Q⟩⟨C|, a Graph-Based Quantum/Classical Algorithm for Efficient Electronic Structure on Hybrid Quantum/Classical Hardware Systems: Improved Quantum Circuit Depth Performance.

We present a procedure to reduce the depth of quantum circuits and improve the accuracy of results in computing post-Hartree-Fock electronic structure energies in large molecular systems. The method is based on molecular fragmentation where a molecular system is divided into overlapping fragments through a graph-theoretic procedure. This allows us to create a set of projection operators that decompose the unitary evolution of the full system into separate sets of processes, some of which can be treated on quantum hardware and others on classical hardware. Thus, we develop a procedure for an electronic structure that can be asynchronously spawned onto a potentially large ensemble of classical and quantum hardware systems. We demonstrate this method by computing Unitary Coupled Cluster Singles and Doubles (UCCSD) energies for a set of [H2]n clusters, with n ranging from 4 to 128. We implement our methodology using quantum circuits, and when these quantum circuits are processed on a quantum simulator, we obtain energies in agreement with the UCCSD energies in the milli-hartree energy range. We also show that our circuit decomposition approach yields up to 9 orders of magnitude reduction in the number of CNOT gates and quantum circuit depth for the large-sized clusters when compared to a standard quantum circuit implementation available on IBM's Quantum Information Science kit, known as Qiskit.

Verification of Distributed Quantum Programs

Distributed quantum systems and especially the Quantum Internet have the ever-increasing potential to fully demonstrate the power of quantum computation. This is particularly true given that developing a general-purpose quantum computer is much more difficult than connecting many small quantum devices. One major challenge of implementing distributed quantum systems is programming them and verifying their correctness. In this paper, we propose a CSP-like distributed programming language to facilitate the specification and verification of such systems. After presenting its operational and denotational semantics, we develop a Hoare-style logic for distributed quantum programs and establish its soundness and (relative) completeness with respect to both partial and total correctness. The effectiveness of the logic is demonstrated by its applications in the verification of quantum teleportation and local implementation of non-local CNOT gates, two important algorithms widely used in distributed quantum systems.

Computationally efficient zero-noise extrapolation for quantum-gate-error mitigation

Zero noise extrapolation (ZNE) is a widely used technique for gate error mitigation on near term quantum computers because it can be implemented in software and does not require knowledge of the quantum computer noise parameters. Traditional ZNE requires a significant resource overhead in terms of quantum operations. A recent proposal using a targeted (or random) instead of fixed identity insertion method (RIIM versus FIIM) requires significantly fewer quantum gates for the same formal precision. We start by showing that RIIM can allow for ZNE to be deployed on deeper circuits than FIIM, but requires many more measurements to maintain the same statistical uncertainty. We develop two extensions to FIIM and RIIM. The List Identity Insertion Method (LIIM) allows to mitigate the error from certain CNOT gates, typically those with the largest error. Set Identity Insertion Method (SIIM) naturally interpolates between the measurement-efficient FIIM and the gate-efficient RIIM, allowing to trade off fewer CNOT gates for more measurements. Finally, we investigate a way to boost the number of measurements, namely to run ZNE in parallel, utilizing as many quantum devices as are available. We explore the performance of RIIM in a parallel setting where there is a non-trivial spread in noise across sets of qubits within or across quantum computers.

Universal topological quantum computation with strongly correlated Majorana edge modes

Majorana-based quantum gates are not complete for performing universal topological quantum computation while Fibonacci-based gates are difficult to be realized electronically and hardly coincide with the conventional quantum circuit models. In reference Hu and Kane (2018 Phys. Rev. Lett. 120 066801), it has been shown that a strongly correlated Majorana edge mode in a chiral topological superconductor can be decomposed into a Fibonacci anyon τ and a thermal operator anyon ɛ in the tricritical Ising model. The deconfinement of τ and ɛ via the interaction between the fermion modes yields the anyon collisions and gives the braiding of either τ or ɛ. With these braidings, the complete members of a set of universal gates, the Pauli gates, the Hadamard gate and extra phase gates for one-qubit as well as controlled-NOT (CNOT) gate for two-qubits, are topologically assembled. Encoding quantum information and reading out the computation results can be carried out through electric signals. With the sparse-dense mixed encodings, we set up the quantum circuit where the CNOT gate turns out to be a probabilistic gate and design the corresponding devices with thin films of the chiral topological superconductor. As an example of the universal topological quantum computing, we show the application to Shor’s integer factorization algorithm.

Catalytic Transformations with CNOT Gate

Catalytic Transformations with CNOT Gate

Laser-Controlled Implementation of Controlled-NOT, Hadamard, SWAP, and Pauli Gates as Well as Generation of Bell States in a 3d-4f Molecular Magnet.

Using high-level ab initio many-body theory, we theoretically propose that the Dy and the Ni atoms in the [Dy2Ni2(L)4(NO3)2(DMF)2] real molecular magnet as well as in its core, that is, the [Dy2Ni2O6] system, act as two-level qubit systems. Despite their spatial proximity we can individually control each qubit in this highly correlated real magnetic system through specially designed laser-pulse combinations. This allows us to prepare any desired two-qubit state and to build several classical and quantum logic gates, such as the two-qubit (binary) CNOT gate with three distinct laser pulses. Other quantum logic gates include the single-qubit (unary) quantum X, Y, and Z Pauli gates; the Hadamard gate (which necessitates the coherent quantum superposition of two many-body electronic states); and the SWAP gate (which plays an important role in Shor's algorithm for integer factorization). Finally, by sequentially using the achieved CNOT and Hadamard gates we are able to obtain the maximally entangled Bell states, for example, ()(|00⟩ + |11⟩).

Deterministic linear-optical quantum control gates utilizing path and polarization degrees of freedom

We present a general scheme for a family of linear-optical quantum control gates, including controlled-not and controlled-swap gates for two or three qubits. Our approach utilizes polarization-path-entangled pairs of photons and encodes qubits in mixed degrees of freedom with the control qubit specifically occupying the polarization degree of freedom. By exploiting multiple degrees of freedom and initial state entanglement of the two photons, the proposed control gates do not require any ancilla photons or measurement-induced nonlinearities. Since our gates are purely linear and we implicitly use nonlinearities in a standard manner to create entanglement via parametric nonlinear process, our work demonstrates that a need to have nonlinearities in the photonic gates can be shifted to the state preparation stage; the cost of such shift is that the construction of a certain class of single-qubit operations, such as Hadamard, needs to be probabilistic. In particular, we focus on a deterministic linear-optical quantum Fredkin (controlled-swap) gate and perform a full characterization of the gate performance with a high fidelity typically well above $99%$ under realistic conditions. The proposed control gates rely on simple linear-optical elements and polarization-entangled photon pairs readily generated from ubiquitous sources, making the gates experimentally feasible with current technologies.