Quantum Gates Research Articles

Noise correlations behind superdiffusive quantum walks.

We study how discrete-time quantum walks behave under short-range correlated noise. By considering noise as a source of inhomogeneity of quantum gates, we introduce a primitive relaxation in the assumption of uncorrelated stochastic noise: binary pair correlations manifesting in the random distribution. Using different quantum gates, we examined the transport properties for both spatial and temporal noise regimes. For spatial inhomogeneities, we unveil noise correlations driving quantum walks from the well-known exponentially localized regime to superdiffusive spreading. This scenario displays an intriguing performance in which the superdiffusive exponent is almost invariant to the degree of inhomogeneity. The time-asymptotic regime and the finite-size scaling also unveil an emergent superdiffusive behavior for quantum walks undergoing temporal noise correlation, replacing the diffusive regime exhibited when noise is random and uncorrelated. However, some quantum gates are insensitive to correlations, contrasting with the spatial noise scenario. Numerical and analytical results provide valuable insights into the underlying mechanism of superdiffusive quantum walks, including those arising from deterministic aperiodic inhomogeneities.

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

A reference architecture for quantum computing as a service

Quantum computers (QCs) aim to disrupt the status-quo of computing – replacing traditional systems and platforms that are driven by digital circuits and modular software – with hardware and software that operate on the principle of quantum mechanics. QCs that rely on quantum mechanics can exploit quantum circuits (i.e., quantum bits for manipulating quantum gates) to achieve ‘quantum computational supremacy’ over traditional, i.e., digital computing systems. Currently, the issues that impede mass-scale adoption of quantum systems are rooted in the fact that building, maintaining, and/or programming QCs is a complex and radically distinct engineering paradigm when compared to the challenges of classical computing and software engineering. Quantum service orientation is seen as a solution that synergises the research on service computing and quantum software engineering (QSE) to allow developers and users to build and utilise quantum software services based on pay-per-shot utility computing model. The pay-per-shot model represents a single execution of instruction on quantum processing unit and it allows vendors (e.g., Amazon Braket) to offer their QC platforms, simulators, and software services to end-users. This research contributes by (i) developing a reference architecture for enabling Quantum Computing as a Service (QCaaS), (ii) implementing microservices with the quantum-classic split pattern as an architectural use-case, and (iii) evaluating the architecture based on practitioners’ feedback. The proposed reference architecture follows a layered software pattern to support the three phases of service lifecycle namely development, deployment, and split of quantum software services. In the QSE context, the research focuses on unifying architectural methods and service-orientation patterns to promote reuse knowledge and best practices to tackle emerging and futuristic challenges of architecting QCaaS.

Eliminating Qubit-Type Cross-Talk in the omg Protocol.

The omg protocol is a promising paradigm that uses multiple, application-specific, qubit subspaces within the Hilbert space of each single atom during quantum information processing. A key assumption for omg operation is that a subspace can be accessed independently without deleterious effects on information stored in other subspaces. We find that intensity noise during laser-based quantum gates in one subspace can cause decoherence in other subspaces, potentially complicating omg operation. We show, however, that a magnetic-field-induced vector light shift can be used to eliminate this source of decoherence. As this technique simply requires choosing a specific, magnetic field-dependent polarization for the gate lasers, itis straightforward to implement and potentially helpful for omg-based quantum technology.

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

Robust Quantum Gates against Correlated Noise in Integrated Quantum Chips.

As quantum circuits become more integrated and complex, additional error sources that were previously insignificant start to emerge. Consequently, the fidelity of quantum gates benchmarked under pristine conditions falls short of predicting their performance in realistic circuits. To overcome this problem, we must improve their robustness against pertinent error models besides isolated fidelity. Here, we report the experimental realization of robust quantum gates in superconducting quantum circuits based on a geometric framework for diagnosing and correcting various gate errors. Using quantum process tomography and randomized benchmarking, we demonstrate robust single-qubit gates against quasistatic noise and spatially correlated noise in a broad range of strengths, which are common sources of coherent errors in large-scale quantum circuits. We also apply our method to nonstatic noises and to realize robust two-qubit gates. Our Letter provides a versatile toolbox for achieving noise-resilient complex quantum circuits.

Topological Hong-Ou-Mandel interference.

The interplay of topology and optics provides a route to pursue robust photonic devices, with the application to photonic quantum computation in its infancy. However, the possibilities of harnessing topological structures to process quantum information with linear optics, through the quantum interference of photons, remain largely uncharted. Here, we present a Hong-Ou-Mandel interference effect of topological origin. We show that this interference of photon pairs-ranging from constructive to destructive-is solely determined by a synthetic magnetic flux, rendering it resilient to errors on a fundamental level. Our implementation establishes a quantized flux that facilitates exclusively destructive quantum interference. Our findings pave the way toward the development of next-generation photonic quantum circuitry and scalable quantum computing protected by virtue of topologically robust quantum gates.

Shor’s algorithm does not factor large integers in the presence of noise

