High-quality Thermal Gibbs Sampling with Quantum Annealing Hardware
arXiv:2109.01690 · doi:10.1103/PhysRevApplied.17.044046
Abstract
Quantum Annealing (QA) was originally intended for accelerating the solution of combinatorial optimization tasks that have natural encodings as Ising models. However, recent experiments on QA hardware platforms have demonstrated that, in the operating regime corresponding to weak interactions, the QA hardware behaves like a noisy Gibbs sampler at a hardware-specific effective temperature. This work builds on those insights and identifies a class of small hardware-native Ising models that are robust to noise effects and proposes a procedure for executing these models on QA hardware to maximize Gibbs sampling performance. Experimental results indicate that the proposed protocol results in high-quality Gibbs samples from a hardware-specific effective temperature. Furthermore, we show that this effective temperature can be adjusted by modulating the annealing time and energy scale. The procedure proposed in this work provides an approach to using QA hardware for Ising model sampling presenting potential new opportunities for applications in machine learning and physics simulation.
References in corpus (42)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum Annealing in the Transverse Ising Model
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Quantum annealing with more than one hundred qubits
- Defining and detecting quantum speedup
- Bounds for the adiabatic approximation with applications to quantum computation
- Quantum Boltzmann Machine
- Observation of topological phenomena in a programmable lattice of 1,800 qubits
- Architectural considerations in the design of a superconducting quantum annealing processor
- Experimental signature of programmable quantum annealing
- Quantum Adiabatic Markovian Master Equations
- Opportunities and challenges for quantum-assisted machine learning in near-term quantum computers
- Computational Role of Multiqubit Tunneling in a Quantum Annealer
- Estimation of effective temperatures in quantum annealers for sampling applications: A case study with possible applications in deep learning
- Decoherence in adiabatic quantum computation
- Searching for quantum speedup in quasistatic quantum annealers
- Glassy Chimeras could be blind to quantum speedup: Designing better benchmarks for quantum annealing machines
- Tunable Quantum Tunneling of Magnetic Domain Walls
- Consistency Tests of Classical and Quantum Models for a Quantum Annealer
- Power of Pausing: Advancing Understanding of Thermalization in Experimental Quantum Annealers
- Quantum-Assisted Learning of Hardware-Embedded Probabilistic Graphical Models
- Adiabaticity in open quantum systems
- Best-case performance of quantum annealers on native spin-glass benchmarks: How chaos can affect success probabilities
- Adiabatic theorems for generators of contracting evolutions
- Qubit spin ice
- Next-Generation Topology of D-Wave Quantum Processors
- Benchmarking Hamiltonian Noise in the D-Wave Quantum Annealer
- Global warming: Temperature estimation in annealers
- Uncertain fate of fair sampling in quantum annealing
- Interaction Screening: Efficient and Sample-Optimal Learning of Ising Models
- Thermalization, freeze-out and noise: deciphering experimental quantum annealers
- Analog Errors in Ising Machines
- Programmable Quantum Annealers as Noisy Gibbs Samplers
- Improved Boltzmann machines with error corrected quantum annealing
- On the quasi-static evolution of nonequilibrium steady states
- Sampling on NISQ Devices: "Who's the Fairest One of All?"
- Advantages of Unfair Quantum Ground-State Sampling
- Theory of open quantum dynamics with hybrid noise
- Perils of Embedding for Sampling Problems
- Achieving fair sampling in quantum annealing
- Erratum: Glassy Chimeras Could Be Blind to Quantum Speedup. . . [Phys. Rev. X 4, 021008 (2014)]
- Ground-state statistics from annealing algorithms: Quantum vs classical approaches