Biclustering with a quantum annealer

DOI10.1007/s00500-018-3034-zzbMath1398.81049OpenAlexW2790067285MaRDI QIDQ1800360

Riccardo Mengoni, Lorenzo Bottarelli, Alessandro Farinelli, Manuele Bicego, Matteo Denitto, Alessandra Di Pierro

Publication date: 23 October 2018

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-018-3034-z

zbMATH Keywords

quantum annealingbiclusteringD-wave

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items (1)

Quantum error-correcting output codes

Uses Software

• apcluster
• APCluster
• BiMine+
• BicPAM
• Bsig

Cites Work

• Clustering by Passing Messages Between Data Points
• Fast clique minor generation in Chimera qubit connectivity graphs
• The unconstrained binary quadratic programming problem: a survey
• Bsig: evaluating the statistical significance of biclustering solutions
• A case study in programming a quantum annealer for hard operational planning problems
• A biclustering approach based on factor graphs and the max-sum algorithm
• Optimization using quantum mechanics: quantum annealing through adiabatic evolution

This page was built for publication: Biclustering with a quantum annealer