Insecurity of position-based quantum cryptography protocols against entanglement attacks

Recently, position-based quantum cryptography has been claimed to be unconditionally secure. In contrary, here we show that the existing proposals for position-based quantum cryptography are, in fact, insecure if entanglement is shared among two adversaries. Specifically, we demonstrate how the adversaries can incorporate ideas of quantum teleportation and quantum secret sharing to compromise the security with certainty. The common flaw to all current protocols is that the Pauli operators always map a codeword to a codeword (up to an irrelevant overall phase). We propose a modified scheme lacking this property in which the same cheating strategy used to undermine the previous protocols can succeed with a rate at most 85%. We conjecture that the modified protocol is unconditionally secure and prove this to be true when the shared quantum resource between the adversaries is a two- or three- level system

Interfacial shear in adiabatic downward gas/liquid co-current annular flow in pipes

Interfacial friction is one of the key variables for predicting annular two-phase flow behaviours in vertical pipes. In order to develop an improved correlation for interfacial friction factor in downward co-current annular flow, the pressure gradient, film thickness and film velocity data were generated from experiments carried out on Cranfield University’s Serpent Rig, an air/water two-phase vertical flow loop of 101.6 mm internal diameter. The air and water superficial velocity ranges used are 1.42–28.87 and 0.1–1.0 m/s respectively. These correspond to Reynolds number values of 8400–187,000 and 11,000–113,000 respectively. The correlation takes into account the effect of pipe diameter by using the interfacial shear data together with dimensionless liquid film thicknesses related to different pipe sizes ranging from 10 to 101.6 mm, including those from published sources by numerous investigators. It is shown that the predictions of this new correlation outperform those from previously reported studies

Gas/liquid flow behaviours in a downward section of large diameter vertical serpentine pipes

An experimental study on air/water flow behaviours in a 101.6 mm i.d. vertical pipe with a serpentine configuration is presented. The experiments are conducted for superficial gas and liquid velocities ranging from 0.15 to 30 m/s and 0.07 to 1.5 m/s, respectively. The bend effects on the flow behaviours are significantly reduced when the flow reaches an axial distance of 30 pipe diameters or more from the upstream bend. The mean film thickness data from this study has been used to compare with the predicted data using several falling film correlations and theoretical models. It was observed that the large pipe data exhibits different tendencies and this manifests in the difference in slope when the dimensionless film thickness is plotted as a power law function of the liquid film Reynolds number

A quantum analog of Huffman coding

We analyze a generalization of Huffman coding to the quantum case. In particular, we notice various difficulties in using instantaneous codes for quantum communication. Nevertheless, for the storage of quantum information, we have succeeded in constructing a Huffman-coding inspired quantum scheme. The number of computational steps in the encoding and decoding processes of N quantum signals can be made to be of polylogarithmic depth by a massively parallel implementation of a quantum gate array. This is to be compared with the O (N^3) computational steps required in the sequential implementation by Cleve and DiVincenzo of the well-known quantum noiseless block coding scheme of Schumacher. We also show that O(N^2(log N)^a) computational steps are needed for the communication of quantum information using another Huffman-coding inspired scheme where the sender must disentangle her encoding device before the receiver can perform any measurements on his signals.Comment: Revised version, 7 pages, two-column, RevTex. Presented at 1998 IEEE International Symposium on Information Theor

Accelerating Incremental Gradient Optimization with Curvature Information

This paper studies an acceleration technique for incremental aggregated gradient ({\sf IAG}) method through the use of \emph{curvature} information for solving strongly convex finite sum optimization problems. These optimization problems of interest arise in large-scale learning applications. Our technique utilizes a curvature-aided gradient tracking step to produce accurate gradient estimates incrementally using Hessian information. We propose and analyze two methods utilizing the new technique, the curvature-aided IAG ({\sf CIAG}) method and the accelerated CIAG ({\sf A-CIAG}) method, which are analogous to gradient method and Nesterov's accelerated gradient method, respectively. Setting $\kappa$ to be the condition number of the objective function, we prove the $R$ linear convergence rates of $1 - \frac{4c_0 \kappa}{(\kappa+1)^2}$ for the {\sf CIAG} method, and $1 - \sqrt{\frac{c_1}{2\kappa}}$ for the {\sf A-CIAG} method, where $c_0,c_1 \leq 1$ are constants inversely proportional to the distance between the initial point and the optimal solution. When the initial iterate is close to the optimal solution, the $R$ linear convergence rates match with the gradient and accelerated gradient method, albeit {\sf CIAG} and {\sf A-CIAG} operate in an incremental setting with strictly lower computation complexity. Numerical experiments confirm our findings. The source codes used for this paper can be found on \url{http://github.com/hoitowai/ciag/}.Comment: 22 pages, 3 figures, 3 tables. Accepted by Computational Optimization and Applications, to appea