Constructing quantum circuits with global gates

Unlike classical digital computers in which a bit can represent either 1 or 0 at any time, quantum computers use a two-level system, i.e., a qubit, to implement logical operations based on quantum mechanical laws, which can represent both values at once. Owing to the superposition property of qubits, quantum computers have natural parallel processing advantages and thus have potential to exceed the computational efficiency of classical computers for particular tasks. Quantum logic gates are the generalization of classical logic gates in computational networks. It has been proved that two-qubit quantum gates together with one-qubit quantum gates are adequate for constructing networks with any possible quantum computational property. Directional couplers are the most critical elementsfor constructing the quantum gates. In recent years, photonic quantum technologies have emerged as a promising experimental platform for quantum computing. Single photons have robust noise resistance, long coherence time, high transmission speed and great compatibility with other systems. They can be easily manipulated and encoded in any of several degrees of freedom, for example, polarization, path, spatial mode or time bin. Optical waveguide technology enables the realizing of complex optical schemes comprised of many elements with desired scalability, stability and miniaturization. Femtosecond laser direct writing of waveguide has been adopted as a powerful tool for integrated quantum photonics with characteristics of rapidness, cost-effectiveness, mask-less and single-step process. In particular, it has the ability to build arbitrary three-dimensional circuits directly inside bulk materials, which is impossible to achieve with conventional lithography. In this article we review the femtosecond laser writing and quantum characterization of directional coupler and important one-qubit and two-qubit optical quantum logic gates, such as Hadamard gate, Pauli-X gate, controlled-NOT gate, and controlled-Phase gate. The qubits in these gates are usually encoded through optical paths or polarizations of photons. The key to the realization of polarization-encoded one-qubit gates is to achieve flexible wave-plate operations, which is described in detail. Controlled-NOT gate and controlled-phase gate are the most crucial two-qubit gates in the linear optics computation and sometimes they can be converted into each other by adding some one-qubit gates or special superposition states. Many different kinds of waveguide circuits have been used to implement these two-qubit gates. The outlook and challenges for the femtosecond laser writing of three-qubit gates, such as Toffoli gate and Fredkin gate, are briefly introduced.

The controlled-not gate and the single qubit gates are considered elementary gates in quantum computing. It is natural to ask how many such elementary gates are needed to implement more elaborate gates or circuits. Recall that a controlled-U gate can be realized with two controlled-not gates and four single qubit gates. We prove that this implementation is optimal if and only if the matrix U satisfies the conditions trU\neq 0, tr(UX)\neq 0, and detU\neq 1. We also derive optimal implementations in the remaining non-generic cases. realizations of controlled unitary gates (pp139-155) G. Song and A. Klappenecker The controlled-not gate and the single qubit gates are considered elementary gates in quantum computing. It is natural to ask how many such elementary gates are needed to implement more elaborate gates or circuits. Recall that a controlled-U gate can be realized with two controlled-not gates and four single qubit gates. We prove that this implementation is optimal if and only if the matrix U satisfies the conditions trU\neq 0, tr(UX)\neq 0, and detU\neq 1. We also derive optimal implementations in the remaining non-generic cases.

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.

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.

This paper shows that quantum computation can be made fault-tolerant against errors and inaccuracies when $\eta$, the probability for an error in a qubit or a gate, is smaller than a constant threshold $\eta_c$. This result improves on Shor's result [Proceedings of the 37th Symposium on the Foundations of Computer Science, IEEE, Los Alamitos, CA, 1996, pp. 56–65], which shows how to perform fault-tolerant quantum computation when the error rate $\eta$ decays polylogarithmically with the size of the computation, an assumption which is physically unreasonable. The cost of making the quantum circuit fault-tolerant in our construction is polylogarithmic in time and space. Our result holds for a very general local noise model, which includes probabilistic errors, decoherence, amplitude damping, depolarization, and systematic inaccuracies in the gates. Moreover, we allow exponentially decaying correlations between the errors both in space and in time. Fault-tolerant computation can be performed with any universal set of gates. The result also holds for quantum particles with $p>2$ states, namely, p-qudits, and is also generalized to one-dimensional quantum computers with only nearest-neighbor interactions. No measurements, or classical operations, are required during the quantum computation. We estimate the threshold of our construction to be $\eta_c\simeq 10^{-6}$, in the best case. By this we show that local noise is in principle not an obstacle for scalable quantum computation. The main ingredient of our proof is the computation on states encoded by a quantum error correcting code (QECC). To this end we introduce a special class of Calderbank–Shor–Steane (CSS) codes, called polynomial codes (the quantum analogue of Reed–Solomon codes). Their nice algebraic structure allows all of the encoded gates to be transversal. We also provide another version of the proof which uses more general CSS codes, but its encoded gates are slightly less elegant. To achieve fault tolerance, we encode the quantum circuit by another circuit by using one of these QECCs. This step is repeated polyloglog many times, each step slightly improving the effective error rate, to achieve the desired reliability. The resulting circuit exhibits a hierarchical structure, and for the analysis of its robustness we borrow terminology from Khalfin and Tsirelson [Found. Phys., 22 (1992), pp. 879–948] and Gács [Advances in Computing Research: A Research Annual: Randomness and Computation, JAI Press, Greenwich, CT, 1989]. The paper is to a large extent self-contained. In particular, we provide simpler proofs for many of the known results we use, such as the fact that it suffices to correct for bit-flips and phase-flips, the correctness of CSS codes, and the fact that two-qubit gates are universal, together with their extensions to higher-dimensional particles. We also provide full proofs of the universality of the sets of gates we use (the proof of universality was missing in Shor's paper). This paper thus provides a self-contained and complete proof of universal fault-tolerant quantum computation in the presence of local noise.

