Nonnegative/binary matrix factorization with a D-Wave quantum annealer

Abstract

D-Wave quantum annealers represent a novel computational architecture and have attracted significant interest, but have been used for few real-world computations. Machine learning has been identified as an area where quantum annealing may be useful. Here, we show that the D-Wave 2X can be effectively used as part of an unsupervised machine learning method. This method can be used to analyze large datasets. The D-Wave only limits the number of features that can be extracted from the dataset. We apply this method to learn the features from a set of facial images.

References in corpus (4)

• Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
• Training a Binary Classifier with the Quantum Adiabatic Algorithm
• The pitfalls of planar spin-glass benchmarks: Raising the bar for quantum annealers (again)
• Optimal structure and parameter learning of Ising models

Cited by in corpus (46)

• Quantum Annealing for Industry Applications: Introduction and Review
• Expanding the horizon of automated metamaterials discovery via quantum annealing
• Support vector machines on the D-Wave quantum annealer
• A Tutorial on Formulating and Using QUBO Models
• Quantum Computing at the Frontiers of Biological Sciences
• Prospects for Quantum Enhancement with Diabatic Quantum Annealing
• Traffic Signal Optimization on a Square Lattice with Quantum Annealing
• Improving solutions by embedding larger subproblems in a D-Wave quantum annealer
• Benchmarking Quantum Annealing Controls with Portfolio Optimization
• Network Community Detection On Small Quantum Computers
• Feature Selection for Recommender Systems with Quantum Computing
• Training and Classification using a Restricted Boltzmann Machine on the D-Wave 2000Q
• Reverse Annealing for Nonnegative/Binary Matrix Factorization
• Model Predictive Control for Finite Input Systems using the D-Wave Quantum Annealer
• Box algorithm for the solution of differential equations on a quantum annealer
• Community Detection Across Emerging Quantum Architectures
• Implementation of quantum secret sharing and quantum binary voting protocol in the IBM quantum computer
• Low Rank Non-Negative Matrix Factorization with D-Wave 2000Q
• Quantum Annealing Algorithms for Boolean Tensor Networks
• Nonnegative/Binary Matrix Factorization for Image Classification using Quantum Annealing
• Efficient Algorithm for Binary Quadratic Problem by Column Generation and Quantum Annealing
• Quantum autoencoders for image classification
• Exploration of new chemical materials using black-box optimization with the D-wave quantum annealer
• Lossy compression of matrices by black-box optimisation of mixed integer nonlinear programming
• Hybrid Optimization Method Using Simulated-Annealing-Based Ising Machine and Quantum Annealer
• Hybrid adiabatic quantum computing for tomographic image reconstruction -- opportunities and limitations
• Image Analysis Based on Nonnegative/Binary Matrix Factorization
• Low-temperature environments for quantum computation and quantum simulation
• Balanced k-Means Clustering on an Adiabatic Quantum Computer
• Efficient quantum and simulated annealing of Potts models using a half-hot constraint
• Individual subject evaluated difficulty of adjustable mazes generated using quantum annealing
• Hybrid Algorithm of Linear Programming Relaxation and Quantum Annealing
• Dynamical process of a bit-width reduced Ising model with simulated annealing
• Unraveling Reverse Annealing: A Study of D-Wave Quantum Annealers
• Online calibration scheme for training restricted Boltzmann machines with quantum annealing
• Binary matrix factorization on special purpose hardware
• Applications of Quantum Annealing in Statistics
• Subgradient Method using Quantum Annealing for Inequality-Constrained Binary Optimization Problems
• Boolean Hierarchical Tucker Networks on Quantum Annealers
• Solving Large Break Minimization Problems in a Mirrored Double Round-robin Tournament Using Quantum Annealing
• Optimization of Connection Patterns between Mobile Phones and Base Stations using Quantum Annealing
• Collaborative filtering based on nonnegative/binary matrix factorization
• Adiabatic Quantum Graph Matching with Permutation Matrix Constraints
• Solving Non-identifiable Latent Feature Models
• Generating gradients in the energy landscape using rectified linear type cost functions for efficiently solving 0/1 matrix factorization in Simulated Annealing
• Efficient Construction of Feasible Solutions in Column Generation using Quantum Annealing