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 451 records · Page 25

DropSynth 2.0: high-fidelity multiplexed gene synthesis in emulsions

Abstract Multiplexed assays allow functional testing of large synthetic libraries of genetic elements, but are limited by the designability, length, fidelity and scale of the input DNA. Here, we improve DropSynth, a low-cost, multiplexed method that builds gene libraries by compartmentalizing and assembling microarray-derived oligonucleotides in vortexed emulsions. By optimizing enzyme choice, adding enzymatic error correction and increasing scale, we show that DropSynth can build thousands of gene-length fragments at >20% fidelity.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Corrigendum and addendum. Modeling weakly nonlinear acoustic wave propagation

This article presents errors, corrections, and additions to the research outlined in the following citation: Christov, I., Christov, C. I., & Jordan, P. M. (2007). Modeling weakly nonlinear acoustic wave propagation. The Quarterly Journal of Mechanics and Applied Mathematics, 60(4), 473-495.

97 MATHEMATICS AND COMPUTING↗

CarcSeq Measurement of Rat Mammary Cancer Driver Mutations and Relation to Spontaneous Mammary Neoplasia

Abstract The ability to deduce carcinogenic potential from subchronic, repeat dose rodent studies would constitute a major advance in chemical safety assessment and drug development. This study investigated an error-corrected NGS method (CarcSeq) for quantifying cancer driver mutations (CDMs) and deriving a metric of clonal expansion predictive of future neoplastic potential. CarcSeq was designed to interrogate subsets of amplicons encompassing hotspot CDMs applicable to a variety of cancers. Previously, normal human breast DNA was analyzed by CarcSeq and metrics based on mammary-specific CDMs were correlated with tissue donor age, a surrogate of breast cancer risk. Here we report development of parallel methodologies for rat. The utility of the rat CarcSeq method for predicting neoplastic potential was investigated by analyzing mammary tissue of 16-week-old untreated rats with known differences in spontaneous mammary neoplasia (Fischer 344, Wistar Han, and Sprague Dawley). Hundreds of mutants with mutant fractions ≥ 10−4 were quantified in each strain, most were recurrent mutations, and 42.5% of the nonsynonymous mutations have human homologs. Mutants in the mammary-specific target of the most tumor-sensitive strain (Sprague Dawley) showed the greatest nonsynonymous/synonymous mutation ratio, indicative of positive selection consistent with clonal expansion. For the mammary-specific target (Hras, Pik3ca, and Tp53 amplicons), median absolute deviation correlated with percentages of rats that develop spontaneous mammary neoplasia at 104 weeks (Pearson r = 1.0000, 1-tailed p = .0010). Therefore, this study produced evidence CarcSeq analysis of spontaneously occurring CDMs can be used to derive an early metric of clonal expansion relatable to long-term neoplastic outcome.

McKim, Karen L.↗

Structure of the Ndc80 complex and its interactions at the yeast kinetochore–microtubule interface

The conserved Ndc80 kinetochore complex, Ndc80c, is the principal link between mitotic spindle microtubules and centromere-associated proteins. We used AlphaFold 2 (AF2) to obtain predictions of the Ndc80 ‘loop’ structure and of the Ndc80 : Nuf2 globular head domains that interact with the Dam1 subunit of the heterodecameric DASH/Dam1 complex (Dam1c). The predictions guided design of crystallizable constructs, with structures close to the predicted ones. The Ndc80 ‘loop’ is a stiff, α-helical ‘switchback’ structure; AF2 predictions and positions of preferential cleavage sites indicate that flexibility within the long Ndc80c rod occurs instead at a hinge closer to the globular head. Conserved stretches of the Dam1 C terminus bind Ndc80c such that phosphorylation of Dam1 serine residues 257, 265 and 292 by the mitotic kinase Ipl1/Aurora B can release this contact during error correction of mis-attached kinetochores. We integrate the structural results presented here into our current molecular model of the kinetochore–microtubule interface. The model illustrates how multiple interactions between Ndc80c, DASH/Dam1c and the microtubule lattice stabilize kinetochore attachments.

59 BASIC BIOLOGICAL SCIENCES↗

Constant Overhead Entanglement Distillation via Scrambling

High-fidelity quantum entanglement enables key quantum networking capabilities such as secure communication and distributed quantum computing, but long-distance entanglement distribution is limited by noise and loss. Entanglement distillation protocols address this problem by extracting high-fidelity Bell pairs from multiple noisy ones. The primary objective is minimizing the resource overhead: the number of noisy input pairs needed to distill each high-fidelity output pair. While protocols achieving optimal overhead are known in theory, they often require complex decoding operations that make practical implementation challenging. We circumvent this challenge by introducing protocols that use quantum scrambling—the spreading of quantum information under chaotic dynamics—through random Clifford operations. Based on this scrambling mechanism, our protocol maintains asymptotically constant overhead, independent of the desired output error rate $\bar{𝜖}$ , and can be implemented with shallow quantum circuits of depth 𝑂⁡(poly log log⁡ $\bar{𝜖}$ −1 ) and memory 𝑂⁡(poly log⁡ $\bar{𝜖}$ −1 ). Our protocol remains effective even with noisy quantum gates. By incorporating error correction, our protocol achieves state-of-the-art performance: starting with pairs of 10% initial infidelity, we require only seven noisy inputs per output pair to distill a single Bell pair with infidelity $\bar{𝜖}$ =10 −12 , substantially outperforming existing schemes. We demonstrate the utility of our protocols for quantum repeater networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications

This tutorial offers a pedagogical guide to hybrid quantum processors that integrate discrete-variable (DV) qubits and continuous-variable (CV) oscillators. Aimed at computer scientists, engineers, and physicists, it provides an overview of the experimental, algorithmic, and architectural aspects of this novel and rapidly developing hardware model. Experimental realizations of this model include superconducting, trapped-ion, and neutral-atom platforms. By combining DV and CV components, hybrid oscillator-qubit processors enable a powerful new paradigm that offers complementary strengths for quantum control, error correction, computation, and simulation. Working toward the goal of a full-stack system connecting applications to CV-DV hardware, we define and formulate abstract machine models and instruction set architectures. These essential abstractions enable codesign of hardware and software, and resource estimation for exploring the potential of current and future hardware for computational and simulation tasks. Using these abstractions, we present both new and existing examples that illustrate the benefits of hybrid CV-DV processors relative to traditional DV-only hardware in computation as well as quantum simulation of physical models. Examples include algorithms for transferring states between DV and CV systems, performing the quantum Fourier transform, and simulation of lattice gauge theories. Relative to qubit-only hardware, the bosonic degrees of freedom natively available in hybrid architectures can substantially reduce the circuit complexity of simulations for physical models containing bosons. A key technique is the extension of quantum signal processing ideas to CV-DV systems. This work is intended to serve as a timely and comprehensive guide to this relatively unexplored yet promising approach to quantum computation and to provide a road map to guide future development.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Profusion of symmetry-protected qubits from stable ergodicity breaking

We show how combining a discrete symmetry with topological Hilbert space fragmentation can give rise to exponentially many topologically stable qubits protected by a single discrete symmetry. We illustrate this explicitly with the example of the CZ𝑝 model, where the encoded qubits are prethermally stable to arbitrary symmetry-respecting perturbations for parametrically long times, substantially enhancing the robustness of a recently proposed construction based on nontopological fragmentation. In this model, the encoded qubits naturally come in pairs for which a universal set of transversal logical gates can be performed, ruling out (by the Eastin-Knill theorem) the possibility of using them for quantum error correction. We also comment on the combination of symmetry enrichment and topological fragmentation more generally, and the implications for use of systems exhibiting Hilbert space fragmentation as quantum memories.

kinetically constrained models↗

Braiding for the win: Harnessing braiding statistics in topological states to play quantum games

Nonlocal quantum games provide proof of principle that quantum resources can confer an advantage at certain tasks. They also provide a compelling way to explore the computational utility of phases of matter on quantum hardware. In a recent paper [O. Hart et al., Phys. Rev. Lett. 134, 130602 (2025)], we demonstrated that a toric code resource state conferred advantage at a certain nonlocal game, which remained robust to small deformations of the resource state. In this paper we demonstrate that this robust advantage is a generic property of resource states drawn from topological or fracton ordered phases of quantum matter. To this end, we illustrate how several other states from paradigmatic topological and fracton ordered phases can function as resources for suitably defined nonlocal games, notably the three-dimensional toric-code phase, the X-cube fracton phase, and the double-semion phase. The key in every case is to design a nonlocal game that harnesses the characteristic braiding processes of a quantum phase as a source of contextuality. We unify the strategies that take advantage of mutual statistics by relating the operators to be measured to order and disorder parameters of an underlying generalized symmetry-breaking phase transition. Additionally, by connecting the win probability to twist products, we show that success at the game serves as a many-body entanglement witness. Namely, if the players implement a perfect quantum strategy on large length scales, the quantum state they share cannot be connected to a trivial product state via a constant-depth local unitary circuit. Lastly, we massively generalize the family of games that admit perfect strategies when codewords of homological quantum error-correcting codes are used as resources.

