Set Of Gates Research Articles

Pseudo twirling mitigation of coherent errors in non-Clifford gates

The conventional circuit paradigm, utilizing a small set of gates to construct arbitrary quantum circuits, is hindered by significant noise. In the quantum Fourier transform, for instance, the standard gate paradigm employs two CNOT gates for the partial CPhase. In contrast, some quantum computers can directly implement such operations using their native interaction, resulting in less noisy gates. Unfortunately, coherent errors degrade the performance of these gates. In Clifford gates such as the CNOT, these errors can be addressed through randomized compiling (RC). However, RC does not apply to the non-Clifford multi-qubit native implementations described above. The present work introduces and experimentally demonstrates a technique called ‘Pseudo Twirling’ (PST) to address coherent errors. We demonstrate experimentally that integrating PST with the ‘Adaptive KIK’ quantum error mitigation method enables the simultaneous mitigation of noise and coherent errors in multi-qubit non-Clifford gates.

Gate-set evaluation metrics for closed-loop optimal control on nitrogen-vacancy center ensembles in diamond

A recurring challenge in quantum science and technology is the precise control of their underlying dynamics that lead to the desired quantum operations, often described by a set of quantum gates. These gates can be subject to application-specific errors, leading to a dependence of their controls on the chosen circuit, the quality measure and the gate-set itself. A natural solution would be to apply quantum optimal control in an application-oriented fashion. In turn, this requires the definition of a meaningful measure of the contextual gate-set performance. Therefore, we explore and compare the applicability of quantum process tomography, linear inversion gate-set tomography, randomized linear gate-set tomography, and randomized benchmarking as measures for closed-loop quantum optimal control experiments, using a macroscopic ensemble of nitrogen-vacancy centers in diamond as a test-bed. Our work demonstrates the relative trade-offs between those measures and how to significantly enhance the gate-set performance, leading to an improvement across all investigated methods.

Gate tunable edge magnetoplasmon resonators

AbstractQuantum Hall systems are platforms of choice to study topological properties of condensed matter systems and anyonic exchange statistics. In this work we have developed a tunable radiofrequency edge magnetoplasmonic resonator controlled by both the magnetic field and a set of electrostatic gates, meant to serve as a versatile platform for future interferometric devices designed to evidence non-abelian anyons. In our device, gates allow us to change both the size of the resonant cavity and the electronic density of the two-dimensional electron gas. We show that we can continuously control the frequency response of our resonator, making it possible to develop an edge magnetoplasmon interferometer. As we reach smaller sizes of our resonator, finite size effects caused by the measurement probes manifest. In the future, such device will be a valuable tool to investigate the properties of non-abelian anyons in the fractional quantum Hall regime.

Tomography of entangling two-qubit logic operations in exchange-coupled donor electron spin qubits

Scalable quantum processors require high-fidelity universal quantum logic operations in a manufacturable physical platform. Donors in silicon provide atomic size, excellent quantum coherence and compatibility with standard semiconductor processing, but no entanglement between donor-bound electron spins has been demonstrated to date. Here we present the experimental demonstration and tomography of universal one- and two-qubit gates in a system of two weakly exchange-coupled electrons, bound to single phosphorus donors introduced in silicon by ion implantation. We observe that the exchange interaction has no effect on the qubit coherence. We quantify the fidelity of the quantum operations using gate set tomography (GST), and we use the universal gate set to create entangled Bell states of the electrons spins, with fidelity 91.3 ± 3.0%, and concurrence 0.87 ± 0.05. These results form the necessary basis for scaling up donor-based quantum computers.

Efficient Characterization of Qudit Logical Gates with Gate Set Tomography Using an Error-Free Virtual Z Gate Model.

Gate set tomography (GST) characterizes the process matrix of quantum logic gates, along with measurement and state preparation errors in quantum processors. GST typically requires extensive data collection and significant computational resources for model estimation. We propose a more efficient GST approach for qudits, utilizing the qudit Hadamard and virtual Z gates to construct fiducials while assuming virtual Z gates are error-free. Our method reduces the computational costs of estimating characterization results, making GST more practical at scale. We experimentally demonstrate the applicability of this approach on a superconducting transmon qutrit.

