A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing

DOI10.1142/S0219749919500424zbMath1430.81019arXiv1803.04340OpenAlexW3100218203WikidataQ127148148 ScholiaQ127148148MaRDI QIDQ5207191

Richard Hua, Michael J. Dinneen, Alastair A. Abbott, Cristian S. Calude

Publication date: 8 January 2020

Published in: International Journal of Quantum Information (Search for Journal in Brave)

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

zbMATH Keywords

graph embeddingquantum annealingquantum speeduphybrid quantum computing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (4)

A QUBO formulation for the tree containment problem ⋮ The Road to Quantum Computational Supremacy ⋮ Quantum solutions for densest \(k\)-subgraph problems ⋮ A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing

Uses Software

• SageMath
• Python

Cites Work

• Unnamed Item
• Unnamed Item
• Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
• A study of heuristic guesses for adiabatic quantum computation
• Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
• Dynamic graph models
• Boosting quantum annealer performance via sample persistence
• Recent examples in the theory of partition graphs
• Unifying tree decompositions for reasoning in graphical models
• BQP and the polynomial hierarchy
• Quantum versus classical annealing of Ising spin glasses
• Statistical mechanics, three-dimensionality and NP-completeness
• A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing
• Solving NP-Complete Problems with Quantum Search
• The theory of variational hybrid quantum-classical algorithms

This page was built for publication: A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing