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.

SourceResearch connectionFrom yearThrough year

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

At least 325 records · Page 18

All sources NASA NTRS DOE OSTI

DOE OSTI2026

Multitarget Rydberg gates via spatial blockade engineering

Multi-target gates offer the potential to reduce gate depth in syndrome extraction for quantum error correction. Although neutral-atom quantum computers have demonstrated native multi-qubit gates, existing approaches that avoid additional control or multiple atomic species have been limited to single-target gates. We propose single-control-multi-target CZ^n gates on a single-species neutral-atom platform that require no extra control and have gate durations comparable to standard CZ gates. Our approach leverages tailored interatomic distances to create an asymmetric blockade between the control and target atoms. Using a GPU-accelerated pulse synthesis protocol, we design smooth control pulses for CZZ and CZZZ gates, achieving fidelities of up to 99.55% and $99.24\%$, respectively, even in the presence of simulated atom placement errors and Rydberg-state decay. Our approach is most effective for N=2 (CZZ) and N=3 targets (CZZZ); for larger N, increasing spatial crowding of the targets introduces significant challenges for maintaining the required blockade asymmetry. This work presents a practical path to implementing low-overhead multi-target gates in single-species neutral-atom systems, significantly reducing the resource overhead for syndrome extraction. To motivate the impact of these gates, we apply a greedy scheduling algorithm and we demonstrate that our proposed gates can reduce the number of atom reconfiguration costs by up to 50% for color code syndrome extraction of code distances greater than 5.

Stein, Samuel A.↗

DOE OSTI2022

Trade off-free entanglement stabilization in a superconducting qutrit-qubit system

Abstract Quantum reservoir engineering is a powerful framework for autonomous quantum state preparation and error correction. However, traditional approaches to reservoir engineering are hindered by unavoidable coherent leakage out of the target state, which imposes an inherent trade off between achievable steady-state state fidelity and stabilization rate. In this work we demonstrate a protocol that achieves trade off-free Bell state stabilization in a qutrit-qubit system realized on a circuit-QED platform. We accomplish this by creating a purely dissipative channel for population transfer into the target state, mediated by strong parametric interactions coupling the second-excited state of a superconducting transmon and the engineered bath resonator. Our scheme achieves a state preparation fidelity of 84% with a stabilization time constant of 339 ns, leading to a 54 ns error-time product in a solid-state quantum information platform.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Noisy quantum trees: infinite protection without correction

We study quantum networks with tree structures, in which information propagates from a root to leaves. At each node in the network, the received qubit unitarily interacts with fresh ancilla qubits, after which each qubit is sent through a noisy channel to a different node in the next level. Therefore, as the tree depth grows, there is a competition between the irreversible effect of noise and the protection against such noise achieved by the delocalization of information. In the classical setting, where each node simply copies the input bit into multiple output bits, this model has been studied as the broadcasting or reconstruction problem on trees, which has broad applications. In this work, we study the quantum version of this problem. We consider a Clifford encoder at each node that encodes the input qubit in a stabilizer code, along with a single qubit Pauli noise channel at each edge. Such noisy quantum trees describe a scenario in which one has access to a stream of fresh (low-entropy) ancilla qubits, but cannot perform error correction. Therefore, they provide a different perspective on quantum fault tolerance. Furthermore, they provide a useful model for describing the effect of noise within the encoders of concatenated codes. We prove that above certain noise thresholds, which depend on the properties of the code such as its distance, as well as the properties of the encoder, information decays exponentially with the depth of the tree. On the other hand, by studying certain efficient decoders, we prove that for codes with distance d ≥ 2 and for sufficiently small (but non-zero) noise, classical information and entanglement propagate over a noisy tree with infinite depth. Indeed, we find that this remains true even for binary trees with certain 2-qubit encoders at each node, which encodes the received qubit in the binary repetition code with distance d = 1.

Quantum information↗

DOE OSTI2018

Characterizing quantum supremacy in near-term devices

A critical question for quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of supercomputers. Such a demonstration of what is referred to as quantum supremacy requires a reliable evaluation of the resources required to solve tasks with classical approaches. Here, we propose the task of sampling from the output distribution of random quantum circuits as a demonstration of quantum supremacy. We extend previous results in computational complexity to argue that this sampling task must take exponential time in a classical computer. We introduce cross-entropy benchmarking to obtain the experimental fidelity of complex multiqubit dynamics. This can be estimated and extrapolated to give a success metric for a quantum supremacy demonstration. We study the computational cost of relevant classical algorithms and conclude that quantum supremacy can be achieved with circuits in a two-dimensional lattice of 7 × 7 qubits and around 40 clock cycles. This requires an error rate of around 0.5% for two-qubit gates (0.05% for one-qubit gates), and it would demonstrate the basic building blocks for a fault-tolerant quantum computer.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2023

