Aram Harrow - Quantum Monte Carlo vs Tunneling in Adiabatic Optimization

ثبت نشده
چکیده

In this talk I'll present a quantum algorithm for solving semidefinite programs (SDPs). It has worst case running time O((nm)^1/2 r), with n and r the dimension and sparsity of the input matrices, respectively, and m the number of constraints. In contrast any classical method requires at least Omega(nm) time to solve the problem. I'll discuss how for some instances the algorithm might offer even exponential speed-ups, if the quantum Gibbs states of Hamiltonians given by linear combinations of the input matrices of the SDP can be prepared efficiently on a quantum computer. As an application I'll show how the Goemans-Williamson SDP for approximating max-cut can be solved quantum-mechanically in time linear in the number of vertices of the graph. This gives a speed-up over the best classical method, which requires linear time in the number of edges. Based on joint work with Krysta Svore Dmitri Maslov How to program a trapped ions quantum computer Abstract: In this talk, I will discuss ion-trap quantum computing, and specifically, how to program and efficiently compile physical-level experiments for an ion-trap quantum machine developed by the researchers at the University of Maryland. I will report a complete strategy, consisting of the full set of steps taken to sequentially decompose a quantum algorithm/circuit from a higher-level specification into progressively lower-level specifications until physical-level specification is reached. The different stages are structured so as to best assist with the optimization of the resulting physical-level implementation and while taking into account numerous optimization criteria, including minimizing the number of expensive two-qubit gates, minimizing the number of less expensive single-qubit gates, optimizing the runtime, minimizing the overall circuit error, as well as optimizing classical control sequences. There will furthermore be two types of compilation discussed: first allows executing a given quantum algorithm most efficiently via selecting physical qubits to work with, and second provides a fully parametrized physical-level circuit that can be executed on any set of qubits (moreover, sometimes, those parametrized circuits have free parameters that can be set arbitrarily). I will illustrate the efficiency of this compilation approach via comparing to the previously known results. I will also report the results of some physical-level experiments, providing a strong motivation for further study of and the development of tools for the trapped ions quantum information processing platform. In this talk, I will discuss ion-trap quantum computing, and specifically, how to program and efficiently compile physical-level experiments for an ion-trap quantum machine developed by the researchers at the University of Maryland. I will report a complete strategy, consisting of the full set of steps taken to sequentially decompose a quantum algorithm/circuit from a higher-level specification into progressively lower-level specifications until physical-level specification is reached. The different stages are structured so as to best assist with the optimization of the resulting physical-level implementation and while taking into account numerous optimization criteria, including minimizing the number of expensive two-qubit gates, minimizing the number of less expensive single-qubit gates, optimizing the runtime, minimizing the overall circuit error, as well as optimizing classical control sequences. There will furthermore be two types of compilation discussed: first allows executing a given quantum algorithm most efficiently via selecting physical qubits to work with, and second provides a fully parametrized physical-level circuit that can be executed on any set of qubits (moreover, sometimes, those parametrized circuits have free parameters that can be set arbitrarily). I will illustrate the efficiency of this compilation approach via comparing to the previously known results. I will also report the results of some physical-level experiments, providing a strong motivation for further study of and the development of tools for the trapped ions quantum information processing platform.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Quantum Monte Carlo Approach to the Adiabatic Connection Method

We present a new method for realizing the adiabatic connection approach in density functional theory, which is based on combining accurate variational quantum Monte Carlo calculations with a constrained optimization of the ground state many-body wavefunction for different values of the Coulomb coupling constant. We use the method to study an electron gas in the presence of a cosine-wave potenti...

متن کامل

QBoost: Large Scale Classifier Training with Adiabatic Quantum Optimization

We introduce a novel discrete optimization method for training in the context of a boosting framework for large scale binary classifiers. The motivation is to cast the training problem into the format required by existing adiabatic quantum hardware. First we provide theoretical arguments concerning the transformation of an originally continuous optimization problem into one with discrete variab...

متن کامل

Investigating the Performance of an Adiabatic Quantum Optimization Processor

We calculate median adiabatic times (in seconds) of a specific superconducting adiabatic quantum processor for an NP-hard Ising spin glass instance class with up to N = 128 binary variables. To do so, we ran high performance Quantum Monte Carlo simulations on a large-scale Internet-based computing platform. We compare the median adiabatic times with the median running times of two classical sol...

متن کامل

Quantum path minimization: An efficient method for global optimization

A new unbiased global optimization approach is proposed, based on quantum staging path integral Monte Carlo sampling and local minimization of individual imaginary time slices. This algorithm uses the quantum tunneling effect to speed up the crossing of energy barriers. This method differs in important ways from previous work on quantum annealing and is able to find all the global minima of Len...

متن کامل

Training a Large Scale Classifier with the Quantum Adiabatic Algorithm

In a previous publication we proposed discrete global optimization as a method to train a strong binary classifier constructed as a thresholded sum over weak classifiers. Our motivation was to cast the training of a classifier into a format amenable to solution by the quantum adiabatic algorithm. Applying adiabatic quantum computing (AQC) promises to yield solutions that are superior to those w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016