Search NASA⌕ Search

SEARCH · Search NASA

Results for “Protocol”

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 1,693 records · Page 94

Aperiodic dynamical decoupling sequences in the presence of pulse errors

Dynamical decoupling (DD) is a promising tool for preserving the quantum states of qubits. However, small imperfections in the control pulses can seriously affect the fidelity of decoupling, and qualitatively change the evolution of the controlled system at long times. Using both analytical and numerical tools, we theoretically investigate the effect of the pulse error accumulation for two aperiodic DD sequences, Uhrig's DD (UDD) protocol (Uhrig 2007 Phys. Rev. Lett. 98 100504), and the quadratic DD (QDD) protocol (West et al 2010 Phys. Rev. Lett. 104 130501). We consider the implementation of these sequences using the electron spins of phosphorus donors in silicon, where DD sequences are applied to suppress dephasing of the donor spins. The dependence of the decoupling fidelity on different initial states of the spins is the focus of our study. We investigate in detail the initial drop in the DD fidelity, and its long-term saturation. We also demonstrate that by applying the control pulses along different directions, the performance of QDD protocols can be noticeably improved, and explain the reason for such an improvement. Our results can be useful for future implementations of the aperiodic decoupling protocols, and for better understanding of the impact of errors on quantum control of spins.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Saturating the one-axis twisting quantum Cramér-Rao bound with a total spin readout

We show that the lowest quantum Cramér-Rao bound achievable in interferometry with a one-axis twisted spin coherent state is saturated by the asymptotic method of moments error of a protocol that uses one call to the one-axis twisting, one call to time-reversed one-axis twisting, and a final total spin measurement (i.e., a twist-untwist protocol). The result is derived by first showing that the metrological phase diagram for one-axis twisting is asymptotically characterized by a single quantum Fisher information value N(N + 1)/2 for all times, then constructing a twist-untwist protocol having a method of moments error that saturates this value. The case of finite-range one-axis twisting is similarly analyzed, and a simple functional form for the metrological phase diagram is found in both the short-range and long-range interaction regimes. Numerical evidence suggests that the finite-range analogues of twist-untwist protocols can exhibit a method of moments error that asymptotically saturates the lowest quantum Cramér-Rao bound achievable in interferometry with finite-range one-axis twisted spin coherent states for all interaction times.

36 MATERIALS SCIENCE↗

Spectral hole burning for stopping light

We propose a protocol for storage and retrieval of photon wave packets in a {lambda}-type atomic medium. This protocol derives from spectral hole burning and takes advantages of the specific properties of solid-state systems at low temperature, such as rare-earth ion-doped crystals. The signal pulse is tuned to the center of the hole that has been burnt previously within the inhomogeneously broadened absorption band. The group velocity is strongly reduced, being proportional to the hole width. This way the optically carried information and energy are carried over to the off-resonance optical dipoles. Storage and retrieval are performed by conversion to and from ground-state Raman coherence by using brief {pi} pulses. The protocol exhibits some resemblance with the well-known electromagnetically induced transparency process. It also presents distinctive features such as the absence of coupling beam. In this paper we detail the various steps of the protocol, summarize the critical parameters, and theoretically examine the recovery efficiency.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal entanglement generation for efficient hybrid quantum repeaters

We propose a realistic protocol to generate entanglement between quantum memories at neighboring nodes in hybrid quantum repeaters. Generated entanglement includes only one type of error, which enables efficient entanglement distillation. In contrast to the known protocols with such a property, our protocol with ideal detectors achieves the theoretical limit of the success probability and the fidelity to a Bell state, promising higher efficiencies in the repeaters. We also show that the advantage of our protocol remains even with realistic threshold detectors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Environment-assisted quantum-information correction for continuous variables

