SEARCH · Engineering Papers

Results for “Noiseless”

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 37 records · Page 2

All sources NASA NTRS DOE OSTI

NASA NTRS1991

Algorithms for a very high speed universal noiseless coding module

The algorithmic definitions and performance characterizations are presented for a high performance adaptive coding module. Operation of at least one of these (single chip) implementations is expected to exceed 500 Mbits/s under laboratory conditions. Operation of a companion decoding module should operate at up to half the coder's rate. The module incorporates a powerful noiseless coder for Standard Form Data Sources (i.e., sources whose symbols can be represented by uncorrelated non-negative integers where the smaller integers are more likely than the larger ones). Performance close to data entropies can be expected over a Dynamic Range of from 1.5 to 12 to 14 bits/sample (depending on the implementation).

Rice, Robert F.↗

NASA NTRS1991

On the optimality of code options for a universal noiseless coder

A universal noiseless coding structure was developed that provides efficient performance over an extremely broad range of source entropy. This is accomplished by adaptively selecting the best of several easily implemented variable length coding algorithms. Custom VLSI coder and decoder modules capable of processing over 20 million samples per second are currently under development. The first of the code options used in this module development is shown to be equivalent to a class of Huffman code under the Humblet condition, other options are shown to be equivalent to the Huffman codes of a modified Laplacian symbol set, at specified symbol entropy values. Simulation results are obtained on actual aerial imagery, and they confirm the optimality of the scheme. On sources having Gaussian or Poisson distributions, coder performance is also projected through analysis and simulation.

Yeh, Pen-Shu↗

NASA NTRS1994

Some Practical Universal Noiseless Coding Techniques

Report discusses noiseless data-compression-coding algorithms, performance characteristics and practical consideration in implementation of algorithms in coding modules composed of very-large-scale integrated circuits. Report also has value as tutorial document on data-compression-coding concepts. Coding techniques and concepts in question "universal" in sense that, in principle, applicable to streams of data from variety of sources. However, discussion oriented toward compression of high-rate data generated by spaceborne sensors for lower-rate transmission back to earth.

Rice, Robert F.↗

NASA NTRS1982

Capacity limit of the noiseless, energy-efficient optical PPM channel

It is shown that even though the capacity per photon can be made to increase without bound, the capacity per channel use (for best power efficiency) is always less than 2 nats per symbol. Furthermore, it approaches 2 nats per symbol as the bandwidth expansion factor goes to infinity.

Lesh, J. R.↗

NASA NTRS1983

Capacity limit of the noiseless, energy-efficient optical PPM channel

Lesh, J. R.↗

NASA NTRS1989

Noiseless compression using non-Markov models

Adaptive data compression techniques can be viewed as consisting of a model specified by a database common to the encoder and decoder, an encoding rule and a rule for updating the model to ensure that the encoder and decoder always agree on the interpretation of the next transmission. The techniques which fit this framework range from run-length coding, to adaptive Huffman and arithmetic coding, to the string-matching techniques of Lempel and Ziv. The compression obtained by arithmetic coding is dependent on the generality of the source model. For many sources, an independent-letter model is clearly insufficient. Unfortunately, a straightforward implementation of a Markov model requires an amount of space exponential in the number of letters remembered. The Directed Acyclic Word Graph (DAWG) can be constructed in time and space proportional to the text encoded, and can be used to estimate the probabilities required for arithmetic coding based on an amount of memory which varies naturally depending on the encoded text. The tail of that portion of the text which was encoded is the longest suffix that has occurred previously. The frequencies of letters following these previous occurrences can be used to estimate the probability distribution of the next letter. Experimental results indicate that compression is often far better than that obtained using independent-letter models, and sometimes also significantly better than other non-independent techniques.

Blumer, Anselm↗

NASA NTRS1975

Advances in data compression

A rigorous real-variables treatment of general data compression and encoding problems, centered on formulation and proof of relevant existence theorems and a unified formulation of source coding (both noiseless and with a fidelity criterion) in inaccurately or incompletely specified statistical environments. Difficulties in modeling of sources with unknown or imperfectly known statistical descriptions are analyzed and source codes (SC) are classified (variable-rate noiseless SC, fixed-rate noiseless SC) and analyzed, along with types of code sequences (weighted-universal, maximin-universal, strongly or weakly minimax-universal). Universal coding on video data, variable-rate coding with distortion, and distortion-rate functions are discussed. Design strategies for universal coding algorithms are suggested, but the article is not oriented to specific methods of synthesizing data compression systems.

Davisson, L. D.↗

NASA NTRS1979

Block adaptive rate controlled image data compression

