Prime Factorization in the Duality Computer

We give algorithms to factorize large integers in the duality computer. We provide three duality algorithms for factorization based on a naive factorization method, the Shor algorithm in quantum computing, and the Fermat's method in classical computing. All these algorithms are polynomial in the input size.Comment: 4 page

No-relationship between impossibility of faster-than-light quantum communication and distinction of ensembles with the same density matrix

It has been claimed in the literature that impossibility of faster-than-light quantum communication has an origin of indistinguishability of ensembles with the same density matrix. We show that the two concepts are not related. We argue that: 1) even with an ideal single-atom-precision measurement, it is generally impossible to produce two ensembles with exactly the same density matrix; or 2) to produce ensembles with the same density matrix, classical communication is necessary. Hence the impossibility of faster-than-light communication does not imply the indistinguishability of ensembles with the same density matrix.Comment: 4 pages and 3 figure

Transverse momentum resummation for color sextet and antitriplet scalar production at the LHC

We study the factorization and resummation of the transverse momentum spectrum of the color sextet and antitriplet scalars produced at the LHC based on soft-collinear effective theory. Compared to Z boson and Higgs production, a soft function is required to account for the soft gluon emission from the final-state colored scalar. The soft function is calculated at the next-to-leading order, and the resummation is performed at the approximate next-to-next-to-leading logarithmic accuracy. The non-perturbative effects and PDF uncertainties are also discussed.Comment: 20 pages, 7 figure