Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “error correction”

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 811 records · Page 45

Onset of Scrambling as a Dynamical Transition in Tunable-Range Quantum Circuits

In a fast-scrambling many-body quantum system, information is spread and entanglement is built up on a time scale that grows logarithmically with the system size. This is of fundamental interest in understanding the dynamics of many-body systems, as well as in efficiently producing entangled resource states and error-correcting codes. In this work, we identify a dynamical transition marking the onset of scrambling in quantum circuits with different levels of long-range connectivity. In particular, we show that as a function of the interaction range for circuits of different structures, the tripartite mutual information exhibits a scaling collapse around a critical point between two clearly defined regimes of different dynamical behavior. We study this transition analytically in a related long-range Brownian-circuit model and show how the transition can be mapped onto the statistical mechanics of a long-range Ising model in a particular region of parameter space. This mapping predicts mean-field critical exponents v=–1/(1 + s c ), which are consistent with the critical exponents extracted from Clifford-circuit numerics. In addition to systems with conventional power-law interactions, we identify the same phenomenon in deterministic sparse circuits that can be realized in experiments with neutral-atom arrays.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Engineering 3D Floquet Codes by Rewinding

Floquet codes are a novel class of quantum error-correcting codes with dynamically generated logical qubits arising from a periodic schedule of noncommuting measurements. We utilize the interpretation of measurements in terms of condensation of topological excitations and the rewinding of measurement sequences to engineer new examples of Floquet codes. In particular, rewinding is advantageous for obtaining a desired set of instantaneous stabilizer groups on both toric and planar layouts. Our first example is a Floquet code with instantaneous stabilizer codes that have the same topological order as the three-dimensional (3D) toric code(s). This Floquet code also exhibits a splitting of the topological order of the 3D toric code under the associated sequence of measurements, i.e., an instantaneous stabilizer group of a single copy of the 3D toric code in one round transforms into an instantaneous stabilizer group of two copies of the 3D toric code up to nonlocal stabilizers in the following round. We further construct boundaries for this 3D code and argue that stacking it with two copies of the 3D subsystem toric code allows for a transversal implementation of the logical non-Clifford controlled-controlled- Z gate. We also show that the coupled-layer construction of the X-cube Floquet code can be modified by a rewinding schedule such that each of the instantaneous stabilizer codes is finite depth equivalent to the X-cube model up to toric codes; the X-cube Floquet code exhibits a splitting of the X-cube model into a copy of the X-cube model and toric codes under the measurement sequence. Our final 3D example is a generalization of the 2D Floquet toric code on the honeycomb lattice to three dimensions, which has instantaneous stabilizer codes with the same topological order as the 3D fermionic toric code. Published by the American Physical Society2024

Physics↗

Extracting Topological Orders of Generalized Pauli Stabilizer Codes in Two Dimensions

In this paper, we introduce an algorithm for extracting topological data from translation invariant generalized Pauli stabilizer codes in two-dimensional systems, focusing on the analysis of anyon excitations and string operators. The algorithm applies to Z d qudits, including instances where d is a nonprime number. This capability allows the identification of topological orders that differ from the Z d toric codes. It extends our understanding beyond the established theorem that Pauli stabilizer codes for Z p qudits (with p being a prime) are equivalent to finite copies of Z p toric codes and trivial stabilizers. The algorithm is designed to determine all anyons and their string operators, enabling the computation of their fusion rules, topological spins, and braiding statistics. The method converts the identification of topological orders into computational tasks, including Gaussian elimination, the Hermite normal form, and the Smith normal form of truncated Laurent polynomials. Furthermore, the algorithm provides a systematic approach for studying quantum error-correcting codes. We apply it to various codes, such as self-dual CSS quantum codes modified from the two-dimensional honeycomb color code and non-CSS quantum codes that contain the double semion topological order or the six-semion topological order. Published by the American Physical Society 2024

Physics↗

Spectroscopic Measurements and Models of Energy Deposition in the Substrate of Quantum Circuits by Natural Ionizing Radiation

