Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
From MaRDI portal
Publication:544830
DOI10.1007/s11128-010-0200-3zbMath1216.81048arXiv1001.3116MaRDI QIDQ544830
Publication date: 16 June 2011
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1001.3116
graph minor; adiabatic quantum computation; universal graph; adiabatic quantum architecture design; minor-embedding
81P68: Quantum computation
68M07: Mathematical problems of computer architecture
68Q12: Quantum algorithms and complexity in the theory of computing
Related Items
QUBO formulation for the contact map overlap problem, A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing, 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, Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling, Efficiently embedding QUBO problems on adiabatic quantum computers, Optimizing adiabatic quantum program compilation using a graph-theoretic framework, Boosting quantum annealer performance via sample persistence, Enhancing quantum annealing performance for the molecular similarity problem, Systematic and deterministic graph minor embedding for Cartesian products of graphs, Quantum pattern recognition with multi-neuron interactions, Building an iterative heuristic solver for a quantum annealer, Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets, Adiabatic quantum programming: minor embedding with hard faults
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pseudo-Boolean optimization
- A partial k-arboretum of graphs with bounded treewidth
- Graph minors. XIII: The disjoint paths problem
- Colloquium: Quantum annealing and analog quantum computation
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
- Simulating Quantum Computation by Contracting Tensor Networks
