arXiv (Cornell University) · 2020 · 14 citations · 19 references
ComputingComputer SciencePhysicsComputational PhysicsQuantum ComputingQuantum MechanicsComputational Quantum MechanicsQuantum AlgorithmsQuantum AnnealingQuantum ComputationQuantum SimulationGround StatesHamiltonian Perturbation TheoryQuantum Annealing SimulationReverse Annealing
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.
19
Network Applications of Bloom Filters: A Survey
Andrei Broder, Michael Mitzenmacher · Internet Mathematics · 2004 · 2K citations · Full text
The complexity of satisfiability problems
Thomas J. Schaefer · 1978 · 1.8K citations · Full text
Experimental signature of programmable quantum annealing
Sergio Boixo, Tameem Albash, Federico M. Spedalieri et al. · Nature Communications · 2013 · 300 citations · Full text
Computing, Computer Science, Physics +12