We consider Shor’s quantum factoring algorithm in the setting of noisy quantum gates. Under a generic model of random noise for (controlled) rotation gates, we prove that the algorithm does not factor integers of the form pq when the noise exceeds a vanishingly small level in terms of n—the number of bits of the integer to be factored, where p and q are from a well-defined set of primes of positive density. We further prove that with probability 1 − o(1) over random prime pairs (p, q), Shor’s factoring algorithm does not factor numbers of the form pq, with the same level of random noise present.

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.

Analyzing Quantum Error Resilience for Quantum Communication in Guided and Unguided Media

AbstractThis research examines quantum key distribution and its applications in guided and unguided quantum communication. The importance of secure communication in the quantum era requires a thorough exploration of both guided and unguided quantum communication strategies. The research aims to address the challenges posed by guided channels, such as fiber optics, and unguided channels, such as free‐space quantum communication. This study addresses existing knowledge gaps in quantum error resilience management and signal processing techniques in unguided quantum communication. Advanced quantum gate analysis, environmental noise analysis, and quantum channel modeling techniques are employed. The research presents key findings on the impact of gate imperfections on quantum error resilience in guided media, the influence of noise‐induced errors in unguided media, and a unified metric for assessing various error sources in guided channels. Additionally, the study analyses stabilizer codes and surface codes for error mitigation through quantum error correction strategies. Simulation results provide a benchmark for theoretical predictions and guide the refinement of quantum communication protocols. In this context, machine learning‐based error prediction is introduced as a cutting‐edge approach to enhance the robustness of quantum communication systems.

High-efficiency realization of the super-robust Rydberg Deutsch gate

Quantum logic gates are the essential components of quantum computation and have broad practical applications, especially for the multiple-qubit logic gates. Compared with appliying a series of single- and two-qubit gates, constrcuting quantum computation with multiple-qubit logic gates can be more efficient and high-fidelity. As a three-qubit logic gate, Deutsch gate enables the realization of any feasible quantum computations. Based on neutral atoms, we present a scheme of super-robust Deutsch gate via optimal control technique. Utilizing the Rydberg blockade effect of neutral atoms, we design an implementable D(β) based on the three-step program. One of the notable advantages of this function is that β can be achieved arbitrarily between 0 and π with the operation of target atom. In addition, we give an analytical solution agreed very well with numerical simulations for the residual blocking effect between next-neighbor atoms that affects the performance quality of Deutsch gate. The fidelity of our proposed scheme is demonstrated by numerical simulation of the master equation based on the full Hamiltonian, and the robustness of our scheme with control errors is also illustrated. Our proposal offers an alternative promising scheme for fault-tolerant quantum computation. Published by the American Physical Society 2024

Reservoir-Free Decoherence in Flying Qubits.

An effective time-dependent Hamiltonian can be implemented by making a quantum system fly through an inhomogeneous potential, realizing, for example, a quantum gate on its internal degrees of freedom. However, flying systems have a spatial spread that will generically entangle the internal and spatial degrees of freedom, leading to decoherence in the internal state dynamics, even in the absence of any external reservoir. We provide formulas valid at all times for the dynamics, fidelity, and change of entropy for ballistic particles with small spatial spreads, quantified by Δx. This non-Markovian decoherence can be significant for ballistic flying qubits (scaling as Δx^{2}) but usually not for flying qubits carried by a moving potential well (scaling as Δx^{6}). We also discuss a method to completely counteract this decoherence for a ballistic qubit later measured.

Joint mitigation of quantum gate and measurement errors via the Z-mixed-state expression of the Pauli channel

Joint mitigation of quantum gate and measurement errors via the Z-mixed-state expression of the Pauli channel

Leveraging Data Locality in Quantum Convolutional Classifiers.

Quantum computing (QC) has opened the door to advancements in machine learning (ML) tasks that are currently implemented in the classical domain. Convolutional neural networks (CNNs) are classical ML architectures that exploit data locality and possess a simpler structure than a fully connected multi-layer perceptrons (MLPs) without compromising the accuracy of classification. However, the concept of preserving data locality is usually overlooked in the existing quantum counterparts of CNNs, particularly for extracting multifeatures in multidimensional data. In this paper, we present an multidimensional quantum convolutional classifier (MQCC) that performs multidimensional and multifeature quantum convolution with average and Euclidean pooling, thus adapting the CNN structure to a variational quantum algorithm (VQA). The experimental work was conducted using multidimensional data to validate the correctness and demonstrate the scalability of the proposed method utilizing both noisy and noise-free quantum simulations. We evaluated the MQCC model with reference to reported work on state-of-the-art quantum simulators from IBM Quantum and Xanadu using a variety of standard ML datasets. The experimental results show the favorable characteristics of our proposed techniques compared with existing work with respect to a number of quantitative metrics, such as the number of training parameters, cross-entropy loss, classification accuracy, circuit depth, and quantum gate count.

Full quantum tomography study of Google’s Sycamore gate on IBM’s quantum computers