Quantum-information protocols are inevitably affected by decoherence which is associated with the leakage of quantum information into an environment. In this article we address the possibility of recovering the quantum information from an environmental measurement. We investigate continuous-variable quantum information, and we propose a simple environmental measurement that under certain circumstances fully restores the quantum information of the signal state although the state is not reconstructed with unit fidelity. We implement the protocol for which information is encoded into conjugate quadratures of coherent states of light and the noise added under the decoherence process is of Gaussian nature. The correction protocol is tested using both a deterministic as well as a probabilistic strategy. The potential use of the protocol in a continuous-variable quantum-key distribution scheme as a means to combat excess noise is also investigated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum circuit for the proof of the security of quantum key distribution without encryption of error syndrome and noisy processing

One of the simplest security proofs of quantum key distribution is based on the so-called complementarity scenario, which involves the complementarity control of an actual protocol and a virtual protocol [M. Koashi, e-print arXiv:0704.3661 (2007)]. The existing virtual protocol has a limitation in classical postprocessing, i.e., the syndrome for the error-correction step has to be encrypted. In this paper, we remove this limitation by constructing a quantum circuit for the virtual protocol. Moreover, our circuit with a shield system gives an intuitive proof of why adding noise to the sifted key increases the bit error rate threshold in the general case in which one of the parties does not possess a qubit. Thus, our circuit bridges the simple proof and the use of wider classes of classical postprocessing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reference-frame-independent quantum key distribution

We describe a quantum key distribution protocol based on pairs of entangled qubits that generates a secure key between two partners in an environment of unknown and slowly varying reference frame. A direction of particle delivery is required, but the phases between the computational basis states need not be known or fixed. The protocol can simplify the operation of existing setups and has immediate applications to emerging scenarios such as earth-to-satellite links and the use of integrated photonic waveguides. We compute the asymptotic secret key rate for a two-qubit source, which coincides with the rate of the six-state protocol for white noise. We give the generalization of the protocol to higher-dimensional systems and detail a scheme for physical implementation in the three-dimensional qutrit case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum tagging: Authenticating location via quantum information and relativistic signaling constraints

We define the task of quantum tagging, that is, authenticating the classical location of a classical tagging device by sending and receiving quantum signals from suitably located distant sites, in an environment controlled by an adversary whose quantum information processing and transmitting power is unbounded. We define simple security models for this task and briefly discuss alternatives. We illustrate the pitfalls of naive quantum cryptographic reasoning in this context by describing several protocols which at first sight appear unconditionally secure but which, as we show, can in fact be broken by teleportation-based attacks. We also describe some protocols which cannot be broken by these specific attacks, but do not prove they are unconditionally secure. We review the history of quantum tagging protocols, and show that protocols previously proposed by Malaney and Chandran et al. are provably insecure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Practical quantum coin flipping

We show that in the unconditional security model, a single quantum strong coin flip with security guarantees that are strictly better than in any classical protocol is possible to implement with current technology. Our protocol takes into account all aspects of an experimental implementation, including losses, multiphoton pulses emitted by practical photon sources, channel noise, detector dark counts, and finite quantum efficiency. We calculate the abort probability when both players are honest, as well as the probability of one player forcing his desired outcome. For a channel length up to 21 km and commonly used parameter values, we can achieve honest abort and cheating probabilities that are better than in any classical protocol. Our protocol is, in principle, implementable using attenuated laser pulses, with no need for entangled photons or any other specific resources.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

When a quantum measurement can be implemented locally, and when it cannot

In the absence of quantum channels, local operations on subsystems and classical communication between parties (LOCC) constitute the most general protocols available on spatially separated quantum systems. Every LOCC protocol implements a separable quantum measurement, but it is known that there exist separable measurements that cannot be implemented by LOCC. A longstanding problem in quantum information theory is to understand the difference between LOCC and the full set of separable measurements. Toward this end, we show in this paper how to construct an LOCC protocol to implement an arbitrary separable measurement whenever such a protocol exists. In addition, given a measurement that cannot be implemented by LOCC within some fixed maximum number of rounds, the method shows explicitly that this is the case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Trustworthiness of detectors in quantum key distribution with untrusted detectors

