A coordinate-based minor-embedding method for complete bipartite graphs on Pegasus is claimed to be far faster than Minorminer and to avoid long chains, but the zero-long-chain claim is incompatible with the 15-coupler degree limit for 120x120 graphs.
Embedding restricted boltzmann machines onto quantum annealers using pegasus topologies,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Optimized Quantum Embedding: A Universal Minor-Embedding Framework for Large Complete Bipartite Graph
A coordinate-based minor-embedding method for complete bipartite graphs on Pegasus is claimed to be far faster than Minorminer and to avoid long chains, but the zero-long-chain claim is incompatible with the 15-coupler degree limit for 120x120 graphs.