Quantum mechanics is about quantum information - Jeffrey Bub (Foundations of Physics, 2005)
I argue that quantum mechanics is fundamentally a theory about the representation and manipulation of information, not a theory about the mechanics of nonclassical waves or particles. The notion of quantum information is to be understood as a new physical primitive -- just as, following Einstein's special theory of relativity, a field is no longer regarded as the physical manifestation of vibrations in a mechanical medium, but recognized as a new physical primitive in its own right.

Scalable register initialization for quantum computing in an optical lattice - Gavin K. Brennen; Guido Pupillo; Ana Maria Rey; Charles W. Clark; Carl J. Williams (Journal of Physics B: Atomic, Molecular and Optical Physics, 2005)
The Mott insulator state created by loading an atomic Bose-Einstein condensate (BEC) into an optical lattice may be used as a means to prepare a register of atomic qubits in a quantum computer. Such architecture requires a lattice commensurately filled with atoms, which corresponds to the insulator state only in the limit of zero inter-well tunneling. We show that a lattice with spatial inhomogeneity created by a quadratic magnetic trapping potential can be used to isolate a subspace in the center which is impervious to hole-hoping. Components of the wavefunction with more than one atom in any well can be projected out by selective measurement on a molecular photo-associative transition. Maintaining the molecular coupling induces a quantum Zeno effect that can sustain a commensurately filled register for the duration of a quantum computation.

Sodium Bose-Einstein Condensates in an Optical Lattice - K. Xu; Y. Liu; J. R. Abo-Shaeer; T. Mukaiyama; J. K. Chin; D. E. Miller; W. Ketterle; Kevin M. Jones; Eite Tiesinga (Physical Review A, 2005)
The phase transition from a superfluid to a Mott insulator has been observed in a $^{23}$Na Bose-Einstein condensate. A dye laser detuned $≈ 5$nm red of the Na $3^2$S$ → 3^2$P$_{1/2}$ transition was used to form the three dimensional optical lattice. The heating effects of the small detuning as well as the three-body decay processes constrained the timescale of the experiment. Certain lattice detunings were found to induce a large loss of atoms. These loss features were shown to be due to photoassociation of atoms to vibrational levels in the Na$_2$ $(1) ^3Σ_g^+$ state.

Solid-state circuit for spin entanglement generation and purification - J. M. Taylor; W. Dür; P. Zoller; A. Yacoby; C. M. Marcus; M. D. Lukin (Physical Review Letters, 2005)
We show how realistic charge manipulation and measurement techniques, combined with the exchange interaction, allow for the robust generation and purification of four-particle spin entangled states in electrically controlled semiconductor quantum dots. The generated states are immunized to the dominant sources of noise via a dynamical decoherence-free subspace; all additional errors are corrected by a purification protocol. This approach may find application in quantum computation, communication, and metrology.

Spontaneous dissociation of long-range Feshbach molecules - Thorsten Koehler; Eite Tiesinga; Paul S. Julienne (Physical Review Letters, 2005)
We study the spontaneous dissociation of diatomic molecules produced in cold atomic gases via magnetically tunable Feshbach resonances. We provide a universal formula for the lifetime of these molecules that relates their decay to the scattering length and the loss rate constant for inelastic spin relaxation. Our universal treatment as well as our exact coupled channels calculations for $^{85}$Rb dimers predict a suppression of the decay over several orders of magnitude when the scattering length is increased. Our predictions are in good agreement with recent measurements of the lifetime of $^{85}$Rb$_2$.

Strong Fourier Sampling Fails over Gn - Gorjan Alagic; Cristopher Moore; Alexander Russell (2005)
We present a negative result regarding the hidden subgroup problem on the powers Gn of a fixed group G. Under a condition on the base group G, we prove that strong Fourier sampling cannot distinguish some subgroups of Gn. Since strong sampling is in fact the optimal measurement on a coset state, this shows that we have no hope of efficiently solving the hidden subgroup problem over these groups with separable measurements on coset states (that is, using any polynomial number of single-register coset state experiments). Base groups satisfying our condition include all nonabelian simple groups. We apply our results to show that there exist uniform families of nilpotent groups whose normal series factors have constant size and yet are immune to strong Fourier sampling.

