Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Joint Conference on Neural Networks (IJCNN)

2000 Qubit D-Wave Quantum Computer Replacing MCMC for RBM Image Reconstruction and Classification

Yaroslav Koshka, M. A. Novotny

Published Jul 1, 2018• 5 citations
Publisher

Abstract

Restricted Boltzmann Machines trained by the classical Contrastive Divergence algorithm were embedded into a next generation D-Wave quantum computer having more than 2000 qubits. The embedding was used to sample missing visible units and labels of incomplete test images. The previously introduced RBM embedding that combined qubits into individual RBM units in order to increase the connectivity between units was used. In comparison to the 1000 qubit machine investigated earlier, the same embedding approach applied to the 2000 qubit D-Wave enabled a connectivity between RBM units sufficient for RBM training on a classical computer with a satisfactory classification error. After a varied number of CD training iterations, the visible units corresponding to a particular incomplete test image were fixed in the D-Wave embedding. The resulting state returned by the D-Wave represents the most energetically favorable combination of the remaining qubits for the given fixed incomplete input image. The classification errors compared favorably to those obtained by the classical MCMC sampling. Main factors influencing the quality of the embedding were investigated. Regardless of the computational cost incentives for using the D-Wave for this operation, the reconstruction and classification errors determined in this way can be used at least as a verification of the validity and quality of the particular embedding of the given RBM architecture. This is essential for successfully employing a QC in much more computationally demanding parts of the RBM training. opportunities for using QC not only for recognition but especially for RBM training, in particular for obtaining a representative sample from the RBM model distribution, are discussed.

DOI
10.1109/ijcnn.2018.8489746

Related papers

Comparison of Use of a 2000 Qubit D-Wave Quantum Annealer and MCMC for Sampling, Image Reconstruction, and Classification

Yaroslav Koshka, M. A. Novotny

The next generation D-Wave quantum computer (QC) having more than 2000 qubits was demonstrated to be adequate for embedding graphs of restricted Boltzmann machines (RBMs) having the connectivity between RBM units (though still limited) already sufficient for successful training by classical algorithms. As a verification of the validity and quality of the employed embedding approach, the RBM was trained by classical contrastive divergence (CD), while the D-Wave was initially used only in the recognition step for reconstruction of incomplete test images (8 × 8 bars-and-stripes), and for their classification. The label classification errors by the D-Wave compared favorably to those obtained by classical Gibbs sampling, indicating that the QC was successfully finding the most energetically favorable combinations of the unknown visible RBM units/labels for the given fixed incomplete input image. The valid RBM embedding was further applied to investigate opportunities for using QCs in the RBM training, and specifically for replacing the classical Gibbs technique in generating a representative sample from the RBM model distribution. Statistical comparison of samples obtained by the Gibbs technique versus 10000 sample states generated from the D-Wave revealed significant differences in the observed outcomes. The D-Wave samples were found insufficiently representative of the model distribution, specifically by missing many local valley found by the Gibbs sampling. On the other hand, the D-Wave possessed an ability to find local valleys of the configuration space that were consistently missed by the classical sampling algorithms, which could potentially be very interesting for sampling applications.

IEEE Transactions on Emerging Topics in Computational Intelligence•Oct 2, 2018•16 citations

Towards Sampling from Nondirected Probabilistic Graphical models using a D-Wave Quantum Annealer

Yaroslav Koshka, M. A. Novotny

