Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum gate”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 523 records · Page 29

Entangling-gate error from coherently displaced motional modes of trapped ions

Entangling gates in trapped-ion quantum computers are most often applied to stationary ions with initial motional distributions that are thermal and close to the ground state, while those demonstrations that involve transport generally use sympathetic cooling to reinitialize the motional state prior to applying a gate. Future systems with more ions, however, will face greater nonthermal excitation due to increased amounts of ion transport and exacerbated by longer operational times and variations over the trap array. In addition, pregate sympathetic cooling may be limited due to time costs and laser access constraints. In this paper, we analyze the impact of such coherent motional excitation on entangling-gate error by performing simulations of Mølmer-Sørenson (MS) gates on a pair of trapped-ion qubits with both thermal and coherent excitation present in a shared motional mode at the start of the gate. Here, we quantify how a small amount of coherent displacement erodes gate performance in the presence of experimental noise, and we demonstrate that adjusting the relative phase between the initial coherent displacement and the displacement induced by the gate or using Walsh modulation can suppress this error. We then use experimental data from transported ions to analyze the impact of coherent displacement on MS-gate error under realistic conditions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Model dynamics for quantum computing

A model master equation suitable for quantum computing dynamics is presented. In an ideal quantum computer (QC), a system of qubits evolves in time unitarily and, by virtue of their entanglement, interfere quantum mechanically to solve otherwise intractable problems. In the real situation, a QC is subject to decoherence and attenuation effects due to interaction with an environment and with possible short-term random disturbances and gate deficiencies. The stability of a QC under such attacks is a key issue for the development of realistic devices. We assume that the influence of the environment can be incorporated by a master equation that includes unitary evolution with gates, supplemented by a Lindblad term. Lindblad operators of various types are explored; namely, steady, pulsed, gate friction, and measurement operators. In the master equation, we use the Lindblad term to describe short time intrusions by random Lindblad pulses. The phenomenological master equation is then extended to include a nonlinear Beretta term that describes the evolution of a closed system with increasing entropy. An external Bath environment is stipulated by a fixed temperature in two different ways. Here we explore the case of a simple one-qubit system in preparation for generalization to multi-qubit, qutrit and hybrid qubit–qutrit systems. This model master equation can be used to test the stability of memory and the efficacy of quantum gates. The properties of such hybrid master equations are explored, with emphasis on the role of thermal equilibrium and entropy constraints. Several significant properties of time-dependent qubit evolution are revealed by this simple study. - Highlights: • General realistic density matrix evolution model shown for one qubit. • Unitary pulses & bias yield quantum gates without harmful phase accumulations. • Gate friction, dissipation included by random Lindblad noise pulses. • Bath & entropy terms yield equilibrium; test algorithms, gates act on Larmor grid. • Measurement modeled by strong, fast Lindblad pulses.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Optimal Control Using High Performance Computing

This feasibility study developed numerical methods for the optimal control problem for realizing logical gates in closed quantum systems, where the evolution of the state vector is governed by the time dependent Schrodinger equation. The number of parameters in the control functions is made independent of the number of time steps by expanding them in terms of B-spline basis functions, with and without carrier waves. We use an interior point gradient-based technique from the IPOPT package to minimize the gate infidelity subject to amplitude constraints on the control functions. The symplectic Stromer-Verlet scheme is used to integrate a real-valued formulation of Schrodinger's equation in time and the gradient of the gate infidelity is obtained by solving the corresponding adjoint equation. This allows all components of the gradient to be calculated at the cost of solving three Schrodinger systems, independently of the number of parameters in the control functions. The correctness of the method is verified and applied to Hamiltonians that model the dynamics of coupled super-conducting qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Three-terminal graphene single-electron transistor fabricated using feedback-controlled electroburning