Time Reversal and n-qubit Canonical Decompositions - Stephen S. Bullock; Gavin K. Brennen; Dianne P. O'Leary (Journal of Mathematical Physics, 2005)
For n an even number of qubits and v a unitary evolution, a matrix decomposition v=k1 a k2 of the unitary group is explicitly computable and allows for study of the dynamics of the concurrence entanglement monotone. The side factors k1 and k2 of this Concurrence Canonical Decomposition (CCD) are concurrence symmetries, so the dynamics reduce to consideration of the a factor. In this work, we provide an explicit numerical algorithm computing v=k1 a k2 for n odd. Further, in the odd case we lift the monotone to a two-argument function, allowing for a theory of concurrence dynamics in odd qubits. The generalization may also be studied using the CCD, leading again to maximal concurrence capacity for most unitaries. The key technique is to consider the spin-flip as a time reversal symmetry operator in Wigner's axiomatization; the original CCD derivation may be restated entirely in terms of this time reversal. En route, we observe a Kramers' nondegeneracy: the existence of a nondegenerate eigenstate of any time reversal symmetric n-qubit Hamiltonian demands (i) n even and (ii) maximal concurrence of said eigenstate. We provide examples of how to apply this work to study the kinematics and dynamics of entanglement in spin chain Hamiltonians.

Ultracold atoms confined in an optical lattice plus parabolic potential: a closed-form approach - Ana Maria Rey; Guido Pupillo; Charles W. Clark; Carl J. Williams (Physical Review A, 2005)
We discuss interacting and non-interacting one dimensional atomic systems trapped in an optical lattice plus a parabolic potential. We show that, in the tight-binding approximation, the non-interacting problem is exactly solvable in terms of Mathieu functions. We use the analytic solutions to study the collective oscillations of ideal bosonic and fermionic ensembles induced by small displacements of the parabolic potential. We treat the interacting boson problem by numerical diagonalization of the Bose-Hubbard Hamiltonian. From analysis of the dependence upon lattice depth of the low-energy excitation spectrum of the interacting system, we consider the problems of "fermionization" of a Bose gas, and the superfluid-Mott insulator transition. The spectrum of the noninteracting system turns out to provide a useful guide to understanding the collective oscillations of the interacting system, throughout a large and experimentally relevant parameter regime.

Unified derivations of measurement-based schemes for quantum computation - Andrew M. Childs; Debbie W. Leung; Michael A. Nielsen (Physical Review A, 2005)
We present unified, systematic derivations of schemes in the two known measurement-based models of quantum computation. The first model (introduced by Raussendorf and Briegel [Phys. Rev. Lett., 86, 5188 (2001)]) uses a fixed entangled state, adaptive measurements on single qubits, and feedforward of the measurement results. The second model (proposed by Nielsen [Phys. Lett. A, 308, 96 (2003)] and further simplified by Leung [Int. J. Quant. Inf., 2, 33 (2004)]) uses adaptive two-qubit measurements that can be applied to arbitrary pairs of qubits, and feedforward of the measurement results. The underlying principle of our derivations is a variant of teleportation introduced by Zhou, Leung, and Chuang [Phys. Rev. A, 62, 052316 (2000)]. Our derivations unify these two measurement-based models of quantum computation and provide significantly simpler schemes.

Adiabatic association of ultracold molecules via magnetic field tunable interactions - Krzysztof Goral; Thorsten Koehler; Simon A. Gardiner; Eite Tiesinga; Paul S. Julienne (Journal of Physics B: Atomic, Molecular and Optical Physics, 2004)
We consider in detail the situation of applying a time dependent external magnetic field to a 87Rb atomic Bose-Einstein condensate held in a harmonic trap, in order to adiabatically sweep the interatomic interactions across a Feshbach resonance to produce diatomic molecules. To this end, we introduce a minimal two-body Hamiltonian depending on just five measurable parameters of a Feshbach resonance, which accurately determines all low energy binary scattering observables, in particular, the molecular conversion efficiency of just two atoms. Based on this description of the microscopic collision phenomena, we use the many-body theory of T. Koehler and K. Burnett [Phys. Rev. A 65, 033601 (2002)] to study the efficiency of the association of molecules in a 87Rb Bose-Einstein condensate during a linear passage of the magnetic field strength across the 100 mT Feshbach resonance. We explore different, experimentally accessible, parameter regimes, and compare the predictions of Landau-Zener, configuration interaction, and two level mean field calculations with those of the microscopic many-body approach. Our comparative studies reveal a remarkable insensitivity of the molecular conversion efficiency with respect to both the details of the microscopic binary collision physics and the coherent nature of the Bose-Einstein condensed gas, provided that the magnetic field strength is varied linearly. We provide the reasons for this universality of the molecular production achieved by linear ramps of the magnetic field strength, and identify the Landau-Zener coefficient determined by F.H. Mies et al. [Phys. Rev. A 61, 022721 (2000)] as the main parameter that controls the efficiency.

Advantages of high-speed technique for quantum key distribution; reply to quant-ph/0407050 - J. C. Bienfang; Charles W. Clark; Carl J. Williams; E. W. Hagley; Jesse Wen (2004)
We respond to a comment on our high-speed technique for the implementation of free-space quantum key distribution (QKD). The model used in the comment assigns inappropriately high link losses to the technique in question. We show that the use of reasonable loss parameters in the model invalidates the comment's main conclusion and highlights the benefits of increased transmission rates.