Naturally occurring background radiation is a potential source of correlated decoherence events in superconducting qubits that will challenge error-correction schemes. In order to characterize the radiation environment in an unshielded laboratory representative of superconducting qubits’ environments, we performed broadband, spectroscopic measurements of background radiation events inside a millikelvin refrigerator. The spectrometer was designed to mimic the size and composition of a quantum circuit. Specifically, we measured the background radiation spectra in silicon substrates of two thicknesses, 500 and 1500 µm, and one area, 25 mm 2 . The observed spectra span energies from a few kilo-electron-volts up to nearly 10 MeV, are nearly featureless, and decrease in intensity by a factor of 40 000 between 100 keV and 3 MeV for the 500-µm substrate. We integrate the spectra to obtain the average event rates and deposited power levels. These quantities correspond to a rate of 0.023 events per second and a power of 4.9 keV s -1 , when counting events that deposit at least 40 keV for the 500-µm-thick substrate. We find that the cryogenic measurements are in good agreement with predictions based on simple measurements of the terrestrial gamma-ray flux outside the refrigerator, published models of cosmic-ray fluxes, a crude model of the cryostat, and radiation-transport simulations. This model requires no free parameters to predict the background radiation spectra in the silicon substrates. The agreement between measurements and predictions demonstrates that the model we present can be used to assess the relative contributions of terrestrial and cosmic-ray sources to background radiation interactions in silicon substrates of varying thickness. These spectroscopic measurements are performed with a novel combination of superconducting microresonators located on micromachined silicon islands that define the interaction volume with background radiation. The resonators transduce deposited energy to a readily detectable electrical signal. Microresonator readout closely resembles dispersive superconducting qubit readout, so similar devices—with or without micromachined islands—are suitable for integration with superconducting quantum circuits as detectors for background radiation events. For our specific laboratory conditions, we find that gamma-ray emissions from radioisotopes are responsible for the majority of events that deposit E < 1 ⁢Me⁢V. We present results demonstrating that the background radiation spectrum contains relevant contributions from cosmic-ray particles other than muons, particularly a tail of multi-mega-electron-volt events due to protons and neutrons. These observations suggest several paths to reducing the impact of background radiation on quantum circuits, supported by an empirically validated model for generating reliable predictions of radiation interactions with silicon substrates.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Flag Gadgets Based on Classical Codes

Fault-tolerant syndrome extraction is a key ingredient in implementing fault-tolerant quantum computation. While conventional methods use a number of extra qubits that are linear in the weight of the syndrome, several improvements have been introduced using flag gadgets. In this work, we develop a framework to design flag gadgets using classical codes. Using this framework, we show how to perform fault-tolerant syndrome extraction for any stabilizer code with arbitrary distance using exponentially fewer qubits than conventional methods when qubit measurement and reset are relatively slow compared to a round of error correction. In particular, our method requires only ( 2 t + 1 ) t ⌈ log 2 ( w ) ⌉ flag qubits to fault-tolerantly measure a weight- w stabilizer. We further take advantage of the saving provided by our construction to fault-tolerantly measure multiple stabilizers using a single gadget and show that it maintains the same exponential advantage when it is used to fault-tolerantly extract the syndromes of quantum low-density parity-check codes. Using the developed framework, we perform computer-assisted search to find several small examples where our constructions reduce the number of qubits required. These small examples may be relevant to near-term experiments on small-scale quantum computers. Published by the American Physical Society 2024

Anker, Benjamin↗

Practical Introduction to Benchmarking and Characterization of Quantum Computers

Rapid progress in quantum technology has transformed quantum computing and quantum information science from theoretical possibilities into tangible engineering challenges. Breakthroughs in quantum algorithms, quantum simulations, and quantum error correction are bringing useful quantum computation closer to fruition. These remarkable achievements have been facilitated by advances in quantum characterization, verification, and validation (QCVV). QCVV methods and protocols enable scientists and engineers to scrutinize, understand, and enhance the performance of quantum information-processing devices. In this tutorial, we review the fundamental principles underpinning QCVV, and introduce a diverse array of QCVV tools used by quantum researchers. We define and explain QCVV’s core models and concepts—quantum states, measurements, and processes—and illustrate how these building blocks are leveraged to examine a target system or operation. We survey and introduce protocols ranging from simple qubit characterization to advanced benchmarking methods. Along the way, we provide illustrated examples and detailed descriptions of the protocols, highlight the advantages and disadvantages of each, and discuss their potential scalability to future large-scale quantum computers. This tutorial serves as a guidebook for researchers unfamiliar with the benchmarking and characterization of quantum computers, and also as a detailed reference for experienced practitioners.

open quantum systems & decoherence↗

Noisy intermediate-scale quantum algorithms

