Minimizing minor embedding energy: an application in quantum annealing
From MaRDI portal
Publication:2681521
DOI10.1007/s11128-020-02681-xOpenAlexW3027080892MaRDI QIDQ2681521
Yan-Long Fang, P. A. Warburton
Publication date: 3 February 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.03291
Related Items (2)
Inter-generational comparison of quantum annealers in solving hard scheduling problems ⋮ Optimal sufficient requirements on the embedded Ising problem in polynomial time
Cites Work
- Fast clique minor generation in Chimera qubit connectivity graphs
- Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
- A case study in programming a quantum annealer for hard operational planning problems
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Quantum adiabatic Markovian master equations
This page was built for publication: Minimizing minor embedding energy: an application in quantum annealing