Realistic Cost to Execute Practical Quantum Circuits using Direct Clifford+T Lattice Surgery Compilation

We report a resource estimation pipeline that explicitly compiles quantum circuits expressed using the Clifford+T gate set into a surface code lattice surgery instruction set. The cadence of magic state requests from the compiled circuit enables the optimization of magic state distillation and storage requirements in a post-hoc analysis. To compile logical circuits into lattice surgery operations, we build upon the open-source Lattice Surgery Compiler. The revised compiler operates in two stages: the first translates logical gates into an abstract, layout-independent instruction set; the second compiles these into local lattice surgery instructions that are allocated to hardware tiles according to a specified resource layout. The second stage retains logical parallelism while avoiding resource contention in the fault-tolerant layer, aiding realism. Additionally, users can specify dedicated tiles at which magic states are replenished, enabling resource costs from the logical computation to be considered independently from magic state distillation and storage. We demonstrate the applicability of our pipeline to large, practical quantum circuits by providing resource estimates for the ground state estimation of molecules. We find that variable magic state consumption rates in real circuits can cause the resource costs of magic state storage to dominate unless production is varied to suit.

Fault-tolerant one-bit addition with the smallest interesting color code.

Fault-tolerant operations based on stabilizer codes are the state of the art in suppressing error rates in quantum computations. Most such codes do not permit a straightforward implementation of non-Clifford logical operations, which are necessary to define a universal gate set. As a result, implementations of these operations must use either error-correcting codes with more complicated error correction procedures or gate teleportation and magic states, which are prepared at the logical level, increasing overhead to a degree that precludes near-term implementation. Here, we implement a small quantum algorithm, one-qubit addition, fault-tolerantly on a trapped-ion quantum computer, using the [Formula: see text] color code. By removing unnecessary error correction circuits and using low-overhead techniques for fault-tolerant preparation and measurement, we reduce the number of error-prone two-qubit gates and measurements to 36. We observe arithmetic errors with a rate of ∼1.1 × 10-3 for the fault-tolerant circuit and ∼9.5 × 10-3 for the unencoded circuit.

Quanto: optimizing quantum circuits with automatic generation of circuit identities

Existing quantum compilers focus on mapping a logical quantum circuit to a quantum device and its native quantum gates. Only simple circuit identities are used to optimize the quantum circuit during the compilation process. This approach misses more complex circuit identities, which could be used to optimize the quantum circuit further. We propose Quanto, the first quantum optimizer that automatically generates circuit identities. Quanto takes as input a gate set and generates provably correct circuit identities for the gate set. Quanto’s automatic generation of circuit identities includes single-qubit and two-qubit gates, which leads to a new database of circuit identities, some of which are novel to the best of our knowledge. In addition to the generation of new circuit identities, Quanto’s optimizer applies such circuit identities to quantum circuits and finds optimized quantum circuits that have not been discovered by other quantum compilers, including IBM Qiskit and Cambridge Quantum Computing Tket. Quanto’s database of circuit identities could be applied to improve existing quantum compilers and Quanto can be used to generate identity databases for new gate sets.

Synergistic Dynamical Decoupling and Circuit Design for Enhanced Algorithm Performance on Near-Term Quantum Devices.

Dynamical decoupling (DD) is a promising technique for mitigating errors in near-term quantum devices. However, its effectiveness depends on both hardware characteristics and algorithm implementation details. This paper explores the synergistic effects of dynamical decoupling and optimized circuit design in maximizing the performance and robustness of algorithms on near-term quantum devices. By utilizing eight IBM quantum devices, we analyze how hardware features and algorithm design impact the effectiveness of DD for error mitigation. Our analysis takes into account factors such as circuit fidelity, scheduling duration, and hardware-native gate set. We also examine the influence of algorithmic implementation details, including specific gate decompositions, DD sequences, and optimization levels. The results reveal an inverse relationship between the effectiveness of DD and the inherent performance of the algorithm. Furthermore, we emphasize the importance of gate directionality and circuit symmetry in improving performance. This study offers valuable insights for optimizing DD protocols and circuit designs, highlighting the significance of a holistic approach that leverages both hardware features and algorithm design for the high-quality and reliable execution of near-term quantum algorithms.

