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 163 records · Page 9

Security proof for cryptographic protocols based only on the monogamy of Bell's inequality violations

We show that monogamy of Bell's inequality violations, which is strictly weaker condition than the no-signaling principle is enough to prove security of quantum key distribution. We derive our results for a whole class of monogamy constraints and generalize our results to any theory that communicating parties may have access to. Some of these theories do not respect the no-signaling principle yet still allow for secure communication. This proves that no signaling is only a sufficient condition for the possibility of secure communication, but not the necessary one. We also present some new qualitative results concerning the security of existing quantum key distribution protocols.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Non-Markovian effects on quantum-communication protocols

We show how, under the influence of non-Markovian environments, two different maximally entangled Bell states give rise to states that have equal classical correlations and the same capacities to violate the Bell-Clauser-Horne-Shimony-Holt inequality, but intriguingly differing usefulness for teleportation and dense coding. We elucidate how different entanglement measures like negativity and concurrence, and two different measures of quantum discord, could account for these behaviors. In particular, we explicitly show how the Ollivier-Zurek measure of discord directly accounts for one state being a better resource for dense coding compared to another. Our study leads to several important issues about these measures of discord.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Finite-size analysis of a continuous-variable quantum key distribution

The goal of this paper is to extend the framework of finite-size analysis recently developed for quantum key distribution to continuous-variable protocols. We do not solve this problem completely here, and we mainly consider the finite-size effects on the parameter estimation procedure. Despite the fact that some questions are left open, we are able to give an estimation of the secret key rate for protocols which do not contain a postselection procedure. As expected, these results are significantly more pessimistic than those obtained in the asymptotic regime. However, we show that recent continuous-variable protocols are able to provide fully secure secret keys in the finite-size scenario, over distances larger than 50 km.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Continuous quantum error correction through local operations

We propose local strategies to protect global quantum information. The protocols, which are quantum error-correcting codes for dissipative systems, are based on environment measurements, direct feedback control, and simple encoding of the logical qubits into physical qutrits whose decaying transitions are indistinguishable and equally probable. The simple addition of one extra level in the description of the subsystems allows for local actions to fully and deterministically protect global resources such as entanglement. We present codes for both quantum jump and quantum state diffusion measurement strategies and test them against several sources of inefficiency. The use of qutrits in information protocols suggests further characterization of qutrit-qutrit disentanglement dynamics, which we also give together with simple local environment measurement schemes able to prevent distillability sudden death and even enhance entanglement in situations in which our feedback error correction is not possible.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Continuous-variable quantum key distribution in non-Markovian channels

We address continuous-variable quantum key distribution (QKD) in non-Markovian lossy channels and show how the non-Markovian features may be exploited to enhance security and/or to detect the presence and the position of an eavesdropper along the transmission line. In particular, we suggest a coherent-state QKD protocol which is secure against Gaussian individual attacks based on optimal 1{yields}2 asymmetric cloning machines for arbitrarily low values of the overall transmission line. The scheme relies on specific non-Markovian properties, and cannot be implemented in ordinary Markovian channels characterized by uniform losses. Our results give a clear indication of the potential impact of non-Markovian effects in QKD.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fault tolerance in parity-state linear optical quantum computing

We use a combination of analytical and numerical techniques to calculate the noise threshold and resource requirements for a linear optical quantum computing scheme based on parity-state encoding. Parity-state encoding is used at the lowest level of code concatenation in order to efficiently correct errors arising from the inherent nondeterminism of two-qubit linear-optical gates. When combined with teleported error-correction (using either a Steane or Golay code) at higher levels of concatenation, the parity-state scheme is found to achieve a saving of approximately three orders of magnitude in resources when compared to the cluster state scheme, at a cost of a somewhat reduced noise threshold.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simple protocols for oblivious transfer and secure identification in the noisy-quantum-storage model

We present simple protocols for oblivious transfer and password-based identification which are secure against general attacks in the noisy-quantum-storage model as defined in R. Koenig, S. Wehner, and J. Wullschleger [e-print arXiv:0906.1030]. We argue that a technical tool from Koenig et al. suffices to prove security of the known protocols. Whereas the more involved protocol for oblivious transfer from Koenig et al. requires less noise in storage to achieve security, our ''canonical'' protocols have the advantage of being simpler to implement and the security error is easier control. Therefore, our protocols yield higher OT rates for many realistic noise parameters. Furthermore, a proof of security of a direct protocol for password-based identification against general noisy-quantum-storage attacks is given.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Differential-phase-shift quantum key distribution with segmented pulse trains

We present a modified scheme of differential-phase-shift (DPS) quantum key distribution (QKD) for improving its performance. A transmitter sends a weak coherent pulse train segmented with vacant pulses. Then, a receiver can find eavesdropping by monitoring the photon detection rate at particular time slots. Simulations show that the proposed scheme is robust against a sequential attack and a general individual attack.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