Fractons↗

Noninvasive mid-circuit measurement and reset on atomic qubits

Mid-circuit measurement and reset of subsets of qubits are crucial ingredients of quantum error correction and many quantum information applications. Measurement of atomic qubits is accomplished through resonant fluorescence, which typically disturbs neighboring atoms due to photon scattering. We propose and prototype a scheme for measurement and reset that provides both spatial and spectral isolation by using tightly focused laser beams and narrow atomic transitions. The unique advantage of this scheme is that all operations are applied exclusively to the read-out qubit, with little overhead and negligible disturbance to the other qubits of the same species. In this paper, we pave the way for noninvasive and high-fidelity mid-circuit measurement and demonstrate all key building blocks on a single trapped barium ion.

atomic systems↗

Performance and Achievable Rates of the Gottesman-Kitaev-Preskill Code for Pure-Loss and Amplification Channels

Quantum error-correction codes protect information from realistic noisy channels and lie at the heart of quantum computation and communication tasks. Understanding the optimal performance and other information-theoretic properties, such as the achievable rates, of a given code is crucial, as these factors determine the fundamental limits imposed by the encoding in conjunction with the noise channel. Here, we use the transpose channel to analytically obtain the near-optimal performance of any Gottesman-Kitaev-Preskill (GKP) code under pure loss and pure amplification. We present rigorous connections between GKP code’s near-optimal performance and its dual lattice geometry and average input energy. With no energy constraint, we show that when |𝜏/(1−𝜏)| is an integer, specific families of GKP codes simultaneously achieve the loss and amplification capacity. 𝜏 is the transmissivity (gain) for loss (amplification). Our results establish GKP code as the first structured bosonic code family that achieves the capacity of loss and amplification.

Zheng, Guo [Univ. of Chicago, IL (United States)] ↗

Lieb-Mattis States for Robust Entangled Differential Phase Sensing

We explore a two-node, entanglement-enhanced sensor network for differential phase sensing that exploits decoherence-free subspaces to suppress common-mode noise, a primary limitation of many state-of-the-art quantum sensors. We identify a class of entangled states that, while not strictly optimal, achieve the same asymptotic sensitivity scaling as optimal states and can be prepared efficiently from initially unentangled atomic ensembles. Importantly, the preparation time decreases with increasing system size, which makes the states compatible with realistic noise processes in present-day quantum sensors that operate with large particle numbers but lack full error correction. We illustrate these ideas using two cavity-mediated preparation protocols: (i) coherent, unitary entanglement generation analogous to bosonic two-mode squeezing, yielding Heisenberg scaling, and (ii) dissipative preparation through collective emission into a shared cavity mode, providing a square-root improvement beyond the standard quantum limit. Numerical simulations show that both approaches remain effective at experimentally realistic cavity cooperativities, establishing a practical path toward scalable, quantum-enhanced differential phase sensing.

Kaubruegger, Raphael [National Institute of Standa↗

Quantum algorithms for disordered physics

We show how a quantum computer may efficiently simulate a disordered Hamiltonian, by incorporating a pseudo-random number generator directly into the time evolution circuit. This technique is applied to quantum simulation of few-body disordered systems in the large volume limit; in particular, Anderson localization. The method requires a number of (error corrected) qubits proportional to the logarithm of the volume of the system, and each time evolution step requires a number of gates polylogarithmic in the volume. We simulate the method to observe the metal-insulator transition on a three-dimensional lattice. Additionally, we demonstrate the algorithm on a one-dimensional lattice, using physical quantum processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Readout rebalancing for near-term quantum computers

Readout errors are a significant source of noise for near-term intermediate-scale quantum computers. Mismeasuring a qubit as |1) when it should be |0) occurs much less often than mismeasuring a qubit as |0) when it should have been |1). We make the simple observation that one can improve the readout fidelity of quantum computers by applying targeted X gates prior to performing a measurement. These X gates are placed so that the expected number of qubits in the |1) state is minimized. Classical postprocessing can undo the effect of the X gates so that the expectation value of any observable is unchanged. This protocol is designed to have no effect when readout errors are symmetric. We show that the statistical uncertainty following readout error corrections is smaller when using readout rebalancing. The statistical advantage is circuit and computer dependent and is demonstrated for the W state, a Grover search, and for a Gaussian state. The benefit in statistical precision is most pronounced (and nearly a factor of 2 in some cases) when states with many qubits in the excited state have high probability.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simulating non-native cubic interactions on noisy quantum machines

