Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quantum cryptography”

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 199 records · Page 11

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↗

Practical private database queries based on a quantum-key-distribution protocol

Private queries allow a user, Alice, to learn an element of a database held by a provider, Bob, without revealing which element she is interested in, while limiting her information about the other elements. We propose to implement private queries based on a quantum-key-distribution protocol, with changes only in the classical postprocessing of the key. This approach makes our scheme both easy to implement and loss tolerant. While unconditionally secure private queries are known to be impossible, we argue that an interesting degree of security can be achieved by relying on fundamental physical principles instead of unverifiable security assumptions in order to protect both the user and the database. We think that the scope exists for such practical private queries to become another remarkable application of quantum information in the footsteps of quantum key distribution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Min-entropy and quantum key distribution: Nonzero key rates for ''small'' numbers of signals

We calculate an achievable secret key rate for quantum key distribution with a finite number of signals by evaluating the quantum conditional min-entropy explicitly. The min-entropy for a classical random variable is the negative logarithm of the maximal value in its probability distribution. The quantum conditional min-entropy can be expressed in terms of the guessing probability, which we calculate for d-dimensional systems. We compare these key rates to previous approaches using the von Neumann entropy and find nonzero key rates for a smaller number of signals. Furthermore, we improve the secret key rates by modifying the parameter estimation step. Both improvements taken together lead to nonzero key rates for only 10{sup 4}-10{sup 5} signals. An interesting conclusion can also be drawn from the additivity of the min-entropy and its relation to the guessing probability: for a set of symmetric tensor product states, the optimal minimum-error discrimination (MED) measurement is the optimal MED measurement on each subsystem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Continuous-variable quantum-key-distribution protocols with a non-Gaussian modulation

In this paper, we consider continuous-variable quantum-key-distribution (QKD) protocols which use non-Gaussian modulations. These specific modulation schemes are compatible with very efficient error-correction procedures, hence allowing the protocols to outperform previous protocols in terms of achievable range. In their simplest implementation, these protocols are secure for any linear quantum channels (hence against Gaussian attacks). We also show how the use of decoy states makes the protocols secure against arbitrary collective attacks, which implies their unconditional security in the asymptotic limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Security proof for quantum key distribution using qudit systems

We provide security bounds against coherent attacks for two families of quantum key distribution protocols that use d-dimensional quantum systems. In the asymptotic regime, both the secret key rate for fixed noise and the robustness to noise increase with d. The finite key corrections are found to be almost insensitive to d < or approx. 20.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A transform of complementary aspects with applications to entropic uncertainty relations

Even though mutually unbiased bases and entropic uncertainty relations play an important role in quantum cryptographic protocols, they remain ill understood. Here, we construct special sets of up to 2n+1 mutually unbiased bases (MUBs) in dimension d=2{sup n}, which have particularly beautiful symmetry properties derived from the Clifford algebra. More precisely, we show that there exists a unitary transformation that cyclically permutes such bases. This unitary can be understood as a generalization of the Fourier transform, which exchanges two MUBs, to multiple complementary aspects. We proceed to prove a lower bound for min-entropic entropic uncertainty relations for any set of MUBs and show that symmetry plays a central role in obtaining tight bounds. For example, we obtain for the first time a tight bound for four MUBs in dimension d=4, which is attained by an eigenstate of our complementarity transform. Finally, we discuss the relation to other symmetries obtained by transformations in discrete phase space and note that the extrema of discrete Wigner functions are directly related to min-entropic uncertainty relations for MUBs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Experimental study on discretely modulated continuous-variable quantum key distribution

We present a discretely modulated continuous-variable quantum key distribution system in free space by using strong coherent states. The amplitude noise in the laser source is suppressed to the shot-noise limit by using a mode cleaner combined with a frequency shift technique. Also, it is proven that the phase noise in the source has no impact on the final secret key rate. In order to increase the encoding rate, we use broadband homodyne detectors and the no-switching protocol. In a realistic model, we establish a secret key rate of 46.8 kbits/s against collective attacks at an encoding rate of 10 MHz for a 90% channel loss when the modulation variance is optimal.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Proof-of-principle experiment of a modified photon-number-splitting attack against quantum key distribution

Any imperfections in a practical quantum key distribution (QKD) system may be exploited by an eavesdropper to collect information about the key without being discovered. We propose a modified photon-number-splitting attack scheme against QKD systems based on weak laser pulses taking advantage of possible multiphoton pulses. Proof-of-principle experiments are demonstrated. The results show that the eavesdropper can get information about the key generated between the legitimate parties without being detected. Since the equivalent attenuation introduced by the eavesdropper for pulses of different average photon numbers are different, the decoy-state method is effective in fighting against this kind of attack. This has also been proven in our experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Provably secure and high-rate quantum key distribution with time-bin qudits