Liquid Metal Chameleon Tongues: Modulating Surface Tension and Phase Transition to Enable Bioinspired Soft Actuators

Leveraging the unique attributes of functional soft materials to generate force and deformation, significant advancements in soft actuators are driving the evolution of smart robotics. Liquid metals (LMs), known for their high deformability and tunable morphology, demonstrate remarkable actuating capabilities through controllable surface tension. Inspired by the predation method of chameleons, this work introduces a bioinspired LM actuator (BLMA) by modulating the morphology of LM. This BLMA enables high‐strain (up to 170%) actuation by precisely directing LM droplets toward an electrode. Various parameters affecting the BLMA's actuating performance are explored. Notably, the application of a reductive voltage induces rapid solidification of supercooled LM, facilitating phase transition at room temperature. The solidified LM enhances its holding force of BLMA by over 1000 times. To underscore the superior capabilities of the BLMA, diverse applications, such as a complex two‐dimensional plane actuator, a stepper motor with adjustable step intervals, a phase transition‐controlled relay, and a laser code lock actuation gate set, are presented. It is anticipated that the exceptional characteristics of the BLMA will propel advancements in the realms of soft robotics and mechatronics.

Randomised benchmarking for universal qudit gates

We aim to establish a scalable scheme for characterising diagonal non-Clifford gates for single- and multi-qudit systems; d is a prime-power integer. By employing cyclic operators and a qudit T gate, we generalise the dihedral benchmarking scheme for single- and multi-qudit circuits. Our results establish a path for experimentally benchmarking qudit systems and are of theoretical and experimental interest because our scheme is optimal insofar as it does not require preparation of the full qudit Clifford gate set to characterise a non-Clifford gate. Moreover, combined with Clifford randomised benchmarking, our scheme is useful to characterise the generators of a universal gate set.

Sarnak's conjecture in quantum computing, cyclotomic unitary group coranks, and Shimura curves

AbstractSarnak's conjecture in quantum computing concerns when the groups and over cyclotomic rings with , , are generated by the Clifford‐cyclotomic gate set. We previously settled this using Euler–Poincaré characteristics. A generalization of Sarnak's conjecture is to ask when these groups are generated by torsion elements. An obstruction to this is provided by the corank: a group has only if is not generated by torsion elements. In this paper, we study the corank of these cyclotomic unitary groups in the families and , , by letting them act on Bruhat–Tits trees. The quotients by this action are finite graphs whose first Betti number is the corank of the group. Our main result is that for the families and , the corank grows doubly exponentially in as ; it is 0 precisely when , and indeed, the cyclotomic unitary groups are generated by torsion elements (in fact by Clifford‐cyclotomic gates) for these . We give explicit lower bounds for the corank in two different ways. The first is to bound the isotropy subgroups in the action on the tree by explicit cyclotomy. The second is to relate our graphs to Shimura curves over via interchanging local invariants and applying a result of Selberg and Zograf. We show that the cyclotomy arguments give the stronger bounds. In a final section, we execute a program of Sarnak to show that our results for the and families are sufficient to give a second proof of Sarnak's conjecture.

Designing of Reversible Functions in Classical and Quantum Domains

First sections of the paper contain some considerations relevant to the reversibility of quantum gates. The Solovay-Kitayev theorem shows that using proper set of quantum gates one can build a quantum version of the nondeterministic Turing machine. On the other hand the Gottesmann-Knill theorem shows the possibility to simulate the quantum machine consisting of only Clifford/Pauli group of gates. This paper presents also an original method of designing the reversible functions. This method is intended for the most popular gate set with three types of gates CNT (Control, NOT and Toffoli). The presented algorithm leads to cascade with minimal number CNT gates. This solution is called optimal reversible circuits. The paper is organized as follows. Section 5 recalls basic concepts of reversible logic. Section 6 contain short description of CNT set of the reversible gates. In Section 7 is presented form of result of designing as the cascade of gates. Section 8 describes the algorithm and section 9 simple example.