Fixed-frequency transmon quantum computers (QCs) have advanced in coherence times, addressability, and gate fidelities. Unfortunately, these devices are restricted by the number of on-chip qubits, capping processing power and slowing progress toward fault-tolerance. Although emerging transmon devices feature over 100 qubits, building QCs large enough for meaningful demonstrations of quantum advantage requires overcoming many design challenges. For example, today’s transmon qubits suffer from significant variation due to limited precision in fabrication. As a result, barring significant improvements in current fabrication techniques, scaling QCs by building ever larger individual chips with more qubits is hampered by device variation. Severe device variation that degrades QC performance is referred to as a defect. Here, we focus on a specific defect known as a frequency collision. When transmon frequencies collide, their difference falls within a range that limits two-qubit gate fidelity. Frequency collisions occur with greater probability on larger QCs, causing collision-free yields to decline as the number of on-chip qubits increases. As a solution, we propose exploiting the higher yields associated with smaller QCs by integrating quantum chiplets within quantum multi-chip modules (MCMs). Yield, gate performance, and application-based analysis show the feasibility of QC scaling through modularity. Our results demonstrate that chiplet architectures, relative to monolithic designs, benefit from average yield improvements ranging from 9.6 – 92.6 × for ≲5 qubit machines. In addition, our simulations explore the design space of chiplet systems and discover configurations that demonstrate average two-qubit gate infidelity reductions that are at best 0.815 × their monolithic counterpart. Finally, we observe that carefully-selected modular systems achieve fidelity improvements on a range of benchmark circuits.

In NMR quantum computing, spin states of spin-1/2 nuclei are called qubits. Quantum logic gates are represented by unitary matrices. As a universal gate, controlled-NOT (CNOT) is a two-qubit gate. For the IS (I = 1/2 and S = 1/2) spin system, two-qubit CNOT gate is represented by a 4 × 4 matrix. SWAP logic gate, which exchanges two quantum states, is constructed by CNOT gates. In this study, first, four-qubit CNOT gates are constructed for the IS (I = 3/2, S = 3/2) spin system. Then, by using these CNOT gates, a four-qubit SWAP logic gate is found. As an application and verification, an obtained SWAP logic gate is applied to the matrix representation of product operators for the IS (I = 3/2, S = 3/2) spin system. SWAP logic gate can also be presented by an NMR pulse sequence. By using the product operator theory, the pulse sequence of the SWAP logic gate is applied to product operators of the IS (I = 3/2, S = 3/2) spin system. The expected exchange results are obtained for both the matrix representation and the pulse sequence of SWAP logic gate.