The potential of achieving computational hardware with quantum advantage depends heavily on the quality of quantum gate operations. However, the presence of imperfect two-qubit gates poses a significant challenge and acts as a major obstacle in developing scalable quantum information processors. Google’s Quantum AI and collaborators claimed to have conducted a supremacy regime experiment. In this experiment, a new two-qubit universal gate called the Sycamore gate is constructed and employed to generate random quantum circuits (RQCs), using a programmable quantum processor with 53 qubits. These computations were carried out in a computational state space of size 9×1015\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$9 \ imes 10^{15}$\\end{document}. Nevertheless, even in strictly-controlled laboratory settings, quantum information on quantum processors is susceptible to various disturbances, including undesired interaction with the surroundings and imperfections in the quantum state. To address this issue, we conduct both quantum state tomography (QST) and quantum process tomography (QPT) experiments on Google’s Sycamore gate using different artificial architectural superconducting quantum computer. Furthermore, to demonstrate how errors affect gate fidelity at the level of quantum circuits, we design and conduct full QST experiments for the five-qubit eight-cycle circuit, which was introduced as an example of the programability of Google’s Sycamore quantum processor. These quantum tomography experiments are conducted in three distinct environments: noise-free, noisy simulation, and on IBM Quantum’s genuine quantum computer. Our results offer valuable insights into the performance of IBM Quantum’s hardware and the robustness of Sycamore gates within this experimental setup. These findings contribute to our understanding of quantum hardware performance and provide valuable information for optimizing quantum algorithms for practical applications.

Metasurface optical trap array for single atoms

Metasurfaces made of subwavelength silicon nanopillars provide unparalleled capacity to manipulate light, and have emerged as one of the leading platforms for developing integrated photonic devices. In this study, we report on a compact, passive approach based on planar metasurface optics to generate large optical trap arrays. The unique configuration is achieved with a meta-hologram to convert a single incident laser beam into an array of individual beams, followed up with a metalens to form multiple laser foci for single rubidium atom trapping. We experimentally demonstrate two-dimensional arrays of 5 × 5 and 25 × 25 at the wavelength of 830 nm, validating the capability and scalability of our metasurface design. Beam waists ∼1.5 µm, spacings (about 15 µm), and low trap depth variations (8%) of relevance to quantum control for an atomic array are achieved in a robust and efficient fashion. The presented work highlights a compact, stable, and scalable trap array platform well-suitable for Rydberg-state mediated quantum gate operations, which will further facilitate advances in neutral atom quantum computing.

Inertial geometric quantum logic gates

Inertial geometric quantum logic gates

Low-cost nonlocal Toffoli gate in a linear quantum network topology

Although a Toffoli gate can be equivalently implemented using several single-qubit and two-qubit gates, it will consume much resource, two of which are nonlocal controlled-NOT (CNOT) gates acting on two non-adjacent nodes, especially in distributed quantum computation (DQC). We, for the first time, employ an ancillary qubit to construct a nonlocal Toffoli gate for DQC in linear network topology. The ancillary-qubit-based scheme needs fewer qubits, quantum gates, and entanglement states than that based on quantum teleportation scheme and the entanglement swapping scheme. We also analyze the performance of the three proposed schemes under different application scenarios, and present their pros and cons. Our work will help to implement DQC in noisy intermediate-scale quantum (NISQ) era.

Fault-tolerant quantum computation using low-cost joint measurements

We introduce a new method to implement joint measurements using a 4-qubit twist defect on a rotated surface code. The proposed method enables us to perform logical S (Phase gate), T (π/8\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\pi /8$$\\end{document} gate), and H (Hadamard) with low overhead. Combined with other universal quantum gates, we can implement fault-tolerant quantum computation at the lattice surgery level beyond the gate level while saving considerable resources. We compare our method with previous methods using benchmark circuits by calculating the space and time costs. The proposed method requires additional lines of physical qubits for each encoded patch. Although it slightly increases the space cost for logical H compared to the previous work, it reduces the time cost. In addition, the proposed method decreases the space cost and time cost by introducing a 4-qubit twist defect for logical S and T. Therefore, the overall space-time cost is reduced.

Geometric Algebra Jordan-Wigner Transformation for Quantum Simulation.

Quantum simulation qubit models of electronic Hamiltonians rely on specific transformations in order to take into account the fermionic permutation properties of electrons. These transformations (principally the Jordan-Wigner transformation (JWT) and the Bravyi-Kitaev transformation) correspond in a quantum circuit to the introduction of a supplementary circuit level. In order to include the fermionic properties in a more straightforward way in quantum computations, we propose to use methods issued from Geometric Algebra (GA), which, due to its commutation properties, are well adapted for fermionic systems. First, we apply the Witt basis method in GA to reformulate the JWT in this framework and use this formulation to express various quantum gates. We then rewrite the general one and two-electron Hamiltonian and use it for building a quantum simulation circuit for the Hydrogen molecule. Finally, the quantum Ising Hamiltonian, widely used in quantum simulation, is reformulated in this framework.