Room temperature, cascadable, all-optical polariton universal gates

Today, almost all information processing is performed using electronic logic circuits operating at several gigahertz frequency. All-optical logic holds the promise to allow for up to three orders of magnitude higher speed. Whereas essential all-optical transistor functionalities were demonstrated across a range of platforms, utilising them to implement a complete Boolean logic gate set and in particular negation, i.e. switching off an optical signal with another, weaker, optical signal, poses a major challenge. Here, we realize a cascadable NOT gate by introducing the concept of non-ground-state polariton amplification in organic semiconductor microcavities under non-resonant optical excitation. We unravel the importance of vibron-mediated stimulated scattering in room temperature operation of the inverter. Moreover, we extend the concept to a multi-input universal NOR logic gate, where in the presence of any of the input signals non-ground-state amplification supersedes spontaneous ground-state condensation, resulting in a NOR gate with ~1 ps switching time. The realisation of an ultrafast universal logic gate constitutes an essential step for more complex optical circuitry that could boost information processing applications.

Arbitrary quantum circuits on a fully integrated two-qubit computation register for a trapped-ion quantum processor

We report on the implementation of arbitrary circuits on a universal two-qubit register that can act as the computational module in a trapped-ion quantum computer based on the quantum charge-coupled device architecture. A universal set of quantum gates is implemented on a two-ion Coulomb crystal of Be+9 ions using only chip-integrated microwave addressing. Individual-ion addressing is implemented using microwave micromotion sideband transitions; we obtain upper limits on addressing crosstalk in the register. Arbitrary two-qubit operations are characterized using the cycle benchmarking protocol. Published by the American Physical Society 2024

Estimate of the time required to perform a nonadiabatic holonomic quantum computation

Nonadiabatic holonomic quantum computation has been proposed as a method to implement quantum logic gates with robustness comparable to that of adiabatic holonomic gates but with shorter execution times. In this paper, we establish an isoholonomic inequality for quantum gates, which provides a lower bound on the lengths of cyclic transformations of the computational space that generate a specific gate. Then, as a corollary, we derive a nonadiabatic execution time estimate for holonomic gates. In addition, we demonstrate that under certain dimensional conditions, the isoholonomic inequality is tight in the sense that every gate on the computational space can be implemented holonomically and unitarily in a time-optimal way. We illustrate the results by showing that the procedures for implementing a universal set of holonomic gates proposed in a pioneering paper on nonadiabatic holonomic quantum computation saturate the isoholonomic inequality and are thus time optimal. Published by the American Physical Society 2024

CS-count-optimal quantum circuits for arbitrary multi-qubit unitaries

In quantum computing there are quite a few universal gate sets, each having their own characteristics. In this paper we study the Clifford+CS universal fault-tolerant gate set. The CS gate is used is many applications and this gate set is an important alternative to Clifford+T. We introduce a generating set in order to represent any unitary implementable by this gate set and with this we derive a bound on the CS-count of arbitrary multi-qubit unitaries. Analysing the channel representation of the generating set elements, we infer JnCS⊂JnT\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$${\\mathcal {J}}_n^{CS}\\subset {\\mathcal {J}}_n^T$$\\end{document}, where JnCS\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$${\\mathcal {J}}_n^{CS}$$\\end{document} and JnT\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$${\\mathcal {J}}_n^T$$\\end{document} are the set of unitaries exactly implementable by the Clifford+CS and Clifford+T gate sets, respectively. We develop CS-count optimal synthesis algorithms for both approximately and exactly implementable multi-qubit unitaries. With the help of these we derive a CS-count-optimal circuit for Toffoli, implying JnTof=JnCS\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$${\\mathcal {J}}_n^{Tof}={\\mathcal {J}}_n^{CS}$$\\end{document}, where JnTof\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$${\\mathcal {J}}_n^{Tof}$$\\end{document} is the set of unitaries exactly implementable by the Clifford+Toffoli gate set. Such conclusions can have an important impact on resource estimates of quantum algorithms.

Cross-Cap Defects and Fault-Tolerant Logical Gates in the Surface Code and the Honeycomb Floquet Code