An introduction to financial option pricing on a qudit-based quantum computer

The financial sector is anticipated to be one of the first industries to benefit from the increased computational power of quantum computers, in areas such as portfolio optimisation and risk management to financial derivative pricing. Financial mathematics, and derivative pricing in particular, are not areas quantum physicists are traditionally trained in despite the fact that they often have the raw technical skills needed to understand such topics. On the other hand, most quantum algorithms have largely focused on qubits, which are comprised of two discrete states, as the information carriers. However, discrete higher-dimensional qudits, in addition to possibly possessing increased noise robustness and allowing for novel error correction protocols in certain hardware implementations, also have logarithmically greater information storage and processing capacity. In the current NISQ era of quantum computing, a wide array of hardware paradigms are still being studied and any potential advantage a platform offers is worth exploring. Here we introduce the basic concepts behind financial derivatives for the unfamiliar enthusiast as well as outline in great detail the quantum algorithm routines needed to price a European option, the simplest derivative. This is done within the context of a quantum computer comprised of qudits and employing the natural higher-dimensional analogue of a qubit-based pricing algorithm with its various subroutines. From these pieces, one should relatively easily be able to tailor the scheme to more complex, realistic financial derivatives. Finally, the entire stack is numerically simulated with the results demonstrating how the qudit-based scheme's payoff quickly approaches that of both a similarly-resourced classical computer as well as the true payoff, within error, for a modest increase in qudit dimension.

Bornman, Nicholas↗

DOE OSTI2026

A cryogenic muon tagging system based on kinetic inductance detectors for superconducting quantum processors

Ionizing radiation has emerged as a potential limiting factor for superconducting quantum processors, inducing quasiparticle bursts and correlated errors that challenge fault-tolerant operation. Atmospheric muons are particularly problematic due to their high energy and penetration power, making passive shielding ineffective. Therefore, monitoring the real-time muon flux is crucial to guide the development of alternative error-correction or mitigation strategies. We present the design, simulation, and first operation of a cryogenic muon-tagging system based on kinetic inductance detectors (KIDs), developed as a stand-alone cryogenic particle-tagging module for superconducting quantum processors. The system consists of two KIDs arranged in a vertical stack and operated at ∼20 mK. Monte Carlo simulations based on Geant4 guided the prototype design and provided reference expectations for muon-tagging efficiency and accidental coincidences due to ambient γ-rays. We observed a muon-induced coincidence rate among the top and bottom detectors of (192 ± 9) $\times\,10^{-3}$ events s$^{−1}$, in excellent agreement with the Monte Carlo prediction. The prototype achieves a muon-tagging efficiency of about 90% with negligible dead time. These results demonstrate the feasibility of operating a muon-tagging system at millikelvin temperatures and represent a key step toward the integration of cryogenic veto systems with multi-qubit chips to mitigate muon-induced errors.

