Disguising quantum channels by mixing and channel distance trade-off

We consider the reverse problem to the distinguishability of two quantum channels, which we call the disguising problem. Given two quantum channels, the goal here is to make the two channels identical by mixing with some other channels with minimal mixing probabilities. This quantifies how much one channel can disguise as the other. In addition, the possibility to trade off between the two mixing probabilities allows one channel to be more preserved (less mixed) at the expense of the other. We derive lower- and upper-bounds of the trade-off curve and apply them to a few example channels. Optimal trade-off is obtained in one example. We relate the disguising problem and the distinguishability problem by showing the the former can lower and upper bound the diamond norm. We also show that the disguising problem gives an upper bound on the key generation rate in quantum cryptography.Comment: 27 pages, 8 figures. Added new results for using the disguising problem to lower and upper bound the diamond norm and to upper bound the key generation rate in quantum cryptograph

Time-Energy Costs of Quantum Measurements

Time and energy of quantum processes are a tradeoff against each other. We propose to ascribe to any given quantum process a time-energy cost to quantify how much computation it performs. Here, we analyze the time-energy costs for general quantum measurements, along a similar line as our previous work for quantum channels, and prove exact and lower bound formulae for the costs. We use these formulae to evaluate the efficiencies of actual measurement implementations. We find that one implementation for a Bell measurement is optimal in time-energy. We also analyze the time-energy cost for unambiguous state discrimination and find evidence that only a finite time-energy cost is needed to distinguish any number of states.Comment: 10 pages, 6 figure

Time-Energy Measure for Quantum Processes

Quantum mechanics sets limits on how fast quantum processes can run given some system energy through time-energy uncertainty relations, and they imply that time and energy are tradeoff against each other. Thus, we propose to measure the time-energy as a single unit for quantum channels. We consider a time-energy measure for quantum channels and compute lower and upper bounds of it using the channel Kraus operators. For a special class of channels (which includes the depolarizing channel), we can obtain the exact value of the time-energy measure. One consequence of our result is that erasing quantum information requires $\sqrt{(n+1)/n}$ times more time-energy resource than erasing classical information, where $n$ is the system dimension.Comment: 13 pages, 2 figure

Tso-Chan I An Exegetical Translation

This original panuscript of Teo-ch\u27an 1, . the Procedure of Dhyana, is part of a collection of eight voluman of 勍修百丈清规, Ch\u27sh Hau Pe Ca Ching Kuel, or in Japanese, the Chokushu Hyakujo Shingi. Its compiler is, Tokki or Te-kuel who, in 元朝, the the Yuan Dynasty, 1280-1368, received an imperial 大智夀聖禪寺, He resided at the $$ decree to do this work. He resided at 2 Shuo Chih Shou Sheng Shan Szu, which was in a locality that was a part of the Pai Chang mountains, in Hong Chow, about 150 miles east of Hankow. This monastery was started in, the T\u27ang Dynasty, (618-905 A.D.), ita master HuaiHal (720-814 A.D.), a disciple of achu (709-786A.0.), saw the nest for a better plated 2 monastery. He felt the groups at that time were too contemplative and were withdrawing within themselves more and more. Emphasis on other-worldliness was 1,2) See Appendix

No Superluminal Signaling Implies Unconditionally Secure Bit Commitment

Bit commitment (BC) is an important cryptographic primitive for an agent to convince a mutually mistrustful party that she has already made a binding choice of 0 or 1 but only to reveal her choice at a later time. Ideally, a BC protocol should be simple, reliable, easy to implement using existing technologies, and most importantly unconditionally secure in the sense that its security is based on an information-theoretic proof rather than computational complexity assumption or the existence of a trustworthy arbitrator. Here we report such a provably secure scheme involving only one-way classical communications whose unconditional security is based on no superluminal signaling (NSS). Our scheme is inspired by the earlier works by Kent, who proposed two impractical relativistic protocols whose unconditional securities are yet to be established as well as several provably unconditionally secure protocols which rely on both quantum mechanics and NSS. Our scheme is conceptually simple and shows for the first time that quantum communication is not needed to achieve unconditional security for BC. Moreover, with purely classical communications, our scheme is practical and easy to implement with existing telecom technologies. This completes the cycle of study of unconditionally secure bit commitment based on known physical laws.Comment: This paper has been withdrawn by the authors due to a crucial oversight on an earlier work by A. Ken

Rough surface scattering based on facet model

A model for the radar return from bare ground was developed to calculate the radar cross section of bare ground and the effect of the frequency averaging on the reduction of the variance of the return. It is shown that, by assuming that the distribution of the slope to be Gaussian and that the distribution of the length of the facet to be in the form of the positive side of a Gaussian distribution, the results are in good agreement with experimental data collected by an 8- to 18-GHz radar spectrometer system. It is also shown that information on the exact correlation length of the small structure on the ground is not necessary; an effective correlation length may be calculated based on the facet model and the wavelength of the incident wave

An efficient method for computing unsteady transonic aerodynamics of swept wings with control surfaces

A transonic equivalent strip (TES) method was further developed for unsteady flow computations of arbitrary wing planforms. The TES method consists of two consecutive correction steps to a given nonlinear code such as LTRAN2; namely, the chordwise mean flow correction and the spanwise phase correction. The computation procedure requires direct pressure input from other computed or measured data. Otherwise, it does not require airfoil shape or grid generation for given planforms. To validate the computed results, four swept wings of various aspect ratios, including those with control surfaces, are selected as computational examples. Overall trends in unsteady pressures are established with those obtained by XTRAN3S codes, Isogai's full potential code and measured data by NLR and RAE. In comparison with these methods, the TES has achieved considerable saving in computer time and reasonable accuracy which suggests immediate industrial applications