DOE OSTI · 2310313
Tucker-1 Boolean Tensor Factorization with Quantum Annealers
Abstract
Quantum annealers are an emerging computational architecture that have the potential to address some challenging computational issues that will be left unresolved as we approach the end of the Moore's Law era of computing. D-Wave quantum annealers are designed to solve a challenging set of problems - quadratic unconstrained binary optimization problems. This makes them a natural fit for solving problems with binary or Boolean variables. Here, we explore the use of a quantum annealer to solve Boolean tensor factorization. The goal of Boolean tensor factorization is to represent a high-dimensional tensor filled with Boolean values as a product of Boolean matrices and a Boolean core tensor. We show that a particular Boolean tensor factorization problem (called Tucker-1 factorization) can be decomposed into a sequence of quadratic unconstrained binary optimization problems that can be solved with a D-Wave 2000Q quantum annealer. While quantum annealers specifically and quantum computers in general are at a fairly early stage in their development, they are currently capable of solving these Boolean tensor factorization problems. Importantly, our results show that for fairly small tensors, we are frequently able to obtain an accurate (sometimes exact) factorization using quantum annealing.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
O'Malley, Daniel, Djidjev, Hristo Nikolov, Alexandrov, Boian S.. 2020-12-01. Tucker-1 Boolean Tensor Factorization with Quantum Annealers. https://doi.org/10.1109/icrc2020.2020.00002. https://searchnasa.com/record/osti%3A2310313/tucker-1-boolean-tensor-factorization-with-quantum-annealers
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.