Perturbative Gadgets at Arbitrary Orders

Adiabatic quantum algorithms are often most easily formulated using many-body interactions. However, experimentally available interactions are generally two-body. In 2004, Kempe, Kitaev, and Regev introduced perturbative gadgets, by which arbitrary three-body effective interactions can be obtained using Hamiltonians consisting only of two-body interactions. These three-body effective interactions arise from the third order in perturbation theory. Since their introduction, perturbative gadgets have become a standard tool in the theory of quantum computation. Here we construct generalized gadgets so that one can directly obtain arbitrary k-body effective interactions from two-body Hamiltonians. These effective interactions arise from the kth order in perturbation theory.Comment: Corrected an error: U dagger vs. U invers

Asymptotic behavior of the least common multiple of consecutive arithmetic progression terms

Let $l$ and $m$ be two integers with $l>m\ge 0$, and let $a$ and $b$ be integers with $a\ge 1$ and $a+b\ge 1$. In this paper, we prove that $\log {\rm lcm}_{mn<i\le ln}\{ai+b\} =An+o(n)$, where $A$ is a constant depending on $l, m$ and $a$.Comment: 8 pages. To appear in Archiv der Mathemati

Experimental study of ultracold neutron production in pressurized superfluid helium

We have investigated experimentally the pressure dependence of the production of ultracold neutrons (UCN) in superfluid helium in the range from saturated vapor pressure to 20bar. A neutron velocity selector allowed the separation of underlying single-phonon and multiphonon pro- cesses by varying the incident cold neutron (CN) wavelength in the range from 3.5 to 10{\AA}. The predicted pressure dependence of UCN production derived from inelastic neutron scattering data was confirmed for the single-phonon excitation. For multiphonon based UCN production we found no significant dependence on pressure whereas calculations from inelastic neutron scattering data predict an increase of 43(6)% at 20bar relative to saturated vapor pressure. From our data we conclude that applying pressure to superfluid helium does not increase the overall UCN production rate at a typical CN guide.Comment: 18 pages, 8 figures Version accepted for publication in PR

The least common multiple of a sequence of products of linear polynomials

Let $f(x)$ be the product of several linear polynomials with integer coefficients. In this paper, we obtain the estimate: $\log {\rm lcm}(f(1), ..., f(n))\sim An$ as $n\rightarrow\infty$, where $A$ is a constant depending on $f$.Comment: To appear in Acta Mathematica Hungaric

Integral Difference Ratio Functions on Integers

number theoryInternational audienceTo Jozef, on his 80th birthday, with our gratitude for sharing with us his prophetic vision of Informatique Abstract. Various problems lead to the same class of functions from integers to integers: functions having integral difference ratio, i.e. verifying f (a) − f (b) ≡ 0 (mod (a − b)) for all a > b. In this paper we characterize this class of functions from Z to Z via their a la Newton series expansions on a suitably chosen basis of polynomials (with rational coefficients). We also exhibit an example of such a function which is not polynomial but Bessel like

Quantum walks based on an interferometric analogy

There are presently two models for quantum walks on graphs. The "coined" walk uses discrete time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the particle will move. The continuous walk operates with continuous time. Here a third model for a quantum walk is proposed, which is based on an analogy to optical interferometers. It is a discrete-time model, and the unitary operator that advances the walk one step depends only on the local structure of the graph on which the walk is taking place. No quantum coin is introduced. This type of walk allows us to introduce elements, such as phase shifters, that have no counterpart in classical random walks. Walks on the line and cycle are discussed in some detail, and a probability current for these walks is introduced. The relation to the coined quantum walk is also discussed. The paper concludes by showing how to define these walks for a general graph.Comment: Latex,18 pages, 5 figure

Quantum entangling power of adiabatically connected hamiltonians

The space of quantum Hamiltonians has a natural partition in classes of operators that can be adiabatically deformed into each other. We consider parametric families of Hamiltonians acting on a bi-partite quantum state-space. When the different Hamiltonians in the family fall in the same adiabatic class one can manipulate entanglement by moving through energy eigenstates corresponding to different value of the control parameters. We introduce an associated notion of adiabatic entangling power. This novel measure is analyzed for general $d\times d$ quantum systems and specific two-qubits examples are studiedComment: 5 pages, LaTeX, 2 eps figures included. Several non minor changes made (thanks referee) Version to appear in the PR

Robustness of adiabatic quantum computation

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.Comment: 11 pages, 5 figures, REVTe

The performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs

In this paper we study the performance of the quantum adiabatic algorithm on random instances of two combinatorial optimization problems, 3-regular 3-XORSAT and 3-regular Max-Cut. The cost functions associated with these two clause-based optimization problems are similar as they are both defined on 3-regular hypergraphs. For 3-regular 3-XORSAT the clauses contain three variables and for 3-regular Max-Cut the clauses contain two variables. The quantum adiabatic algorithms we study for these two problems use interpolating Hamiltonians which are stoquastic and therefore amenable to sign-problem free quantum Monte Carlo and quantum cavity methods. Using these techniques we find that the quantum adiabatic algorithm fails to solve either of these problems efficiently, although for different reasons.Comment: 20 pages, 15 figure