Pages that link to "Item:Q2105986"
From MaRDI portal
The following pages link to Hard combinatorial problems and minor embeddings on lattice graphs (Q2105986):
Displaying 7 items.
- Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design (Q544830) (← links)
- Efficiently embedding QUBO problems on adiabatic quantum computers (Q670075) (← links)
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem (Q1007120) (← links)
- Adiabatic quantum programming: minor embedding with hard faults (Q2454228) (← links)
- Embedding of complete graphs in broken Chimera graphs (Q2690529) (← links)
- Template-Based Minor Embedding for Adiabatic Quantum Optimization (Q5084660) (← links)
- Intersecting longest cycles in Archimedean tilings (Q6174817) (← links)