Search NASA⌕ Search

SEARCH · Search NASA

Results for “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

Generation of a single-photon source via a four-wave mixing process in a cavity

It is shown that an efficient, well-directional single-photon source can be realized via a four-wave mixing process in a cavity. The probability of producing a single-photon state nearly approaches 50%. The bandwidth of single-photons generated in this way is controllable, which is determined by that of the input pulse. Furthermore, we propose a scheme to generate a coherent multichannel single-photon source, which might have significant applications in wavelength division multiplexing quantum key distribution.

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↗

Quantum stabilizer codes for correlated and asymmetric depolarizing errors

We study the performance of common quantum stabilizer codes in the presence of asymmetric and correlated errors. Specifically, we consider the depolarizing noisy quantum memory channel and perform quantum error correction via the five- and seven-qubit stabilizer codes. We characterize these codes by means of the entanglement fidelity as a function of the error probability and the degree of memory. We show that their performances are lowered by the presence of correlations, and we compute the error probability threshold values for code effectiveness. Furthermore, we uncover that the asymmetry in the error probabilities does not affect the performance of the five-qubit code, while it does affect the performance of the seven-qubit code, which results in being less effective when considering correlated and symmetric depolarizing errors but more effective for correlated and asymmetric errors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Coherent quantum effects through dispersive bosonic media

The coherent evolution of two qubits mediated by a set of bosonic field modes is investigated. By assuming a specific asymmetric encoding of the quantum states in the internal levels of the qubits, we show that entangling quantum gates can be realized, with high fidelity, even when a large number of mediating modes is involved. The effect of losses and imperfections on the gates' operation is also considered in detail.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal distillation of three-qubit W states

Some of the asymmetric three-qubit W states are used for perfect teleportation, superdense coding, and quantum-information splitting. We present the protocols for the optimal distillation of the asymmetric as well as the symmetric W states from a single copy of any three-qubit W class pure state.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Semiquantum secret sharing using entangled states

Secret sharing is a procedure for sharing a secret among a number of participants such that only the qualified subsets of participants have the ability to reconstruct the secret. Even in the presence of eavesdropping, secret sharing can be achieved when all the members are quantum. So what happens if not all the members are quantum? In this paper, we propose two semiquantum secret sharing protocols by using maximally entangled Greenberger-Horne-Zeilinger-type states in which quantum Alice shares a secret with two classical parties, Bob and Charlie, in a way that both parties are sufficient to obtain the secret, but one of them cannot. The presented protocols are also shown to be secure against eavesdropping.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Local equivalence, surface-code states, and matroids

Recently, Ji et al. disproved the local-unitary-local Clifford (LU-LC) conjecture and showed that the local unitary (LU) and local Clifford (LC) equivalence classes of the stabilizer states are not always the same. Despite the fact that this settles the LU-LC conjecture, a sufficient condition for stabilizer states that violate the LU-LC conjecture is not known. In this paper, we investigate further the properties of stabilizer states with respect to local equivalence. Our first result shows that there exist infinitely many stabilizer states that violate the LU-LC conjecture. In particular, we show that for all numbers of qubits n{>=}28, there exist distance-two stabilizer states which are counterexamples to the LU-LC conjecture. We prove that, for all odd n{>=}195, there exist stabilizer states with distance greater than two that are LU equivalent but not LC equivalent. Two important classes of stabilizer states that are of great interest in quantum computation are the cluster states and stabilizer states of the surface codes. We show that, under some minimal restrictions, both these classes of states preclude any counterexamples. In this context, we also show that the associated surface codes do not have any encoded non-Clifford transversal gates. We characterize the Calderbank-Shor-Steane (CSS) surface-code states in terms of a class of minor closed binary matroids. In addition to making a connection to an important open problem in binary matroid theory, this characterization does in some cases provide an efficient test for CSS states that are not counterexamples.

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↗

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↗

Using postmeasurement information in state discrimination

We consider a special form of state discrimination in which after the measurement we are given additional information that may help us identify the state. This task plays a central role in the analysis of quantum cryptographic protocols in the noisy-storage model, where the identity of the state corresponds to a certain bit string, and the additional information is typically a choice of encoding that is initially unknown to the cheating party. We first provide simple optimality conditions for measurements for any such problem and show upper and lower bounds on the success probability. For a certain class of problems, we furthermore provide tight bounds on how useful postmeasurement information can be. In particular, we show that for this class finding the optimal measurement for the task of state discrimination with postmeasurement information does in fact reduce to solving a different problem of state discrimination without such information. However, we show that for the corresponding classical state discrimination problems with postmeasurement information such a reduction is impossible, by relating the success probability to the violation of Bell inequalities. This suggests the usefulness of postmeasurement information as another feature that distinguishes the classical from a quantum world.

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↗

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↗

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↗

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↗

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↗

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↗

Quantum steganography with noisy quantum channels

Steganography is the technique of hiding secret information by embedding it in a seemingly ''innocent'' message. We present protocols for hiding quantum information by disguising it as noise in a codeword of a quantum error-correcting code. The sender (Alice) swaps quantum information into the codeword and applies a random choice of unitary operation, drawing on a secret random key she shares with the receiver (Bob). Using the key, Bob can retrieve the information, but an eavesdropper (Eve) with the power to monitor the channel, but without the secret key, cannot distinguish the message from channel noise. We consider two types of protocols: one in which the hidden quantum information is stored locally in the codeword, and another in which it is embedded in the space of error syndromes. We analyze how difficult it is for Eve to detect the presence of secret messages, and estimate rates of steganographic communication and secret key consumption for specific protocols and examples of error channels. We consider both the case where there is no actual noise in the channel (so that all errors in the codeword result from the deliberate actions of Alice), and the case where the channel is noisy and not controlled by Alice and Bob.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