Search NASA⌕ Search

SEARCH · Search NASA

Results for “bits”

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 55 records · Page 3

Bit threads in higher-curvature gravity

We generalize holographic bit threads to bulk theories with a gravitational action containing higher-curvature terms. Bit threads are a reformulation of holographic entanglement entropy, where the entropy is given by the maximum number of threads emanating from a boundary region into the bulk. We show that the addition of higher-curvature terms adds corrections to the bit thread thickness that depend on the local geometry and thread orientation. Two different methods are given: determination of the density bound by requiring the maximum number of threads through a given surface to reproduce the entanglement entropy functional on that surface, and application of Lagrange dualization. The results of the two methods are applied to Gauss-Bonnet gravity as the simplest non-trivial example.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Room temperature single-photon detectors for high bit rate quantum key distribution

We report room temperature operation of telecom wavelength single-photon detectors for high bit rate quantum key distribution (QKD). Room temperature operation is achieved using InGaAs avalanche photodiodes integrated with electronics based on the self-differencing technique that increases avalanche discrimination sensitivity. Despite using room temperature detectors, we demonstrate QKD with record secure bit rates over a range of fiber lengths (e.g., 1.26 Mbit/s over 50 km). Furthermore, our results indicate that operating the detectors at room temperature increases the secure bit rate for short distances.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Nonequilibrium formulation of varying-temperature bit erasure

Landauer's principle states that erasing a bit of information at fixed temperature T costs at least $k$ B $T$ ln 2 units of work. Here we investigate erasure at varying temperature, to which Landauer's result does not apply. Here we formulate bit erasure as a stochastic nonequilibrium process involving a compression of configuration space, with physical and logical states associated in a symmetric way. Erasure starts and ends at temperature T, but temperature can otherwise vary with time in an arbitrary way. Defined in this way, erasure is governed by a set of nonequilibrium fluctuation relations that show that varying-temperature erasure can done with less work than $k$ B $T$ ln 2. As a result, erasure and the complementary process of bit randomization can be combined to form a work-producing engine cycle.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fast nondeterministic random-bit generation using on-chip chaos lasers

It is shown that broadband chaos suitable for fast nondeterministic random-bit generation in small devices can be achieved in a semiconductor laser with a short external cavity. The design of the device is based on a theoretical model for nondeterministic random-bit generation by amplification of microscopic noise. Moreover, it is demonstrated that bit sequences passing common tests of statistical randomness at rates up to 2.08 Gbits/s can be generated using on-chip lasers with a monolithically integrated external cavity, amplifiers, and a photodetector.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum bit threads

We give a bit thread prescription that is equivalent to the quantum extremal surface prescription for holographic entanglement entropy. Our proposal is inspired by considerations of bit threads in doubly holographic models, and equivalence is established by proving a generalisation of the Riemannian max-flow min-cut theorem. We explore our proposal’s properties and discuss ways in which islands and spacetime are emergent phenomena from the quantum bit thread perspective.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Supporting 64-bit global indices in Epetra and other Trilinos packages :

The Trilinos Project is an effort to facilitate the design, development, integration and ongoing support of mathematical software libraries within an object-oriented framework. It is intended for large-scale, complex multiphysics engineering and scientific applications [2, 4, 3]. Epetra is one of its basic packages. It provides serial and parallel linear algebra capabilities. Before Trilinos version 11.0, released in 2012, Epetra used the C++ int data-type for storing global and local indices for degrees of freedom (DOFs). Since int is typically 32-bit, this limited the largest problem size to be smaller than approximately two billion DOFs. This was true even if a distributed memory machine could handle larger problems. We have added optional support for C++ long long data-type, which is at least 64-bit wide, for global indices. To save memory, maintain the speed of memory-bound operations, and reduce further changes to the code, the local indices are still 32-bit. We document the changes required to achieve this feature and how the new functionality can be used. We also report on the lessons learned in modifying a mature and popular package from various perspectives design goals, backward compatibility, engineering decisions, C++ language features, effects on existing users and other packages, and build integration.

Jhurani, Chetan↗

Bit error protection in cache memories

A computing device having a cache memory that is configured in a write-back mode is described. A cache controller in the cache memory acquires, from a record of bit errors that are present in each of a plurality of portions of the cache memory, a number of bit errors in a portion of the cache memory. The cache controller detects a coherency state of data stored in the portion of the cache memory. Based on the coherency state and the number of bit errors, the cache controller selects an error protection from among a plurality of error protections. The cache controller uses the selected error protection to protect the data stored in the portion of the cache memory from errors.