A block adaptive rate controlled (BARC) image data compression algorithm is described. It is noted that in the algorithm's principal rate controlled mode, image lines can be coded at selected rates by combining practical universal noiseless coding techniques with block adaptive adjustments in linear quantization. Compression of any source data at chosen rates of 3.0 bits/sample and above can be expected to yield visual image quality with imperceptible degradation. Exact reconstruction will be obtained if the one-dimensional difference entropy is below the selected compression rate. It is noted that the compressor can also be operated as a floating rate noiseless coder by simply not altering the input data quantization. Here, the universal noiseless coder ensures that the code rate is always close to the entropy. Application of BARC image data compression to the Galileo orbiter mission of Jupiter is considered.

Rice, R. F.↗

DOE OSTI2025

Demonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem

Simon’s problem is to find a hidden period (a bitstring) encoded into an unknown 2-to-1 function. It is one of the earliest problems for which an exponential quantum speedup was proven for ideal, noiseless quantum computers, albeit in the oracle model. Here, using two different 127-qubit IBM Quantum superconducting processors, we demonstrate an algorithmic quantum speedup for a variant of Simon’s problem where the hidden period has a restricted Hamming weight 𝑤. For sufficiently small values of 𝑤 and for circuits involving up to 58 qubits, we demonstrate an exponential speedup, albeit of a lower quality than the speedup predicted for the noiseless algorithm. The speedup exponent and the range of 𝑤 values for which an exponential speedup exists are significantly enhanced when the computation is protected by dynamical decoupling. Further enhancement is achieved with measurement error mitigation. This case constitutes a demonstration of a bona fide quantum advantage for an Abelian hidden subgroup problem.

computation↗

NASA NTRS1981

Practical codes for photon communication

It is shown that even assuming a noiseless model for photon communication for which capacity (measured in nats/photon) is infinite, it is unlikely that a signaling efficiency of even 10 nats/photon could be achieved in practice. Pulse-position modulation plus Reed-Solomon coding is shown to yield practical results in the range of 2 to 3 nats/photon. In addition, a channel model appropriate for the study of noiseless photon communication, referred to as a photon channel, is presented. The use of q-ary pulse position modulation (q-PPM) on the photon channel is investigated. It is shown that q-PPM channel capacity is log q nats/photon, and performance curves (error probability versus signaling efficiency) are given for coded and uncoded q-PPM.

Mceliece, R. J.↗

DOE OSTI2026

Robustness of the smartpixels classifier for different simulated sensor geometries and non-ideal detector conditions

Pixel tracking detectors at upcoming collider experiments will see unprecedented charged-particle densities. Real-time data reduction on the detector will enable higher granularity and faster readout, possibly enabling the use of the pixel detector in high-rate online event selection, such as the ATLAS or CMS first-level trigger systems. This data reduction can be accomplished with a neural network (NN) in the readout chip bonded with the sensor that recognizes and rejects tracks with low transverse momentum (p T ) based on the geometrical shape of the charge deposition (“cluster”). To design viable detectors for deployment, the dependence of the NN as a function of the sensor geometry, external magnetic field, irradiation, and noise must be understood. In this paper, we present first studies of the efficiency and data reduction for planar pixel sensors exploring these parameters. For the CMS HL-LHC sensor geometry, we obtain a signal efficiency of (91.9 ± 0.7)% and a data reduction of (29.7 ± 1.0)%. A smaller sensor pitch in the bending direction improves the p T discrimination, but a larger pitch can be partially compensated with detector thickness. Any accumulated radiation damage also changes the cluster shape, reducing the signal efficiency compared to the baseline by approximately 30–60% in absolute terms, but nearly all of the performance can be recovered through retraining of the network and updating the weights. Finally, the impact of noise was investigated, and retraining the network on noise-injected datasets was found to maintain performance within 6% of the baseline network trained and evaluated on noiseless data. •ASIC-compatible track-momentum classifier is robust in realistic detector conditions.•About 90% signal efficiency and 30% data reduction per layer for CMS HL-LHC geometry.•Single-layer signal efficiency increases for smaller pixel pitch or thicker sensors.•Performance with noise or after radiation damage mostly recovered by retraining.

