paper-with-me

홈 › Papers

Programmable Quantum Annealers as Noisy Gibbs Samplers

2020-12-16 · Marc Vuffray, Carleton Coffrin, Yaroslav A. Kharkov, Andrey Y. Lokhov

Drawing independent samples from high-dimensional probability distributions represents the major computational bottleneck for modern algorithms, including powerful machine learning frameworks such as deep learning. The quest for discovering larger families of distributions for which sampling can be efficiently realized has inspired an exploration beyond established computing methods and turning to novel physical devices that leverage the principles of quantum computation. Quantum annealing embodies a promising computational paradigm that is intimately related to the complexity of energy landscapes in Gibbs distributions, which relate the probabilities of system states to the energies of these states. Here, we study the sampling properties of physical realizations of quantum annealers which are implemented through programmable lattices of superconducting flux qubits. Comprehensive statistical analysis of the data produced by these quantum machines shows that quantum annealers behave as samplers that generate independent configurations from low-temperature noisy Gibbs distributions. We show that the structure of the output distribution probes the intrinsic physical properties of the quantum device such as effective temperature of individual qubits and magnitude of local qubit noise, which result in a non-linear response function and spurious interactions that are absent in the hardware implementation. We anticipate that our methodology will find widespread use in characterization of future generations of quantum annealers and other emerging analog computing devices.

📄 PDF Abstract BibTeX arXiv:2012.08827

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

A Path Towards Quantum Advantage in Training Deep Generative Models with Quantum Annealers

2019-12-04 · Walter Vinci, Lorenzo Buffoni, Hossein Sadeghi, Amir Khoshaman 외

The development of quantum-classical hybrid (QCH) algorithms is critical to achieve state-of-the-art computational models. A QCH variational autoencoder (QVAE) was introduced in Ref. [1] by some of the authors of this pa…

Quantum-Assisted Learning of Hardware-Embedded Probabilistic Graphical Models

2016-09-08 · Marcello Benedetti, John Realpe-Gómez, Rupak Biswas, Alejandro Perdomo-Ortiz

Mainstream machine-learning techniques such as deep learning and probabilistic programming rely heavily on sampling from generally intractable probability distributions. There is increasing interest in the potential adva…

BenchmarkingBIG-bench Machine LearningProbabilistic Programming

Boosting the Performance of Quantum Annealers using Machine Learning

2022-03-04 · Jure Brence, Dragan Mihailović, Viktor Kabanov, Ljupčo Todorovski 외

Noisy intermediate-scale quantum (NISQ) devices are spearheading the second quantum revolution. Of these, quantum annealers are the only ones currently offering real world, commercial applications on as many as 5000 qubi…

BIG-bench Machine Learning

Learning Proposals for Probabilistic Programs with Inference Combinators

2021-03-01 · Sam Stites, Heiko Zimmermann, Hao Wu, Eli Sennesh 외

We develop operators for construction of proposals in probabilistic programs, which we refer to as inference combinators. Inference combinators define a grammar over importance samplers that compose primitive operations …

Quantum Image Denoising: A Framework via Boltzmann Machines, QUBO, and Quantum Annealing

2023-07-13 · Phillip Kerger, Ryoji Miyazaki

We investigate a framework for binary image denoising via restricted Boltzmann machines (RBMs) that introduces a denoising objective in quadratic unconstrained binary optimization (QUBO) form and is well-suited for quant…

DenoisingImage Denoising