We report room-temperature Coulomb blockade in a single layer graphene three-terminal single-electron transistor fabricated using feedback-controlled electroburning. The small separation between the side gate electrode and the graphene quantum dot results in a gate coupling up to 3 times larger compared to the value found for the back gate electrode. This allows for an effective tuning between the conductive and Coulomb blocked state using a small side gate voltage of about 1 V. The technique can potentially be used in the future to fabricate all-graphene based room temperature single-electron transistors or three terminal single molecule transistors with enhanced gate coupling.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scheduling error correction operations for a quantum computer.

In a (future) quantum computer a single logical quantum bit (qubit) will be made of multiple physical qubits. These extra physical qubits implement mandatory extensive error checking. The efficiency of error correction will fundamentally influence the performance of a future quantum computer, both in latency/speed and in error threshold (the worst error tolerated for an individual gate). Executing this quantum error correction requires scheduling the individual operations subject to architectural constraints. Since our last talk on this subject, a team of researchers at Sandia National Labortories has designed a logical qubit architecture that considers all relevant architectural issues including layout, the effects of supporting classical electronics, and the types of gates that the underlying physical qubit implementation supports most naturally. This is a two-dimensional system where 2-qubit operations occur locally, so there is no need to calculate more complex qubit/information transportation. Using integer programming, we found a schedule of qubit operations that obeys the hardware constraints, implements the local-check code in the native gate set, and minimizes qubit idle periods. Even with an optimal schedule, however, parallel Monte Carlo simulation shows that there is no finite error probability for the native gates such that the error-correction system would be benecial. However, by adding dynamic decoupling, a series of timed pulses that can reverse some errors, we found that there may be a threshold. Thus finding optimal schedules for increasingly-refined scheduling problems has proven critical for the overall design of the logical qubit system. We describe the evolving scheduling problems and the ideas behind the integer programming-based solution methods. This talk assumes no prior knowledge of quantum computing.

99 GENERAL AND MISCELLANEOUS↗

Realization of the Werner-Holevo and Landau-Streater Quantum Channels for Qutrits on Quantum Computers.

We realize the Landau-Streater (LS) and Werner-Holevo (WH) quantum channels for qutrits on IBM quantum computers. These channels correspond to the interaction between a qutrit and its environment that results in the globally unitarily covariant qutrit transformation violating the multiplicativity of the maximal p-norm. Our realization of the LS and WH channels is based on embedding the qutrit states into states of two qubits and using the single-qubit and two-qubit CNOT gates to implement the specific interaction. We employ the standard quantum gates, hence the developed algorithm suits any quantum computer. We run our algorithm on a 5-qubit computer and a 20-qubit computer, as well as on a simulator. We quantify the quality of the implemented channels comparing their action on different input states with theoretical predictions. The overall efficiency is quantified by the fidelity between the theoretical and experimental Choi states implemented on the 20-qubit computer.

completely-positive trace-preserving map↗

NISQ+: Boosting quantum computing power by approximating quantum error correction

Quantum computers are growing in size, and design decisions are being made now that attempt to squeeze more computation out of these machines. In this spirit, we design a method to boost the computational power of near-term quantum computers by adapting protocols used in quantum error correction to implement "Approximate Quantum Error Correction (AQEC)." By approximating fully-fledged error correction mechanisms, we can increase the compute volume (qubits × gates, or "Simple Quantum Volume (SQV)") of near-term machines. The crux of our design is a fast hardware decoder that can approximately decode detected error syndromes rapidly. Specifically, we demonstrate a proof-of-concept that approximate error decoding can be accomplished online in near-term quantum systems by designing and implementing a novel algorithm in Single-Flux Quantum (SFQ) superconducting logic technology. This avoids a critical decoding backlog, hidden in all offline decoding schemes, that leads to idle time exponential in the number of T gates in a program. Our design utilizes one SFQ processing module per physical qubit. Employing state-of-the-art SFQ synthesis tools, we show that the circuit area, power, and latency are within the constraints of contemporary quantum system designs. Under pure dephasing error models, the proposed accelerator and AQEC solution is able to expand SQV by factors between 3,402 and 11,163 on expected near-term machines. The decoder achieves a 5% accuracy-threshold and pseudo-thresholds of ~ 5%,4.75%,4.5%, and 3.5% physical error-rates for code distances 3,5,7, and 9. Decoding solutions are achieved in a maximum of ~20 nanoseconds on the largest code distances studied. By avoiding the exponential idle time in offline decoders, we achieve a 10x reduction in required code distances to achieve the same logical performance as alternative designs.