Quantum information processing using localized ensembles of nuclear spins - J. M. Taylor; G. Giedke; H. Christ; B. Paredes; J. I. Cirac; P. Zoller; M. D. Lukin; A. Imamoglu (2004)
We describe a technique for quantum information processing based on localized en sembles of nuclear spins. A qubit is identified as the presence or absence of a collective excitation of a mesoscopic ensemble of nuclear spins surrounding a single quantum dot. All single and two-qubit operations can be effected using hyperfine interactions and single-electron spin rotations, hence the proposed scheme avoids gate errors arising from entanglement between spin and orbital degrees of freedom. Ultra-long coherence times of nuclear spins suggest that this scheme could be particularly well suited for applications where long lived memory is essential.

Quantum key distribution with 1.25 Gbps clock synchronization - J. C. Bienfang; A. J. Gross; A. Mink; B. J. Hershman; A. Nakassis; X. Tang; R. Lu; D. H. Su; Charles W Clark; Carl J. Williams; E. W. Hagley; Jesse Wen (Optics Express, 2004)
We have demonstrated the exchange of sifted quantum cryptographic key over a 730 meter free-space link at rates of up to 1.0 Mbps, two orders of magnitude faster than previously reported results. A classical channel at 1550 nm operates in parallel with a quantum channel at 845 nm. Clock recovery techniques on the classical channel at 1.25 Gbps enable quantum transmission at up to the clock rate. System performance is currently limited by the timing resolution of our silicon avalanche photodiode detectors. With improved detector resolution, our technique will yield another order of magnitude increase in performance, with existing technology.

Relativistic many-body calculations of electric-dipole matrix elements, lifetimes and polarizabilities in rubidium - M. S. Safronova; Carl J. Williams; Charles W. Clark (Physical Review A, 2004)
Electric-dipole matrix elements for ns-n'p, nd-n'p, and 6d-4f transitions in Rb are calculated using a relativistic all-order method. A third-order calculation is also carried out for these matrix elements to evaluate the importance of the high-order many-body perturbation theory contributions. The all-order matrix elements are used to evaluate lifetimes of ns and np levels with n=6, 7, 8 and nd levels with n=4, 5, 6 for comparison with experiment and to provide benchmark values for these lifetimes. The dynamic polarizabilities are calculated for ns states of rubidium. The resulting lifetime and polarizability values are compared with available theory and experiment.

Reversible simulation of bipartite product Hamiltonians - Andrew M. Childs; Debbie W. Leung; Guifre Vidal (IEEE Transactions on Information Theory, 2004)
Consider two quantum systems A and B interacting according to a product Hamiltonian H = H_A x H_B. We show that any two such Hamiltonians can be used to simulate each other reversibly (i.e., without efficiency losses) with the help of local unitary operations and local ancillas. Accordingly, all non-local features of a product Hamiltonian -- including the rate at which it can be used to produce entanglement, transmit classical or quantum information, or simulate other Hamiltonians -- depend only upon a single parameter. We identify this parameter and use it to obtain an explicit expression for the entanglement capacity of all product Hamiltonians. Finally, we show how the notion of simulation leads to a natural formulation of measures of the strength of a nonlocal Hamiltonian.

Scalable quantum computation in systems with Bose-Hubbard dynamics - Guido Pupillo; Ana Maria Rey; Gavin Brennen; Carl J. Williams; Charles W. Clark (Journal of Modern Optics, 2004)
Several proposals for quantum computation utilize a lattice type architecture with qubits trapped by a periodic potential. For systems undergoing many body interactions described by the Bose-Hubbard Hamiltonian, the ground state of the system carries number fluctuations that scale with the number of qubits. This process degrades the initialization of the quantum computer register and can introduce errors during error correction. In an earlier manuscript we proposed a solution to this problem tailored to the loading of cold atoms into an optical lattice via the Mott Insulator phase transition. It was shown that by adding an inhomogeneity to the lattice and performing a continuous measurement, the unit filled state suitable for a quantum computer register can be maintained. Here, we give a more rigorous derivation of the register fidelity in homogeneous and inhomogeneous lattices and provide evidence that the protocol is effective in the finite temperature regime.

Spatial search and the Dirac equation - Andrew M. Childs; Jeffrey Goldstone (Physical Review A, 2004)
We consider the problem of searching a d-dimensional lattice of N sites for a single marked location. We present a Hamiltonian that solves this problem in time of order sqrt(N) for d>2 and of order sqrt(N) log(N) in the critical dimension d=2. This improves upon the performance of our previous quantum walk search algorithm (which has a critical dimension of d=4), and matches the performance of a corresponding discrete-time quantum walk algorithm. The improvement uses a lattice version of the Dirac Hamiltonian, and thus requires the introduction of spin (or coin) degrees of freedom.

