Non-adiabatic transitions in multi-level systems

In a quantum system with a smoothly and slowly varying Hamiltonian, which approaches a constant operator at times $t\to \pm \infty$, the transition probabilities between adiabatic states are exponentially small. They are characterized by an exponent that depends on a phase integral along a path around a set of branch points connecting the energy level surfaces in complex time. Only certain sequences of branch points contribute. We propose that these sequences are determined by a topological rule involving the Stokes lines attached to the branch points. Our hypothesis is supported by theoretical arguments and results of numerical experiments.Comment: 25 pages RevTeX, 9 figures and 4 tables as Postscipt file

On the complete integrability of the discrete Nahm equations

The discrete Nahm equations, a system of matrix valued difference equations, arose in the work of Braam and Austin on half-integral mass hyperbolic monopoles. We show that the discrete Nahm equations are completely integrable in a natural sense: to any solution we can associate a spectral curve and a holomorphic line-bundle over the spectral curve, such that the discrete-time DN evolution corresponds to walking in the Jacobian of the spectral curve in a straight line through the line-bundle with steps of a fixed size. Some of the implications for hyperbolic monopoles are also discussed

Optical quantum computation using cluster states

We propose an approach to optical quantum computation in which a deterministic entangling quantum gate may be performed using, on average, a few hundred coherently interacting optical elements (beamsplitters, phase shifters, single photon sources, and photodetectors with feedforward). This scheme combines ideas from the optical quantum computing proposal of Knill, Laflamme and Milburn [Nature 409 (6816), 46 (2001)], and the abstract cluster-state model of quantum computation proposed by Raussendorf and Briegel [Phys. Rev. Lett. 86, 5188 (2001)].Comment: 4 page

Universal quantum computation using only projective measurement, quantum memory, and preparation of the 0 state

What resources are universal for quantum computation? In the standard model, a quantum computer consists of a sequence of unitary gates acting coherently on the qubits making up the computer. This paper shows that a very different model involving only projective measurements, quantum memory, and the ability to prepare the |0> state is also universal for quantum computation. In particular, no coherent unitary dynamics are involved in the computation.Comment: 4 page

Fundamental Physics and the Fine-Structure Constant

From the exponential function of Euler’s equation to the geometry of a fundamental form, a calculation of the fine-structure constant and its relationship to the proton-electron mass ratio is given. Equations are found for the fundamental constants of the four forces of nature: electromagnetism, the weak force, the strong force and the force of gravitation. Symmetry principles are then associated with traditional physical measures