1 problem

0 votes0 replies0 views
Rajakumar et al.'s NP-hardness conjecture for shortest graph compilation
Rajakumar et al.'s conjecture. Determining a shortest graph compilation for a given graph $G$ , equivalently finding a compilation using the fewest number of $H_{\mathrm{Ising}}$ pu…
Conjectureopengraph-algorithms hamiltonian-compilation quantum-computationarXiv posted 2 days ago

Rajakumar et al.'s NP-hardness conjecture for shortest graph compilation