Nonnegative/Binary matrix factorization with a D-Wave quantum annealer
Open accessThe DOI matches its Crossref record; 55 of the 56 references it cites were found in a registry or an index.
Abstract
D-Wave quantum annealers represent a novel computational architecture and have attracted significant interest. Much of this interest has focused on the quantum behavior of D-Wave machines, and there have been few practical algorithms that use the D-Wave. 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 takes a matrix as input and produces two low-rank matrices as output-one containing latent features in the data and another matrix describing how the features can be combined to approximately reproduce the input matrix. Despite the limited number of bits in the D-Wave hardware, this method is capable of handling a large input matrix. The D-Wave only limits the rank of the two output matrices. We apply this method to learn the features from a set of facial images and compare the performance of the D-Wave to two classical tools. This method is able to learn facial features and accurately reproduce the set of facial images. The performance of the D-Wave shows some promise, but has some limitations. It outperforms the two classical codes in a benchmark when only a short amount of computational time is allowed (200-20,000 microseconds), but these results suggest heuristics that would likely outperform the D-Wave in this benchmark.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Figures




Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“However,duetothelimitednumberofqubitsandtheirconnectivity, the QAhardwaredidnot show such an advantage over classical methods in past benchmarking studies.”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [17]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Whilepreviousbenchmarkingstudiesshowedsomeadvantages of QA, most used low-dimensional or the sparse con fi gurations of QUBO matrices due to the lack of available qubits in the QA hardware and poor topology to connect qubits 17 -19 .”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [17]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Consequently, these benchmarking studies show that QA methods and their classical counterparts can exhibit similar solution quality and time complexity.”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [17]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“We measure the computational time dedicated solely to solving given problems, excluding problem reading time, queue time, or communication time between the local computer and quantum annealer. This is consistent with other benchmarking studies 17,18 .”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [17]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“For example, O ' Malley et al. 17 compared the performance of QA with classical methods (mathematical programming), but they limited the number of binary variables to 35 due to the QA hardware limitation.”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [17]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066
Rapid object detection using a boosted cascade of simple features
Viola, P., & Jones, M. (2005) · Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001 · doi:10.1109/cvpr.2001.990517 · Cited by 18,300
Learning the parts of objects by non-negative matrix factorization
Lee, D. D., & Seung, H. S. (1999) · Nature · doi:10.1038/44565 · Cited by 13,868 · cited 3×
“In particular, we utilize the form of quantum annealing realized with D-Wave hardware [6, 7], which has been used to solve a PLOS ONE | https://doi.org/10.1371/journal.pone.0206653 December 10, 2018 1 / 12 OPEN ACCESS Citation: O’Malley D, Vesselinov VV, Alexandrov BS, Alexandrov LB (2018)…”
BackgroundMethodInfluentialGlover, F. (1990) · ORSA Journal on Computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,647
Face recognition using eigenfaces
Turk, M. A., & Pentland, A. P. (2002) · Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.1991.139758 · Cited by 5,197
Glover, F. (1989) · ORSA Journal on Computing · doi:10.1287/ijoc.1.3.190 · Cited by 5,106
Quantum annealing in the transverse Ising model
Kadowaki, T., & Nishimori, H. (1998) · Physical Review E · doi:10.1103/physreve.58.5355 · Cited by 2,339 · cited 1×
“Here we explore the use of another new architecture: quantum annealing [11].”
MethodQuantum annealing with manufactured spins
Johnson, M. W., Amin, M. H. S., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A. J., Johansson, J., Bunyk, P., et al. (2011) · Nature · doi:10.1038/nature10012 · Cited by 1,891 · cited 1×
“This method takes a matrix as input and produces two low-rank matrices as output—one containing latent features in the data and another matrix describing how the features can be combined to approximately reproduce the input matrix.”
MethodProjected Gradient Methods for Nonnegative Matrix Factorization
Lin, C.-J. (2007) · Neural Computation · doi:10.1162/neco.2007.19.10.2756 · Cited by 1,737 · cited 1×
“To satisfy equation 1, we utilize an alternating least squares algorithm [17] (see Algorithm 1). where || · || F is the Frobenius norm.”
MethodOwens, J. D., Houston, M., Luebke, D., Green, S., Stone, J. E., & Phillips, J. C. (2008) · Proceedings of the IEEE · doi:10.1109/jproc.2008.917757 · Cited by 1,495 · cited 1×
“As a result, alternative computational architectures have sprung up including multi-core processors [8], graphic processing units [9], neuromorphic computing [10], and application-specific integrated circuits to name a few.”
BackgroundJuMP: A MODELING LANGUAGE FOR MATHEMATICAL OPTIMIZATION
Dunning, I., Huchette, J., & Lubin, M. (2016) · Cited by 1,357
Tosic, I., & Frossard, P. (2011) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.939537 · Cited by 897
Defining and detecting quantum speedup
Rønnow, T. F., Wang, Z., Job, J., Boixo, S., Isakov, S. V., Wecker, D., Martinis, J. M., Lidar, D. A., & Troyer, M. (2014) · Science · doi:10.1126/science.1252319 · Cited by 601
Chip makers turn to multicore processors
Geer, D. (2005) · Computer · doi:10.1109/mc.2005.160 · Cited by 439 · cited 1×
“As a result, alternative computational architectures have sprung up including multi-core processors [8], graphic processing units [9], neuromorphic computing [10], and application-specific integrated circuits to name a few.”
BackgroundMinor-embedding in adiabatic quantum computation: I. The parameter setting problem
Choi, V. (2008) · Quantum Information Processing · doi:10.1007/s11128-008-0082-9 · Cited by 410
Computational Science and Engineering
Strang, G. (2007) · SDÜ Bilgi Merkezi · Cited by 402
What is the Computational Value of Finite-Range Tunneling?
Denchev, V. S., Boixo, S., Isakov, S. V., Ding, N., Babbush, R., Smelyanskiy, V., Martinis, J., & Neven, H. (2016) · Physical Review X · doi:10.1103/physrevx.6.031015 · Cited by 399 · cited 1×
“This was demonstrated by the cases we studied with 10, 100, and 1,000 anneals where the cumulative time-to-targets for both Gurobi and qbsolv exceeded the annealing time used by the D-Wave.”
MethodComputer Vision and Pattern Recognition, 2008. CVPR 2008. IEEE Conference on
Ferrari, V., Marín-Jiménez, M. J., & Zisserman, A. (2008) · Edinburgh Research Explorer (University of Edinburgh) · Cited by 397
Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice
McGeoch, C. C. (2014) · Synthesis lectures on quantum computing · doi:10.2200/s00585ed1v01y201407qmc008 · Cited by 341
Unsupervised feature selection by regularized self-representation
Zhu, P., Zuo, W., Zhang, L., Hu, Q., & Shiu, S. C. K. (2015) · Pattern Recognition · doi:10.1016/j.patcog.2014.08.006 · Cited by 323
Advances and challenges in log analysis
Oliner, A., Ganapathi, A., & Xu, W. (2012) · Communications of the ACM · doi:10.1145/2076450.2076466 · Cited by 290
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
Choi, V. (2011) · Quantum Information Processing · doi:10.1007/s11128-010-0200-3 · Cited by 278
A brief history of linear and mixed-integer programming computation
Bixby, R. E. (2012) · Documenta Mathematica Series · doi:10.4171/dms/6/16 · Cited by 228
Subspace clustering guided unsupervised feature selection
Zhu, P., Zhu, W., Hu, Q., Zhang, C., & Zuo, W. (2017) · Pattern Recognition · doi:10.1016/j.patcog.2017.01.016 · Cited by 209
Multi-label feature selection with missing labels
Zhu, P., Xu, Q., Hu, Q., Zhang, C., & Zhao, H. (2018) · Pattern Recognition · doi:10.1016/j.patcog.2017.09.036 · Cited by 171
Experimental evaluation of an adiabiatic quantum system for combinatorial optimization
McGeoch, C. C., & Wang, C. (2013) · Proceedings of the ACM International Conference on Computing Frontiers · doi:10.1145/2482767.2482797 · Cited by 166 · cited 1×
“We apply this method to learn the features from a set of facial images and compare the performance of the D-Wave to two classical tools.”
MethodMachine Learning in a Quantum World
Aïmeur, E., Brassard, G., & Gambs, S. (2006) · Lecture Notes in Computer Science · doi:10.1007/11766247_37 · Cited by 161 · cited 1×
“area where quantum annealing may be useful [4, 5, 6].”
BackgroundFast clique minor generation in Chimera qubit connectivity graphs
Boothby, T., King, A. D., & Roy, A. (2016) · Quantum Information Processing · doi:10.1007/s11128-015-1150-6 · Cited by 156
Neuromorphic computing gets ready for the (really) big time
Monroe, D. (2014) · Communications of the ACM · doi:10.1145/2601069 · Cited by 153 · cited 1×
“As a result, alternative computational architectures have sprung up including multi-core processors [8], graphic processing units [9], neuromorphic computing [10], and application-specific integrated circuits to name a few.”
BackgroundOptimised simulated annealing for Ising spin glasses
Isakov, S. V., Zintchenko, I. N., Rønnow, T. F., & Troyer, M. (2015) · Computer Physics Communications · doi:10.1016/j.cpc.2015.02.015 · Cited by 149 · cited 1×
“We apply this method to learn the features from a set of facial images and compare the performance of the D-Wave to two classical tools.”
MethodImage Set-Based Collaborative Representation for Face Recognition
Zhu, P., Zuo, W., Zhang, L., Shiu, S. C.-K., & Zhang, D. D. (2014) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2014.2324277 · Cited by 142
Danowitz, A., Kelley, K., Mao, J., Stevenson, J. P., & Horowitz, M. (2012) · Communications of the ACM · doi:10.1145/2133806.2133822 · Cited by 142 · cited 2×
“Single-core computational performance relentlessly improved for decades, but recently that progress has begun to slow [7].”
BackgroundFrom Point to Set: Extend the Learning of Distance Metrics
Zhu, P., Zhang, L., Zuo, W., & Zhang, D. D. (2013) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2013.331 · Cited by 134
Equivalences and Separations Between Quantum and Classical Learnability
Servedio, R. A., & Gortler, S. J. (2004) · SIAM Journal on Computing · doi:10.1137/s0097539704412910 · Cited by 121
Quantum adiabatic machine learning
Pudenz, K. L., & Lidar, D. A. (2013) · Quantum Information Processing · doi:10.1007/s11128-012-0506-4 · Cited by 115 · cited 1×
“area where quantum annealing may be useful [4, 5, 6].”
Background1 Image Set based Collaborative Representation for Face Recognition
Zhu, P., Member, S., Zuo, W., Zhang, L., Shiu, S., & Zhang, D. D. (2014) · Cited by 113
Optimal structure and parameter learning of Ising models
Lokhov, A. Y., Vuffray, M., Misra, S., & Chertkov, M. (2018) · Science Advances · doi:10.1126/sciadv.1700791 · Cited by 110 · cited 1×
“That is, we would expect D-Wave’s fifth generation chip to be capable of solving NBMF problems with more features than can be solved with the third generation chip that we have used here.”
MethodLearning Iteration-wise Generalized Shrinkage-Thresholding Operators for Blind Deconvolution
Zuo, W., Ren, D., Zhang, D., Gu, S., & Zhang, L. (2016) · IEEE Transactions on Image Processing · doi:10.1109/tip.2016.2531905 · Cited by 107
Quantum Annealing amid Local Ruggedness and Global Frustration
King, J., Yarkoni, S., Raymond, J., Ozfidan, I., King, A. D., Nevisi, M. M., Hilton, J. P., & McGeoch, C. C. (2019) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.88.061007 · Cited by 84 · cited 1×
“There is an ongoing back-and-forth regarding whether or not D-Wave’s hardware provides performance benefits over classical single-core computing [12, 13, 14, 15].”
BackgroundBenchmarking a quantum annealing processor with the time-to-target metric
King, J., Yarkoni, S., Nevisi, M. M., Hilton, J. P., & McGeoch, C. C. (2015) · arXiv · doi:10.48550/arxiv.1508.05087 · Cited by 77 · cited 1×
“The performance is compared using a cumulative time-to-targets benchmark that is a variation of the time-to-target benchmark [24].”
MethodTraining a Binary Classifier with the Quantum Adiabatic Algorithm
Neven, H., Denchev, V. S., Rose, G., & Macready, W. G. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0811.0416 · Cited by 68
Non-negative matrix factorization as a feature selection tool for maximum margin classifiers
Gupta, M. D., & Xiao, J. (2011) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2011.5995492 · Cited by 68
CPU DB: Recording Microprocessor History
Danowitz, A., Kelley, K., Mao, J., Stevenson, J. P., & Horowitz, M. (2012) · Queue · doi:10.1145/2181796.2181798 · Cited by 68
D-Wave upgrade: How scientists are using the world’s most controversial quantum computer
Gibney, E. (2017) · Nature · doi:10.1038/541447b · Cited by 60
Training a Large Scale Classifier with the Quantum Adiabatic Algorithm
Neven, H., Denchev, V. S., Rose, G., & Macready, W. G. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0912.0779 · Cited by 58
Monroe, D. (2014) · Communications of the ACM · doi:10.1145/2557446 · Cited by 47
Non-convex regularized self-representation for unsupervised feature selection
Zhu, P., Zhu, W., Wang, W., Zuo, W., & Hu, Q. (2016) · Image and Vision Computing · doi:10.1016/j.imavis.2016.11.014 · Cited by 42
ToQ.jl: A high-level programming language for D-Wave machines based on Julia
O'Malley, D., & Vesselinov, V. V. (2016) · 2016 IEEE High Performance Extreme Computing Conference (HPEC) · doi:10.1109/hpec.2016.7761616 · Cited by 39 · cited 2×
“This type of problem can be readily solved on D-Wave hardware [18], as long as the number of binary variables is small.”
BackgroundSelf-citationPartial Deconvolution With Inaccurate Blur Kernel
Ren, D., Zuo, W., Zhang, D., Xu, J., & Zhang, L. (2018) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2764261 · Cited by 37
The pitfalls of planar spin-glass benchmarks: raising the bar for quantum annealers (again)
Mandrà, S., Katzgraber, H. G., & Thomas, C. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/aa7877 · Cited by 35 · cited 1×
“We apply this method to learn the features from a set of facial images and compare the performance of the D-Wave to two classical tools.”
MethodNon-convex Regularized Self-representation for Unsupervised Feature Selection
Wang, W., Zhang, H., Zhu, P., Zhang, D. D., & Zuo, W. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-23862-3_6 · Cited by 31
Combining neighborhood separable subspaces for classification via sparsity regularized optimization
Zhu, P., Hu, Q., Han, Y., Zhang, C., & Du, Y. (2016) · Information Sciences · doi:10.1016/j.ins.2016.08.004 · Cited by 29
(2022) · Documenta Mathematica · doi:10.4171/dm · Cited by 12
Optimal structure and parameter learning of Ising modelsPreprint
Lokhov, A. Y., Vuffray, M., Misra, S., et al. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1612.05024 · Cited by 2 · cited 1×
“That is, we would expect D-Wave’s fifth generation chip to be capable of solving NBMF problems with more features than can be solved with the third generation chip that we have used here.”
Method
Research works printed but not linked: 1
- Slawski M, Hein M, Lutsik P. Matrix factorization with binary components. In: Advances in Neural Information Processing Systems; 2013. p. 3210–3218.
Cited by
A Tutorial on Formulating and Using QUBO Models
Glover, F., Kochenberger, G. A., & Du, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.11538 · Cited by 159
Quantum bridge analytics I: a tutorial on formulating and using QUBO models
Glover, F., Kochenberger, G., Hennig, R., & Du, Y. (2022) · Annals of Operations Research · doi:10.1007/s10479-022-04634-2 · Cited by 297
“A related application in O’Malley et al. (2018) investigates nonnegative/binary matrix factorization with a D-Wave quantum annealer.”
BackgroundQuantum annealing for industry applications: introduction and review
Yarkoni, S., Raponi, E., Bäck, T., & Schmitt, S. (2022) · Reports on Progress in Physics · doi:10.1088/1361-6633/ac8c54 · Cited by 341
“Here we discuss different machine learning problems that have been addressed by making use of QA: classification [127] and reinforcement learning problems [135], cluster analysis [104, 134], and matrix factorization [67, 142, 145].”
Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models
Glover, F., Kochenberger, G., & Du, Y. (2019) · 4OR · doi:10.1007/s10288-019-00424-y · Cited by 298
Efficient partition of integer optimization problems with one-hot encoding
Okada, S., Ohzeki, M., & Taguchi, S. (2019) · Scientific Reports · doi:10.1038/s41598-019-49539-6 · Cited by 190
Metadata
- Authors
- O’Malley, D., Vesselinov, V. V., Alexandrov, B. S., & Alexandrov, L. B.
- Affiliations
- Los Alamos National Laboratory (US)
- Corresponding author
- O’Malley, Daniel
- Venue
- PLOS ONE
- Publisher
- Public Library of Science (PLoS)
- Published
- 2018-12-10
- Volume
- 13
- Issue
- 12
- Pages
- e0206653
- ISSN
- 1932-6203 (ISSN-L)
- PMC
- PMC6287781
- OpenAlex
- W2605422054
- Semantic Scholar
- ef5a2a394d57f728a4833454e9936beafa0fdc1a
- Cited by
- 140
- References
- 56
- Citations by year
- 2026: 3 · 2025: 15 · 2024: 19 · 2023: 23 · 2022: 15 · 2021: 21 · 2020: 19 · 2019: 15 · 2018: 8
- FWCI
- 8.75
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- public-domain
- creativecommons.org/publicdomain/zero/1.0/ (vor)
- Locations
- PLoS ONE (publishedVersion, public-domain)
- Europe PMC (PubMed Central) (publishedVersion, public-domain)
- PubMed Central (publishedVersion, public-domain)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Los Alamos National Laboratory
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Face and Expression Recognition
- Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
- Keywords
- D-Wave quantum annealer, non-negative matrix factorization, binary matrix factorization, quantum annealing, unsupervised feature learning, low-rank approximation, facial image features, quantum machine learning
- MeSH terms
- Machine Learning, Models, Theoretical, Quantum Theory
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.