Kelly Boothby
Kelly Boothby
Please note that the clique embedder is quite inefficient at the moment, and for large `k`, it's basically computing the entire cache every time. Also, I'm working on a total...
The term "full yield" is not accurate here. An "evil" coupler, in my old terminology, is an internal coupler (a coupler between a horizontal and a vertical qubit) for which...
also, do you mean to be propagating the "embeddor" typo?
Preferred Alternative: ``` import dwave_networkx as dnx import dwave.embedding as dwe p = dnx.pegasus_graph(6, node_list = qpu.nodelist, edge_list = qpu.edgelist) # even more preferable, already-requested feature: # p = dnx.pegasus_graph(solver=qpu)...
The "clique embedder" searches for cliques of a very specific structural description, in a Chimera graph. We exploit that structural description to produce a polynomial-time algorithm which is effective at...
That's a great description, thank you.
It's worth noting that finding a path of length N in an N-node graph is generally quite difficult (this also known as the Hamiltonian Path Problem). I would expect `minorminer`...
It does. It says that misleading output may occur before `make_confluent` is called but not after. What I'm observing is the opposite.
This looks pretty good, @GuyAglionby, I'll go over it in detail in the next few days. Thanks for your contribution!
I encountered this just yesterday to some frustration; I think it would be good to raise a warning when the parameter is provided but not used.