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 145 records · Page 8

Bounds on the information rate of quantum-secret-sharing schemes

An important metric of the performance of a quantum-secret-sharing scheme is its information rate. Beyond the fact that the information rate is upper-bounded by one, very little is known in terms of bounds on the information rate of quantum-secret-sharing schemes. Furthermore, not every scheme can be realized with rate one. In this paper we derive upper bounds for the information rates of quantum-secret-sharing schemes. We show that there exist quantum access structures on n players for which the information rate cannot be better than O((log{sub 2}n)/n). These results are the quantum analogues of the bounds for classical-secret-sharing schemes proved by Csirmaz.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cheat-sensitive commitment of a classical bit coded in a block of mxn round-trip qubits

This paper proposes a quantum protocol for a cheat-sensitive commitment of a classical bit. Alice, the receiver of the bit, can examine dishonest Bob, who changes or postpones his choice. Bob, the sender of the bit, can examine dishonest Alice, who violates concealment. For each round-trip case, Alice sends one of two spin states |S{+-}> by choosing basis S at random from two conjugate bases X and Y. Bob chooses basis C is an element of {l_brace}X,Y{r_brace} to perform a measurement and returns a resultant state |C{+-}>. Alice then performs a measurement with the other basis R ({ne}S) and obtains an outcome |R{+-}>. In the opening phase, she can discover dishonest Bob, who unveils a wrong basis with a faked spin state, or Bob can discover dishonest Alice, who infers basis C but destroys |C{+-}> by setting R to be identical to S in the commitment phase. If a classical bit is coded in a block of mxn qubit particles, impartial examinations and probabilistic security criteria can be achieved.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient heralding of photonic qubits with applications to device-independent quantum key distribution

We present an efficient way of heralding photonic qubit signals using linear optics devices. First, we show that one can obtain asymptotically perfect heralding and unit success probability with growing resources. Second, we show that even using finite resources, we can improve qualitatively and quantitatively over earlier heralding results. In the latter scenario, we can obtain perfect heralded photonic qubits while maintaining a finite success probability. We demonstrate the advantage of our heralding scheme by predicting key rates for device-independent quantum key distribution, taking imperfections of sources and detectors into account.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Unconditional security proof of a deterministic quantum key distribution with a two-way quantum channel

In a deterministic quantum key distribution (DQKD) protocol with a two-way quantum channel, Bob sends a qubit to Alice who then encodes a key bit onto the qubit and sends it back to Bob. After measuring the returned qubit, Bob can obtain Alice's key bit immediately, without basis reconciliation. Since an eavesdropper may attack the qubits traveling on either the Bob-Alice channel or the Alice-Bob channel, the security analysis of DQKD protocol with a two-way quantum channel is complicated and its unconditional security has been controversial. This paper presents a security proof of a single-photon four-state DQKD protocol against general attacks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Field test of continuous-variable quantum key distribution with a true local oscillator

A continuous-variable quantum key distribution (CV QKD) using a true local (located at the receiver) oscillator (LO) has been proposed to remove any possibility of side-channel attacks associated with transmission of the LO as well as reduce the cross-pulse contamination. Here we report an implementation of true LO-CV QKD using “off-the-shelf” components and conduct QKD experiments using the fiber optical network at Oak Ridge National Laboratory. A phase reference and quantum signal are time multiplexed and then wavelength division multiplexed with the classical communications that “coexist” with each other on a single optical network fiber. Importantly, this is the first demonstration of CV QKD with a receiver-based true LO over a deployed fiber network, a crucial step for its application in real-world situations.

97 MATHEMATICS AND COMPUTING↗

Security proof of practical quantum key distribution with detection-efficiency mismatch

Quantum key distribution (QKD) protocols with threshold detectors are driving high-performance QKD demonstrations. The corresponding security proofs usually assume that all physical detectors have the same detection efficiency. However, the efficiencies of the detectors used in practice might show a mismatch depending on the manufacturing and setup of these detectors. A mismatch can also be induced as the different spatial-temporal modes of an incoming signal might couple differently to a detector. Here we develop a method that allows to provide security proofs without the usual assumption. Our method can take the detection-efficiency mismatch into account without having to restrict the attack strategy of the adversary. Especially, we do not rely on any photon-number cutoff of incoming signals such that our security proof is directly applicable to practical situations. We illustrate our method for a receiver that is designed for polarization encoding and is sensitive to a number of spatial-temporal modes. In our detector model, the absence of quantum interference between any pair of spatial-temporal modes is assumed. For a QKD protocol with this detector model, we can perform a security proof with characterized efficiency mismatch and without photon-number cutoff assumption. Our method also shows that in the absence of efficiency mismatch in our detector model, the key rate increases if the loss due to detection inefficiency is assumed to be outside of the adversary's control, as compared to the view where for a security proof this loss is attributed to the action of the adversary.

97 MATHEMATICS AND COMPUTING↗

Quantum Key Distribution with Temporal Coding of Time-Bin Qubits

In this study, we demonstrate the possibility of realizing the quantum key distribution system by temporal coding of time-bin qubits that are prepared and measured using unbalanced Mach-Zehnder interferometers. We also show that, to exclude a clear a priori identification of time-bin qubits with equal bases, their encoding with the symbols 0 and 1 can be accomplished by delaying one of them by half the clock interval. The uniqueness of measurements of qutrits in this algorithm is shown to be based on the ability of quantum particles in β-states to interfere with the probability amplitudes at the ports of the system interferometers, as well as the absence of collisions of signaling states of the qutrits in adjacent clock intervals. We describe a method for controlling such collisions, including those that are based on qubits prepared from quasi-one-photon coherent laser states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Achieving the physical limits of the bounded-storage model

Secure two-party cryptography is possible if the adversary's quantum storage device suffers imperfections. For example, security can be achieved if the adversary can store strictly less then half of the qubits transmitted during the protocol. This special case is known as the bounded-storage model, and it has long been an open question whether security can still be achieved if the adversary's storage were any larger. Here, we answer this question positively and demonstrate a two-party protocol which is secure as long as the adversary cannot store even a small fraction of the transmitted pulses. We also show that security can be extended to a larger class of noisy quantum memories.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Lie algebraic significance of symmetric informationally complete measurements

Examples of symmetric informationally complete positive operator-valued measures (SIC-POVMs) have been constructed in every dimension {<=}67. However, it remains an open question whether they exist in all finite dimensions. A SIC-POVM is usually thought of as a highly symmetric structure in quantum state space. However, its elements can equally well be regarded as a basis for the Lie algebra gl(d,C). In this paper we examine the resulting structure constants, which are calculated from the traces of the triple products of the SIC-POVM elements and which, it turns out, characterize the SIC-POVM up to unitary equivalence. We show that the structure constants have numerous remarkable properties. In particular we show that the existence of a SIC-POVM in dimension d is equivalent to the existence of a certain structure in the adjoint representation of gl(d,C). We hope that transforming the problem in this way, from a question about quantum state space to a question about Lie algebras, may help to make the existence problem tractable.

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↗

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↗

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↗

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↗