Adiabatic quantum programming: minor embedding with hard faults

DOI10.1007/s11128-013-0683-9zbMath1291.81099arXiv1210.8395MaRDI QIDQ2454228

Christine Klymko, Travis S. Humble, Blair D. Sullivan

Publication date: 13 June 2014

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.8395

zbMATH Keywords

quantum computing; graph embedding; adiabatic quantum optimization; fault-tolerant computing

Mathematics Subject Classification ID

81P68: Quantum computation

Related Items

Template-Based Minor Embedding for Adiabatic Quantum Optimization, Influence of long-range interaction on degeneracy of eigenvalues of connection matrix of d-dimensional Ising system, Graph minors from simulated annealing for annealing machines with sparse connectivity, Minor embedding in broken chimera and derived graphs is NP-complete, Fast clique minor generation in Chimera qubit connectivity graphs, A comparison of approaches for finding minimum identifying codes on graphs, Differential geometric treewidth estimation in adiabatic quantum computation, Efficiently embedding QUBO problems on adiabatic quantum computers, Optimizing adiabatic quantum program compilation using a graph-theoretic framework, Embedding equality constraints of optimization problems into a quantum annealer, A case study in programming a quantum annealer for hard operational planning problems, Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets, Embedding of complete graphs in broken Chimera graphs

Uses Software

• ComputeTW

Cites Work

• Unnamed Item
• Unnamed Item
• Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
• Treewidth computations. II. Lower bounds
• Faster parameterized algorithms for minor containment
• Pseudo-Boolean optimization
• Approximation algorithms for treewidth
• Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
• Graph minors. XIII: The disjoint paths problem
• Quantum adiabatic machine learning
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• Algorithms - ESA 2003