SWAP Version 3.2. Theory description and user manual

SWAP 3.2 simulates transport of water, solutes and heat in the vadose zone. It describes a domain from the top of canopy into the groundwater which may be in interaction with a surface water system. The program has been developed by Alterra and Wageningen University, and is designed to simulate transport processes at field scale and during whole growing seasons. This is a new release with special emphasis on numerical stability, macro pore flow, and options for detailed meteorological input and linkage to other models. This manual describes the theoretical background, model use, input requirements and output tables

Algorithmic approach to adiabatic quantum optimization

It is believed that the presence of anticrossings with exponentially small gaps between the lowest two energy levels of the system Hamiltonian, can render adiabatic quantum optimization inefficient. Here, we present a simple adiabatic quantum algorithm designed to eliminate exponentially small gaps caused by anticrossings between eigenstates that correspond with the local and global minima of the problem Hamiltonian. In each iteration of the algorithm, information is gathered about the local minima that are reached after passing the anticrossing non-adiabatically. This information is then used to penalize pathways to the corresponding local minima, by adjusting the initial Hamiltonian. This is repeated for multiple clusters of local minima as needed. We generate 64-qubit random instances of the maximum independent set problem, skewed to be extremely hard, with between 10^5 and 10^6 highly-degenerate local minima. Using quantum Monte Carlo simulations, it is found that the algorithm can trivially solve all the instances in ~10 iterations.Comment: 7 pages, 3 figure

Scaling of running time of quantum adiabatic algorithm for propositional satisfiability

We numerically study quantum adiabatic algorithm for the propositional satisfiability. A new class of previously unknown hard instances is identified among random problems. We numerically find that the running time for such instances grows exponentially with their size. Worst case complexity of quantum adiabatic algorithm therefore seems to be exponential.Comment: 7 page

Single-electron tunneling in InP nanowires

We report on the fabrication and electrical characterization of field-effect devices based on wire-shaped InP crystals grown from Au catalyst particles by a vapor-liquid-solid process. Our InP wires are n-type doped with diameters in the 40-55 nm range and lengths of several microns. After being deposited on an oxidized Si substrate, wires are contacted individually via e-beam fabricated Ti/Al electrodes. We obtain contact resistances as low as ~10 kOhm, with minor temperature dependence. The distance between the electrodes varies between 0.2 and 2 micron. The electron density in the wires is changed with a back gate. Low-temperature transport measurements show Coulomb-blockade behavior with single-electron charging energies of ~1 meV. We also demonstrate energy quantization resulting from the confinement in the wire.Comment: 4 pages, 3 figure

Experimental implementation of an adiabatic quantum optimization algorithm

We report the realization of a nuclear magnetic resonance computer with three quantum bits that simulates an adiabatic quantum optimization algorithm. Adiabatic quantum algorithms offer new insight into how quantum resources can be used to solve hard problems. This experiment uses a particularly well suited three quantum bit molecule and was made possible by introducing a technique that encodes general instances of the given optimization problem into an easily applicable Hamiltonian. Our results indicate an optimal run time of the adiabatic algorithm that agrees well with the prediction of a simple decoherence model.Comment: REVTeX, 5 pages, 4 figures, improved lay-out; accepted for publication in Physical Review Letter

Neutrix Calculus and Finite Quantum Field Theory

In general, quantum field theories (QFT) require regularizations and infinite renormalizations due to ultraviolet divergences in their loop calculations. Furthermore, perturbation series in theories like QED are not convergent series, but are asymptotic series. We apply neutrix calculus, developed in connection with asymptotic series and divergent integrals, to QFT,obtaining finite renormalizations. While none of the physically measurable results in renormalizable QFT is changed, quantum gravity is rendered more manageable in the neutrix framework.Comment: 10 pages; LaTeX; version to appear in J. Phys. A: Math. Gen. as a Letter to the Edito