The security of conventional cryptography systems is threatened in the forthcoming era of quantum computers. Quantum key distribution (QKD) features fundamentally proven security and offers a promising option for quantum-proof cryptography solution. Although prototype QKD systems over optical fiber have been demonstrated over the years, the key generation rates remain several orders of magnitude lower than current classical communication systems. In an effort toward a commercially viable QKD system with improved key generation rates, we developed a discrete-variable QKD system based on time-bin quantum photonic states that can generate provably secure cryptographic keys at megabit-per-second rates over metropolitan distances. We use high-dimensional quantum states that transmit more than one secret bit per received photon, alleviating detector saturation effects in the superconducting nanowire single-photon detectors used in our system that feature very high detection efficiency (of more than 70%) and low timing jitter (of less than 40 ps). Our system is constructed using commercial off-the-shelf components, and the adopted protocol can be readily extended to free-space quantum channels. In conclusion, the security analysis adopted to distill the keys ensures that the demonstrated protocol is robust against coherent attacks, finite-size effects, and a broad class of experimental imperfections identified in our system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum tagging for tags containing secret classical data

Various authors have considered schemes for 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 potentially unbounded. All of the schemes proposed elsewhere in the literature assume that the adversary is able to inspect the interior of the tagging device. All of these schemes have been shown to be breakable if the adversary has unbounded predistributed entanglement. We consider here the case in which the tagging device contains a finite key string shared with distant sites but kept secret from the adversary, and show this allows the location of the tagging device to be authenticated securely and indefinitely. Our protocol relies on quantum key distribution between the tagging device and at least one distant site, and demonstrates a new practical application of quantum key distribution. It also illustrates that the attainable security in position-based cryptography can depend crucially on apparently subtle details in the security scenario considered.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum measurements of atoms using cavity QED

Generalized quantum measurements are an important extension of projective or von Neumann measurements in that they can be used to describe any measurement that can be implemented on a quantum system. We describe how to realize two nonstandard quantum measurements using cavity QED. The first measurement optimally and unambiguously distinguishes between two nonorthogonal quantum states. The second example is a measurement that demonstrates superadditive quantum coding gain. The experimental tools used are single-atom unitary operations effected by Ramsey pulses and two-atom Tavis-Cummings interactions. We show how the superadditive quantum coding gain is affected by errors in the field-ionization detection of atoms and that even with rather high levels of experimental imperfections, a reasonable amount of superadditivity can still be seen. To date, these types of measurements have been realized only on photons. It would be of great interest to have realizations using other physical systems. This is for fundamental reasons but also since quantum coding gain in general increases with code word length, and a realization using atoms could be more easily scaled than existing realizations using photons.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Intrinsic quantum correlations of weak coherent states for quantum communication

Intrinsic quantum correlations of weak coherent states are observed between two parties through a novel detection scheme, which can be used as a supplement to the existence decoy-state Bennett-Brassard 1984 protocol and the differential phase-shift quantum key distribution (DPS-QKD) protocol. In a proof-of-principle experiment, we generate bipartite correlations of weak coherent states using weak local oscillator fields in two spatially separated balanced homodyne detections. We employ a nonlinearity of postmeasurement method to obtain the bipartite correlations from two single-field interferences at individual homodyne measurements. This scheme is then used to demonstrate bits correlations between two parties over a distance of 10 km through a transmission fiber. We believe that the scheme can add another physical layer of security to these protocols for quantum key distribution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Clifford transformations for fermionic quantum systems: From Pauli and Majorana operators to Dirac fermions

Clifford gates and transformations, which map products of elementary Pauli or Majorana operators to other such products, are foundational in quantum computing, underpinning the stabilizer formalism, error-correcting codes, magic state distillation, quantum communication and cryptography, and qubit tapering. Moreover, circuits composed entirely of Clifford gates are classically simulatable, highlighting their computational significance. In this article we extend the concept of Clifford transformations to Dirac fermions. We demonstrate that discrete Clifford transformations are generated by half-body and pair operators while continuous Clifford transformations are generated by number operators, providing a systematic framework for their characterization. Additionally, we establish connections with fermionic mean-field theories and applications in qubit tapering, offering insights into their broader implications in quantum computing.

74 ATOMIC AND MOLECULAR PHYSICS↗

Quantum states prepared by realistic entanglement swapping

Entanglement swapping between photon pairs is a fundamental building block in schemes using quantum relays or quantum repeaters to overcome the range limits of long-distance quantum key distribution. We develop a closed-form solution for the actual quantum states prepared by realistic entanglement swapping, which takes into account experimental deficiencies due to inefficient detectors, detector dark counts, and multiphoton-pair contributions of parametric down-conversion sources. We investigate how the entanglement present in the final state of the remaining modes is affected by the real-world imperfections. To test the predictions of our theory, comparison with previously published experimental entanglement swapping is provided.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum key management

