Quantum Boltzmann Machines using Parallel Annealing for Medical Image Classification

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Schuman, Daniëlle, Seebode, Mark V., Rohe, Tobias, Mansky, Maximilian Balthasar, Schroedl-Baumann, Michael, Stein, Jonas, Linnhoff-Popien, Claudia, Krellner, Florian
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915416111054848
author Schuman, Daniëlle
Seebode, Mark V.
Rohe, Tobias
Mansky, Maximilian Balthasar
Schroedl-Baumann, Michael
Stein, Jonas
Linnhoff-Popien, Claudia
Krellner, Florian
author_facet Schuman, Daniëlle
Seebode, Mark V.
Rohe, Tobias
Mansky, Maximilian Balthasar
Schroedl-Baumann, Michael
Stein, Jonas
Linnhoff-Popien, Claudia
Krellner, Florian
contents Exploiting the fact that samples drawn from a quantum annealer inherently follow a Boltzmann-like distribution, annealing-based Quantum Boltzmann Machines (QBMs) have gained increasing popularity in the quantum research community. While they harbor great promises for quantum speed-up, their usage currently stays a costly endeavor, as large amounts of QPU time are required to train them. This limits their applicability in the NISQ era. Following the idea of Noè et al. (2024), who tried to alleviate this cost by incorporating parallel quantum annealing into their unsupervised training of QBMs, this paper presents an improved version of parallel quantum annealing that we employ to train QBMs in a supervised setting. Saving qubits to encode the inputs, the latter setting allows us to test our approach on medical images from the MedMNIST data set (Yang et al., 2023), thereby moving closer to real-world applicability of the technology. Our experiments show that QBMs using our approach already achieve reasonable results, comparable to those of similarly-sized Convolutional Neural Networks (CNNs), with markedly smaller numbers of epochs than these classical models. Our parallel annealing technique leads to a speed-up of almost 70 % compared to regular annealing-based BM executions.
format Preprint
id arxiv_https___arxiv_org_abs_2507_14116
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Quantum Boltzmann Machines using Parallel Annealing for Medical Image Classification
Schuman, Daniëlle
Seebode, Mark V.
Rohe, Tobias
Mansky, Maximilian Balthasar
Schroedl-Baumann, Michael
Stein, Jonas
Linnhoff-Popien, Claudia
Krellner, Florian
Quantum Physics
Emerging Technologies
Machine Learning
Exploiting the fact that samples drawn from a quantum annealer inherently follow a Boltzmann-like distribution, annealing-based Quantum Boltzmann Machines (QBMs) have gained increasing popularity in the quantum research community. While they harbor great promises for quantum speed-up, their usage currently stays a costly endeavor, as large amounts of QPU time are required to train them. This limits their applicability in the NISQ era. Following the idea of Noè et al. (2024), who tried to alleviate this cost by incorporating parallel quantum annealing into their unsupervised training of QBMs, this paper presents an improved version of parallel quantum annealing that we employ to train QBMs in a supervised setting. Saving qubits to encode the inputs, the latter setting allows us to test our approach on medical images from the MedMNIST data set (Yang et al., 2023), thereby moving closer to real-world applicability of the technology. Our experiments show that QBMs using our approach already achieve reasonable results, comparable to those of similarly-sized Convolutional Neural Networks (CNNs), with markedly smaller numbers of epochs than these classical models. Our parallel annealing technique leads to a speed-up of almost 70 % compared to regular annealing-based BM executions.
title Quantum Boltzmann Machines using Parallel Annealing for Medical Image Classification
topic Quantum Physics
Emerging Technologies
Machine Learning
url https://arxiv.org/abs/2507.14116