Measurement-device-independent quantum key distribution (MDI-QKD) protocol has been demonstrated as a viable solution to detector side-channel attacks. One of the main advantages of MDI-QKD is that the security can be proved without making any assumptions about how the measurement device works. The price to pay is the relatively low secure key rate comparing with conventional quantum key distribution (QKD), such as the decoy-state BB84 protocol. Recently a new QKD protocol, aiming at bridging the strong security of MDI-QKD with the high e ciency of conventional QKD, has been proposed. In this protocol, the legitimate receiver employs a trusted linear optics network to encode information on photons received from an insecure quantum channel, and then performs a Bell state measurement (BSM) using untrusted detectors. One crucial assumption made in most of these studies is that the untrusted BSM located inside the receiver's laboratory cannot send any unwanted information to the outside. Here in this paper, we show that if the BSM is completely untrusted, a simple scheme would allow the BSM to send information to the outside. Combined with Trojan horse attacks, this scheme could allow Eve to gain information of the quantum key without being detected. Ultimately, to prevent the above attack, either countermeasures to Trojan horse attacks or some trustworthiness to the "untrusted" BSM device is required.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum secret sharing with polarization-entangled photon pairs

Here, we describe and experimentally demonstrate a more practical three-party quantum secret sharing (QSS) protocol using polarization-entangled photon pairs. The source itself serves as an active participant and can switch between the required photon states by modulating the pump beam only, thereby making the protocol less susceptible to loss and amenable to fast switching. We derive a security proof based on quantum key distribution, demonstrating our QSS protocol to be secure against both eavesdropping and dishonest participants. Compared to three-photon protocols, the practical efficiency is dramatically improved as there is no need to generate, transmit, or detect a third photon.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hyperentangled Time-Bin and Polarization Quantum Key Distribution

Fiber-based quantum communication networks are currently limited without quantum repeaters. Satellite-based quantum links have been proposed to extend the network domain. Here, we develop a quantum communication system, suitable for realistic satellite-to-ground communication. With this system, we execute an entanglement-based quantum key distribution (QKD) protocol developed by Bennett, Brassard, and Mermin (BBM92), achieving quantum bit-error rates (QBERs) below 2% in all bases. More importantly, we demonstrate low-QBER execution of a higher-dimensional hyperentanglement-based QKD protocol, using photons simultaneously entangled in polarization and time bin, leading to significantly higher secure key rates, at the cost of increased technical complexity and system size. We show that our protocol is suitable for a space-to-ground link, after incorporating Doppler-shift compensation, and verify its security using a rigorous finite-key analysis. Additionally, we discuss system-engineering considerations relevant to those and other quantum communication protocols and their dependence on what photonic degrees of freedom are utilized.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Hybrid Authentication and Authorization Process for Control System Networks

Convergence of control system and IT networks require that security, privacy, and trust be addressed. Trust management continues to plague traditional IT managers and is even more complex when extended into control system networks, with potentially millions of entities, a mission that requires 100% availability. Yet these very networks necessitate a trusted secure environment where controllers and managers can be assured that the systems are secure and functioning properly. We propose a hybrid authentication management protocol that addresses the unique issues inherent within control system networks, while leveraging the considerable research and momentum in existing IT authentication schemes. Our hybrid authentication protocol for control systems provides end device to end device authentication within a remote station and between remote stations and control centers. Additionally, the hybrid protocol is failsafe and will not interrupt communication or control of vital systems in a network partition or device failure. Finally, the hybrid protocol is resilient to transitory link loss and can operate in an island mode until connectivity is reestablished.

99 GENERAL AND MISCELLANEOUS↗

Improving transition to IPv6-only via RFC8925 and IPv4 DNS Interventions

Nine years have passed since the American Registry for Internet Numbers exhausted its allocation of Internet Protocol version 4 (IPv4) addresses, and four years have passed since the United States Government mandated federal agencies to complete the transition to Internet Protocol version 6 (IPv6). Despite the IPv4 address shortage and IPv6 mandate, Federally Funded Research and Development Centers (FFRDCs) are still struggling to sunset IPv4. As demonstrated on SC23’s SC23v6 wireless network, newer tooling such as RFC8925 allows clients to disable their IPv4 protocol stack while retaining legacy IP connectivity via the RFC6145 translation algorithm. However, SC23v6 wireless clients without RFC8925 support or a disabled IPv6 stack would continue to receive internet access via legacy IPv4. This paper introduces a method of using poisoned IPv4 Domain Name System (DNS) records to gracefully inform IPv4-only clients at SC24’s SC24v6 wireless network about their inability to use the current version of internet protocol, with a goal of minimal impact to RFC8925 and dual-stack clients. When implemented as designed, this method may improve supportability and user experience of IPv6-only deployments at FFRDCs.

