Simulated-quantum-annealing comparison between all-to-all connectivity schemes

Abstract

Quantum annealing aims to exploit quantum mechanics to speed up the search for the solution to optimization problems. Most problems exhibit complete connectivity between the logical spin variables after they are mapped to the Ising spin Hamiltonian of quantum annealing. To account for hardware constraints of current and future physical quantum annealers, methods enabling the embedding of fully connected graphs of logical spins into a constant-degree graph of physical spins are therefore essential. Here, we compare the recently proposed embedding scheme for quantum annealing with all-to-all connectivity due to Lechner, Hauke and Zoller (LHZ) [Science Advances 1 (2015)] to the commonly used minor embedding (ME) scheme. Using both simulated quantum annealing and parallel tempering simulations, we find that for a set of instances randomly chosen from a class of fully connected, random Ising problems, the ME scheme outperforms the LHZ scheme when using identical simulation parameters, despite the fault tolerance of the latter to weakly correlated spin-flip noise. This result persists even after we introduce several decoding strategies for the LHZ scheme, including a minimumweight decoding algorithm that results in substantially improved performance over the original LHZ scheme. We explain the better performance of the ME scheme in terms of more efficient spin updates, which allows it to better tolerate the correlated spin-flip errors that arise in our model of quantum annealing. Our results leave open the question of whether the performance of the two embedding schemes can be improved using scheme-specific parameters and new error correction approaches.

A Direct Mapping of Max k-SAT and High Order Parity Checks to a Chimera Graph

“…In particular, a fully connected graph can always be mapped to a Chimera graph using minor embedding [11]. Recently, this focus has also included purpose-built architectures different from the Chimera graph [12] (see also [13] and [14] for related work). Here our focus is on higher order terms which are necessary to implement clauses and parity terms which involve more than two variables.…”

Domain wall encoding of discrete variables for quantum annealing and QAOA

“…Problems can than be mapped to the effective interaction graph of the minors rather than the original graph. Alternatively, the logical variables could be encoded into the parity of qubits [25][26][27]. For quantum annealing, either embedding technique effectively reduces the number of qubit variables a machine can simulate and decreases the effective dynamic range of energies which can be used in encoding the problem, since both methods require strong interactions to enforce that the qubits remain in logically valid states.…”

A transmon quantum annealer: decomposing many-body Ising constraints into pair interactions

“…The scheme features error correction capabilities for uncorrelated noise models [32]. However, in [33], it is pointed that this does not correct for correlated errors as expected from a error model based on quantum Monte Carlo simulations, where minor embedding schemes show larger robustness.…”