<sec>Spin qubits in silicon-based semiconductor quantum dots have become one of the prominent candidates for realizing fault-tolerant quantum computing due to their long coherence time, good controllability, and compatibility with modern advanced integrated circuit manufacturing processes. In recent years, due to the remarkable advances in silicon-based materials, the structure of quantum dot and its fabrication process, and qubit manipulation technology, the great progress of high-fidelity state preparation and readout, single- and two-qubit gates of spin qubits for silicon based semiconductor quantum computation has been achieved. The control fidelities for single- and two-qubit gates all exceed 99%—fault tolerance threshold required by the surface code known for its exceptionally high tolerance to errors. In this paper, we briefly introduce the basic concepts of silicon-based semiconductor quantum dots, discuss the state-of-art technologies used to improve the fidelities of single- and two-qubit gates, and finally highlight the research directions that should be focused on.</sec><sec>This paper is organized as follows. Firstly, we introduce three major types of quantum dot (QD) devices fabricated on different silicon-based substrates, including Si/SiGe heterojunction and Si/SiO<sub>2</sub>. The spin degree of electron or nucleus hosted in QD can be encoded into spin qubits. Electron spin qubits can be thermally initialized to ground state by using an electron reservoirs, and can be read out by spin-charge conversion mechanism: energy-selective readout (Elzerman readout) with reservoirs or Pauli spin blockade (PSB) without reservoirs. Additionally, high fidelity single-shot readout has been demonstrated by using radio-frequency gate reflectometry combined with the PSB, which has unique advantages in large-scale qubit array. To coherently control the spin qubits, electron dipole resonance (ESR) or electron dipole spin resonance (EDSR) for electron and nuclear magnetic resonance (NMR) for nucleus are introduced. With the help of isotope purification greatly improving the dephasing time of qubit and fast single-qubit manipulation based on EDSR, fidelity above 99.9% can be reached. For the two-qubit gates based on exchange interaction between electron spins, the strength of interaction <inline-formula><tex-math id="M1">\begin{document}$ J $\end{document}</tex-math><alternatives><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="23-20221900_M1.jpg"/><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="23-20221900_M1.png"/></alternatives></inline-formula> combined with Zeeman energy difference <inline-formula><tex-math id="M2">\begin{document}$ \Delta {E}_{z} $\end{document}</tex-math><alternatives><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="23-20221900_M2.jpg"/><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="23-20221900_M2.png"/></alternatives></inline-formula> determines the energy levels of system, which lead to the different two-qubit gates, such as controlled-Z (CZ), controlled-Rotation (CROT), and the square root of the SWAP gate (<inline-formula><tex-math id="M3">\begin{document}$ \sqrt{\rm{S}\rm{W}\rm{A}\rm{P}} $\end{document}</tex-math><alternatives><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="23-20221900_M3.jpg"/><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="23-20221900_M3.png"/></alternatives></inline-formula>) gates. In order to improve the fidelity of two-qubit gates, a series of key technologies is used experimentally, they being isotope purification, symmetry operation, careful Hamiltonian engineering, and gate set tomography. Fidelity of two-qubit gates exceeding 99% has been demonstrated for electron spin qubits in Si/SiGe quantum dots and nuclear spin qubits in donors. These advances have pushed the silicon-based spin qubit platform to become a major stepping stone towards fault-tolerant quantum computation. Finally, we discuss the future study of spin qubits, that is, how to effectively expand the number of qubits, and many other problems to be explored and solved.</sec>

A Busy March Meeting Is Brewing in Seattle

Among the many proposals for the realization of a quantum computer, holonomic\nquantum computation (HQC) is distinguished from the rest in that it is\ngeometrical in nature and thus expected to be robust against decoherence. Here\nwe analyze the realization of various quantum gates by solving the inverse\nproblem: Given a unitary matrix, we develop a formalism by which we find loops\nin the parameter space generating this matrix as a holonomy. We demonstrate for\nthe first time that such a one-qubit gate as the Hadamard gate and such\ntwo-qubit gates as the CNOT gate, the SWAP gate and the discrete Fourier\ntransformation can be obtained with a single loop.\n

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.

Quantum computer promises to outperform classical computer fundamentally, due to its quantum superposition. Any operations to N qubits can be decomposed into several single-qubit operations and two-qubit controlled-NOT (CNOT) operations in theory. Linear optical quantum computing (LOQC) is one of the most prominent physical quantum systems, which has the advantage of long coherent time and convenience in implementing single qubit operations. However, the realization of two-qubit CNOT gate is the greatest challenge for LOQC, because two photons cannot directly interact with each other by nature. KLM protocol proves the feasibility of LOQC and spurs quantity of research on schematic design and experimental demonstration of CNOT gates by using linear quantum optics system. These researches are very important and nontrivial for LOQC, and this paper gives an overview of different schemes of the proposed CNOT gates and the experimental demonstration.

Quantum bit commitment (QBC) is a quantum version of the classical bit commitment security primitive. As other quantum security primitives and protocols, QBC improves on cheating detection over its classical counterpart. The implementation of the QBC protocol below relies on the use of common quantum gates: the Hadamard gate used for orthonormal bases and the CNOT gate used to swap qubits. The protocol was run and tested on IBM quantum experience (IBM QX). IBM QX offers two different quantum environments: as a simulator and as a real quantum machine. In our implementation, honest and dishonest participants were considered. Results of both the simulation and the quantum execution were compared against the theoretical expectations. The IBM QX simulator gives results that match the theoretical model. The IBM QX real computer deviates from the expected behavior by a measurable amount. Using the standard deviation and the Hamming distance, the conclusion is that the quantum computer is usable as the difference to the simulator is within an acceptable margin of error. The QBC protocol of choice is fully secure against cheating by Bob. The only way Alice can cheat is using multi-dimensional entanglement. The cost for Alice to cheat is exponential in the number of qubits used, namely $$ O(2^{6n + 3k + 1} ) $$.

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.

4 - Introduction to NMR quantum computing