Kalamatianos, John↗

Towards a bit threads derivation of holographic entanglement of purification

We apply the bit thread formulation of holographic entanglement entropy to reduced states describing only the geometry contained within an entanglement wedge. We argue that a certain optimized bit thread configuration, which we construct, gives a purification of the reduced state to a full holographic state obeying a precise set of conditional mutual information relations. When this purification exists, we establish, under certain assumptions, the conjectured E P = E W relation equating the entanglement of purification with the area of the minimal cross section partitioning the bulk entanglement wedge. Along the way, we comment on minimal purifications of holographic states, geometric purifications, and black hole geometries.

97 MATHEMATICS AND COMPUTING↗

Demonstration of photonic micro-ring resonator based digital bit magnitude comparator

This paper details the novel design, simulation and analysis of the digital photonic single-bit magnitude comparator with the utilization of silicon micro-ring resonator as its core component. The micro-ring resonator uses electro-optic carrier injection modulation properties with its ring waveguide being structured in PIN diode. Five micro-ring resonators are used in the proposed design, with each corresponds to the specific logic mode operation. This work also presents the time varying simulation, where two predetermined 1-bit input stream is injected into the circuit at the data rate of 1 Gbps, where its output is observed via oscilloscope, where results are obtained at the sampling rate of 1.6 THz. The timing diagram for the entire simulation is also shown together with additional results obtained from the simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Memory-bit selection and recording by rotating fields in vortex-core cross-point architecture

In one of our earlier studies [Appl. Phys. Lett. 92, 022509 (2008)], we proposed a concept of robust information storage, recording and readout, which can be implementaed in nonvolatile magnetic random-access memories and is based on the energetically degenerated twofold ground states of vortex-core magnetizations. In the present study, we experimentally demonstrate reliable memory-bit selection and information recording in vortex-core cross-point architecture, specifically using a two-by-two vortex-state disk array. In order to efficiently switch a vortex core positioned at the intersection of crossed electrodes, two orthogonal addressing electrodes are selected, and then two Gaussian pulse currents of optimal pulse width and time delay are applied. Such tailored pulse-type rotating magnetic fields which occurs only at the selected intersection is prerequisite for a reliable memory-bit selection and low-power-consumption recording of information in the existing cross-point architecture.

36 MATERIALS SCIENCE↗

Bit patterned media optimization at 1 Tdot/in{sup 2} by post-annealing

We report on the fabrication of 1 Tdot/in{sup 2} bit patterned media with high coercivity (H{sub C}) and narrow intrinsic switching field distribution (iSFD) based on nanoimprint from a master pattern formed by e-beam guided block copolymer assembly onto a carbon hard mask and subsequent pattern transfer via etching into a thin CoCrPt perpendicular anisotropy recording layer. We demonstrate that an additional vacuum annealing step after pattern transfer into the CoCrPt layer and after Carbon hard mask removal not only yields recovery from undesired damage of the island edges, but actually transforms the islands into a magnetically more favorable compositional phase with higher H{sub C}, lower iSFD/H{sub C}, and three-fold increased thermal stability. Energy filtered transmission electron microscopy analysis reveals that the diffusion of Cr from the island cores to the periphery of the islands during post-annealing is responsible for the transformation of the magnetic bits into a more stable state.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Feasibility of bit patterned media for HAMR at 5 Tb/in{sup 2}

We have investigated the feasibility of BPM for HAMR via Finite Difference Time Domain and atomistic simulation and we have substantiated the feasibility of 5 Tb/in{sup 2} with two filling factors 25% and 56% even when the maximum on-track bit temperature is below the Curie temperature. The success of this underheated switching is attributed to sufficiently low anisotropy instead of reduction of Curie temperature. The temperature gradient in the cross-track direction is almost doubled if the optical head width is reduced by half, indicating the possibility of higher areal densities. Moreover, contrary to continuous media, we also found that the power absorption peaks at the bottom of the bit patterned FePt when the media is illuminated from above, which is probably due to stronger coupling there between FePt and the surrounding materials.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Error statistics in a high-speed fibreoptic communication line with a phase shift of odd bits