As a milestone for general-purpose computing machines, we demonstrate that quantum processors can be programed to efficiently simulate dynamics that are not native to the hardware. Moreover, on noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates instead of a restricted set of standard gates. We demonstrate the general methodology by solving a cubic interaction problem, which appears in nonlinear optics, gauge theories, as well as plasma and fluid dynamics. To encode the non-native Hamiltonian evolution, we decompose the Hilbert space into a direct sum of invariant subspaces in which the nonlinear problem is mapped to a finite-dimensional Hamiltonian simulation problem. Furthermore, in a three-states example, the resultant unitary evolution is realized by a product of approximately 20 standard gates, using which approximately ten simulation steps can be carried out on state-of-the-art quantum hardware before results are corrupted by decoherence. In comparison, the simulation depth is improved by more than an order of magnitude when the unitary evolution is realized as a single cubic gate, which is compiled directly using optimal control. Alternatively, parametric gates may also be compiled by interpolating control pulses. Modular gates thus obtained provide high-fidelity building blocks for quantum Hamiltonian simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Architecture for fast implementation of quantum low-density parity-check codes with optimized Rydberg gates

Here, we propose an implementation of bivariate bicycle codes [S. Bravyi et al., Nature (London) 627, 778 (2024)] based on long-range Rydberg gates between stationary neutral atom qubits. An optimized layout of data and ancilla qubits reduces the maximum Euclidean communication distance needed for nonlocal parity-check operators. An optimized Rydberg gate pulse design enables 𝖢𝖹 entangling operations with fidelity $\mathscr{F}$ >0.999 at a distance greater than 12 µ⁢m. The combination of optimized layout and gate design leads to a quantum error correction cycle time of ∼1.2⁢8 ms for a [[144,12,12]] code, which is nearly a factor-of-two improvement over previous designs.

Poole, C. [Univ. of Wisconsin, Madison, WI (United↗

Witnessing entanglement in phase space using inefficient detectors

We propose a scheme for witnessing entanglement in phase space by significantly inefficient detectors. The implementation of this scheme does not require any additional process for correcting errors, in contrast to previous proposals. Moreover, it allows us to detect entanglement without full a priori knowledge of the detection efficiency. It is shown that entanglement in single-photon entangled and two-mode squeezed states can be witnessed with detection efficiency as low as 40%. Our approach enhances the possibility of witnessing entanglement in various physical systems using current detection technologies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Experimental demonstration of nonlocal effects in the partial-collapse measurement and reversal process

We demonstrate experimentally the nonlocal reversal of a partial-collapse quantum measurement of a two-photon entangled state. Both the partial-collapse measurement and the reversal operation are implemented in linear optics with two displaced Sagnac interferometers, characterized by single-qubit quantum-process tomography. The recovered state is measured by quantum-state tomography, and its nonlocality is characterized by testing the Bell inequality. Our result will be helpful in quantum communication and quantum error correction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Minimal-memory realization of pearl-necklace encoders of general quantum convolutional codes

Quantum convolutional codes, like their classical counterparts, promise to offer higher error correction performance than block codes of equivalent encoding complexity, and are expected to find important applications in reliable quantum communication where a continuous stream of qubits is transmitted. Grassl and Roetteler devised an algorithm to encode a quantum convolutional code with a ''pearl-necklace'' encoder. Despite their algorithm's theoretical significance as a neat way of representing quantum convolutional codes, it is not well suited to practical realization. In fact, there is no straightforward way to implement any given pearl-necklace structure. This paper closes the gap between theoretical representation and practical implementation. In our previous work, we presented an efficient algorithm to find a minimal-memory realization of a pearl-necklace encoder for Calderbank-Shor-Steane (CSS) convolutional codes. This work is an extension of our previous work and presents an algorithm for turning a pearl-necklace encoder for a general (non-CSS) quantum convolutional code into a realizable quantum convolutional encoder. We show that a minimal-memory realization depends on the commutativity relations between the gate strings in the pearl-necklace encoder. We find a realization by means of a weighted graph which details the noncommutative paths through the pearl necklace. The weight of the longest path in this graph is equal to the minimal amount of memory needed to implement the encoder. The algorithm has a polynomial-time complexity in the number of gate strings in the pearl-necklace encoder.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