Symbiotic approaches to work and technology

Production Planning;production

Bounds on New Physics from the New Data on Parity Violation in Atomic Cesium

We assume the latest experimental determination of the weak charge of atomic cesium and analyze its implications for possible new physics. We notice that the data would imply positive upper and lower bounds on the new physics contribution to the weak charge, $\delta_NQ_W$. The required new physics should be of a type not severely constrained by the high energy precision data. A simplest possibility would be new neutral vector bosons almost un-mixed to the $Z$ and with sizeable couplings to fermions. The lower positive bound would however forbid zero or negative $\delta_NQ_W$ and exclude not only the standard model but also models with sequential $Z^\prime$, in particular simple-minded towers of $Z$-like excitations from extra-dimensions. The bound would also imply an upper limit on the $Z^\prime$ mass within the models allowed. Conclusions are also derived for models of four-fermion contact interactions.Comment: 11 pages, Latex, 1 PS figure, final version for Physics Letter

Strengths and Weaknesses of Quantum Computing

Recently a great deal of attention has focused on quantum computation following a sequence of results suggesting that quantum computers are more powerful than classical probabilistic computers. Following Shor's result that factoring and the extraction of discrete logarithms are both solvable in quantum polynomial time, it is natural to ask whether all of NP can be efficiently solved in quantum polynomial time. In this paper, we address this question by proving that relative to an oracle chosen uniformly at random, with probability 1, the class NP cannot be solved on a quantum Turing machine in time $o(2^{n/2})$. We also show that relative to a permutation oracle chosen uniformly at random, with probability 1, the class $NP \cap coNP$ cannot be solved on a quantum Turing machine in time $o(2^{n/3})$. The former bound is tight since recent work of Grover shows how to accept the class NP relative to any oracle on a quantum computer in time $O(2^{n/2})$.Comment: 18 pages, latex, no figures, to appear in SIAM Journal on Computing (special issue on quantum computing

A de Finetti representation for finite symmetric quantum states

Consider a symmetric quantum state on an n-fold product space, that is, the state is invariant under permutations of the n subsystems. We show that, conditioned on the outcomes of an informationally complete measurement applied to a number of subsystems, the state in the remaining subsystems is close to having product form. This immediately generalizes the so-called de Finetti representation to the case of finite symmetric quantum states.Comment: 22 pages, LaTe

Security improvement of using modified coherent state for quantum cryptography

Weak coherent states as a photon source for quantum cryptography have limit in secure data rate and transmission distance because of the presence of multi-photon events and loss in transmission line. Two-photon events in a coherent state can be taken out by a two-photon interference scheme. We investigate the security issue of utilizing this modified coherent state in quantum cryptography. A 4 dB improvement in secure data rate or a nearly two-fold increase in transmission distance over the coherent state are found. With a recently proposed and improved encoding strategy, further improvement is possible.Comment: 5 pages, 2 figures, to appear in Physical Review

Roll diffusion bonding of titanium alloy panels

Roll diffusion bonding technique is used for fabricating T-stiffened panel assemblies from titanium alloy. The single unit fabrication exhibits excellent strength characteristics under tensile and compressive loads. This program is applied to structures in which weight/strength ratio and integral construction are important considerations

Local permutations of products of Bell states and entanglement distillation

We present new algorithms for mixed-state multi-copy entanglement distillation for pairs of qubits. Our algorithms perform significantly better than the best known algorithms. Better algorithms can be derived that are tuned for specific initial states. The new algorithms are based on a characterization of the group of all locally realizable permutations of the 4^n possible tensor products of n Bell states.Comment: 6 pages, 1 figur