A universal fault-tolerant quantum computer that can efficiently solve problems such as integer factorization and unstructured database search requires millions of qubits with low error rates and long coherence times. While the experimental advancement toward realizing such devices will potentially take decades of research, noisy intermediate-scale quantum (NISQ) computers already exist. These computers are composed of hundreds of noisy qubits, i.e., qubits that are not error corrected, and therefore perform imperfect operations within a limited coherence time. In the search for achieving quantum advantage with these devices, algorithms have been proposed for applications in various disciplines spanning physics, machine learning, quantum chemistry, and combinatorial optimization. The overarching goal of such algorithms is to leverage the limited available resources to perform classically challenging tasks. In this review, a thorough summary of NISQ computational paradigms and algorithms is provided. The key structure of these algorithms and their limitations and advantages are discussed. Finally, a comprehensive overview of various benchmarking and software tools useful for programming and testing NISQ devices is additionally provided.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Clifford transformations for fermionic quantum systems: From Pauli and Majorana operators to Dirac fermions

Clifford gates and transformations, which map products of elementary Pauli or Majorana operators to other such products, are foundational in quantum computing, underpinning the stabilizer formalism, error-correcting codes, magic state distillation, quantum communication and cryptography, and qubit tapering. Moreover, circuits composed entirely of Clifford gates are classically simulatable, highlighting their computational significance. In this article we extend the concept of Clifford transformations to Dirac fermions. We demonstrate that discrete Clifford transformations are generated by half-body and pair operators while continuous Clifford transformations are generated by number operators, providing a systematic framework for their characterization. Additionally, we establish connections with fermionic mean-field theories and applications in qubit tapering, offering insights into their broader implications in quantum computing.

74 ATOMIC AND MOLECULAR PHYSICS↗

Understanding the Interplay between Hardware Errors and User Job Characteristics on the Titan Supercomputer

Designing dependable supercomputers begins with an understanding of errors in real-world, large-scale systems. The Titan supercomputer at Oak Ridge National Laboratory provides a unique opportunity to investigate errors when an actual system is actively used by multiple concurrent users and workloads from diverse domains at varying scales. This study presents a thorough analysis of 6, 908, 497 hardware errors from 18, 688 compute nodes of Titan for 312, 215 user jobs over a 3-year time period. Through careful joining of two system logs – the Machine Check Architecture (MCA) log and the job scheduler log – we show the correlated pattern of hardware errors for each job and user, in addition to individual descriptive statistics of errors, jobs, and users. Since the majority of hardware errors are memory errors, this study also shows the importance of error correcting in memory systems.

Lim, Seung-Hwan↗

Adapting Quantum Approximation Optimization Algorithm (QAOA) for Unit Commitment

In the present Noisy Intermediate-Scale Quantum (NISQ), hybrid algorithms that leverage classical resources to reduce quantum costs are particularly appealing. We formulate and apply such a hybrid quantum-classical algorithm to a power system optimization problem called Unit Commitment, which aims to satisfy a target power load at minimal cost. Our algorithm extends the Quantum Approximation Optimization Algorithm (QAOA) with a classical minimizer in order to support mixed binary optimization. Using Qiskit, we simulate results for sample systems to validate the effectiveness of our approach. Here, we also compare to purely classical methods. Our results indicate that classical solvers are effective for our simulated Unit Commitment instances with fewer than 400 power generation units. However, for larger problem instances, the classical solvers either scale exponentially in runtime or must resort to coarse approximations. This opens the door to potential quantum advantage for systems with several hundred units, though quantum error correction may be necessary at this scale.

42 ENGINEERING↗

Implementation of a level 1 trigger system using high speed serial (VXS) techniques for the 12GeV high luminosity experimental programs at Thomas Jefferson National Accelerator Facility

We will demonstrate a hardware and firmware solution for a complete fully pipelined multi-crate trigger system that takes advantage of the elegant high speed VXS serial extensions for VME. This trigger system includes three sections starting with the front end crate trigger processor (CTP), a global Sub-System Processor (SSP) and a Trigger Supervisor that manages the timing, synchronization and front end event readout. Within a front end crate, trigger information is gathered from each 16 Channel, 12 bit Flash ADC module at 4 nS intervals via the VXS backplane, to a Crate Trigger Processor (CTP). Each Crate Trigger Processor receives these 500 MB/S VXS links from the 16 FADC-250 modules, aligns skewed data inherent of Aurora protocol, and performs real time crate level trigger algorithms. The algorithm results are encoded using a Reed-Solomon technique and transmission of this Level 1 trigger data is sent to the SSP using a multi-fiber link. The multi-fiber link achieves an aggregate trigger data transfer rate to the global trigger at 8 Gb/s. The SSP receives and decodes Reed-Solomon error correcting transmission from each crate, aligns the data, and performs the global level trigger algorithms. The entire trigger system is synchronous and operates at 250 MHz with the Trigger Supervisor managing not only the front end event readout, but also the distribution of the critical timing clocks, synchronization signals, and the global trigger signals to each front end readout crate. These signals are distributed to the front end crates on a separate fiber link and each crate is synchronized using a unique encoding scheme to guarantee that each front end crate is synchronous with a fixed latency, independent of the distance between each crate. The overall trigger signal latency is <3 uS, and the proposed 12GeV experiments at Jefferson Lab require up to 200KHz Level 1 trigger rate.

