Semiclassical Fourier Transform for Quantum Computation

Shor's algorithms for factorization and discrete logarithms on a quantum computer employ Fourier transforms preceding a final measurement. It is shown that such a Fourier transform can be carried out in a semi-classical way in which a ``classical'' (macroscopic) signal resulting from the measurement of one bit (embodied in a two-state quantum system) is employed to determine the type of measurement carried out on the next bit, and so forth. In this way the two-bit gates in the Fourier transform can all be replaced by a smaller number of one-bit gates controlled by classical signals. Success in simplifying the Fourier transform suggests that it may be worthwhile looking for other ways of using semi-classical methods in quantum computing.Comment: Latex 6 pages, two figures on one page in uuencoded Postscrip

Minimal field requirement in precessional magnetization switching

We investigate the minimal field strength in precessional magnetization switching using the Landau-Lifshitz-Gilbert equation in under-critically damped systems. It is shown that precessional switching occurs when localized trajectories in phase space become unlocalized upon application of field pulses. By studying the evolution of the phase space, we obtain the analytical expression of the critical switching field in the limit of small damping for a magnetic object with biaxial anisotropy. We also calculate the switching times for the zero damping situation. We show that applying field along the medium axis is good for both small field and fast switching times.Comment: 6 pages, 7 figure

Adaptive just-in-time code diversification

We present a method to regenerate diversified code dynamically in a Java bytecode JIT compiler, and to update the diversification frequently during the execution of the program. This way, we can significantly reduce the time frame in which attackers can let a program leak useful address space information and subsequently use the leaked information in memory exploits. A proof of concept implementation is evaluated, showing that even though code is recompiled frequently, we can achieved smaller overheads than the previous state of the art, which generated diversity only once during the whole execution of a program

Failure Probabilities and Tough-Brittle Crossover of Heterogeneous Materials with Continuous Disorder

The failure probabilities or the strength distributions of heterogeneous 1D systems with continuous local strength distribution and local load sharing have been studied using a simple, exact, recursive method. The fracture behavior depends on the local bond-strength distribution, the system size, and the applied stress, and crossovers occur as system size or stress changes. In the brittle region, systems with continuous disorders have a failure probability of the modified-Gumbel form, similar to that for systems with percolation disorder. The modified-Gumbel form is of special significance in weak-stress situations. This new recursive method has also been generalized to calculate exactly the failure probabilities under various boundary conditions, thereby illustrating the important effect of surfaces in the fracture process.Comment: 9 pages, revtex, 7 figure