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 91 records · Page 5

Polaractivation for classical zero-error capacity of qudit channels

We introduce a new phenomenon for zero-error transmission of classical information over quantum channels that initially were not able for zero-error classical communication. The effect is called polaractivation, and the result is similar to the superactivation effect. We use the Choi-Jamiolkowski isomorphism and the Schmidt-theorem to prove the polaractivation of classical zero-error capacity and define the polaractivator channel coding scheme.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quasi-superactivation for the classical capacity of quantum channels

The superactivation effect has its roots in the extreme violation of additivity of the channel capacity and enables to reliably transmit quantum information over zero-capacity quantum channels. In this work we demonstrate a similar effect for the classical capacity of a quantum channel which previously was thought to be impossible.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reliable quantum communication over a quantum relay channel

We show that reliable quantum communication over an unreliable quantum relay channels is possible. The coding scheme combines the results on the superadditivity of quantum channels and the efficient quantum coding approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Braid group representation on quantum computation

There are many studies about topological representation of quantum computation recently. One of diagram representation of quantum computation is by using ZX-Calculus. In this paper we will make a diagrammatical scheme of Dense Coding. We also proved that ZX-Calculus diagram of maximally entangle state satisfies Yang-Baxter Equation and therefore, we can construct a Braid Group representation of set of maximally entangle state.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the operational meaning and practical aspects of using the security parameter in quantum key distribution

We discuss the operational meaning of a commonly accepted security parameter in quantum key distribution, which is based on the trace distance. We separately consider the cases of using a key in a one-time pad and in a computationally secure cipher. Some practical aspects of using the security parameter are also elucidated, which are usually not paid enough attention in theoretical studies and which therefore may cause difficulties for experimentalists and engineers. It is shown that a one-time pad requires not only a higher key generation rate than computationally secure ciphers, but also a significantly stronger condition on the key security parameter. (paper)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Orthogonality broadcasting and quantum position verification

The no-cloning theorem leads to information-theoretic security in various quantum cryptographic protocols. However, this security typically derives from a possibly weaker property that classical information encoded in certain quantum states cannot be broadcast. To formally capture this property, we introduce the study of ‘orthogonality broadcasting.’ When attempting to broadcast the orthogonality of two different qubit bases, we establish that the power of classical and quantum communication is equivalent. However, quantum communication is shown to be strictly more powerful for broadcasting orthogonality in higher dimensions. We then relate orthogonality broadcasting to quantum position verification and provide a new method for establishing error bounds in the no pre-shared entanglement model that can address protocols previous methods could not. Our key technical contribution is an uncertainty relation that uses the geometric relation of the states that undergo broadcasting rather than the non-commutative aspect of the final measurements.

quantum cryptography↗

Experimental decoy-state Bennett-Brassard 1984 quantum key distribution through a turbulent channel

In free-space quantum key distribution (QKD) in turbulent conditions, scattering and beam wandering cause intensity fluctuations which decrease the detected signal-to-noise ratio. This effect can be mitigated by rejecting received bits when the channel's transmittance is below a threshold. Thus, the overall error rate is reduced and the secure key rate increases despite the deletion of bits. In this work, we implement recently proposed selection methods focusing on the prefixed-threshold real-time selection (P-RTS) where a cutoff can be chosen prior to data collection and independently of the transmittance distribution. We perform finite-size decoy-state Bennett-Brassard 1984 QKD in a laboratory setting where we simulate the atmospheric turbulence using an acousto-optical modulator. We show that P-RTS can yield considerably higher secure key rates for a wide range of the atmospheric channel parameters. In addition, we evaluate the performance of the P-RTS method for a realistically finite sample size. We demonstrate that a near-optimal selection threshold can be predetermined even with imperfect knowledge of the channel transmittance distribution parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Relationship between quantum repeating devices and quantum seals

It is revealed that quantum repeating devices and quantum seals have a very close relationship, thus the theory in one field can be applied to the other. Consequently, it is shown that the fidelity bounds and optimality of quantum repeating devices for decoding quantum information can be violated when they are used for decoding classical information from quantum states and the security bounds for protocols sealing quantum data exist.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Semi-device-independent security of one-way quantum key distribution