43 PARTICLE ACCELERATORS↗

Scalable Deep Learning-Based Microarchitecture Simulation on GPUs

Cycle-accurate microarchitecture simulators are essential tools for designers to architect, estimate, optimize, and manufacture new processors that meet specific design expectations. However, conventional simulators based on discrete-event methods often require an exceedingly long time-to-solution for the simulation of applications and architectures at full complexity and scale. Given the excitement around wielding the machine learning (ML) hammer to tackle various architecture problems, there have been attempts to employ ML to perform architecture simulations, such as Ithemal and SimNet. However, the direct application of existing ML approaches to architecture simulation may be even slower due to overwhelming memory traffic and stringent sequential computation logic. This work proposes the first graphics processing unit (GPU)-based microarchitecture simulator that fully unleashes the potential of GPUs to accelerate state-of-the-art ML-based simulators. First, considering the application traces are loaded from central processing unit (CPU) to GPU for simulation, we introduce various designs to reduce the data movement cost between CPUs and GPUs. Second, we propose a parallel simulation paradigm that partitions the application trace into sub-traces to simulate them in parallel with rigorous error analysis and effective error correction mechanisms. Combined, this scalable GPU-based simulator outperforms by orders of magnitude the traditional CPU-based simulators and the state-of-the-art ML-based simulators, i.e., SimNet and Ithemal.

97 MATHEMATICS AND COMPUTING↗

YBCO-on-Kapton: Material for High-Density Quan-tum Computer Interconnects with Ultra-Low Thermal Conductance

Development of practical quantum computers would require 1000's of qubits and equally large number of read-outs, bias and drive lines. New materials that combine low passive loss and good RF properties are needed. In this study we report performance of signal interconnects comprised of high-temperature YBCO films that are exfoliated from a metal substrate and transferred to a E-Kapton tape. The technology offers low-loss transition be-tween 60 K to sub-mK environments and interfacing with off-shelf flexible silicon electronics. We demonstrate < 1 dB/m at-tenuation at 6 GHz at 77 K. The microstrip assemblies demon-strated no degradation upon multiple cycles to liquid Nitrogen and conduction cooling down to 18 K. We discuss designs of a practical high-density signal cable with passive heat load well below 1 μW per line. The YBCO-on-Kapton technology offers a practical pathway to large error-corrected quantum computing systems.

47 OTHER INSTRUMENTATION↗

Geometric Structure and Transversal Logic of Quantum Reed–Muller Codes

Designing efficient and noise-tolerant quantum computation protocols generally begins with an understanding of quantum error-correcting codes and their native logical operations. The simplest class of native operations are transversal gates, which are naturally fault-tolerant. Here, in this paper, we aim to characterize the transversal gates of quantum Reed–Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. We start our work by establishing a new geometric characterization of quantum RM codes via the Boolean hypercube and its associated subcube complex. More specifically, a set of stabilizer generators for a quantum RM code can be described via transversal X and Z operators acting on subcubes of particular dimensions. This characterization leads us to define subcube operators composed of single-qubit π/2 k Z -rotations that act on subcubes of given dimensions. We first characterize the action of subcube operators on the code space: depending on the dimension of the subcube, these operators either (1) act as a logical identity on the code space, (2) implement non-trivial logic, or (3) rotate a state away from the code space. Second, and more remarkably, we uncover that the logic implemented by these operators corresponds to circuits of multi-controlled-Z gates that have an explicit and simple combinatorial description. Overall, this suite of results yields a comprehensive understanding of a class of natural transversal operators for quantum RM codes.

Reed–Muller (RM) codes↗

InterQnet: A Heterogeneous Full-Stack Approach to Co-Designing Scalable Quantum Networks