Spatial search by quantum walk - Andrew M. Childs; Jeffrey Goldstone (Physical Review A, 2004)
Grover's quantum search algorithm provides a way to speed up combinatorial search, but is not directly applicable to searching a physical database. Nevertheless, Aaronson and Ambainis showed that a database of N items laid out in d spatial dimensions can be searched in time of order sqrt(N) for d>2, and in time of order sqrt(N) poly(log N) for d=2. We consider an alternative search algorithm based on a continuous time quantum walk on a graph. The case of the complete graph gives the continuous time search algorithm of Farhi and Gutmann, and other previously known results can be used to show that sqrt(N) speedup can also be achieved on the hypercube. We show that full sqrt(N) speedup can be achieved on a d-dimensional periodic lattice for d>4. In d=4, the quantum walk search algorithm takes time of order sqrt(N) poly(log N), and in d<4, the algorithm does not provide substantial speedup.

Why the quantum? - Jeffrey Bub (2004)
This paper is a commentary on the foundational significance of the Clifton-Bub-Halvorson theorem characterizing quantum theory in terms of three information-theoretic constraints (Foundations of Physics 33, 1561-1591 (2003); quant-ph/0211089). I argue that: (1) a quantum theory is best understood as a theory about the possibilities and impossibilities of information transfer, as opposed to a theory about the mechanics of nonclassical waves or particles, (2) given the information-theoretic constraints, any mechanical theory of quantum phenomena that includes an account of the measuring instruments that reveal these phenomena must be empirically equivalent to a quantum theory, and (3) assuming the information-theoretic constraints are in fact satisfied in our world, no mechanical theory of quantum phenomena that includes an account of measurement interactions can be acceptable, and the appropriate aim of physics at the fundamental level then becomes the representation and manipulation of information.

Bogoliubov approach to superfluidity of atoms in an optical lattice - Ana Maria Rey; Keith Burnett; Robert Roth; Mark Edwards; Carl J. Williams; Charles W. Clark (Journal of Physics B: Atomic, Molecular and Optical Physics, 2003)
We use the Bogoliubov theory of atoms in an optical lattice to study the approach to the Mott-insulator transition. We derive an explicit expression for the superfluid density based on the rigidity of the system under phase variations. This enables us to explore the connection between the quantum depletion of the condensate and the quasi-momentum distribution on the one hand and the superfluid fraction on the other. The approach to the insulator phase may be characterized through the filling of the band by quantum depletion, which should be directly observable via the matter wave interference patterns. We complement these findings by self-consistent Hartree-Fock-Bogoliubov-Popov calculations for one-dimensional lattices including the effects of a parabolic trapping potential.

Can quantum cryptography imply quantum mechanics? Reply to Smolin - Hans Halvorson; Jeffrey Bub (2003)
Clifton, Bub, and Halvorson (CBH) have argued that quantum mechanics can be derived from three cryptographic, or broadly information-theoretic, axioms. But Smolin disagrees, and he has given a toy theory that he claims is a counterexample. Here we show that Smolin's toy theory violates an independence condition for spacelike separated systems that was assumed in the CBH argument. We then argue that any acceptable physical theory should satisfy this independence condition.

Controlling a mesoscopic spin environment by quantum bit manipulation - J. M. Taylor; A. Imamoglu; M. D. Lukin (Physical Review Letters, 2003)
We present a unified description of cooling and manipulation of a mesoscopic bath of nuclear spins via coupling to a single quantum system of electronic spin (quantum bit). We show that a bath cooled by the quantum bit rapidly saturates. Although the resulting saturated states of the spin bath (``dark states'') generally have low degrees of polarization and purity, their symmetry properties make them a valuable resource for the coherent manipulation of quantum bits. Specifically, we demonstrate that the dark states of nuclear ensembles can be used to coherently control the system-bath interaction and to provide a robust, long-lived quantum memory for qubit states.

Language-reconfigurable universal phone recognition - Walker, Brenton D; Lackey, Bradley C; Muller, JS; Schone, Patrick John (Eighth European Conference on Speech Communication and Technology, 2003)

Long-lived memory for mesoscopic quantum bits - J. M. Taylor; C. M. Marcus; M. D. Lukin (Physical Review Letters, 2003)
We describe a technique to create long-lived quantum memory for quantum bits in mesoscopic systems. Specifically we show that electronic spin coherence can be reversibly mapped onto the collective state of the surrounding nuclei. The coherent transfer can be efficient and fast and it can be used, when combined with standard resonance techniques, to reversibly store coherent superpositions on the time scale of seconds. This method can also allow for ``engineering'' entangled states of nuclear ensembles and efficiently manipulating the stored states. We investigate the feasibility of this method through a detailed analysis of the coherence properties of the system.