Costello, Thomas M↗

Integrating 5G Technology for Improved Process Monitoring and Network Slicing in ICS

Industrial Control Systems (ICS) are crucial for monitoring physical processes that support essential cyber-enabled services like power generation. The use of proprietary communication and lack of effective intrusion detection mechanisms pose constraints for efficient operation. Therefore, there is a need to modernize these systems with decentralized technologies like Edge Computing and 5G. However, integrating 5G and Edge Computing into large-scale ICS networks presents implementation and performance challenges. To address these challenges, this paper proposes an integrated ICS architecture that combines 5G and Edge Computing technologies with traditional ICS protocols. The objective is to minimize implementation and operational difficulties while improving the monitoring of physical processes and enabling robust intrusion detection. The proposed architecture outlines the necessary components, services, and communication protocols required for the integration of 5G and Edge Computing.

Aguayo, Jared M.↗

Machine Learning Based Resilience Testing of an Address Randomization Cyber Defense

Moving target defenses (MTDs) are widely used as an active defense strategy for thwarting cyberattacks on cyber-physical systems by increasing diversity of software and network paths. Recently, machine Learning (ML) and deep Learning (DL) models have been demonstrated to defeat some of the cyber defenses by learning attack detection patterns and defense strategies. It raises concerns about the susceptibility of MTD to ML and DL methods. Here, in this article, we analyze the effectiveness of ML and DL models when it comes to deciphering MTD methods and ultimately evade MTD-based protections in real-time systems. Specifically, we consider a MTD algorithm that periodically randomizes address assignments within the MIL-STD-1553 protocol—a military standard serial data bus. Two ML and DL-based tasks are performed on MIL-STD-1553 protocol to measure the effectiveness of the learning models in deciphering the MTD algorithm: 1) determining whether there is an address assignments change i.e., whether the given system employs a MTD protocol and if it does 2) predicting the future address assignments. The supervised learning models (random forest and k-nearest neighbors) effectively detected the address assignment changes and classified whether the given system is equipped with a specified MTD protocol. On the other hand, the unsupervised learning model (K-means) was significantly less effective. The DL model (long short-term memory) was able to predict the future addresses with varied effectiveness based on MTD algorithm's settings.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Black-box optimization of CT acquisition and reconstruction parameters: a reinforcement learning approach

Protocol optimization is critical in Computed Tomography (CT) for achieving desired diagnostic image quality while minimizing radiation dose. Due to the inter-effect of influencing CT parameters, traditional optimization methods rely on the testing of exhaustive combinations of these parameters. This poses a notable limitation due to the impracticality of exhaustive parameter testing. This study introduces a novel methodology leveraging Virtual Imaging Trials (VITs) and reinforcement learning to more efficiently optimize CT protocols. Computational phantoms with liver lesions were imaged using a validated CT simulator and reconstructed with a novel CT reconstruction Toolkit. The optimization parameter space included tube voltage, tube current, reconstruction kernel, slice thickness, and pixel size. The optimization process was done using a Proximal Policy Optimization (PPO) agent which was trained to maximize the Detectability Index (d’) of the liver lesion for each reconstructed image. Results showed that our reinforcement learning approach found the absolute maximum d’ across the test cases while requiring 79.7% fewer steps compared to an exhaustive search, demonstrating both accuracy and computational efficiency, offering a efficient and robust framework for CT protocol optimization. The flexibility of the proposed technique allows for use of varying image quality metrics as the objective metric to maximize for. Our findings highlight the advantages of combining VIT and reinforcement learning for CT protocol management.

Fenwick, David [Duke University Medical Center]↗