Optimal sufficient requirements on the embedded Ising problem in polynomial time

DOI10.1007/s11128-023-04058-2arXiv2302.04162OpenAlexW4385665697MaRDI QIDQ6073965

Elisabeth Lobe, Volker Kaibel

Publication date: 18 September 2023

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

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

zbMATH Keywords

embeddinglinear optimizationquantum annealingIsing problem

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites Work

• Fast clique minor generation in Chimera qubit connectivity graphs
• The unconstrained binary quadratic programming problem: a survey
• Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
• Sparsest cuts and bottlenecks in graphs
• Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
• Graph minors. XIII: The disjoint paths problem
• Minimizing minor embedding energy: an application in quantum annealing
• Embedding of complete graphs in broken Chimera graphs
• Graph Theory
• Expander graphs and their applications
• Quantum Annealing versus Digital Computing
• Combinatorial optimization. Theory and algorithms

This page was built for publication: Optimal sufficient requirements on the embedded Ising problem in polynomial time