Mariani, Ambra [INFN, Rome] (ORCID:000000028184857↗

DOE OSTI2014

SU-F-BRF-07: Impact of Different Patient Setup Strategies in Adaptive Radiation Therapy with Simultaneous Integrated Volume-Adapted Boost of NSCLC

Purpose: To evaluate the potential impact of several setup error correction strategies on a proposed image-guided adaptive radiotherapy strategy for locally advanced lung cancer. Methods: Daily 4D cone-beam CT and weekly 4D fan-beam CT images were acquired from 9 lung cancer patients undergoing concurrent chemoradiation therapy. Initial planning CT was deformably registered to daily CBCT images to generate synthetic treatment courses. An adaptive radiation therapy course was simulated using the weekly CT images with replanning twice and a hypofractionated, simultaneous integrated boost to a total dose of 66 Gy to the original PTV and either a 66 Gy (no boost) or 82 Gy (boost) dose to the boost PTV (ITV + 3mm) in 33 fractions with IMRT or VMAT. Lymph nodes (LN) were not boosted (prescribed to 66 Gy in both plans). Synthetic images were rigidly, bony (BN) or tumor and carina (TC), registered to the corresponding plan CT, dose was computed on these from adaptive replans (PLAN) and deformably accumulated back to the original planning CT. Cumulative D98% of CTV of PT (ITV for 82Gy) and LN, and normal tissue dose changes were analyzed. Results: Two patients were removed from the study due to large registration errors. For the remaining 7 patients, D98% for CTV-PT (ITV-PT for 82 Gy) and CTV-LN was within 1 Gy of PLAN for both 66 Gy and 82 Gy plans with both setup techniques. Overall, TC based setup provided better results, especially for LN coverage (p = 0.1 for 66Gy plan and p = 0.2 for 82 Gy plan, comparison of BN and TC), though not significant. Normal tissue dose constraints violated for some patients if constraint was barely achieved in PLAN. Conclusion: The hypofractionated adaptive strategy appears to be deliverable with soft tissue alignment for the evaluated margins and planning parameters. Research was supported by NIH P01CA116602.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2016

Measurement of electron density using reactance cutoff probe

This paper proposes a new measurement method of electron density using the reactance spectrum of the plasma in the cutoff probe system instead of the transmission spectrum. The highly accurate reactance spectrum of the plasma-cutoff probe system, as expected from previous circuit simulations [Kim et al., Appl. Phys. Lett. 99, 131502 (2011)], was measured using the full two-port error correction and automatic port extension methods of the network analyzer. The electron density can be obtained from the analysis of the measured reactance spectrum, based on circuit modeling. According to the circuit simulation results, the reactance cutoff probe can measure the electron density more precisely than the previous cutoff probe at low densities or at higher pressure. The obtained results for the electron density are presented and discussed for a wide range of experimental conditions, and this method is compared with previous methods (a cutoff probe using the transmission spectrum and a single Langmuir probe).

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2011

Long-distance continuous-variable quantum key distribution with a Gaussian modulation

We designed high-efficiency error correcting codes allowing us to extract an errorless secret key in a continuous-variable quantum key distribution (CVQKD) protocol using a Gaussian modulation of coherent states and a homodyne detection. These codes are available for a wide range of signal-to-noise ratios on an additive white Gaussian noise channel with a binary modulation and can be combined with a multidimensional reconciliation method proven secure against arbitrary collective attacks. This improved reconciliation procedure considerably extends the secure range of a CVQKD with a Gaussian modulation, giving a secret key rate of about 10{sup -3} bit per pulse at a distance of 120 km for reasonable physical parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2020

Properties of the new $ \mathcal{N} $ = 1 AdS 4 vacuum of maximal supergravity

The recent comprehensive numerical study of critical points of the scalar potential of four-dimensional N = 8, SO(8) gauged supergravity using Machine Learning software in [1] has led to a discovery of a new N = 1 vacuum with a triality-invariant SO(3) symmetry. Guided by the numerical data for that point, we obtain a consistent SO(3) × Z 2 -invariant truncation of the N = 8 theory to an N = 1 supergravity with three chiral multiplets. Critical points of the truncated scalar potential include both the N = 1 point as well as two new non-supersymmetric and perturbatively unstable points not found by previous searches. Studying the structure of the submanifold of SO(3) × Z 2 -invariant supergravity scalars, we find that it has a simple interpretation as a submanifold of the 14-dimensional Z $3\atop{2}$ -invariant scalar manifold (SU(1, 1)/U(1)) 7 , for which we find a rather remarkable superpotential whose structure matches the single bit error correcting (7, 4) Hamming code. This 14-dimensional scalar manifold contains approximately one quarter of the known critical points. We also show that there exists a smooth supersymmetric domain wall which interpolates between the new N = 1 AdS4 solution and the maximally supersymmetric AdS4 vacuum. Using holography, this result indicates the existence of an N = 1 RG flow from the ABJM SCFT to a new strongly interacting conformal fixed point in the IR.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2020

The ghost in the radiation: robust encodings of the black hole interior

We reconsider the black hole firewall puzzle, emphasizing that quantum error-correction, computational complexity, and pseudorandomness are crucial concepts for understanding the black hole interior. We assume that the Hawking radiation emitted by an old black hole is pseudorandom, meaning that it cannot be distinguished from a perfectly thermal state by any efficient quantum computation acting on the radiation alone. We then infer the existence of a subspace of the radiation system which we interpret as an encoding of the black hole interior. This encoded interior is entangled with the late outgoing Hawking quanta emitted by the old black hole, and is inaccessible to computationally bounded observers who are outside the black hole. Specifically, efficient operations acting on the radiation, those with quantum computational complexity polynomial in the entropy of the remaining black hole, commute with a complete set of logical operators acting on the encoded interior, up to corrections which are exponentially small in the entropy. Thus, under our pseudorandomness assumption, the black hole interior is well protected from exterior observers as long as the remaining black hole is macroscopic. On the other hand, if the radiation is not pseudorandom, an exterior observer may be able to create a firewall by applying a polynomial-time quantum computation to the radiation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

Relational bulk reconstruction from modular flow

Abstract The entanglement wedge reconstruction paradigm in AdS/CFT states that for a bulk qudit within the entanglement wedge of a boundary subregion$$ \overline{A} $$ A ¯ , operators acting on the bulk qudit can be reconstructed as CFT operators on$$ \overline{A} $$ A ¯ . This naturally fits within the framework of quantum error correction, with the CFT states containing the bulk qudit forming a code protected against the erasure of the boundary subregionA. In this paper, we set up and study a framework for relational bulk reconstruction in holography: given two code subspaces both protected against erasure of the boundary regionA, the goal is to relate the operator reconstructions between the two spaces. To accomplish this, we assume that the two code subspaces are smoothly connected by a one-parameter family of codes all protected against the erasure ofA, and that the maximally-entangled states on these codes are all full-rank. We argue that such code subspaces can naturally be constructed in holography in a “measurement-based” setting. In this setting, we derive a flow equation for the operator reconstruction of a fixed code subspace operator using modular theory which can, in principle, be integrated to relate the reconstructed operators all along the flow. We observe a striking resemblance between our formulas for relational bulk reconstruction and the infinite-time limit of Connes cocycle flow, and take some steps towards making this connection more rigorous. We also provide alternative derivations of our reconstruction formulas in terms of a canonical reconstruction map we call the modular reflection operator.

Physics↗

DOE OSTI2024

Security of quantum position-verification limits Hamiltonian simulation via holography

We investigate the link between quantum position-verification (QPV) and holography established in [1] using holographic quantum error correcting codes as toy models. By inserting the “temporal” scaling of the AdS metric by hand via the bulk Hamiltonian interaction strength, we recover a toy model with consistent causality structure. This leads to an interesting implication between two topics in quantum information: if position-based verification is secure against attacks with small entanglement then there are new fundamental lower bounds for resources required for one Hamiltonian to simulate another.

AdS-CFT Correspondence↗

DOE OSTI2025

Changes to virus taxonomy, the international code of virus classification and nomenclature, and the ICTV statutes ratified by the International Committee on Taxonomy of Viruses (2025)

Abstract The 56th meeting of the Executive Committee (EC) of the International Committee on Taxonomy of Viruses (ICTV) was held in Bari, Italy, in July/August, 2024, and 115 submitted taxonomy proposals were reviewed. A total of 112 were subsequently ratified by the ICTV membership. An additional 9 error correction proposals were also approved in August 2025. This article lists the taxonomy proposals that have now been incorporated into release 40 version v2 of the Master Species List ( https://ictv.global/msl ), the Virus Metadata Resource ( https://ictv.global/vmr ), and associated ICTV databases. In addition to the assignments of 1,563 new virus species, 243genera, 55 families, 11 orders, and 8 classes, there were substantial additions to higher taxonomic ranks. These include the creation of a new realm ( Singelaviria ), which is based on the recognition of a separate evolutionary origin for the hallmark capsid genes of members of the kingdom Helvetiavirae. These express capsid proteins forming a single jelly-roll fold that is structurally and evolutionarily distinct from those of members of the family Bamfordvirae , assigned to the realm Varidnaviria . Furthermore, the realm Varidnaviria underwent a major reorganization, including the addition of a new kingdom, Abadenavirae . Another notable change was the classification of the vertebrate-infecting single-stranded DNA anellovirids into a new phylum Commensaviricota (kingdom Shotokuvirae , realm Monodnaviria ). Archaeal viruses infecting the hyperthermophilic Archaeoglobi were assigned to a new phylum Calorviricota , in the kingdom Trapavirae (realm Monodnaviria ), whereas RNA viruses infecting hyperthermophilic bacteria were classified into a new phylum Artimaviricota (realm Riboviria ). In recognition of his extensive and valuable contributions to virus taxonomic developments in Study Groups and over the period of his EC membership, Stuart Siddell was honoured as a new life member of the ICTV. The ICTV has created a new strategy for disseminating information on taxonomy advances through annual open-access publication of citeable taxonomy proposal summaries from each ICTV Subcommittee. A collective total of 354 co-authors of the seven summaries were drawn from members of each Subcommittee, the EC, and a very large number of contributors from the wider virology community.

Simmonds, Peter (ORCID:0000000279644700)↗

DOE OSTI2021

Variational approach to relative entropies with an application to QFT

Abstract We define a new divergence of von Neumann algebras using a variational expression similar in nature to Kosaki’s formula for Umegaki’s relative entropy. Our divergence satisfies several of the usual desirable properties, upper bounds the sandwiched Renyi entropy and reduces to the fidelity in a limit. As an illustration, we use the formula in quantum field theory to compute our divergence between the vacuum in a bipartite system and an “orbifolded”—in the sense of a conditional expectation—system in terms of the Jones index. We take the opportunity to point out an entropic certainty relation associated with an inclusion of von Neumann factors related to the relative entropy. This certainty relation has an equivalent formulation in terms of error correcting codes.

Hollands, Stefan↗

DOE OSTI2019

Counting Kmers for Biological Sequences at Large Scale

Counting the abundance of all the distinct kmers in biological sequence data is a fundamental step in bioinformatics. These applications include de novo genome assembly, error correction, etc. With the development of sequencing technology, the sequence data in a single project can reach Petabyte-scale or Terabyte-scale nucleotides. Counting demand for the abundance of these sequencing data is beyond the memory and computing capacity of single computing node, and how to process it efficiently is a challenge on a high-performance computing cluster. As such, we propose SWAPCounter, a highly scalable distributed approach for kmer counting. This approach is embedded with an MPI streaming I/O module for loading huge data set at high speed, and a counting bloom filter module for both memory and communication efficiency. By overlapping all the counting steps, SWAPCounter achieves high scalability with high parallel efficiency. In this work, the experimental results indicate that SWAPCounter has competitive performance with two other tools on shared memory environment, KMC 2 , and MSPKmerCounter. Moreover, SWAPCounter also shows the highest scalability under strong scaling experiments. In our experiment on Cetus supercomputer, SWAPCounter scales to 32,768 cores with 79% parallel efficiency (using 2048 cores as baseline) when processing 4 TB sequence data of 1000 Genomes. The source code of SWAPCounter is publicly available at https://github.com/mengjintao/SWAPCounter.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2017

Mass Spectral Library Quality Assurance by Inter-Library Comparison

A method to discover and correct errors in mass spectral libraries is described. Comparing across a set of highly curated reference libraries compounds that have the same chemical structure quickly identifies entries that are outliers. In cases where three or more entries for the same compound are compared, the outlier as determined by visual inspection was almost always found to contain the error. These errors were either in the spectrum itself or in the chemical descriptors that accompanied it. The method is demonstrated on finding errors in compounds of forensic interest in the NIST/EPA/NIH Mass Spectral Library. The target list of compounds checked was the Scientific Working Group for the Analysis of Seized Drugs (SWGDRUG) mass spectral library. Some examples of errors found are described. A checklist of errors that curators should look for when performing inter-library comparisons is provided. .

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2018

Compact video content representation for video coding using low multi-linear tensor rank approximation with dynamic core tensor order

Tensor is a multi-way representation of an entity that is widely used in many applications of mathematics and physics. The wide range of tensor algebra operations attract the researchers of graphical and vision field to identify unique methods for various applications such as segmentation, compression, indexing and so on. In this paper, low multi-linear rank approximation of a tensor is used for decomposition so as to perform compression on a video that is represented as a 4D tensor. Thus, the encoder has blocks for (1) multilinear rank approximation method so as to aid decomposition, (2) sparsity removal of residual data to reduce the required memory storage to a small level, (3) quantization on the sparse less residual data and (4) LZ77 dictionary coding for the video. The decoder uses a tensor reconstruction block along with residual error correction block that reduces loss/error in the reconstructed video. The size of core tensor is an important factor in rank approximation. It is identified at run time depending on the video contents. This size is determined adaptively using Tikhonov’s regularization method. The best value of core tensor size is identified with the corner of L-curve which preserves the video contents from heavy loss/error. Experimental results of the proposed work on comparison with H.264/AVC compression method indicate that the proposed method achieves up to 10% improvement in compression ratio with the least amount of loss and a maximum signal to noise ratio of 0.14. The proposed system gives better compression ratio than H.265 for videos with more number of frames without compromising quality.

97 MATHEMATICS AND COMPUTING↗