Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quantum computing”

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 1,063 records · Page 59

Mitigation of Cosmic Rays-Induced Errors in Superconducting Quantum Processors

Environmental radioactivity and cosmic-rays have recently been identified as a source of decoherence in super-conducting quantum bits (qubits). In particular, the absorption of cosmic-ray muons and gamma rays emitted by naturally occurring radioactive isotopes in the qubit substrate leads to correlated errors in superconducting quantum processors, posing significant challenges to quantum error correction. To enable quantum computing to scale, it is therefore necessary the devel-opment of mitigation strategies to prevent, or keep under control, error bursts due to particle impacts in the chip. While most environmental radioactive sources can be effectively suppressed using dedicated shielding, cosmic-ray muons, with their high penetration capability, can only be mitigated by moving the entire facility in a deep underground laboratory. This work explores the potential for developing a novel class of quantum processors equipped with an active veto system to protect superconducting-based quantum computers from the detrimental effects of atmospheric muons. Such a device would enable the identification of an atmospheric muon interaction within the processor and veto all operations performed during the occurrence of such an interaction. By demonstrating high detection efficiency and negligible dead time, we aim to establish that the future of quantum processors can be envisioned in above-around facilities.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Ablation loading of barium ions into a surface-electrode trap

Trapped-ion quantum information processing may benefit from qubits encoded in isotopes that are practically available in only small quantities, e.g., due to low natural abundance or radioactivity. Laser ablation provides a method of controllably liberating neutral atoms or ions from low-volume targets, but energetic ablation products can be difficult to confine in the small ion-electrode distance, micron-scale microfabricated traps amenable to high-speed, high-fidelity manipulation of ion arrays. Here, we investigate ablation-based ion loading into surface-electrode traps of different sizes to test a model describing ion loading probability as a function of effective trap volume and other trap parameters. We characterize loading of ablated barium from a metallic source in two cryogenic surface-electrode traps with 730 and 50 μm ion-electrode distances. Furthermore, our loading rate agrees with a predictive analytical model, providing insight for the confinement of limited-quantity species of interest for quantum computing, simulation, and sensing.

74 ATOMIC AND MOLECULAR PHYSICS↗

Variational Quantum Linear Solver

Previously proposed quantum algorithms for solving linear systems of equations cannot be implemented in the near term due to the re quired circuit depth. Here, we propose a hybrid quantum-classical algorithm, called Variational Quantum Linear Solver (VQLS), for solving linear systems on near-term quantum computers. VQLS seeks to variationally prepare |x$\rangle$ such that A|x$\rangle$ ∝ |b$\rangle$. We derive an operationally meaningful termination condition for VQLS that allows one to guarantee that a desired solution precision ϵ is achieved. Specifically, we prove that C $⩾$ ϵ 2 /κ 2 , where C is the VQLS cost function and κ is the condition number of A. We present efficient quantum circuits to estimate C, while providing evidence for the classical hardness of its estimation. Using Rigetti’s quantum computer, we success fully implement VQLS up to a problem size of 1024 × 1024. Finally, we numerically solve nontrivial problems of size up to 2 50 × 2 50 . For the specific examples that we consider, we heuristically find that the time complexity of VQLS scales efficiently in ϵ, κ, and the system size N.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Chemical Computation of Omicron Mutations Near Cleavage Sites of the Spike Protein