A D-Wave quantum annealer (QA) having a 2048 qubit lattice, with no missing qubits and couplings, allowed embedding of a complete graph of a Restricted Boltzmann Machine (RBM). A handwritten digit OptDigits data set having 8x7 pixels of visible units was used to train the RBM using a classical Contrastive Divergence. Embedding of the classically-trained RBM into the D-Wave lattice was used to demonstrate that the QA offers a high-efficiency alternative to the classical Markov Chain Monte Carlo (MCMC) for reconstructing missing labels of the test images as well as a generative model. At any training iteration, the D-Wave-based classification had classification error more than two times lower than MCMC. The main goal of this study was to investigate the quality of the sample from the RBM model distribution and its comparison to a classical MCMC sample. For the OptDigits dataset, the states in the D-Wave sample belonged to about two times more local valleys compared to the MCMC sample. All the lowest-energy (the highest joint probability) local minima in the MCMC sample were also found by the D-Wave. The D-Wave missed many of the higher-energy local valleys, while finding many "new" local valleys consistently missed by the MCMC. It was established that the "new" local valleys that the D-Wave finds are important for the model distribution in terms of the energy of the corresponding local minima, the width of the local valleys, and the height of the escape barrier.

arXiv:1905.00159•May 1, 2019•2 citations

Training Restricted Boltzmann Machines With a D-Wave Quantum Annealer

Vivek Dixit, Raja Selvarajan, Muhammad Ashraful Alam +2 more

Restricted Boltzmann Machine (RBM) is an energy-based, undirected graphical model. It is commonly used for unsupervised and supervised machine learning. Typically, RBM is trained using contrastive divergence (CD). However, training with CD is slow and does not estimate the exact gradient of the log-likelihood cost function. In this work, the model expectation of gradient learning for RBM has been calculated using a quantum annealer (D-Wave 2000Q), where obtaining samples is faster than Markov chain Monte Carlo (MCMC) used in CD. Training and classification results of RBM trained using quantum annealing are compared with the CD-based method. The performance of the two approaches is compared with respect to the classification accuracies, image reconstruction, and log-likelihood results. The classification accuracy results indicate comparable performances of the two methods. Image reconstruction and log-likelihood results show improved performance of the CD-based method. It is shown that the samples obtained from quantum annealer can be used to train an RBM on a 64-bit “bars and stripes” dataset with classification performance similar to an RBM trained with CD. Though training based on CD showed improved learning performance, training using a quantum annealer could be useful as it eliminates computationally expensive MCMC steps of CD.

arXiv:2005.03247•Frontiers in Physics•Jun 29, 2021•48 citations

A hybrid quantum enabled RBM advantage: convolutional autoencoders for quantum image compression and generative learning

Jennifer Sleeman, John E. Dorband, Milton Halem

Understanding how the D-Wave quantum computer could be used for machine learning problems is of growing interest. Our work explores the feasibility of using the D-Wave as a sampler for a machine learning task. We describe a hybrid method that combines a classical deep neural network autoencoder with a quantum annealing Restricted Boltzmann Machine (RBM) using the D-Wave for image generation. Our method overcomes two key limitations in the 2000-qubit D-Wave processor, namely the limited number of qubits available to accommodate typical problem sizes for fully connected quantum objective functions, and samples that are binary pixel representations. As a consequence of these limitations we are able to show how we achieved nearly a 22-fold compression factor of grayscale 28 x 28 sized images to binary 6 x 6 sized images with a lossy recovery of the original 28 x 28 grayscale images. We further show how generating samples from the D-Wave after training the RBM, resulted in 28 x 28 images that were variations of the original input data distribution, as opposed to recreating the training samples. We evaluated the quality of this method by using a downstream classification method. We formulated a MNIST classification problem using a deep convolutional neural network that used samples from the quantum RBM to train the MNIST classifier and compared the results with a MNIST classifier trained with the original MNIST training data set, as well as a MNIST classifier trained using classical RBM samples. We also explored using a secondary dataset, the MNIST Fashion dataset and demonstrate the first quantum-generated fashion. Our hybrid autoencoder approach indicates advantage for RBM results relative to the use of a current RBM classical computer implementation for image-based machine learning and even more promising results for the next generation D-Wave quantum system. Our method for compression and image mappings is not constrained to RBMs, the autoencoder part of this method could be coupled with other quantum-based algorithms.

arXiv:2001.11946•Apr 24, 2020•26 citations

Determination of the Lowest-Energy States for the Model Distribution of Trained Restricted Boltzmann Machines Using a 1000 Qubit D-Wave 2X Quantum Computer

