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.”
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
Items 101–149 of 149
Homomorphic Encryption for Quantum Annealing with Spin Reversal Transformations
O’Malley, D., & Golden, J. K. (2020) · IEEE High Performance Extreme Computing Conference · doi:10.1109/hpec43674.2020.9286176 · Cited by 3
“The nonnegative/binary matrix factorization problem was introduced in [15].”
BackgroundMethodSelf-citationBoolean Hierarchical Tucker Networks on Quantum Annealers
Pelofske, E., Hahn, G., O’Malley, D., Djidjev, H. N., & Alexandrov, B. S. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-97549-4_40 · Cited by 3
Self-citationKuramata, M., Katsuki, R., & Nakata, K. (2022) · PLoS ONE · doi:10.1371/journal.pone.0266846 · Cited by 3
“However, researchers struggle to find practical combinatorial optimization problems, for which quantum annealers outperform other mathematical optimization solvers [9, 11].”
BackgroundCloning and Beyond: A Quantum Solution to Duplicate Code
Jhaveri, S., Krone-Martins, A., & Lopes, C. V. (2023) · ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software (Onward!) · doi:10.1145/3622758.3622889 · Cited by 7
“Researchers have successfully reformulated various problems as QUBO or QUDO equations for quantum annealers to solve for both research and commercial applications [see 13, 39, 59].”
MethodComparing Adiabatic Quantum Computers for satellite images feature extraction
Rocutto, L., Maronese, M., Dragoni, D., Cavalli, A., & Cavazzoni, C. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.04.027 · Cited by 3
Basics and Applications of Quantum Annealing
Tanaka, S., TANAHASHI, K., Motohashi, T., & Takayanagi, S. (2018) · TEION KOGAKU (Journal of Cryogenics and Superconductivity Society of Japan) · doi:10.2221/jcsj.53.287 · Cited by 3
Tucker-1 Boolean Tensor Factorization with Quantum Annealers
O’Malley, D., Djidjev, H. N., & Alexandrov, B. S. (2020) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc2020.2020.00002 · Cited by 5
“Here based on previous work [30], we present an approach to performing Boolean Tucker decomposition that is implemented on a quantum annealer.”
MethodInfluentialSelf-citationA Solution Scheme Based on Quantum Enhancement for Multi Classification Problems
Zhang, Y., Mu, X., Zhang, P., & Zhao, D. (2022) · Neurocomputing · doi:10.1016/j.neucom.2023.127106 · Cited by 2
Quantum annealing for ICT system design automation
Kuroda, T., Kuwahara, T., Yonaga, K., Osaki, T., Miyama, M. J., & Ohzeki, M. (2021) · IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid) · doi:10.1109/ccgrid51090.2021.00025 · Cited by 2
Relaxation-assisted reverse annealing on nonnegative/binary matrix factorization
Haba, R., Ohzeki, M., & Tanaka, K. (2025) · PLoS ONE · doi:10.1371/journal.pone.0323232 · Cited by 3
“In the literature, quantum annealing has been proposed as a heuristic solver for NBMF [24,28].”
Quantum annealing-based feature selection
Pranjić, D., Mummaneni, B. C., & Tutschku, C. (2025) · Neurocomputing · doi:10.1016/j.neucom.2025.131673 · Cited by 2
Computing a Sparse Approximate Inverse on Quantum Annealing MachinesPreprint
Suresh, S., & Suresh, K. (2023) · Research Square · doi:10.21203/rs.3.rs-3408766/v1 · Cited by 2
Turati, G., Foderà, S., Nembrini, R., Dacrema, M. F., & Cremonesi, P. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2507.16001 · Cited by 2
Efficient Construction of Feasible Solutions in Column Generation Using Quantum Annealing
Takabayashi, T., Maruyama, N., Yoshihara, T., Haba, R., & Ohzeki, M. (2025) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.94.094005 · Cited by 2
Demonstration of a compatibility-based childcare support service using quantum annealing
Matsumoto, Y., Takabayashi, T., Sato, R., Honda, R., & Ohzeki, M. (2026) · Scientific Reports · doi:10.1038/s41598-026-60894-z · Cited by 1
Construction of SubQUBOs by K-Means Clustering of QUBO Variables
Kamishima, Y., Kikuchi, S., & Tanaka, S. (2025) · IEEE Access · doi:10.1109/access.2025.3638373 · Cited by 2
“…[17], [18], [19], [20], portfolio optimization [21], [22], [23], machine The associate editor coordinating the review of this manuscript and approving it for publication was Shih-Wei Lin . learning [24], [25], [26], quantum compilers [27], and black-box optimization [28], [29], [30], [31], [32].”
Computing a Sparse Approximate Inverse on Quantum Annealing Machines
Suresh, S., & Suresh, K. (2025) · Journal of Computing and Information Science in Engineering · doi:10.1115/1.4070578 · Cited by 2
Statistical Mechanics Calculations Using Variational Autoregressive Networks and Quantum Annealing
Tamura, Y., & Ohzeki, M. (2026) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.95.024001 · Cited by 1
Non-negative Tensor Factorization for Robust Exploratory Big-Data Analytics
Los Alamos National Lab. (LANL), L. A., Alexandrov, B. S., USDOE, Vesselinov, V. V., & Djidjev, H. N. (2018) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/1417803 · Cited by 1
Self-citationAdiabatic Quantum Graph Matching with Permutation Matrix ConstraintsPreprint
Benkner, M. S., Golyanik, V., Theobalt, C., & Moeller, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.04032 · Cited by 2
“Classificationrelated problems were addressed in [15], to enhance the detection of vegetation zones in aerial images on D-Wave, in [51] to learn facial features and reproduce facial image collections, and in [49] which proposes a dictionary learning method for image classification.”
BackgroundGraph Theoretic Algorithms Adaptable to Quantum Computing
Srivastava, S. (2021) · Deep Blue (University of Michigan) · doi:10.7302/1543 · Cited by 1
Machine learning and data mining
Giardina, C. R. (2024) · Elsevier eBooks · doi:10.1016/b978-0-443-13697-9.00016-3 · Cited by 1
Zaiou, A. (2022) · theses.fr (ABES) · doi:10.70675/72d6811bzbf86z4920z88c7zc2de09bcd42f · Cited by 5
Solving Non-identifiable Latent Feature ModelsPreprint
Suzuki, R., Takahashi, S., Petladwala, M., & Kohmoto, S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1809.03776
“Algorithm 2 has a lower bound on its optimality for typical linear-Gaussian LFMs in a limit of β → ∞ because it becomes greedy local search algorithm for submodular maximization on a matroid constraint.”
BackgroundInfluentialCaracterização da evolução adiabática em cadeias de spin
Grajales, J. A. V. (2018) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/t.76.2018.tde-05062018-151545
Recent Progress of Ising Machines and Related Technology
Tanaka, S., & Matsuda, Y. (2020) · Vacuum and Surface Science · doi:10.1380/vss.63.96
Benchmarks and Controls for Optimization with Quantum Annealing
Grant, E. (2020) · Cited by 2
Basics and Applications of Quantum Annealing
Tanaka, S. (2018) · Journal of Japan Society for Fuzzy Theory and Intelligent Informatics · doi:10.3156/jsoft.30.1_42
Report on scipost_202106_00008v2
Borle, A., Elfving, V. E., & Lomonaco, S. J. (2021) · SciPost Physics Core · doi:10.21468/scipost.report.3619
“Other works in this domain were for solving specific NMF problems [15], [16], polynomial system of equations [20], underdetermined binary linear systems [17] and polynomial least squares [22].”
InfluentialReport on scipost_202106_00008v1
Borle, A., Elfving, V. E., & Lomonaco, S. J. (2021) · SciPost Physics Core · doi:10.21468/scipost.report.3307
Report on scipost_202106_00008v1
Borle, A., Elfving, V. E., & Lomonaco, S. J. (2021) · SciPost Physics Core · doi:10.21468/scipost.report.3409
Goodarzi, S., Rezakhani, A., & Maleki, M. (2023) · Journal of Information Systems and Telecommunication (JIST) · doi:10.52547/jist.33142.11.42.135
(2023) · Nonlinear processes in geophysics · doi:10.5194/npg-2023-16-cc1
(2023) · Nonlinear processes in geophysics · doi:10.5194/npg-2023-16-rc1
(2023) · Nonlinear processes in geophysics · doi:10.5194/npg-2023-16-rc2
Kotsuki, S. (2024) · Nonlinear processes in geophysics · doi:10.5194/npg-2023-16-ac1
Kotsuki, S. (2024) · Nonlinear processes in geophysics · doi:10.5194/npg-2023-16-ac2
Kotsuki, S. (2024) · Nonlinear processes in geophysics · doi:10.5194/npg-2023-16-ac3
Quantum annealing and adiabatic quantum computing
Giardina, C. R. (2024) · Elsevier eBooks · doi:10.1016/b978-0-443-13697-9.00021-7
Konoshima, M., Tamura, H., & Kabashima, Y. (2024) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.93.044002
Experience with quantum annealing computation
(2024) · Frontiers research topics · doi:10.3389/978-2-8325-5436-4
Tsuyuki, T., Kawasaki, F., & Kotsuki, S. (2025) · Journal of the Meteorological Society of Japan Ser II · doi:10.2151/jmsj.2025-032
“…in 2011 (Johnson et al. 2011), quantum annealing research has progressed rapidly, with applications in graph partitioning (Ushijima-Mwesigwa et al. 2017), clustering (O’Malley et al. 2018), machine learning (Hu et al. 2019; Willsch et al. 2020), and model predictive control (Inoue et al. 2020).”
Binary Quadratic Quantization: Beyond First-Order Quantization for Real-Valued Matrix Compression
Kuroki, K., Okoshi, Y., Chu, T. V., Kawamura, K., & Motomura, M. (2025) · neural information processing systems · doi:10.52202/085713-5283
Non-Negative Matrix Factorization Using Non-Von Neumann ComputersPreprint
Borle, A., Nicholas, C., Chukwu, U., Miri, M., & Chancellor, N. (2025) · arXiv (Cornell University) · doi:10.13016/m2ibt2-2zuo
Audio Source Separation via Nonnegative Binary Matrix Factorization Using D-Wave Quantum Annealer
Sasajima, T., Koshikawa, A. S., & Ohzeki, M. (2026) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.95.064006
Compression-Driven Anomaly Detection in Brain MRI Using an Interpretable Quantum AutoencoderPreprint
Ganguly, S., Liang, X., & Makris, D. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2606.27411
Sampei, H. (2026) · Institutional Repositories DataBase (IRDB) · doi:10.20556/0002008370
ChainForge: Characterizing Embedding as the Bottleneck in Quantum Annealer Workloads
Jayathilake, K., Brumley, C., Smith, T., & Ayanzadeh, R. (2026) · IEEE International Symposium on Workload Characterization · doi:10.1109/iiswc71020.2026.00053
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.