Quantum Kitchen Sinks: An algorithm for machine learning on near-term quantum computers

Abstract

Noisy intermediate-scale quantum computing devices are an exciting platform for the exploration of the power of near-term quantum applications. Performing nontrivial tasks in such devices requires a fundamentally different approach than what would be used on an error-corrected quantum computer. One such approach is to use hybrid algorithms, where problems are reduced to a parameterized quantum circuit that is often optimized in a classical feedback loop. Here we describe one such hybrid algorithm for machine learning tasks by building upon the classical algorithm known as random kitchen sinks. Our technique, called quantum kitchen sinks, uses quantum circuits to nonlinearly transform classical inputs into features that can then be used in a number of machine learning algorithms. We demonstrate the power and flexibility of this proposal by using it to solve binary classification problems for synthetic datasets as well as handwritten digits from the MNIST database. Using the Rigetti quantum virtual machine, we show that small quantum circuits provide significant performance lift over standard linear classical algorithms, reducing classification error rates from 50% to $<0.1\%$, and from $4.1\%$ to $1.4\%$ in these two examples, respectively. Further, we are able to run the MNIST classification problem, using full-sized MNIST images, on a Rigetti quantum processing unit, finding a modest performance lift over the linear baseline.

arXiv comment8 pages, 5 figures; v2: Added experimental results and new authors related to experimental effort

References in corpus (20)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Elementary gates for quantum computation
• Quantum algorithm for solving linear systems of equations
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Supervised learning with quantum enhanced feature spaces
• Quantum support vector machine for big data classification
• A Quantum Approximate Optimization Algorithm
• Quantum principal component analysis
• Circuit-centric quantum classifiers
• Average-case complexity versus approximate simulation of commuting quantum computations
• Demonstration of Universal Parametric Entangling Gates on a Multi-Qubit Lattice
• Concrete Categorical Model of a Quantum Circuit Description Language with Measurement
• Parametrically Activated Entangling Gates Using Transmon Qubits
• Achieving quantum supremacy with sparse and noisy commuting quantum computations
• Quantum Supremacy through the Quantum Approximate Optimization Algorithm
• Analytical modeling of parametrically-modulated transmon qubits
• Quantum Algorithms for Fixed Qubit Architectures
• Quantum learning robust to noise
• Kernel Approximation Methods for Speech Recognition

Cited by in corpus (5)

• Advances in Quantum Deep Learning: An Overview
• A Grover-search Based Quantum Learning Scheme for Classification
• Fock State-enhanced Expressivity of Quantum Machine Learning Models
• End-to-End Quantum Machine Learning Implemented with Controlled Quantum Dynamics
• QUILT: Effective Multi-Class Classification on Quantum Computers Using an Ensemble of Diverse Quantum Classifiers