Programmable Quantum Annealers as Noisy Gibbs Samplers

• URL: http://arxiv.org/abs/2012.08827v1
• Date: Wed, 16 Dec 2020 09:54:53 GMT
• Title: Programmable Quantum Annealers as Noisy Gibbs Samplers
• Authors: Marc Vuffray, Carleton Coffrin, Yaroslav A. Kharkov, Andrey Y. Lokhov
• Abstract summary: We study the sampling properties of physical realizations of quantum annealers implemented through programmable lattices of superconducting flux qubits. We show that our methodology will find widespread use in characterization of future generations of quantum annealers and other emerging analog computing devices.
• Score: 10.154836127889487
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Experimental demonstration of reconstructing quantum states with generative models [0.44600863117978684]
  We report an experimental demonstration of reconstructing quantum states based on neural network generative models with an array of programmable superconducting transmon qubits. Our results experimentally showcase the intriguing potential for exploiting machine learning techniques in validating and characterizing complex quantum devices.
  arXiv  Detail & Related papers  (2024-07-21T09:44:05Z)
• Quantum Tensor Product Decomposition from Choi State Tomography [0.0]
  We present an algorithm for unbalanced partitions into a small subsystem and a large one (the environment) to compute the tensor product decomposition of a unitary. This quantum algorithm may be used to make predictions about operator non-locality, effective open quantum dynamics on a subsystem, as well as for finding low-rank approximations and low-depth compilations of quantum circuit unitaries.
  arXiv  Detail & Related papers  (2024-02-07T16:36:47Z)
• Statistical learning on randomized data to verify quantum state k-designs [0.0]
  Random ensembles of pure states have proven to be extremely important in various aspects of quantum physics. generating a fully random ensemble is experimentally challenging but approximations are just as useful. verifying their degree of randomness can be an expensive task, similar to performing full quantum state tomography on many-body systems.
  arXiv  Detail & Related papers  (2023-05-02T14:46:28Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• On Quantum Circuits for Discrete Graphical Models [1.0965065178451106]
  We provide the first method that allows one to provably generate unbiased and independent samples from general discrete factor models. Our method is compatible with multi-body interactions and its success probability does not depend on the number of variables. Experiments with quantum simulation as well as actual quantum hardware show that our method can carry out sampling and parameter learning on quantum computers.
  arXiv  Detail & Related papers  (2022-06-01T11:03:51Z)
• Noisy Quantum Kernel Machines [58.09028887465797]
  An emerging class of quantum learning machines is that based on the paradigm of quantum kernels. We study how dissipation and decoherence affect their performance. We show that decoherence and dissipation can be seen as an implicit regularization for the quantum kernel machines.
  arXiv  Detail & Related papers  (2022-04-26T09:52:02Z)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on Quantum Computers [52.77024349608834]
  We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. We evaluate the algorithm by simulating thermal states of the transverse Ising model.
  arXiv  Detail & Related papers  (2021-03-04T18:21:00Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Noise robustness and experimental demonstration of a quantum generative adversarial network for continuous distributions [0.5249805590164901]
  We numerically simulate the noisy hybrid quantum generative adversarial networks (HQGANs) to learn continuous probability distributions. We also investigate the effect of different parameters on the training time to reduce the computational scaling of the algorithm. Our results pave the way for experimental exploration of different quantum machine learning algorithms on noisy intermediate scale quantum devices.
  arXiv  Detail & Related papers  (2020-06-02T23:14:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.