1 problem

0 votes0 replies0 views
Calude et al.'s quadratic-qubit constraint conjecture for QUBO formulations of graph isomorphism
If the underlying graph $\mathcal{A}$ has $N$ vertices, representing the graph isomorphism problem as a quadratic unconstrained binary optimization problem in a quantum computer re…
Conjectureopengraph-isomorphism quantum-algorithms quboarXiv posted 2 days ago

Calude et al.'s quadratic-qubit constraint conjecture for QUBO formulations of graph isomorphism