The propagation of optical pulses through a fibreoptic communication line with a phase shift of odd bits is directly numerically simulated. It is shown that simple analytic expressions approximate well the error probability. The phase shift of odd bits in the initial sequence is statistically shown to decrease significantly the error probability in the communication line. (fibreoptic communication lines)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Strong no-go theorem for Gaussian quantum bit commitment

Unconditionally secure bit commitment is forbidden by quantum mechanics. We extend this no-go theorem to continuous-variable protocols where both players are restricted to use Gaussian states and operations, which is a reasonable assumption in current-state optical implementations. Our Gaussian no-go theorem also provides a natural counter-example to a conjecture that quantum mechanics can be rederived from the assumption that key distribution is allowed while bit commitment is forbidden in Nature.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Invariance of the bit error rate in the ancilla-assisted homodyne detection

We investigate the minimum achievable bit error rate of the discrimination of binary coherent states with the help of arbitrary ancillary states. We adopt homodyne measurement with a common phase of the local oscillator and classical feedforward control. After one ancillary state is measured, its outcome is referred to the preparation of the next ancillary state and the tuning of the next mixing with the signal. It is shown that the minimum bit error rate of the system is invariant under the following operations: feedforward control, deformations, and introduction of any ancillary state. We also discuss the possible generalization of the homodyne detection scheme.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Redundancy of einselected information in quantum Darwinism: The irrelevance of irrelevant environment bits [Separating the wheat from the chaff: Redundancy and relevant information in quantum Darwinism]

Here, the objective, classical world emerges from the underlying quantum substrate via the proliferation of redundant copies of selected information into the environment, which acts as a communication channel, transmitting that information to observers. These copies are independently accessible, allowing many observers to reach consensus about the state of a quantum system via its imprints in the environment. Quantum Darwinism recognizes that the redundancy of information is thus central to the emergence of objective reality in the quantum world. However, in addition to the “quantum system of interest,” there are many other systems “of no interest” in the Universe that can imprint information on the common environment. There is therefore a danger that the information of interest will be diluted with irrelevant bits, suppressing the redundancy responsible for objectivity. We show that mixing of the relevant (the “wheat”) and irrelevant (the “chaff”) bits of information makes little quantitative difference to the redundancy of the information of interest. Thus, we demonstrate that it does not matter whether one separates the wheat (relevant information) from the (irrelevant) chaff: The large redundancy of the relevant information survives dilution, providing evidence of the objective, effectively classical world.

74 ATOMIC AND MOLECULAR PHYSICS↗

A Radiation-Hard 8-Channel 15-Bit 40-MSPS ADC for the ATLAS Liquid Argon Calorimeter Readout

The custom design of a radiation-hardened, 8-channel, 40-MSPS, 15-bit resolution, 14.2-bit dynamic range, 11.4-ENOB ADC data acquisition ASIC fabricated in a commercial 65-nm triple-well CMOS technology is presented. The ADC is developed for and integrates seamlessly into the readout system for the ATLAS liquid argon (LAr) calorimeter in the high-luminosity large hadron collider (HLLHC) upgrade at CERN, which will require a total of 364 936 ADC channels. A three-stage MDAC+SAR pipelined ADC architecture was designed to meet the physics requirements and scientific goals of the ATLAS experiment. The ADC is a fully self-contained data acquisition system that includes foreground calibration, digital data processing, digital control, and supporting circuitry. The measured performance shows the ADC achieves a competitive dynamic range and SNDR, and it meets or exceeds the ATLAS analog requirements. Radiation tolerance and scalability design considerations were implemented at the device-, circuit-, and system-level. Radiation-hardening-by-design techniques used include redundancy for digital circuits, the use of MiM capacitors, and a hybrid RC-DAC for the ADC core. The ADC ASIC was demonstrated to be robust against the effects of the intense radiation expected in the HL-LHC experimental environment.

DAQ↗

The Complexity of Bit Retrieval

Bit retrieval is the problem of reconstructing a periodic binary sequence from its periodic autocorrelation, with applications in cryptography and x-ray crystallography. After defining the problem, with and without noise, we describe and compare various algorithms for solving it. A geometrical constraint satisfaction algorithm, relaxed-reflect-reflect, is currently the best algorithm for noisy bit retrieval.

97 MATHEMATICS AND COMPUTING↗