Smooth Structured Prediction Using Quantum and Classical Gibbs Samplers
By Behrooz Sepehry, Ehsan Iranmanesh, Michael P. Friedlander, & Pooya Ronagh
We introduce a quantum algorithm for solving structured prediction problems with a runtime that scales with the square root of the size of the label space, but scales in \(\widetilde O\left(\epsilon^{-3.5}\right)\) with respect to the precision, \(\epsilon\), of the solution. In doing so, we analyze a stochastic gradient algorithm for convex optimization in the presence of an additive error in the calculation of the gradients, and show that its convergence rate does not deteriorate if the additive errors are of the order \(O(\sqrt\epsilon)\). Our algorithm uses quantum Gibbs sampling at temperature \(\Omega (\epsilon)\) as a subroutine. Based on these theoretical observations, we propose a method for using quantum Gibbs samplers to combine feedforward neural networks with probabilistic graphical models for quantum machine learning. Numerical results using Monte Carlo simulations on an image tagging task demonstrate the benefit of the approach.
PDF ARXIV PREPRINT
Most Recent Papers
Variationally Scheduled Quantum Simulation
By Shunji Matsuura, Samantha Buck, Valentin Senicourt, & Arman Zaribafiyan Eigenstate preparation is ubiquitous in quantum computing, and a standard approach for generating the lowest-energy states of a given system is by employing adiabatic state preparation...
Scaling Up Electronic Structure Calculations on Quantum Computers: The Frozen Natural Orbital Based Method of Increments
By Prakash Verma, Lee Huntington, Marc Coons, Yukio Kawashima, Takeshi Yamazaki, & Arman Zaribafiyan Quantum computing is a new computing paradigm that holds great promise for the efficient simulation of quantum mechanical systems. However, the hardware envelope...
Effects of Setting the Temperatures in the Parallel Tempering Monte Carlo Algorithm
By Ignacio Rozada, Maliheh Aramon, Jonathan Machta, & Helmut G. Katzgraber Parallel tempering Monte Carlo has proven to be an efficient method in optimization and sampling applications. Having an optimized temperature set enhances the efficiency of the algorithm...
Adiabatic Quantum Kitchen Sinks for Learning Kernels Using Randomized Features
By Moslem Noori, Seyed Shakib Vedaie, Inderpreet Singh, Daniel Crawford, Jaspreet S. Oberoi, Barry C. Sanders, & Ehsan Zahedinejad Quantum information processing is likely to have far-reaching impact in the field of artificial intelligence. While the race to build...
A Quantum Annealing-Based Approach to Extreme Clustering
By Tim Jaschek, Marko Bucyk, & Jaspreet S. Oberoi Clustering, or grouping, dataset elements based on similarity can be used not only to classify a dataset into a few categories, but also to approximate it by a relatively large number of representative elements. In...