Yaroslav Koshka, Dilina Perera, Spencer Hall +1 more

The possibility of using a quantum computer D-Wave 2X with more than 1000 qubits to determine the global minimum of the energy landscape of trained restricted Boltzmann machines is investigated. In order to overcome the problem of limited interconnectivity in the D-Wave architecture, the proposed RBM embedding combines multiple qubits to represent a particular RBM unit. The results for the lowest-energy (the ground state) and some of the higher-energy states found by the D-Wave 2X were compared with those of the classical simulated annealing (SA) algorithm. In many cases, the D-Wave machine successfully found the same RBM lowest-energy state as that found by SA. In some examples, the D-Wave machine returned a state corresponding to one of the higher-energy local minima found by SA. The inherently nonperfect embedding of the RBM into the Chimera lattice explored in this work (i.e., multiple qubits combined into a single RBM unit were found not to be guaranteed to be all aligned) and the existence of small, persistent biases in the D-Wave hardware may cause a discrepancy between the D-Wave and the SA results. In some of the investigated cases, introduction of a small bias field into the energy function or optimization of the chain-strength parameter in the D-Wave embedding successfully addressed difficulties of the particular RBM embedding. With further development of the D-Wave hardware, the approach will be suitable for much larger numbers of RBM units.

Neural Computation•May 31, 2017•15 citations

Empirical investigation of the low temperature energy function of the Restricted Boltzmann Machine using a 1000 qubit D-Wave 2X

Yaroslav Koshka, Dilina Perera, Spencer Hall +1 more

D-Wave 2X with more than 1000 qubits was applied to the relatively rugged energy landscape of trained Restricted Boltzmann Machines (RBMs). The D-Wave machine has a Chimera interconnect architecture. A native RBM restricted to the Chimera graph was found difficult to train for large number of RBM units. To overcome this difficulty, a RBM embedding that combined qubits in order to significantly increase the connectivity between hidden and visible units of the RBM was investigated. The results for the lowest-energy and some of the higher-energy states found by D-Wave 2X were compared with those of the classical simulated annealing (SA) algorithm. In many cases, the D-Wave machine successfully found the same RBM lowest energy state as that found by SA. In the relatively simple cases of training patterns investigated in this work, the lowest energy state also corresponded to one of the training patterns. Sometimes the D-Wave machine returned a state corresponding to one of the higher energy states found by SA. The inherently non-perfect embedding of the RBM into the Chimera lattice used in this work (i.e., multiple qubits combined into a single RBM unit were not guaranteed to have perfectly aligned qubits) and the existence of small bias fields in the D-Wave hardware were found to be responsible for the discrepancy in the D-Wave and the SA results. In some but not all of the investigated cases, introduction of a small bias field into the energy function or optimization of the chain-strength parameter in the D-Wave embedding successfully addressed difficulties of the particular RBM embedding.