Lower bounds on the complexity of simulating quantum gates - Andrew M. Childs; Henry L. Haselgrove; Michael A. Nielsen (Physical Review A, 2003)
We give a simple proof of a formula for the minimal time required to simulate a two-qubit unitary operation using a fixed two-qubit Hamiltonian together with fast local unitaries. We also note that a related lower bound holds for arbitrary n-qubit gates.

Optimizing the fast Rydberg quantum gate - M. S. Safronova; Carl J. Williams; Charles W. Clark (Physical Review A, 2003)
The fast phase gate scheme, in which the qubits are atoms confined in sites of an optical lattice, and gate operations are mediated by excitation of Rydberg states, was proposed by Jaksch et al. Phys. Rev. Lett. 85, 2208 (2000). A potential source of decoherence in this system derives from motional heating, which occurs if the ground and Rydberg states of the atom move in different optical lattice potentials. We propose to minimize this effect by choosing the lattice photon frequency ω so that the ground and Rydberg states have the same frequency-dependent polarizability α(omega). The results are presented for the case of Rb.

Quantum algorithms for subset finding - Andrew M. Childs; Jason M. Eisenberg (2003)
Recently, Ambainis gave an O(N^(2/3))-query quantum walk algorithm for element distinctness, and more generally, an O(N^(L/(L+1)))-query algorithm for finding L equal numbers. We point out that this algorithm actually solves a much more general problem, the problem of finding a subset of size L that satisfies any given property. We review the algorithm and give a considerably simplified analysis of its query complexity. We present several applications, including two algorithms for the problem of finding an L-clique in an N-vertex graph. One of these algorithms uses O(N^(2L/(L+1))) edge queries, and the other uses \tilde{O}(N^((5L-2)/(2L+4))), which is an improvement for L <= 5. The latter algorithm generalizes a recent result of Magniez, Santha, and Szegedy, who considered the case L=3 (finding a triangle). We also pose two open problems regarding continuous time quantum walk and lower bounds.

A Quantum Computer Architecture using Nonlocal Interactions - Gavin K. Brennen; Daegene Song; Carl J. Williams (Physical Review A, 2003)
Several authors have described the basic requirements essential to build a scalable quantum computer. Because many physical implementation schemes for quantum computing rely on nearest neighbor interactions, there is a hidden quantum communication overhead to connect distant nodes of the computer. In this paper we propose a physical solution to this problem which, together with the key building blocks, provides a pathway to a scalable quantum architecture using nonlocal interactions. Our solution involves the concept of a quantum bus that acts as a refreshable entanglement resource to connect distant memory nodes providing an architectural concept for quantum computers analogous to the von Neumann architecture for classical computers.

Ultracold collision properties of metastable alkaline-earth atoms - Andrei Derevianko; Sergey G. Porsev; Svetlana Kotochigova; Eite Tiesinga; Paul S. Julienne (Physical Review Letters, 2003)
Ultra-cold collisions of spin-polarized 24Mg,40Ca, and 88Sr in the metastable 3P2 excited state are investigated. We calculate the long-range interaction potentials and estimate the scattering length and the collisional loss rate as a function of magnetic field. The estimates are based on molecular potentials between 3P2 alkaline-earth atoms obtained from ab initio atomic and molecular structure calculations. The scattering lengths show resonance behavior due to the appearance of a molecular bound state in a purely long-range interaction potential and are positive for magnetic fields below 50 mT. A loss-rate model shows that losses should be smallest near zero magnetic field and for fields slightly larger than the resonance field, where the scattering length is also positive.

Ultracold Cs$_2$ Feshbach Spectroscopy - Cheng Chin; Vladan Vuletic; Andrew J. Kerman; Steven Chu; Eite Tiesinga; Paul J. Leo; Carl J. Williams (2003)
We have observed and located more than 60 magnetic field-induced Feshbach resonances in ultracold collisions of ground-state $^{133}$Cs atoms. These resonances are associated with molecular states with up to four units of rotational angular momentum, and are detected through variations in the elastic, inelastic, and radiative collision cross sections. These observations allow us to greatly improve upon the interaction potentials between two cesium atoms and to reproduce the positions of most resonances to accuracies better than 0.5%. Based on the relevant coupling scheme between the electron spin, nuclear spin, and orbital angular momenta of the nuclei, quantum numbers and energy structure of the molecular states beneath the dissociation continuum are revealed. Finally, we predict the relevant collision properties for cesium Bose-Einstein condensation experiments.