Shekar, Danush [Illinois U., Chicago] (ORCID:00000↗

DOE OSTI2025

Quantum Time Dynamics Mediated by the Yang–Baxter Equation and Artificial Neural Networks

Quantum computing shows great potential, but errors pose a significant challenge. This study explores new strategies for mitigating quantum errors using artificial neural networks (ANNs) and the Yang–Baxter equation (YBE). Unlike traditional error mitigation methods, which are computationally intensive, we investigate artificial error mitigation. We developed a novel method that combines ANNs for noise mitigation combined with the YBE to generate noisy data. This approach effectively reduces noise in quantum simulations, enhancing the accuracy of the results. The YBE rigorously preserves quantum correlations and symmetries in spin chain simulations in certain classes of integrable lattice models, enabling effective compression of quantum circuits while retaining linear scalability with the number of qubits. This compression facilitates both full and partial implementations, allowing the generation of noisy quantum data on hardware alongside noiseless simulations using classical platforms. By introducing controlled noise through the YBE, we enhance the data set for error mitigation. We train an ANN model on partial data from quantum simulations, demonstrating its effectiveness in mitigating errors in time-evolving quantum states, providing a scalable framework to enhance quantum computation fidelity, particularly in noisy intermediate-scale quantum (NISQ) systems. We demonstrate the efficacy of this approach by performing quantum time dynamics simulations using the Heisenberg XY Hamiltonian on real quantum devices.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2025

Quantum Simulation of Molecular Dynamics Processes─A Benchmark Study Using a Classical Simulator and Present-Day Quantum Hardware

Here, we explore how the fundamental problems in quantum molecular dynamics can be modeled using classical simulators (emulators) of quantum computers and the actual quantum hardware available to us today. The list of problems we tackle includes propagation of a free wave packet, vibration of a harmonic oscillator, and tunneling through a barrier. Each of these problems starts with the initial wave packet setup. Although Qiskit provides a general method for initializing wave functions, in most cases it generates deep quantum circuits. While these circuits perform well on noiseless simulators, they suffer from excessive noise on quantum hardware. To overcome this issue, we designed a shallower quantum circuit for preparing a Gaussian-like initial wave packet, which improves the performance of real hardware. Next, quantum circuits are implemented to apply the kinetic and potential energy operators for the evolution of a wave function over time. The results of our modeling on classical emulators of quantum hardware agree perfectly with the results obtained using the traditional (classical) methods. This serves as a benchmark and demonstrates that the quantum algorithms and Qiskit codes we developed are accurate. However, the results obtained on the actual quantum hardware available today, such as IBM’s superconducting qubits and IonQ’s trapped ions, indicate large discrepancies due to hardware limitations. This work highlights both the potential and challenges of using quantum computers to solve fundamental quantum molecular dynamics problems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2025

Nonunitary Variational Quantum Eigensolver with the Localized Active Space Method and Cost Mitigation

Accurately describing strongly correlated systems with affordable quantum resources remains a central challenge for quantum chemistry applications on near and intermediate term quantum computers. The localized active space self-consistent field (LASSCF) approximates the complete active space self-consistent field (CASSCF) by generating active space-based wave functions within specific fragments while treating interfragment correlation with mean-field approach, hence is computationally less expensive. Hardware-efficient ansatzes (HEA) offer affordable and shallower circuits, yet they often fail to capture the necessary correlation. Previously, Jastrow-factor-inspired nonunitary qubit operators were proposed to use with HEA for variational quantum eigensolver (VQE) calculations (so-called nuVQE), as they do not increase circuit depths and recover correlation beyond the mean-field level for Hartree–Fock initial states. Here, in this study, we explore running nuVQE with LASSCF as the initial state. The method, named LAS-nuVQE, is shown to recover interfragment correlations, reach chemical accuracy with a small number of gates (<70) in both H 4 and square cyclobutadiene (C 4 H 4 ), and produces more accurate energetics than its HEA counterparts at all circuit depths. To further address the inherent symmetry-breaking in HEA, we implemented spin-constrained LAS-nuVQE to extend the capabilities of HEA further and show spin-pure results for square cyclobutadiene. We also mitigate the increased measurement overhead of nuVQE via Pauli grouping and shot-frugal sampling, reducing measurement costs by up to 2 orders of magnitude compared to ungrouped operator, and show that one can achieve better accuracy with a small number of shots (10 3–4 ) per one expectation value calculation compared to noiseless simulations with one or two orders of magnitude more shots. Finally, wall clock time estimates show that, with our measurement mitigation protocols, nuVQE becomes a cheaper and more accurate alternative than vanilla VQE with HEA. Taken together, these developments illustrate a practical pathway toward performing multireference chemical simulations with accuracy and affordable resources on today’s quantum hardware, achieving both accuracy and affordability in challenging correlated systems.

Wang, Qiaohong [Univ. of Chicago, IL (United State↗

DOE OSTI2024

Discovery of atomic clock-like spin defects in simple oxides from first principles

Virtually noiseless due to the scarcity of spinful nuclei in the lattice, simple oxides hold promise as hosts of solid-state spin qubits. However, no suitable spin defect has yet been found in these systems. Using high-throughput first-principles calculations, we predict spin defects in calcium oxide with electronic properties remarkably similar to those of the NV center in diamond. These defects are charged complexes where a dopant atom — Sb, Bi, or I — occupies the volume vacated by adjacent cation and anion vacancies. The predicted zero phonon line shows that the Bi complex emits in the telecommunication range, and the computed many-body energy levels suggest a viable optical cycle required for qubit initialization. Notably, the high-spin nucleus of each dopant strongly couples to the electron spin, leading to many controllable quantum levels and the emergence of atomic clock-like transitions that are well protected from environmental noise. Specifically, the Hanh-echo coherence time increases beyond seconds at the clock-like transition in the defect with 209 Bi. Our results pave the way to designing quantum states with long coherence times in simple oxides, making them attractive platforms for quantum technologies.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2024

Compressed baryon acoustic oscillation analysis is robust to modified-gravity models

Abstract We study the robustness of the baryon acoustic oscillation (BAO) analysis to the underlying cosmological model. We focus on testing the standard BAO analysis that relies on the use of a template. These templates are constructed assuming a fixed fiducial cosmological model and used to extract the location of the acoustic peaks. Such “compressed analysis” had been shown to be unbiased when applied to the ΛCDM model and some of its extensions. However, it has not been known whether this type of analysis introduces biases in a wider range of cosmological models where the template may not fully capture relevant features in the BAO signal. In this study, we apply the compressed analysis to noiseless mock power spectra that are based on Horndeski models, a broad class of modified-gravity theories specified with eight additional free parameters. We study the precision and accuracy of the BAO peak-location extraction assuming DESI, DESI II, and MegaMapper survey specifications. We find that the bias in the extracted peak locations is negligible; for example, it is less than 10% of the statistical error for even the proposed future MegaMapper survey. Our findings indicate that the compressed BAO analysis is remarkably robust to the underlying cosmological model.

Astronomy & Astrophysics↗

DOE OSTI2025

A comparison of effective field theory models of redshift space galaxy power spectra for DESI 2024 and future surveys

In preparation for the next generation of galaxy redshift surveys, and in particular the year-one data release from the Dark Energy Spectroscopic Instrument (DESI), we investigate the consistency of a variety of effective field theory models that describe the galaxy-galaxy power spectra in redshift space into the quasi-linear regime using 1-loop perturbation theory. These models are employed in the pipelines velocileptors, PyBird, and Folpsν. While these models have been validated independently, a detailed comparison with consistent choices has not been attempted. After briefly discussing the theoretical differences between the models we describe how to provide a more apples-to-apples comparison between them. We present the results of fitting mock spectra from the AbacusSummit suite of N-body simulations provided in three redshift bins to mimic the types of dark time tracers targeted by the DESI survey. We show that the theories behave similarly and give consistent constraints in both the forward-modeling and ShapeFit compressed fitting approaches. We additionally generate (noiseless) synthetic data from each pipeline to be fit by the others, varying the scale cuts in order to show that the models agree within the range of scales for which we expect 1-loop perturbation theory to be applicable. Finally, this work lays the foundation of Full-Shape analysis with DESI Y1 galaxy samples where in the tests we performed, we found no systematic error associated with the modeling of the galaxy redshift space power spectrum for this volume.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2026

Constraining primordial non-Gaussianity from DESI DR1 quasars and Planck PR4 CMB lensing

We present the first measurement of local-type primordial non-Gaussianity from the cross-correlation between 1.2 million spectroscopically confirmed quasars from the first data release (DR1) of the Dark Energy Spectroscopic Instrument (DESI) and the Planck PR4 CMB lensing reconstructions. The analysis is performed in three tomographic redshift bins covering 0.8 < z < 3.5, covering a sky fraction of ∼20%. We adopt a catalog-based pseudo-C ℓ estimator and apply linear imaging weights validated on noiseless mocks. Compared to previous analyses using photometric quasar samples, our results benefit from the high purity of the DESI spectroscopic sample, the reduced noise of PR4 lensing, and the absence of excess large-scale power in the spectroscopic quasar auto-correlation. Fitting simultaneously for the non-Gaussianity parameter f NL and the linear bias amplitude in each redshift bin, we obtain f NL = 2 +28 -34 for a response parameter p = 1.6, and f NL = 6 +20 -24 for p = 1.0. These results improve the constraints on f NL by ∼35% compared to the previous analysis based on the Legacy Imaging Survey DR9. Additionally, we derive an optimal weighting scheme to maximize the constraining power. In this case, and assuming p = 1.6, we obtain f NL = 19 +25 -31 . Our results demonstrate the statistical power of DESI quasars for probing inflationary physics, and highlight the promise of future DESI data releases.

cosmological parameters from CMBR↗