We consider the Z2 toric code, surface code, and Floquet code defined on a nonorientable surface, which can be considered as families of codes extending Shor’s nine-qubit code. We investigate the fault-tolerant logical gates of the Z2 toric code in this setup, which corresponds to e↔m exchanging symmetry of the underlying Z2 gauge theory. We find that nonorientable geometry provides a new way for the emergent symmetry to act on the code space, and discover the new realization of the fault-tolerant Hadamard gate of the two-dimensional surface code with a single cross cap connecting the vertices nonlocally along a slit, dubbed a nonorientable surface code. This Hadamard gate can be realized by a constant-depth local unitary circuit modulo nonlocality caused by a cross cap. Via folding, the nonorientable surface code can be turned into a bilayer local quantum code, where the folded cross cap is equivalent to a bilayer twist terminated on a gapped boundary and the logical Hadamard only contains local gates with intralayer couplings when being away from the cross cap, as opposed to the interlayer couplings on each site needed in the case of the folded surface code. We further obtain the complete logical Clifford gate set for a stack of nonorientable surface codes and similarly for codes defined on Klein-bottle geometries. We then construct the honeycomb Floquet code in the presence of a single cross cap, and find that the period of the sequential Pauli measurements acts as a HZ logical gate on the single logical qubit, where the cross cap enriches the dynamics compared with the orientable case. We find that the dynamics of the honeycomb Floquet code is precisely described by a condensation operator of the Z2 gauge theory, and illustrate the exotic dynamics of our code in terms of a condensation operator supported at a nonorientable surface. Published by the American Physical Society 2024

From Entanglement to Universality: A Multiparticle Spacetime Algebra Approach to Quantum Computational Gates Revisited

Alternative mathematical explorations in quantum computing can be of great scientific interest, especially if they come with penetrating physical insights. In this paper, we present a critical revisitation of our application of geometric (Clifford) algebras (GAs) in quantum computing as originally presented in [C. Cafaro and S. Mancini, Adv. Appl. Clifford Algebras 21, 493 (2011)]. Our focus is on testing the usefulness of geometric algebras (GAs) techniques in two quantum computing applications. First, making use of the geometric algebra of a relativistic configuration space (namely multiparticle spacetime algebra or MSTA), we offer an explicit algebraic characterization of one- and two-qubit quantum states together with a MSTA description of one- and two-qubit quantum computational gates. In this first application, we devote special attention to the concept of entanglement, focusing on entangled quantum states and two-qubit entangling quantum gates. Second, exploiting the previously mentioned MSTA characterization together with the GA depiction of the Lie algebras SO3;R and SU2;C depending on the rotor group Spin+3,0 formalism, we focus our attention to the concept of universality in quantum computing by reevaluating Boykin’s proof on the identification of a suitable set of universal quantum gates. At the end of our mathematical exploration, we arrive at two main conclusions. Firstly, the MSTA perspective leads to a powerful conceptual unification between quantum states and quantum operators. More specifically, the complex qubit space and the complex space of unitary operators acting on them merge in a single multivectorial real space. Secondly, the GA viewpoint on rotations based on the rotor group Spin+3,0 carries both conceptual and computational advantages compared to conventional vectorial and matricial methods.

Ansatz optimization of the variational quantum eigensolver tested on the atomic Anderson model

We present a detailed analysis and optimization of the variational quantum algorithms required to find the ground state of a correlated electron model, using several types of variational ansatz. Specifically, we apply our approach to the atomic limit of the Anderson model, which is widely studied in condensed matter physics since it can simulate fundamental physical phenomena, ranging from magnetism to superconductivity. The method is developed by presenting efficient state preparation circuits that exhibit total spin, spin projection, particle number and time-reversal symmetries. These states contain the minimal number of variational parameters needed to fully span the appropriate symmetry subspace allowing to avoid irrelevant sectors of Hilbert space. Then, we show how to construct quantum circuits, providing explicit decomposition and gate count in terms of standard gate sets. We test these quantum algorithms looking at ideal quantum computer simulations as well as implementing quantum noisy simulations. We finally perform an accurate comparative analysis among the approaches implemented, highlighting their merits and shortcomings.