By testing nonlocality, the security of entanglement-based quantum key distribution (QKD) can be enhanced to being ''device-independent.'' Here we ask whether such a strong form of security could also be established for one-way (prepare and measure) QKD. While fully device-independent security is impossible, we show that security can be guaranteed against individual attacks in a semi-device-independent scenario. In the latter, the devices used by the trusted parties are noncharacterized, but the dimensionality of the quantum systems used in the protocol is assumed to be bounded. Our security proof relies on the analogies between one-way QKD, dimension witnesses, and random-access codes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Weaker entanglement between two parties guarantees stronger entanglement with a third party

The monogamy of entanglement is one of the basic quantum mechanical features, which says that when two partners Alice and Bob are more entangled then either of them has to be less entangled with the third party. Here we qualitatively present the converse monogamy of entanglement: given a tripartite pure system and when Alice and Bob are weakly entangled, then either of them is generally strongly entangled with the third party. Our result leads to the classification of tripartite pure states based on bipartite reduced density operators, which is an effective way to this longstanding problem compared to the means by stochastic local operations and classical communications. We also systematically indicate the structure of the classified states and generate them.

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↗

Cryptanalysis of the arbitrated quantum signature protocols

As a new model for signing quantum messages, arbitrated quantum signature (AQS) has recently received a lot of attention. In this paper we study the cryptanalysis of previous AQS protocols from the aspects of forgery and disavowal. We show that in these protocols the receiver, Bob, can realize existential forgery of the sender's signature under known message attack. Bob can even achieve universal forgery when the protocols are used to sign a classical message. Furthermore, the sender, Alice, can successfully disavow any of her signatures by simple attack. The attack strategies are described in detail and some discussions about the potential improvements of the protocols are given. Finally we also present several interesting topics on AQS protocols that can be studied in future.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cloning of a quantum measurement

We analyze quantum algorithms for cloning of a quantum measurement. Our aim is to mimic two uses of a device performing an unknown von Neumann measurement with a single use of the device. When the unknown device has to be used before the bipartite state to be measured is available we talk about 1{yields}2 learning of the measurement, otherwise the task is called 1{yields}2 cloning of a measurement. We perform the optimization for both learning and cloning for arbitrary dimension d of the Hilbert space. For 1{yields}2 cloning we also propose a simple quantum network that achieves the optimal fidelity. The optimal fidelity for 1{yields}2 learning just slightly outperforms the estimate and prepare strategy in which one first estimates the unknown measurement and depending on the result suitably prepares the duplicate.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Long-distance continuous-variable quantum key distribution with a Gaussian modulation

We designed high-efficiency error correcting codes allowing us to extract an errorless secret key in a continuous-variable quantum key distribution (CVQKD) protocol using a Gaussian modulation of coherent states and a homodyne detection. These codes are available for a wide range of signal-to-noise ratios on an additive white Gaussian noise channel with a binary modulation and can be combined with a multidimensional reconciliation method proven secure against arbitrary collective attacks. This improved reconciliation procedure considerably extends the secure range of a CVQKD with a Gaussian modulation, giving a secret key rate of about 10{sup -3} bit per pulse at a distance of 120 km for reasonable physical parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Design of additive quantum codes via the code-word-stabilized framework

We consider design of the quantum stabilizer codes via a two-step, low-complexity approach based on the framework of codeword-stabilized (CWS) codes. In this framework, each quantum CWS code can be specified by a graph and a binary code. For codes that can be obtained from a given graph, we give several upper bounds on the distance of a generic (additive or nonadditive) CWS code, and the lower Gilbert-Varshamov bound for the existence of additive CWS codes. We also consider additive cyclic CWS codes and show that these codes correspond to a previously unexplored class of single-generator cyclic stabilizer codes. We present several families of simple stabilizer codes with relatively good parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Entanglement-assisted codeword stabilized quantum codes

Entangled qubits can increase the capacity of quantum error-correcting codes based on stabilizer codes. In addition, by using entanglement quantum stabilizer codes can be construct from classical linear codes that do not satisfy the dual-containing constraint. We show that it is possible to construct both additive and nonadditive quantum codes using the codeword stabilized quantum code framework. Nonadditive codes may offer improved performance over the more common stabilizer codes. Like other entanglement-assisted codes, the encoding procedure acts only on the qubits on Alice's side, and only these qubits are assumed to pass through the channel. However, errors in the codeword stabilized quantum code framework give rise to effective Z errors on Bob's side. We use this scheme to construct entanglement-assisted nonadditive quantum codes, in particular, ((5,16,2;1)) and ((7,4,5;4)) codes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