97 MATHEMATICS AND COMPUTING↗

Dynamics of qudit gates and effects of spectator modes on optimal control pulses

Qudit gates for high-dimensional quantum computing can be synthesized with high precision using numerical quantum optimal control techniques. Large circuits are broken down into modules and the tailored pulses for each module can be used as primitives for a qudit compiler. Application of the pulses of each module in the presence of extra modes may decrease their effectiveness due to crosstalk. In this paper, we address this problem by simulating qudit dynamics for circuit quantum electrodynamics systems. As a test case, we take pulses for single-qudit swap gates optimized in isolation and then apply them in the presence of spectator modes each of which are in Fock states. We provide an experimentally relevant scaling formula that can be used as a bound on the fidelity decay. Our results show that frequency shift from spectator mode populations has to be ≲ 0.1 % of the qudit's nonlinearity in order for high-fidelity single-qudit gates to be useful in the presence of occupied spectator modes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

High-Fidelity Two-Qubit Gates Using a Microelectromechanical-System-Based Beam Steering System for Individual Qubit Addressing

In a large scale trapped atomic ion quantum computer, high-fidelity two-qubit gates need to be extended over all qubits with individual control. We realize and characterize high-fidelity two-qubit gates in a system with up to four ions using radial modes. The ions are individually addressed by two tightly focused beams steered using microelectromechanical system mirrors. We deduce a gate fidelity of 99.49(7)% in a two-ion chain and 99.30(6)% in a four-ion chain by applying a sequence of up to 21 two-qubit gates and measuring the final state fidelity. Our team characterizes the residual errors and discuss methods to further improve the gate fidelity towards values that are compatible with fault-tolerant quantum computation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Field Programmable Gate Arrays for Enhancing the Speed and Energy Efficiency of Quantum Dynamics Simulations

We present the first application of field programmable gate arrays (FPGAs) as new, customizable hardware architectures for carrying out fast and energy-efficient quantum dynamics simulations of large chemical/material systems. Instead of tailoring the software to fixed hardware, which is the typical case for writing quantum chemistry code for central processing units (CPUs) and graphics processing units (GPUs), FPGAs allow us to directly customize the underlying hardware (even at the level of specific electrical signals in the circuit) to give a truly optimized computational performance for quantum dynamics calculations. By offloading the most intensive and repetitive calculations onto an FPGA, we show that the computational performance of our real-time electron dynamics calculations can even exceed that of optimized commercial mathematical libraries running on high-performance GPUs. In addition to this impressive computational speedup, we show that FPGAs are immensely energy-efficient and consume 4 times less energy than modern GPU or CPU architectures. These energy savings are a practical and important metric for supercomputing centers (many of which exceed over $1 million in power costs alone), as exascale computing capabilities become more widespread and commonplace. Taken together, the implementation techniques and performance metrics of our study demonstrate that FPGAs could play a promising role in upcoming quantum chemistry and materials science applications, particularly for the acceleration and energy-efficient execution of quantum dynamics calculations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Spin-squeezed Gottesman-Kitaev-Preskill codes for quantum error correction in atomic ensembles

