Quick Navigation

Topics

Quantum Optimization Quantum Machine Learning

Reverse Annealing for Nonnegative/Binary Matrix Factorization

arXiv
Authors: John Golden, Daniel O'Malley

Year

2020

Paper ID

22318

Status

Preprint

Abstract Read

~2 min

Abstract Words

100

Citations

N/A

Abstract

It was recently shown that quantum annealing can be used as an effective, fast subroutine in certain types of matrix factorization algorithms. The quantum annealing algorithm performed best for quick, approximate answers, but performance rapidly plateaued. In this paper, we utilize reverse annealing instead of forward annealing in the quantum annealing subroutine for nonnegative/binary matrix factorization problems. After an initial global search with forward annealing, reverse annealing performs a series of local searches that refine existing solutions. The combination of forward and reverse annealing significantly improves performance compared to forward annealing alone for all but the shortest run times.

Why This Paper Matters

  • This paper contributes to the Quantum Machine Learning research area in the Quantum Articles archive.
  • It adds a 2020 reference point for readers tracking recent quantum research.
  • It was recently shown that quantum annealing can be used as an effective, fast subroutine in certain types of matrix factorization algorithms.

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #22318 #78828 Verifiable Sampling for Delegat... #78813 Large-Scale Benchmarking of Qua... #78775 On linearity or non-linearity i...

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.