Quantum communications have progressed significantly, moving from a theoretical concept to small-scale experiments to recent metropolitan-scale demonstrations. As the technology matures, it is expected to revolutionize quantum computing in much the same way that classical networks revolutionized classical computing. Quantum communications will also enable breakthroughs in quantum sensing, metrology, and other areas. However, scalability has emerged as a major challenge, particularly in terms of the number and heterogeneity of nodes, the distances between nodes, the diversity of applications, and the scale of user demand. This article describes InterQnet, a multidisciplinary project that advances scalable quantum communications through a comprehensive approach that improves devices, error handling, and network architecture. InterQnet has a two-pronged strategy to address scalability challenges: InterQnet-Achieve focuses on practical realizations of heterogeneous quantum networks by building and then integrating first-generation quantum repeaters with error mitigation schemes and centralized automated network control systems. The resulting system will enable quantum communications between two heterogeneous quantum platforms through a third type of platform operating as a repeater node. InterQnet-Scale focuses on a systems study of architectural choices for scalable quantum networks by developing forward-looking models of quantum network devices, advanced error correction schemes, and entanglement protocols. Here, we report our current progress toward achieving our scalability goals.

Chung, Joaquin [Argonne] (ORCID:0000000173833810)↗

The first two chromosome‐scale genome assemblies of American hazelnut enable comparative genomic analysis of the genus Corylus

Summary The native, perennial shrub American hazelnut ( Corylus americana ) is cultivated in the Midwestern United States for its significant ecological benefits, as well as its high‐value nut crop. Implementation of modern breeding methods and quantitative genetic analyses of C. americana requires high‐quality reference genomes, a resource that is currently lacking. We therefore developed the first chromosome‐scale assemblies for this species using the accessions ‘Rush’ and ‘Winkler’. Genomes were assembled using HiFi PacBio reads and Arima Hi‐C data, and Oxford Nanopore reads and a high‐density genetic map were used to perform error correction. N50 scores are 31.9 Mb and 35.3 Mb, with 90.2% and 97.1% of the total genome assembled into the 11 pseudomolecules, for ‘Rush’ and ‘Winkler’, respectively. Gene prediction was performed using custom RNAseq libraries and protein homology data. ‘Rush’ has a BUSCO score of 99.0 for its assembly and 99.0 for its annotation, while ‘Winkler’ had corresponding scores of 96.9 and 96.5, indicating high‐quality assemblies. These two independent assemblies enable unbiased assessment of structural variation within C. americana , as well as patterns of syntenic relationships across the Corylus genus. Furthermore, we identified high‐density SNP marker sets from genotyping‐by‐sequencing data using 1343 C. americana , C. avellana and C. americana × C. avellana hybrids, in order to assess population structure in natural and breeding populations. Finally, the transcriptomes of these assemblies, as well as several other recently published Corylus genomes, were utilized to perform phylogenetic analysis of sporophytic self‐incompatibility (SSI) in hazelnut, providing evidence of unique molecular pathways governing self‐incompatibility in Corylus .

54 ENVIRONMENTAL SCIENCES↗

SU-E-J-64: Feasibility Study of Surgical Clips for Fiducial Tracking in CyberKnife System

Purpose: To investigate the ability of CyberKnife to track surgical clips used as fiducial markers. Methods: The Octavius 1000SRS detector and solid water (RW3) slab phantom were used with motion platform to evaluate the study. The RW3 slab phantom was set up to measure the dose distribution from coronal plane. It consists of 9 plates and the thickness of each plate is 10mm. Among them, one plate was attached with 3 surgical clips, which are orthogonally positioned on outer region of array. The length of attached clip was represented as 1cm on planning CT. The clip plate was placed on the 1000SRS detector and 3 slabs were stacked up on the plate to build the measuring depth. Below the detector, 5 slabs were set. The two-axis motion platform was programmed with 1D sinusoidal movement (20mm peak-to-peak, 3s period) toward superior/inferior and left/right directions to simulate target motion. During delivery, two clips were extracted by two X-ray imagers, which led to translational error correction only. Synchrony was also used for dynamic tracking. After the irradiation, the measured dose distribution of coronal plane was compared with the planar dose distribution calculated by the CyberKnife treatment planning system (Multiplan) for cross verification. The results were assessed by comparing the absolute Gamma (γ) index. Results: The dose distributions measured by the 1000SRS detector were in good agreements with those calculated by Multiplan. In the dosimetric comparison using γ-function criteria based on the distance-to-agreement of 3mm and the local dose difference of 3%, the passing rate with γ- parameter ≤1 was 91% in coronal plane. Conclusion: The surgical clips can be considered as new fiducials for robotic radiosurgery delivery by considering the target margin with less than 5mm.

60 APPLIED LIFE SCIENCES↗