Gottesman-Kitaev-Preskill (GKP) codes encode a qubit in displaced phase-space combs of a continuous-variable (CV) quantum system and are useful for correcting a variety of high-weight photonic errors. Here we propose atomic ensemble analogs of the single-mode CV GKP code by using the quantum central limit theorem to pull back the phase-space structure of a CV system to the compact phase space of a quantum spin system. We study the optimal recovery performance of these codes under error channels described by stochastic relaxation and isotropic ballistic dephasing processes using the diversity combining approach for calculating channel fidelity. Additionally, we find that the spin GKP codes outperform other spin system codes such as cat codes or binomial codes. Our spin GKP codes based on the two-axis countertwisting interaction and superpositions of SU(2) coherent states are direct spin analogs of the finite-energy CV GKP codes, whereas our codes based on one-axis twisting do not yet have well-studied CV analogs. A state preparation scheme for the spin GKP codes is proposed which uses the linear-combination-of-unitaries method, applicable to both the CV and spin GKP settings. Finally, we discuss a fault-tolerant approximate gate set for quantum computing with spin-GKP-encoded qubits, obtained by translating gates from the CV GKP setting using the quantum central limit theorem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An elementary optical logic circuit for quantum computing: a review

The classical computing has already done wonders with computation, however limitations on speed and security of transmitted information is endorsing novel computation techniques. Quantum computing is expected to resolve complex problems especially for unachievable speed with best possible secure communication. The logic gates for two Quantum bits (qubits) are one of the most important part of information processing in Quantum computing. Although photons are the best candidates for the processing of qubit but they need lots of nonlinear coupling to perform logic operations. Recent developments in the field of integrated optics showing promising signs for the development of Quantum networks and Quantum computation. In this article we have reviewed the technology of handling polarization encoded Qubit to perform logic operations and interconnections of logic circuits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SCB Quantum Computers Using iSWAP and 1-Qubit Rotations

Units of superconducting circuitry that exploit the concept of the single- Cooper-pair box (SCB) have been built and are undergoing testing as prototypes of logic gates that could, in principle, constitute building blocks of clocked quantum computers. These units utilize quantized charge states as the quantum information-bearing degrees of freedom. An SCB is an artificial two-level quantum system that comprises a nanoscale superconducting electrode connected to a reservoir of Cooper-pair charges via a Josephson junction. The logical quantum states of the device, .0. and .1., are implemented physically as a pair of charge-number states that differ by 2e (where e is the charge of an electron). Typically, some 109 Cooper pairs are involved. Transitions between the logical states are accomplished by tunneling of Cooper pairs through the Josephson junction. Although the two-level system contains a macroscopic number of charges, in the superconducting regime, they behave collectively, as a Bose-Einstein condensate, making possible a coherent superposition of the two logical states. This possibility makes the SCB a candidate for the physical implementation of a qubit. A set of quantum logic operations and the gates that implement them is characterized as universal if, in principle, one can form combinations of the operations in the set to implement any desired quantum computation. To be able to design a practical quantum computer, one must first specify how to decompose any valid quantum computation into a sequence of elementary 1- and 2-qubit quantum gates that are universal and that can be realized in hardware that is feasible to fabricate. Traditionally, the set of universal gates has been taken to be the set of all 1-qubit quantum gates in conjunction with the controlled-NOT (CNOT) gate, which is a 2-qubit gate. Also, it has been known for some time that the SWAP gate, which implements square root of the simple 2-qubit exchange interaction, is as computationally universal as is the CNOT operation.

Williams, Colin↗

Controlled gate networks: theory and application to eigenvalue estimation

