Fast clique minor generation in Chimera qubit connectivity graphs
Explore this paper's citation graph
Summary
A combinatorial class of native clique minors in Chimera graphs with vertex images of uniform, near minimal size and a polynomial-time algorithm that finds a maximum native clique minor in a given induced subgraph of a Chimera graph are defined.
- Type
- preprint
- Published
- 2015-07-16
- Cited by
- 183
- References
- 22
- Access
- Open access
- OpenAlex
- https://openalex.org/W1849694871
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:6536805
Keywords
Quantum annealing, Combinatorics, Pairwise comparison, Clique graph, Ising model
References
- Quantum Annealing and Analog Quantum Computation
- Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
- Algorithm engineering for a quantum annealing platform
- Quantum Computation by Adiabatic Evolution
- Quantum Optimization of Fully-Connected Spin Glasses
- A Performance Estimator for Quantum Annealers: Gauge selection and Parameter Setting
- A practical heuristic for finding graph minors
- On Points Drawn from a Circle
- Adiabatic quantum optimization with the wrong Hamiltonian
- Quantum annealing in the transverse Ising model
- Thermally assisted quantum annealing of a 16-qubit problem
- A scalable readout system for a superconducting adiabatic quantum optimization system
- Quantum annealing with manufactured spins
- Consistency tests of classical and quantum models for a quantum annealer
- Optimization using quantum mechanics: quantum annealing through adiabatic evolution
- Quantum annealing: A new method for minimizing multidimensional functions
- Dynamics of a quantum phase transition: exact solution of the quantum Ising model.
- Adiabatic quantum programming: minor embedding with hard faults
- Experimental demonstration of a robust and scalable flux qubit
- Minor-embedding in adiabatic quantum computation: I. The parameter setting problem
Cited by
- High Performance Computing: 6th Latin American Conference, CARLA 2019, Turrialba, Costa Rica, September 25–27, 2019, Revised Selected Papers
- High Performance Computing
- Nested quantum annealing correction
- Homology Computation of Large Point Clouds using Quantum Annealing
- Some Results on Structure in Graphs and Numbers
- Simulated-quantum-annealing comparison between all-to-all connectivity schemes
- Prime factorization using quantum annealing and computational algebraic geometry
- Systematic and deterministic graph minor embedding for Cartesian products of graphs
- Stabilizers as a design tool for new forms of the Lechner-Hauke-Zoller annealer
- Planarity Based Algorithms for Minor Embedding in Grid Graphs
- Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets
- Optimizing adiabatic quantum program compilation using a graph-theoretic framework
- Critical phenomena and Kibble–Zurek scaling in the long-range quantum Ising chain
- Enhancing quantum annealing performance for the molecular similarity problem
- Nonnegative/Binary matrix factorization with a D-Wave quantum annealer
- Graph Partitioning using Quantum Annealing on the D-Wave System
- Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems
- Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis
- Quantum walk on a chimera graph
- Finding Maximum Cliques on the D-Wave Quantum Annealer