The attachment of the spike protein in SARS-CoV-2 to host cells and the initiation of viral invasion are two critical processes in the viral infection and transmission in which the presence of unique furin (S1/S2) and TMPRSS2 (S2') cleavage sites play a pivotal role. We provide a detailed analysis of the impact of the BA.1 Omicron mutations vicinal to these cleavage sites using a novel computational method based on the amino acid–amino acid bond pair unit (AABPU), a specific protein structural unit as a proxy for quantifying the atomic interaction. Our study is focused mainly on the spike region between subdomain 2 (SD2) and the central helix (CH), which contains both S1/S2 and S2' cleavage sites. Based on ab initio quantum calculations, we have identified several key features related to the electronic structure and bonding of the Omicron mutations that significantly increase the size of the relevant AABPUs and the positive charge. These findings enable us to conjecture on the biological role of Omicron mutations and their specific effects on cleavage sites and identify the principles that can be of some value in analyzing new variants.

60 APPLIED LIFE SCIENCES↗

LUNA: LUT-Based Neural Architecture for Fast and Low-Cost Qubit Readout

Qubit readout is a critical operation in quantum computing systems, which maps the analog response of qubits into discrete classical states. Deep neural networks (DNNs) have recently emerged as a promising solution to improve readout accuracy . Prior hardware implementations of DNN-based readout are resource-intensive and suffer from high inference latency, limiting their practical use in low-latency decoding and quantum error correction (QEC) loops. This paper proposes LUNA, a fast and efficient superconducting qubit readout accelerator that combines low-cost integrator-based preprocessing with Look-Up Table (LUT) based neural networks for classification. The architecture uses simple integrators for dimensionality reduction with minimal hardware overhead, and employs LogicNets (DNNs synthesized into LUT logic) to drastically reduce resource usage while enabling ultra-low-latency inference. We integrate this with a differential evolution based exploration and optimization framework to identify high-quality design points. Our results show up to a 10.95x reduction in area and 30% lower latency with little to no loss in fidelity compared to the state-of-the-art. LUNA enables scalable, low-footprint, and high-speed qubit readout, supporting the development of larger and more reliable quantum computing systems.

Farooq, M. A. [Arizona State U., Tempe]↗

Experimental Measurement of Out-of-Time-Ordered Correlators at Finite Temperature

Out-of-time-ordered correlators (OTOCs) are a key observable in a wide range of interconnected fields including many-body physics, quantum information science, and quantum gravity. Measuring OTOCs using near-term quantum simulators will extend our ability to explore fundamental aspects of these fields and the subtle connections between them. Here, we demonstrate an experimental method to measure OTOCs at finite temperatures and use the method to study their temperature dependence. These measurements are performed on a digital quantum computer running a simulation of the transverse field Ising model. Our flexible method, based on the creation of a thermofield double state, can be extended to other models and enables us to probe the OTOC’s temperature-dependent decay rate. Measuring this decay rate opens up the possibility of testing the fundamental temperature-dependent bounds on quantum information scrambling.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adaptively controlled fast production of defect-free beryllium ion crystals using pulsed laser ablation

Trapped atomic ions find wide applications ranging from precision measurement to quantum information science and quantum computing. Beryllium ions are widely used due to the light mass and convenient atomic structure of beryllium; however, conventional ion loading from thermal ovens exerts undesirable gas loads for a prolonged duration. Here, we demonstrate a method to rapidly produce pure linear chains of beryllium ions with pulsed laser ablation, serving as a starting point for large-scale quantum information processing. Our method is fast compared to thermal ovens, reduces the gas load to only 10 -12 Torr (10 -10 Pa) level, yields a short recovery time of a few seconds, and also eliminates the need for a deep ultraviolet laser for photoionization. We also study the loading dynamics, which show non-Poissonian statistics in the presence of sympathetic cooling. In addition, we apply feedback control to obtain defect-free ion chains with desirable lengths.

47 OTHER INSTRUMENTATION↗

Fast-forwarding quantum simulation with real-time quantum Krylov subspace algorithms

Quantum subspace diagonalization (QSD) algorithms have emerged as a competitive family of algorithms that avoid many of the optimization pitfalls associated with parameterized quantum circuit algorithms. While the vast majority of the QSD algorithms have focused on solving the eigenpair problem for ground, excited-state, and thermal observable estimation, there has been a lot less work in considering QSD algorithms for the problem of quantum dynamical simulation. In this work, we propose several quantum Krylov fast-forwarding (QKFF) algorithms capable of predicting long-time dynamics well beyond the coherence time of current quantum hardware. Our algorithms use real-time evolved Krylov basis states prepared on the quantum computer and a multi-reference subspace method to ensure convergence towards high-fidelity, long-time dynamics. In particular, we show that the proposed multi-reference methodology provides a systematic way of trading off circuit depth with classical post-processing complexity. Further, we also demonstrate the efficacy of our approach through numerical implementations for several quantum chemistry problems including the calculation of the auto-correlation and dipole moment correlation functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Diagonal state designs with reconfigurable real-time circuits

Unitary designs are widely used in quantum computation, but in many practical settings it suffices to construct a diagonal state design generated with unitary gates diagonal in the computational basis. In this work, we introduce a simple and efficient diagonal state 3-design based on real-time evolutions under 2-local Hamiltonians. Our construction is inspired by the classical Girard-Hutchinson trace estimator in that it involves the stochastic preparation of many random-phase states. Though the exact Girard-Hutchinson states are not tractably implementable on a quantum computer, we can construct states that match the statistical moments of the Girard-Hutchinson states with real-time evolution. Importantly, our random states are all generated using the same Hamiltonians for real-time evolution, with the randomness arising solely from stochastic variations in the durations of the evolutions. In this sense, the circuit is fully reconfigurable and thus suited for near-term realizations on both digital and analog platforms. Moreover, we show how to extend our construction to achieve diagonal state designs of arbitrarily high order.

Shen, Yizhi [LBL, Berkeley] (ORCID:000000024160548↗

Quantum information processing with majorana bound states in superconducting circuits

In a weak link of two s-wave superconductors (SCs) coupled via a time-reversal-invariant (TRI) topological superconducting (TSC) island, a Josephson current can flow due to Cooper pairs tunneling in and out of spatially separated Majorana Kramers pairs (MKPs), which are doublets of Majorana bound states (MBSs). The sign of the resulting Josephson current is fixed by the joint parity of the four Majorana bound states that make up the MKPs on the TSC island. This parity-controlled Josephson effect can be used as a read-out mechanism for the joint parity in Majorana-based quantum computing. For a TSC island with four terminals, the SC leads can address a Majorana superconducting qubit (MSQ) formed by the charge ground states of the TSC island's terminals. Cooper pair splitting enables single-qubit operations, qubit read-out, as well as two-qubit entangling gates. Hence, TSC islands between SC leads may provide an alternative approach to superconducting quantum computation.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Fast-forwarding quantum evolution

We investigate the problem of fast-forwarding quantum evolution, whereby the dynamics of certain quantum systems can be simulated with gate complexity that is sublinear in the evolution time. We provide a definition of fast-forwarding that considers the model of quantum computation, the Hamiltonians that induce the evolution, and the properties of the initial states. Our definition accounts for any asymptotic complexity improvement of the general case and we use it to demonstrate fast-forwarding in several quantum systems. In particular, we show that some local spin systems whose Hamiltonians can be taken into block diagonal form using an efficient quantum circuit, such as those that are permutation-invariant, can be exponentially fast-forwarded. We also show that certain classes of positive semidefinite local spin systems, also known as frustration-free, can be polynomially fast-forwarded, provided the initial state is supported on a subspace of sufficiently low energies. Last, we show that all quadratic fermionic systems and number-conserving quadratic bosonic systems can be exponentially fast-forwarded in a model where quantum gates are exponentials of specific fermionic or bosonic operators, respectively. Our results extend the classes of physical Hamiltonians that were previously known to be fast-forwarded, while not necessarily requiring methods that diagonalize the Hamiltonians efficiently. We further develop a connection between fast-forwarding and precise energy measurements that also accounts for polynomial improvements.

97 MATHEMATICS AND COMPUTING↗

Quantum simulation of nonequilibrium dynamics and thermalization in the Schwinger model

In this work, we present simulations of nonequilibrium dynamics of quantum field theories on digital quantum computers. As a representative example, we consider the Schwinger model, a (1+1)-dimensional U(1) gauge theory, coupled through a Yukawa-type interaction to a thermal environment described by a scalar field theory. We use the Hamiltonian formulation of the Schwinger model discretized on a spatial lattice. With the thermal scalar fields traced out, the Schwinger model can be treated as an open quantum system and its real-time dynamics are governed by a Lindblad equation in the Markovian limit. The interaction with the environment ultimately drives the system to thermal equilibrium. In the quantum Brownian motion limit, the Lindblad equation is related to a field theoretical Caldeira-Leggett equation. By using the Stinespring dilation theorem with ancillary qubits, we perform studies of both the nonequilibrium dynamics and the preparation of a thermal state in the Schwinger model using IBM's simulator and quantum devices. The real-time dynamics of field theories as open quantum systems and the thermal state preparation studied here are relevant for a variety of applications in nuclear and particle physics, quantum information and cosmology.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Benchmark Testing on the IBM-Q Network

The goal of this project is to evaluate a proposed set of candidate benchmarks being developed by the Standards and Performance Metrics Technical Advisory Group (TAG) of the Quantum Economic Development Consortium (QED-C), of which LANL is a member. The QED-C Standards and Performance Metrics TAG has developed implementations of several benchmark codes with the hope and expectation that these codes will be helpful to QED-C members interested in investigating various quantum computer platforms. The benchmark set will be run on LANL’s access to the IBM-Q system with the intent to evaluate the set for scalability, correct execution, and coverage of the application space. The goal is for the QED-C Standards and Performance Metrics TAC to be able to produce a coherent, consistent, scalable set of benchmarks that will run on multiple quantum computing platforms and will be available to members of QED-C, including LANL.

97 MATHEMATICS AND COMPUTING↗

Orientation-dependent etching of silicon by fluorine molecules: A quantum chemistry computational study

Anisotropic etching is a widely used process in semiconductor manufacturing, in particular, for micro- and nanoscale texturing of silicon surfaces for black silicon production. The typical process of plasma-assisted etching uses energetic ions to remove materials in the vertical direction, creating anisotropic etch profiles. Plasmaless anisotropic etching, considered here, is a less common process that does not use ions and plasma. The anisotropy is caused by the unequal etching rates of different crystal planes; the etching process, thus, proceeds in a preferred direction. In this paper, we have performed quantum chemistry modeling of gas-surface reactions involved in the etching of silicon surfaces by molecular fluorine. The results confirm that orientation-dependent etch rates are the reason for anisotropy. The modeling of F 2 dissociative chemisorption on F-terminated silicon surfaces shows that Si–Si bond breaking is slow for the Si(111) surface, while it is fast for Si(100) and Si(110) surfaces. Both Si(100) and Si(110) surfaces incorporate a larger number of fluorine atoms resulting in Si–Si bonds having a larger amount of positive charge, which lowers the reaction barrier of F 2 dissociative chemisorption, yielding a higher etch rate for Si(100) and Si(110) surfaces compared to Si(111) surfaces. Molecular dynamics modeling of the same reactions has shown that the chosen reactive bond order potential does not accurately reproduce the lower reaction barriers for F 2 dissociative chemisorption on Si(100) and Si(100) surfaces. Furthermore, reparameterization is necessary to model the anisotropic etching process that occurs at lower temperatures.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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↗

Planning for Compilation of a Quantum Algorithm for Graph Coloring

Recently, the problem of compiling general quantum algorithms for implementation on near-term quantum processors has been introduced to the AI community. Previous work demonstrated that temporal planning is an attractive approach for part of this compilation task, specifically, the routing of circuits that implement the Quantum Alternating Operator Ansatz (QAOA) applied to theMaxCut problem on a quantum processor architecture. In this paper, we extend the earlier work to route circuits that implement QAOAfor Graph Coloring problems. QAOA for coloring requires execution of more, and more complex, operations on the chip, which makes routing a more challenging problem. We evaluate the approach on state-of-the-art hardware architectures from leading quantum computing companies. Additionally, we investigate applying the planning approach to qubit initialization as well as routing. Our empirical evaluation shows that temporal planning compares well to reasonable analytic upper bounds [20], and that solving qubit initialization with a classical planner generally helps temporal planners in finding shorter-makespan compilations for QAOA for Graph Coloring.These advances suggest that temporal planning can be an effective approach for more complex quantum computing algorithms and architectures.

Minh Do↗

A Bayesian Approach for Characterizing and Mitigating Gate and Measurement Errors

Various noise models have been developed in quantum computing study to describe the propagation and effect of the noise that is caused by imperfect implementation of hardware. Identifying parameters such as gate and readout error rates is critical to these models. We use a Bayesian inference approach to identify posterior distributions of these parameters such that they can be characterized more elaborately. By characterizing the device errors in this way, we can further improve the accuracy of quantum error mitigation. Experiments conducted on IBM’s quantum computing devices suggest that our approach provides better error mitigation performance than existing techniques used by the vendor. Also, our approach outperforms the standard Bayesian inference method in some scenarios.

97 MATHEMATICS AND COMPUTING↗