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

Analysis of Properties of Quantum Hashing

We analyze a method of binary quantum hashing that allows one to represent binary sets as quantum states. We show that this method is very stable with respect to the recovery of preimages. Moreover, we propose heuristic approaches to small-bias sets on which the construction of quantum hash-functions is based and show that they are stable with respect to collisions.

97 MATHEMATICS AND COMPUTING↗

Batch quantum multi-proxy signature

A batch quantum multi-proxy signature scheme is proposed, in which the original signatory distributes his signing right to multiple proxy signatories, and these proxy signatories can sign multiple messages. The proxy signatories generate some single particles, and the original signatory uses the quantum-controlled-not to transmit the signing information to these single particles. Then the proxy signatories measure these single particles to generate the signature, and the arbitrator uses the comparison of quantum states to verify the signature. Compared to the existing schemes, the main merit of our scheme is that multiple quantum messages can be signed. So the signing efficiency will be increased greatly.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Homological stabilizer codes

In this paper we define homological stabilizer codes on qubits which encompass codes such as Kitaev's toric code and the topological color codes. These codes are defined solely by the graphs they reside on. This feature allows us to use properties of topological graph theory to determine the graphs which are suitable as homological stabilizer codes. We then show that all toric codes are equivalent to homological stabilizer codes on 4-valent graphs. We show that the topological color codes and toric codes correspond to two distinct classes of graphs. We define the notion of label set equivalencies and show that under a small set of constraints the only homological stabilizer codes without local logical operators are equivalent to Kitaev's toric code or to the topological color codes. - Highlights: Black-Right-Pointing-Pointer We show that Kitaev's toric codes are equivalent to homological stabilizer codes on 4-valent graphs. Black-Right-Pointing-Pointer We show that toric codes and color codes correspond to homological stabilizer codes on distinct graphs. Black-Right-Pointing-Pointer We find and classify all 2D homological stabilizer codes. Black-Right-Pointing-Pointer We find optimal codes among the homological stabilizer codes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Implementing phase-covariant cloning in circuit quantum electrodynamics

An efficient scheme is proposed to implement phase-covariant quantum cloning by using a superconducting transmon qubit coupled to a microwave cavity resonator in the strong dispersive limit of circuit quantum electrodynamics (QED). By solving the master equation numerically, we plot the Wigner function and Poisson distribution of the cavity mode after each operation in the cloning transformation sequence according to two logic circuits proposed. The visualizations of the quasi-probability distribution in phase-space for the cavity mode and the occupation probability distribution in the Fock basis enable us to penetrate the evolution process of cavity mode during the phase-covariant cloning (PCC) transformation. With the help of numerical simulation method, we find out that the present cloning machine is not the isotropic model because its output fidelity depends on the polar angle and the azimuthal angle of the initial input state on the Bloch sphere. The fidelity for the actual output clone of the present scheme is slightly smaller than one in the theoretical case. The simulation results are consistent with the theoretical ones. This further corroborates our scheme based on circuit QED can implement efficiently PCC transformation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Stochastic Processes

We consider quantum analogues of n-parameter stochastic processes, associated integrals and martingale properties extending classical results obtained in [1, 2, 3], and quantum results in [4, 5, 6, 7, 8, 9, 10].

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Bases for Spin Systems and Qudits

There is a growing interest these days for the field of quantum information and quantum computation (for which classical bits are replaced by qubits in dimension 2 and qudits in dimension d). This field is at the crossing of mathematics, informatics and quantum physics. In this work, bases of relevance for spin systems with cyclic symmetry as well as for quantum information and quantum computation are discussed from the theory of angular momentum and group-theoretical methods. This approach is connected to the use of generalized Pauli matrices (in dimension d) arising from a polar decomposition of the group SU{sub 2}. Examples are given for d = 2, 3 and 4.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient Raman generation in a waveguide: A route to ultrafast quantum random number generation

The inherent uncertainty in quantum mechanics offers a source of true randomness which can be used to produce unbreakable cryptographic keys. We discuss the development of a high-speed random number generator based on the quantum phase fluctuations in spontaneously initiated stimulated Raman scattering (SISRS). We utilize the tight confinement and long interaction length available in a Potassium Titanyl Phosphate waveguide to generate highly efficient SISRS using nanojoule pulse energies, reducing the high pump power requirements of the previous approaches. We measure the random phase of the Stokes output using a simple interferometric setup to yield quantum random numbers at 145 Mbps.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

Tight bounds on the eavesdropping of a continuous-variable quantum cryptographic protocol with no basis switching

The Gaussian continuous-variable quantum key distribution protocol based on coherent states and heterodyne detection [Phys. Rev. Lett. 93, 170504 (2004)] has the advantage that no active random basis switching is needed on the receiver's side. Its security is, however, not very satisfyingly understood today because the bounds on the secret key rate that have been derived from Heisenberg relations are not attained by any known scheme. Here, we address the problem of the optimal Gaussian individual attack against this protocol, and derive tight upper bounds on the information accessible to an eavesdropper. Interestingly, this protocol is proven to be even more resistant to individual attacks than originally thought. Optical schemes achieving these bounds are also exhibited, which concludes the security analysis of Gaussian protocols against individual attacks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Comment on 'Quantum string seal is insecure'

An attack strategy was recently proposed by Chau [Phys. Rev. A 75, 012327 (2007)], which was claimed to be able to break all quantum string seal protocols. Here it will be shown that the attack cannot obtain nontrivial information and escape the detection simultaneously in a class of quantum string seal, including the one proposed by He [Int. J. Quantum Inf. 4, 677 (2006)]. Thus it is insufficient to conclude that all quantum string seals are insecure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