Asymptotic entanglement capacity of the Ising and anisotropic Heisenberg interactions - Andrew M. Childs; D. W. Leung; F. Verstraete; G. Vidal (2002)
We compute the asymptotic entanglement capacity of the Ising interaction ZZ, the anisotropic Heisenberg interaction XX + YY, and more generally, any two-qubit Hamiltonian with canonical form K = a XX + b YY. We also describe an entanglement assisted classical communication protocol using the Hamiltonian K with rate equal to the asymptotic entanglement capacity.

Characterizing quantum theory in terms of information-theoretic constraints - Rob Clifton; Jeffrey Bub; Hans Halvorson (Foundations of Physics, 2002)
We show that three fundamental information-theoretic constraints--the impossibility of superluminal information transfer between two physical systems by performing measurements on one of them, the impossibility of broadcasting the information contained in an unknown physical state, and the impossibility of unconditionally secure bit commitment--suffice to entail that the observables and state space of a physical theory are quantum-mechanical. We demonstrate the converse derivation in part, and consider the implications of alternative answers to a remaining open question about nonlocality and bit commitment.

Exponential algorithmic speedup by quantum walk - Andrew M. Childs; Richard Cleve; Enrico Deotto; Edward Farhi; Sam Gutmann; Daniel A. Spielman (2002)
We construct an oracular (i.e., black box) problem that can be solved exponentially faster on a quantum computer than on a classical computer. The quantum algorithm is based on a continuous time quantum walk, and thus employs a different technique from previous quantum algorithms based on quantum Fourier transforms. We show how to implement the quantum walk efficiently in our oracular setting. We then show how this quantum walk can be used to solve our problem by rapidly traversing a graph. Finally, we prove that no classical algorithm can solve this problem with high probability in subexponential time.

