A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem

A quantum system will stay near its instantaneous ground state if the Hamiltonian that governs its evolution varies slowly enough. This quantum adiabatic behavior is the basis of a new class of algorithms for quantum computing. We test one such algorithm by applying it to randomly generated, hard, instances of an NP-complete problem. For the small examples that we can simulate, the quantum adiabatic algorithm works well, and provides evidence that quantum computers (if large ones can be built) may be able to outperform ordinary computers on hard sets of instances of NP-complete problems.Comment: 15 pages, 6 figures, email correspondence to [email protected] ; a shorter version of this article appeared in the April 20, 2001 issue of Science; see http://www.sciencemag.org/cgi/content/full/292/5516/47

Derivation of the Quantum Probability Rule without the Frequency Operator

We present an alternative frequencists' proof of the quantum probability rule which does not make use of the frequency operator, with expectation that this can circumvent the recent criticism against the previous proofs which use it. We also argue that avoiding the frequency operator is not only for technical merits for doing so but is closely related to what quantum mechanics is all about from the viewpoint of many-world interpretation.Comment: 12 page

Improved Error-Scaling for Adiabatic Quantum State Transfer

We present a technique that dramatically improves the accuracy of adiabatic state transfer for a broad class of realistic Hamiltonians. For some systems, the total error scaling can be quadratically reduced at a fixed maximum transfer rate. These improvements rely only on the judicious choice of the total evolution time. Our technique is error-robust, and hence applicable to existing experiments utilizing adiabatic passage. We give two examples as proofs-of-principle, showing quadratic error reductions for an adiabatic search algorithm and a tunable two-qubit quantum logic gate.Comment: 10 Pages, 4 figures. Comments are welcome. Version substantially revised to generalize results to cases where several derivatives of the Hamiltonian are zero on the boundar

Enabling Technologies for the Future of Chemical Synthesis.

Technology is evolving at breakneck pace, changing the way we communicate, travel, find out information, and live our lives. Yet chemistry as a science has been slower to adapt to this rapidly shifting world. In this Outlook we use highlights from recent literature reports to describe how progresses in enabling technologies are altering this trend, permitting chemists to incorporate new advances into their work at all levels of the chemistry development cycle. We discuss the benefits and challenges that have arisen, impacts on academic-industry relationships, and future trends in the area of chemical synthesis.We are grateful to the Woolf Fisher Trust (D.E.F), Syngenta Crop Protection AG (C.B.) and EPSRC (S.V.L., grant codes EP/K009494/1, EP/M004120/1 and EP/K039520/1) for financial assistance.This is the final version of the article. It first appeared from the American Chemical Society via https://doi.org/10.1021/acscentsci.6b0001

Adiabatic Quantum Computing with Phase Modulated Laser Pulses

Implementation of quantum logical gates for multilevel system is demonstrated through decoherence control under the quantum adiabatic method using simple phase modulated laser pulses. We make use of selective population inversion and Hamiltonian evolution with time to achieve such goals robustly instead of the standard unitary transformation language.Comment: 19 pages, 6 figures, submitted to JOP