Innovations for quantum key management harness quantum communications to form a cryptography system within a public key infrastructure framework. In example implementations, the quantum key management innovations combine quantum key distribution and a quantum identification protocol with a Merkle signature scheme (using Winternitz one-time digital signatures or other one-time digital signatures, and Merkle hash trees) to constitute a cryptography system. More generally, the quantum key management innovations combine quantum key distribution and a quantum identification protocol with a hash-based signature scheme. This provides a secure way to identify, authenticate, verify, and exchange secret cryptographic keys. Features of the quantum key management innovations further include secure enrollment of users with a registration authority, as well as credential checking and revocation with a certificate authority, where the registration authority and/or certificate authority can be part of the same system as a trusted authority for quantum key distribution.

97 MATHEMATICS AND COMPUTING↗

High-Purity Quantum Emission from an Au 24 (S-CH 2 Ph- t Bu) 20 Nanocluster at Room Temperature

Atomically precise gold nanoclusters have garnered significant attention for their diverse applications, ranging from biological labeling to optoelectronics. Their potential in optical quantum computing, which calls for ideal single-photon sources, has recently become a key area of interest. In the current work, we use photon antibunching experiments to explore the single-photon emission efficiency of atomically precise Au 24 nanoclusters protected by 4-tert-butylbenzyl mercaptan ligands (Au 24 (TBBM) 20 ). This cluster exhibits quantum emission with good photostability and without any observable blinking or spectral drift at room temperature under an inert gas atmosphere, with antibunching dips (g 2 (0)) as low as 0.07 in the solid state or, equivalently, a single-photon purity of 93% under time-gated conditions. Transient absorption and time-gated antibunching studies reveal that the short emission lifetime of this cluster and its high photoluminescence quantum yield in the solid state play critical roles in enhancing the emitted single-photon purity. This research advances the understanding of single-emitter behavior in atomically precise gold nanoclusters, contributing to the development of stable quantum emitters that are essential for quantum computing and cryptography.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Long coherence times in nuclear spin-free vanadyl qubits

Quantum information processing (QIP) offers the potential to create new frontiers in fields ranging from quantum biology to cryptography. Two key figures of merit for electronic spin qubits, the smallest units of QIP, are the coherence time ( T 2 ), the lifetime of the qubit, and the spin–lattice relaxation time (T 1 ), the thermally defined upper limit of T 2 . To achieve QIP, processable qubits with long coherence times are required. Recent studies on (Ph 4 P-d 20 ) 2 [V(C 8 S 8 ) 3 ], a vanadium-based qubit, demonstrate that millisecond T 2 times are achievable in transition metal complexes with nuclear spinfree environments. Applying these principles to vanadyl complexes offers a route to combine the previously established surface compatibility of the flatter vanadyl structures with a long T 2 . Toward those ends, we investigated a series of four qubits, (Ph 4 P) 2 [VO(C 8 S 8 ) 2 ] (1), (Ph 4 P) 2 [VO(β-C 3 S 5 ) 2 ] (2), (Ph 4 P) 2 [VO(α-C 3 S 5 ) 2 ] (3), and (Ph 4 P) 2 [VO(C 3 S 4 O) 2 ] (4), by pulsed electron paramagnetic resonance (EPR) spectroscopy and compared the performance of these species with our recently reported set of vanadium tris(dithiolene) complexes. Crucially we demonstrate that solutions of 1–4 in SO 2 , a uniquely polar nuclear spinfree solvent, reveal T 2 values of up to 152(6) μs, comparable to the best molecular qubit candidates. Upon transitioning to vanadyl species from the tris(dithiolene) analogues, we observe a remarkable order of magnitude increase in T 2 , attributed to stronger solute–solvent interactions with the polar vanadium-oxo moiety. Simultaneously, we detect a small decrease in T 2 for the vanadyl analogues relative to the tris(dithiolene) complexes. We attribute this decrease to the absence of one nuclear spinfree ligand, which served to shield the vanadium centers against solvent nuclear spins. Lastly, our results highlight new design principles for long T 1 and T 2 times by demonstrating the efficacy of ligand-based tuning of solute–solvent interactions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fair loss-tolerant quantum coin flipping

Coin flipping is a cryptographic primitive in which two spatially separated players, who do not trust each other, wish to establish a common random bit. If we limit ourselves to classical communication, this task requires either assumptions on the computational power of the players or it requires them to send messages to each other with sufficient simultaneity to force their complete independence. Without such assumptions, all classical protocols are so that one dishonest player has complete control over the outcome. If we use quantum communication, on the other hand, protocols have been introduced that limit the maximal bias that dishonest players can produce. However, those protocols would be very difficult to implement in practice because they are susceptible to realistic losses on the quantum channel between the players or in their quantum memory and measurement apparatus. In this paper, we introduce a quantum protocol and we prove that it is completely impervious to loss. The protocol is fair in the sense that either player has the same probability of success in cheating attempts at biasing the outcome of the coin flip. We also give explicit and optimal cheating strategies for both players.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