`Flat Phase' Loading of a Bose-Einstein Condensate into an Optical Lattice - Shlomo E. Sklarz; Inbal Friedler; David J. Tannor; Yehuda B. Band; Carl J. Williams (Physical Review A, 2002)
It has been proposed that the adiabatic loading of a Bose-Einstein Condensate (BEC) into an optical lattice via the Mott-insulator transition can be used to initialize a quantum computer [D. Jaksch, {\it et al.}, Phys. Rev. Lett. {\bf 81}, 3108 (1998)]. The loading of a BEC into the lattice without causing band excitation is readily achievable; however, unless one switches on an optical lattice very slowly, the optical lattice causes a phase to accumulate across the condensate. We show analytically and numerically that a cancellation of this effect is possible by adjusting the harmonic trap force-constant of the magnetic trap appropriately, thereby facilitating quick loading of an optical lattice for quantum computing purposes. A simple analytical theory is developed for a non-stationary BEC in a harmonic trap.

On the Gauss–Bonnet Formula in Riemann–Finsler Geometry - Brad Lackey (Bulletin of the London Mathematical Society, 2002)
Using Chern's method of transgression, the Euler class of a compact orientable Riemann–Finsler space is represented by polynomials in the connection and curvature matrices of a torsion-free connection. When using the Chern connection (and hence the Christoffel–Levi–Civita connection in the Riemannian case), this result extends the Gauss–Bonnet formula of Bao and Chern to Finsler spaces whose indicatrices need not have constant volume.

Maxwell's demon and the thermodynamics of computation - J. Bub (2002)
It is generally accepted, following Landauer and Bennett, that the process of measurement involves no minimum entropy cost, but the erasure of information in resetting the memory register of a computer to zero requires dissipating heat into the environment. This thesis has been challenged recently in a two-part article by Earman and Norton. I review some relevant observations in the thermodynamics of computation and argue that Earman and Norton are mistaken: there is in principle no entropy cost to the acquisition of information, but the destruction of information does involve an irreducible entropy cost.

Quantum search by measurement - Andrew M. Childs; Enrico Deotto; Edward Farhi; Jeffrey Goldstone; Sam Gutmann; Andrew J. Landahl (Physical Review A, 2002)
We propose a quantum algorithm for solving combinatorial search problems that uses only a sequence of measurements. The algorithm is similar in spirit to quantum computation by adiabatic evolution, in that the goal is to remain in the ground state of a time-varying Hamiltonian. Indeed, we show that the running times of the two algorithms are closely related. We also show how to achieve the quadratic speedup for Grover's unstructured search problem with only two measurements. Finally, we discuss some similarities and differences between the adiabatic and measurement algorithms.

Universal simulation of Hamiltonian dynamics for qudits - Michael A. Nielsen; Michael J. Bremner; Jennifer L. Dodd; Andrew M. Childs; Christopher M. Dawson (Physical Review A, 2002)
What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? Dodd et al. (quant-ph/0106064) provided a partial solution to this problem in the form of an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling N-qubit Hamiltonian, and local unitaries. We extend this result to the case where the component systems have D dimensions. As a consequence we explain how universal quantum computation can be performed with any fixed two-body entangling N-qudit Hamiltonian, and local unitaries.

Exact sampling from non-attractive distributions using summary states - Andrew M. Childs; Ryan B. Patterson; David J. C. MacKay (Physical Review E, 2001)
Propp and Wilson's method of coupling from the past allows one to efficiently generate exact samples from attractive statistical distributions (e.g., the ferromagnetic Ising model). This method may be generalized to non-attractive distributions by the use of summary states, as first described by Huber. Using this method, we present exact samples from a frustrated antiferromagnetic triangular Ising model and the antiferromagnetic q=3 Potts model. We discuss the advantages and limitations of the method of summary states for practical sampling, paying particular attention to the slowing down of the algorithm at low temperature. In particular, we show that such a slowing down can occur in the absence of a physical phase transition.

An example of the difference between quantum and classical random walks - Andrew M. Childs; Edward Farhi; Sam Gutmann (Quantum Information Processing, 2001)
In this note, we discuss a general definition of quantum random walks on graphs and illustrate with a simple graph the possibility of very different behavior between a classical random walk and its quantum analogue. In this graph, propagation between a particular pair of nodes is exponentially faster in the quantum case.

Realization of quantum process tomography in NMR - Andrew M. Childs; Isaac L. Chuang; Debbie W. Leung (Physical Review A, 2001)
Quantum process tomography is a procedure by which the unknown dynamical evolution of an open quantum system can be fully experimentally characterized. We demonstrate explicitly how this procedure can be implemented with a nuclear magnetic resonance quantum computer. This allows us to measure the fidelity of a controlled-not logic gate and to experimentally investigate the error model for our computer. Based on the latter analysis, we test an important assumption underlying nearly all models of quantum error correction, the independence of errors on different qubits.

Robustness of adiabatic quantum computation - Andrew M. Childs; Edward Farhi; John Preskill (Physical Review A, 2001)
We study the fault tolerance of quantum computation by adiabatic evolution, a quantum algorithm for solving various combinatorial search problems. We describe an inherent robustness of adiabatic computation against two kinds of errors, unitary control errors and decoherence, and we study this robustness using numerical simulations of the algorithm.

Secure assisted quantum computation - Andrew M. Childs (2001)
Suppose Alice wants to perform some computation that could be done quickly on a quantum computer, but she cannot do universal quantum computation. Bob can do universal quantum computation and claims he is willing to help, but Alice wants to be sure that Bob cannot learn her input, the result of her calculation, or perhaps even the function she is trying to compute. We describe a simple, efficient protocol by which Bob can help Alice perform the computation, but there is no way for him to learn anything about it. We also discuss techniques for Alice to detect whether Bob is honestly helping her or if he is introducing errors.

Secure key distribution via pre- and post-selected quantum states - J. Bub (Physical Review A, 2001)
A quantum key distribution scheme whose security depends on the features of pre- and post-selected quantum states is described.

Universal simulation of Markovian quantum dynamics - Dave Bacon; Andrew M. Childs; Isaac L. Chuang; Julia Kempe; Debbie W. Leung; Xinlan Zhou (Physical Review A, 2001)
Although the conditions for performing arbitrary unitary operations to simulate the dynamics of a closed quantum system are well understood, the same is not true of the more general class of quantum operations (also known as superoperators) corresponding to the dynamics of open quantum systems. We propose a framework for the generation of Markovian quantum dynamics and study the resources needed for universality. For the case of a single qubit, we show that a single nonunitary process is necessary and sufficient to generate all unital Markovian quantum dynamics, whereas a set of processes parametrized by one continuous parameter is needed in general. We also obtain preliminary results for the unital case in higher dimensions.

Finding cliques by quantum adiabatic evolution - Andrew M. Childs; Edward Farhi; Jeffrey Goldstone; Sam Gutmann (2000)
Quantum adiabatic evolution provides a general technique for the solution of combinatorial search problems on quantum computers. We present the results of a numerical study of a particular application of quantum adiabatic evolution, the problem of finding the largest clique in a random graph. An n-vertex random graph has each edge included with probability 1/2, and a clique is a completely connected subgraph. There is no known classical algorithm that finds the largest clique in a random graph with high probability and runs in a time polynomial in n. For the small graphs we are able to investigate (n <= 18), the quantum algorithm appears to require only a quadratic run time.

Metric Equivalence of Path Spaces - Brad Lackey (Nonlinear Studies, 2000)
Local equivalence and the invariants of systems of second order differential equations were studied in a series of papers by Kosambi, Cartan, and Chern. The resulting theory, deemed KCC-theory, is a rich geometric study which in many ways generalizes Riemannian and Finsler geometry. Yet, in many applications one requires a metric structure in addition to the systems of second order differential equations. We pose a geometry which is equipped with both of these structures, and solve the problem of local equivalence and thus determining a preferred connection and finding a generating set for all the invariants of the theory.

The quantum bit commitment theorem - Jeffrey Bub (2000)
Unconditionally secure two-party bit commitment based solely on the principles of quantum mechanics (without exploiting special relativistic signalling constraints, or principles of general relativity or thermodynamics) has been shown to be impossible, but the claim is repeatedly challenged. The quantum bit commitment theorem is reviewed here and the central conceptual point, that an `Einstein-Podolsky-Rosen' attack or cheating strategy can always be applied, is clarified. The question of whether following such a cheating strategy can ever be disadvantageous to the cheater is considered and answered in the negative. There is, indeed, no loophole in the theorem.

