Achieving fair sampling in quantum annealing
arXiv:2007.08487
Abstract
Sampling all ground states of a Hamiltonian with equal probability is a desired feature of a sampling algorithm, but recent studies indicate that common variants of transverse field quantum annealing sample the ground state subspace unfairly. In this note, we present perturbation theory arguments suggesting that this deficiency can be corrected by employing reverse annealing-inspired paths. We confirm that this conclusion holds in simulations of previously studied small instances with degeneracy, as well as larger instances on quantum annealing hardware.
5 pages, 5 figures
References in corpus (10)
- Experimental signature of programmable quantum annealing
- Consistency Tests of Classical and Quantum Models for a Quantum Annealer
- Reverse annealing for the fully connected -spin model
- A Quantum Approach to Classical Statistical Mechanics
- Dynamics of reverse annealing for the fully-connected -spin model
- Exponentially-Biased Ground-State Sampling of Quantum Annealing Machines with Transverse-Field Driving Hamiltonians
- An Elementary Proof of the Quantum Adiabatic Theorem
- Uncertain fate of fair sampling in quantum annealing
- Degeneracy, degree, and heavy tails in quantum annealing
- Advantages of Unfair Quantum Ground-State Sampling
Cited by in corpus (7)
- Polymer Physics by Quantum Computing
- High-quality Thermal Gibbs Sampling with Quantum Annealing Hardware
- Sampling on NISQ Devices: "Who's the Fairest One of All?"
- Standard quantum annealing outperforms adiabatic reverse annealing with decoherence
- Fair Sampling Error Analysis on NISQ Devices
- Posiform Planting: Generating QUBO Instances for Benchmarking
- A Note on Enumeration by Fair Sampling