Site- and bond-percolation thresholds in K_{n,n}-based lattices: Vulnerability of quantum annealers to random qubit and coupler failures on chimera topologies.

  title={Site- and bond-percolation thresholds in K\_\{n,n\}-based lattices: Vulnerability of quantum annealers to random qubit and coupler failures on chimera topologies.},
  author={Oliver Melchert and Helmut G. Katzgraber and Mark A. Novotny},
  journal={Physical review. E},
We estimate the critical thresholds of bond and site percolation on nonplanar, effectively two-dimensional graphs with chimeralike topology. The building blocks of these graphs are complete and symmetric bipartite subgraphs of size 2n, referred to as K_{n,n} graphs. For the numerical simulations we use an efficient union-find-based algorithm and employ a finite-size scaling analysis to obtain the critical properties for both bond and site percolation. We report the respective percolation… 

Figures and Tables from this paper

Strengths and weaknesses of weak-strong cluster problems: A detailed overview of state-of-the-art classical heuristics versus quantum approaches

To date, a conclusive detection of quantum speedup remains elusive. Recently, a team by Google Inc.~[V.~S.~Denchev {\em et al}., Phys.~Rev.~X {\bf 6}, 031015 (2016)] proposed a weak-strong cluster

Measurement-induced phase transitions in sparse nonlocal scramblers

This work considers sets of deterministic sparse couplings that naturally interpolate between local circuits that slowly scramble information and highly nonlocal circuits that achieve the fast-scrambling limit, and finds that circuits featuring sparse nonlocal interactions are able to withstand substantially higher rates of local measurement than circuits with only local interactions.

Percolation of binary disk systems: Modeling and theory.

Monte Carlo simulations and spanning probability are used to extend prior models into regions of higher polydispersity than those previously considered and a correlation to predict the percolation threshold for binary disk systems is proposed.

Heat percolation in many-body flat-band localizing systems

Translationally invariant finetuned single-particle lattice Hamiltonians host flat bands only. Suitable short-range many-body interactions result in complete suppression of particle transport due to

borealis—A generalized global update algorithm for Boolean optimization problems

This work presents a generalized global update optimization heuristic that can be applied to different NP-complete problems with Boolean variables, and illustrates the efficiency of the heuristic on paradigmatic optimization problems, such as the maximum satisfiability problem and the vertex cover problem.



Mean-Field Conditions for Percolation on Finite Graphs

AbstractLet {Gn} be a sequence of finite transitive graphs with vertex degree d = d(n) and |Gn| = n. Denote by pt(v, v) the return probability after t steps of the non-backtracking random walk on Gn.

Best-case performance of quantum annealers on native spin-glass benchmarks: How chaos can affect success probabilities

Recent tests performed on the D-Wave Two quantum annealer have revealed no clear evidence of speedup over conventional silicon-based technologies. Here we present results from classical

Critical Probabilities for Cluster Size and Percolation Problems

When particles occupy the sites or bonds of a lattice at random with probability p, there is a critical probability pc above which an infinite connected cluster of particles forms. Rigorous bounds

Quantum annealing correction with minor embedding

This work demonstrates that quantum annealing correction can and should be used to improve the robustness of quantumAnnealing not only for natively embeddable problems, but also when minor embedding is used to extend the connectivity of physical devices.

Continuum Percolation Thresholds in Two Dimensions

  • S. MertensC. Moore
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2012
This work finds precise values of the percolation transition for disks, squares, rotated squares, and rotated sticks in two dimensions and confirms that these transitions behave as conformal field theory predicts.

Critical properties of loop percolation models with optimization constraints.

  • F. PfeifferH. Rieger
  • Physics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2003
It is shown that the uncorrelated occupation of elementary plaquettes of the square and the simple cubic lattice by elementary loops leads to a percolation transition that is in the same universality class as the conventional percolations.

Probing for quantum speedup in spin-glass problems with planted solutions

This work introduces a method to construct a set of frustrated Ising-model optimization problems with tunable hardness, and studies the performance of a D-Wave Two device with up to 503 qubits on these problems and compares it to a suite of classical algorithms.

Exact solution of site and bond percolation on small-world networks.

  • C. MooreM. Newman
  • Mathematics
    Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
  • 2000
An exact solution of the model for both site and bond percolation is given, including the position of thePercolation transition at which epidemic behavior sets in, the values of the critical exponents governing this transition, the mean and variance of the distribution of cluster sizes below the transition, and the size of the giant component (epidemic) above the transition.

Percolation thresholds on two-dimensional Voronoi networks and Delaunay triangulations.

  • Adam BeckerR. Ziff
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2009
The results rule out the conjecture by Hsu and Huang that the bond thresholds are 2/3 and 1/3, respectively, but support the conjecture of Wierman that, for fully triangulated lattices other than the regular triangular lattice, the bond threshold is less than 2 sin pi/18 approximately 0.3473.

Fast Monte Carlo algorithm for site or bond percolation.

  • M. NewmanR. Ziff
  • Physics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2001
An efficient algorithm is described that can measure an observable quantity in a percolation system for all values of the site or bond occupation probability from zero to one in an amount of time that scales linearly with the size of the system.