We introduce a new scheme for quantum circuit design called controlled gate networks. Rather than trying to reduce the complexity of individual unitary operations, the new strategy is to toggle between all of the unitary operations needed with the fewest number of gates. We present the general theory of controlled gate networks and show that, under quite general conditions, it can significantly reduce the number of two-qubit gates needed to produce linear combinations of unitary operators. The first example we consider is a variational subspace calculation for a two-qubit system. The second example is estimating the eigenvalues of a two-qubit Hamiltonian via the rodeo algorithm (Choi et al. in Phys Rev Lett 127(4):040505, 2021. https://doi.org/10.1103/PhysRevLett.127.040505) using operators that we call controlled reversal gates. We use the Quantinuum H1-2 and IBM Perth devices to realize the quantum circuits. The third example is the application of controlled gate networks to the controlled time evolution of a free nucleon on a three-dimensional lattice. For all of the examples, we show very substantial reductions in the number of two-qubit gates required. Our work demonstrates that controlled gate networks are a useful tool for reducing gate complexity in quantum algorithms for quantum many-body problems such as those relevant to nuclear physics.

Bee-Lindgren, Max [Georgia Institute of Technology↗

Individual addressing of trapped {sup 171}Yb{sup +} ion qubits using a microelectromechanical systems-based beam steering system

The ability to individually manipulate the increasing number of qubits is one of the many challenges towards scalable quantum information processing with trapped ions. Using micro-mirrors fabricated with micro-electromechanical systems technology, we focus laser beams on individual ions in a linear chain and steer the focal point in two dimensions. We demonstrate sequential single qubit gates on multiple {sup 171}Yb{sup +} qubits and characterize the gate performance using quantum state tomography. Our system features negligible crosstalk to neighboring ions (<3×10{sup −4}), and switching speed comparable to typical single qubit gate times (<2 μs)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Proposed spin-qubit controlled-not gate robust against noisy coupling

We propose an implementation of the two-qubit gate in a quantum dot spin qubit system which is immune to charge noise problems. Our proposed implementation, if it could be realized in a physical system, would have the advantage of being robust against uncertainties and fluctuations in the tunnel coupling and barrier gate voltage pulse area. The key idea is to introduce an auxiliary dot and use an analog to the stimulated Raman adiabatic passage pulse sequence in three-level atomic systems, often referred to in the context of electron transport in quantum dot systems as Coherent Tunneling by Adiabatic Passage. Spin-dependent tunneling opens the possibility of performing two-qubit gate operations by this method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Generalized Toffoli gates using qudit catalysis

We present quantum networks for a n-qubit controlled gate C{sup n-1}(U) which use a higher-dimensional (qudit) ancilla as a catalyzer. In its simplest form the network has only n two-particle gates (qubit-qudit)--this is the minimum number of two-body interactions needed to couple all n+1 subsystems (n qubits plus one ancilla). This class of controlled gates includes the generalized Toffoli gate C{sup n-1}(X) on n qubits, which plays an important role in several quantum algorithms and error correction. A particular example implementing this model is given by the dispersive limit of a generalized Jaynes-Cummings Hamiltonian of an effective spin s interacting with a cavity mode.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

LuGo: An enhanced quantum phase estimation implementation

Quantum Phase Estimation (QPE) is a cardinal algorithm in quantum computing that plays a crucial role in various applications, including cryptography, molecular simulation, and solving systems of linear equations. However, the standard implementation of QPE faces challenges related to time complexity and circuit depth, which limit its practicality for large-scale computations. We introduce LuGo, a novel framework designed to enhance the performance of QPE by reducing circuit duplication, as well as using parallelization techniques to achieve faster generation of the QPE circuit and gate reduction. We validate the effectiveness of our framework by generating quantum linear solver circuits, which require both QPE and inverse QPE, to solve linear systems of equations. LuGo achieves significant improvements in both computational efficiency and hardware requirements without compromising on accuracy. Compared to a standard QPE implementation, LuGo reduces time consumption to generate a circuit that solves a 2 6 × 2 6 system matrix by a factor of 50.68 and over 31× reduction of quantum gates and circuit depth, with no fidelity loss on an ideal quantum simulator. Furthermore, we demonstrated the versatility and scalability of LuGo enabled HHL algorithm by simulating a canonical Hele-Shaw fluid problem using a quantum simulator. With these advantages, LuGo paves the way for more efficient implementations of QPE, enabling broader applications across several quantum computing domains.

Quantum algorithm↗