Quantum information and precision measurement - Andrew M. Childs; John Preskill; Joseph Renes (Journal of Modern Optics, 2000)
We describe some applications of quantum information theory to the analysis of quantum limits on measurement sensitivity. A measurement of a weak force acting on a quantum system is a determination of a classical parameter appearing in the master equation that governs the evolution of the system; limitations on measurement accuracy arise because it is not possible to distinguish perfectly among the different possible values of this parameter. Tools developed in the study of quantum information and computation can be exploited to improve the precision of physics experiments; examples include superdense coding, fast database search, and the quantum Fourier transform.

Universal quantum computation with two-level trapped ions - Andrew M. Childs; Isaac L. Chuang (Physical Review A, 2000)
Although the initial proposal for ion trap quantum computation made use of an auxiliary internal level to perform logic between ions, this resource is not necessary in principle. Instead, one may perform such operations directly using sideband laser pulses, operating with an arbitrary (sufficiently small) Lamb-Dicke parameter. We explore the potential of this technique, showing how to perform logical operations between the internal state of an ion and the collective motional state and giving explicit constructions for a controlled-not gate between ions.

On Galilean connections and the first jet bundle - James D. E. Grant; Brad Lackey (1999)
We express the first jet bundle of curves in Euclidean space as homogeneous spaces associated to a Galilean-type group. Certain Cartan connections on a manifold with values in the Lie algebra of the Galilean group are characterized as geometries associated to systems of second order ordinary differential equations. We show these Cartan connections admit a form of normal coordinates, and that in these normal coordinates the geodesic equations of the connection are second order ordinary differential equations. We then classify such connections by some of their torsions, extending a classical theorem of Chern involving the geometry associated to a system of second order differential equations.

A model of trophodynamics - Brad Lackey (Nonlinear Analysis: Theory, Methods & Applications, 1999)

Quantum Mechanics as a Principle Theory - Jeffrey Bub (1999)
I show how quantum mechanics, like the theory of relativity, can be understood as a 'principle theory' in Einstein's sense, and I use this notion to explore the approach to the problem of interpretation developed in my book Interpreting the Quantum World (Cambridge: Cambridge University Press, 1999).

Randers surfaces whose Laplacians have completely positive symbol - Bao, David; Lackey, Brad (Nonlinear Analysis: Theory, Methods & Applications, 1999)

Revised Proof of the Uniqueness Theorem for 'No Collapse' Interpretations of Quantum Mechanics - Jeffrey Bub; Rob Clifton; Sheldon Goldstein (1999)
We show that the Bub-Clifton uniqueness theorem for 'no collapse' interpretations of quantum mechanics (Studies in the History and Philosophy of Modern Physics 27, 181-219 (1996)) can be proved without the 'weak separability' assumption.

A Bochner Vanishing Theorem for Elliptic Complexes - Lackey, Brad (The Theory of Finslerian Laplacians and Applications, 1998)

A geometric inequality and a Weitzenboeck formula for Finsler surfaces - Bao, David; Lackey, Brad (The Theory of Finslerian Laplacians and Applications, 1998)

A Lichnerowicz Vanishing Theorem for Finsler Spaces - Lackey, Brad (The Theory of Finslerian Laplacians and Applications, 1998)

A Hodge decomposition theorem for Finsler spaces - Bao, David; Brad Lackey (Comptes rendus de l'Académie des sciences. Série 1, Mathématique, 1996)
Soit (M,F) une vari\e'té finslérienne compacte sans bord. On donne une condition nécessaire et suffisante, portant sur le tenseur fondamental, afin q'une forme différentielle extérieure de M soit harmonique. On introduit aussi le laplacien sur M et on démontre l'analoque du théorème de Hodge dans le cas finslérien.

Special eigenforms on the sphere bundle of a Finsler manifold - Bao, David; Lackey, Brad (Contemporary Mathematics, 1996)