Back to News
quantum-computing

Non-Negative Matrix Factorization Using Non-Von Neumann Computers

Ajinkya Borle, Charles Nicholas, Uchenna Chukwu, Mohammad-Ali Miri, Nicholas Chancellor
Loading...
4 min read
0 likes
⚡ Quantum Brief
Researchers demonstrated non-von Neumann computing’s potential for solving NP-hard non-negative matrix factorization (NMF), a key unsupervised learning problem, using Quantum Computing Inc.’s entropy-based Dirac-3 device. The team developed two formulations: a QUBO model for Ising machines and a quartic model for real-valued/integer variables, tailored to Dirac-3’s architecture, though current hardware limits problem size. Hybrid experiments showed Dirac-3’s results, when fed into Scikit-learn’s NMF, reduced reconstruction errors for non-negative real matrices compared to Scikit-learn alone using default parameters. For non-negative integer matrices, Dirac-3 outperformed Google’s CP-SAT solver in most serial-processing cases, suggesting advantages for specific problem variants and domains. The study concludes entropy computing could offer future advantages for NMF, warranting further research into non-von Neumann architectures for optimization challenges.
AI Audio Summary
0:00 / 0:00
Click to play
Generate images of quantum computing to be used as banner image for articles (3).jpg
Quantum News · Media Library

Quantum Physics arXiv:2512.00675 (quant-ph) [Submitted on 30 Nov 2025] Title:Non-Negative Matrix Factorization Using Non-Von Neumann Computers Authors:Ajinkya Borle, Charles Nicholas, Uchenna Chukwu, Mohammad-Ali Miri, Nicholas Chancellor View a PDF of the paper titled Non-Negative Matrix Factorization Using Non-Von Neumann Computers, by Ajinkya Borle and 4 other authors View PDF HTML (experimental) Abstract:Non-negative matrix factorization (NMF) is a matrix decomposition problem with applications in unsupervised learning. The general form of this problem (along with many of its variants) is NP-hard in nature. In our work, we explore how this problem could be solved with an energy-based optimization method suitable for certain machines with non-von Neumann architectures. We used the Dirac-3, a device based on the entropy computing paradigm and made by Quantum Computing Inc., to evaluate our approach. Our formulations consist of (i) a quadratic unconstrained binary optimization model (QUBO, suitable for Ising machines) and a quartic formulation that allows for real-valued and integer variables (suitable for machines like the Dirac-3). Although current devices cannot solve large NMF problems, the results of our preliminary experiments are promising enough to warrant further research. For non-negative real matrices, we observed that a fusion approach of first using Dirac-3 and then feeding its results as the initial factor matrices to Scikit-learn's NMF procedure outperforms Scikit-learn's NMF procedure on its own, with default parameters in terms of the error in the reconstructed matrices. For our experiments on non-negative integer matrices, we compared the Dirac-3 device to Google's CP-SAT solver (inside the Or-Tools package) and found that for serial processing, Dirac-3 outperforms CP-SAT in a majority of the cases. We believe that future work in this area might be able to identify domains and variants of the problem where entropy computing (and other non-von Neumann architectures) could offer a clear advantage. Comments: Subjects: Quantum Physics (quant-ph); Emerging Technologies (cs.ET); Machine Learning (cs.LG) Cite as: arXiv:2512.00675 [quant-ph] (or arXiv:2512.00675v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2512.00675 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Ajinkya Borle [view email] [v1] Sun, 30 Nov 2025 00:08:47 UTC (121 KB) Full-text links: Access Paper: View a PDF of the paper titled Non-Negative Matrix Factorization Using Non-Von Neumann Computers, by Ajinkya Borle and 4 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2025-12 Change to browse by: cs cs.ET cs.LG References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

energy-climate
quantum-computing

Source Information

Source: arXiv Quantum Physics

Discussion

0 professional contributions

Sign in to join this professional discussion.

Be the first to add a constructive contribution.