International Joint Conference on Neural Networks (IJCNN)•Jul 1, 2016•8 citations
Restricted Boltzmann Machines trained by the classical Contrastive Divergence algorithm were embedded into a next generation D-Wave quantum computer having more than 2000 qubits. The embedding was used to sample missing visible units and labels of incomplete test images. The previously introduced RBM embedding that combined qubits into individual RBM units in order to increase the connectivity between units was used. In comparison to the 1000 qubit machine investigated earlier, the same embedding approach applied to the 2000 qubit D-Wave enabled a connectivity between RBM units sufficient for RBM training on a classical computer with a satisfactory classification error. After a varied number of CD training iterations, the visible units corresponding to a particular incomplete test image were fixed in the D-Wave embedding. The resulting state returned by the D-Wave represents the most energetically favorable combination of the remaining qubits for the given fixed incomplete input image. The classification errors compared favorably to those obtained by the classical MCMC sampling. Main factors influencing the quality of the embedding were investigated. Regardless of the computational cost incentives for using the D-Wave for this operation, the reconstruction and classification errors determined in this way can be used at least as a verification of the validity and quality of the particular embedding of the given RBM architecture. This is essential for successfully employing a QC in much more computationally demanding parts of the RBM training. opportunities for using QC not only for recognition but especially for RBM training, in particular for obtaining a representative sample from the RBM model distribution, are discussed.
The next generation D-Wave quantum computer (QC) having more than 2000 qubits was demonstrated to be adequate for embedding graphs of restricted Boltzmann machines (RBMs) having the connectivity between RBM units (though still limited) already sufficient for successful training by classical algorithms. As a verification of the validity and quality of the employed embedding approach, the RBM was trained by classical contrastive divergence (CD), while the D-Wave was initially used only in the recognition step for reconstruction of incomplete test images (8 × 8 bars-and-stripes), and for their classification. The label classification errors by the D-Wave compared favorably to those obtained by classical Gibbs sampling, indicating that the QC was successfully finding the most energetically favorable combinations of the unknown visible RBM units/labels for the given fixed incomplete input image. The valid RBM embedding was further applied to investigate opportunities for using QCs in the RBM training, and specifically for replacing the classical Gibbs technique in generating a representative sample from the RBM model distribution. Statistical comparison of samples obtained by the Gibbs technique versus 10000 sample states generated from the D-Wave revealed significant differences in the observed outcomes. The D-Wave samples were found insufficiently representative of the model distribution, specifically by missing many local valley found by the Gibbs sampling. On the other hand, the D-Wave possessed an ability to find local valleys of the configuration space that were consistently missed by the classical sampling algorithms, which could potentially be very interesting for sampling applications.
A D-Wave quantum annealer (QA) having a 2048 qubit lattice, with no missing qubits and couplings, allowed embedding of a complete graph of a Restricted Boltzmann Machine (RBM). A handwritten digit OptDigits data set having 8x7 pixels of visible units was used to train the RBM using a classical Contrastive Divergence. Embedding of the classically-trained RBM into the D-Wave lattice was used to demonstrate that the QA offers a high-efficiency alternative to the classical Markov Chain Monte Carlo (MCMC) for reconstructing missing labels of the test images as well as a generative model. At any training iteration, the D-Wave-based classification had classification error more than two times lower than MCMC. The main goal of this study was to investigate the quality of the sample from the RBM model distribution and its comparison to a classical MCMC sample. For the OptDigits dataset, the states in the D-Wave sample belonged to about two times more local valleys compared to the MCMC sample. All the lowest-energy (the highest joint probability) local minima in the MCMC sample were also found by the D-Wave. The D-Wave missed many of the higher-energy local valleys, while finding many "new" local valleys consistently missed by the MCMC. It was established that the "new" local valleys that the D-Wave finds are important for the model distribution in terms of the energy of the corresponding local minima, the width of the local valleys, and the height of the escape barrier.
Restricted Boltzmann Machine (RBM) is an energy-based, undirected graphical model. It is commonly used for unsupervised and supervised machine learning. Typically, RBM is trained using contrastive divergence (CD). However, training with CD is slow and does not estimate the exact gradient of the log-likelihood cost function. In this work, the model expectation of gradient learning for RBM has been calculated using a quantum annealer (D-Wave 2000Q), where obtaining samples is faster than Markov chain Monte Carlo (MCMC) used in CD. Training and classification results of RBM trained using quantum annealing are compared with the CD-based method. The performance of the two approaches is compared with respect to the classification accuracies, image reconstruction, and log-likelihood results. The classification accuracy results indicate comparable performances of the two methods. Image reconstruction and log-likelihood results show improved performance of the CD-based method. It is shown that the samples obtained from quantum annealer can be used to train an RBM on a 64-bit “bars and stripes” dataset with classification performance similar to an RBM trained with CD. Though training based on CD showed improved learning performance, training using a quantum annealer could be useful as it eliminates computationally expensive MCMC steps of CD.
Understanding how the D-Wave quantum computer could be used for machine learning problems is of growing interest. Our work explores the feasibility of using the D-Wave as a sampler for a machine learning task. We describe a hybrid method that combines a classical deep neural network autoencoder with a quantum annealing Restricted Boltzmann Machine (RBM) using the D-Wave for image generation. Our method overcomes two key limitations in the 2000-qubit D-Wave processor, namely the limited number of qubits available to accommodate typical problem sizes for fully connected quantum objective functions, and samples that are binary pixel representations. As a consequence of these limitations we are able to show how we achieved nearly a 22-fold compression factor of grayscale 28 x 28 sized images to binary 6 x 6 sized images with a lossy recovery of the original 28 x 28 grayscale images. We further show how generating samples from the D-Wave after training the RBM, resulted in 28 x 28 images that were variations of the original input data distribution, as opposed to recreating the training samples. We evaluated the quality of this method by using a downstream classification method. We formulated a MNIST classification problem using a deep convolutional neural network that used samples from the quantum RBM to train the MNIST classifier and compared the results with a MNIST classifier trained with the original MNIST training data set, as well as a MNIST classifier trained using classical RBM samples. We also explored using a secondary dataset, the MNIST Fashion dataset and demonstrate the first quantum-generated fashion. Our hybrid autoencoder approach indicates advantage for RBM results relative to the use of a current RBM classical computer implementation for image-based machine learning and even more promising results for the next generation D-Wave quantum system. Our method for compression and image mappings is not constrained to RBMs, the autoencoder part of this method could be coupled with other quantum-based algorithms.
The possibility of using a quantum computer D-Wave 2X with more than 1000 qubits to determine the global minimum of the energy landscape of trained restricted Boltzmann machines is investigated. In order to overcome the problem of limited interconnectivity in the D-Wave architecture, the proposed RBM embedding combines multiple qubits to represent a particular RBM unit. The results for the lowest-energy (the ground state) and some of the higher-energy states found by the D-Wave 2X were compared with those of the classical simulated annealing (SA) algorithm. In many cases, the D-Wave machine successfully found the same RBM lowest-energy state as that found by SA. In some examples, the D-Wave machine returned a state corresponding to one of the higher-energy local minima found by SA. The inherently nonperfect embedding of the RBM into the Chimera lattice explored in this work (i.e., multiple qubits combined into a single RBM unit were found not to be guaranteed to be all aligned) and the existence of small, persistent biases in the D-Wave hardware may cause a discrepancy between the D-Wave and the SA results. In some of the investigated cases, introduction of a small bias field into the energy function or optimization of the chain-strength parameter in the D-Wave embedding successfully addressed difficulties of the particular RBM embedding. With further development of the D-Wave hardware, the approach will be suitable for much larger numbers of RBM units.
D-Wave 2X with more than 1000 qubits was applied to the relatively rugged energy landscape of trained Restricted Boltzmann Machines (RBMs). The D-Wave machine has a Chimera interconnect architecture. A native RBM restricted to the Chimera graph was found difficult to train for large number of RBM units. To overcome this difficulty, a RBM embedding that combined qubits in order to significantly increase the connectivity between hidden and visible units of the RBM was investigated. The results for the lowest-energy and some of the higher-energy states found by D-Wave 2X were compared with those of the classical simulated annealing (SA) algorithm. In many cases, the D-Wave machine successfully found the same RBM lowest energy state as that found by SA. In the relatively simple cases of training patterns investigated in this work, the lowest energy state also corresponded to one of the training patterns. Sometimes the D-Wave machine returned a state corresponding to one of the higher energy states found by SA. The inherently non-perfect embedding of the RBM into the Chimera lattice used in this work (i.e., multiple qubits combined into a single RBM unit were not guaranteed to have perfectly aligned qubits) and the existence of small bias fields in the D-Wave hardware were found to be responsible for the discrepancy in the D-Wave and the SA results. In some but not all of the investigated cases, introduction of a small bias field into the energy function or optimization of the chain-strength parameter in the D-Wave embedding successfully addressed difficulties of the particular RBM embedding.