Exhaustively parametrised feasibility-respecting quantum circuits can reach every feasible solution to problems like TSP with certainty using fixed parameters by leveraging group actions and generating sequences.
Space-efficient binary optimization for variational computing
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
method 1
citation-polarity summary
fields
quant-ph 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
Iterative-QAOA solves pangenome assembly instances on current quantum hardware by using a fixed-ramp QAOA schedule with warm-start updates and a new HUBO encoding that cuts variables from O(N^{2}) to O(N log N).
HUBO formulations for logistics problems offer qubit savings over QUBO at the expense of higher circuit depth, validated classically and simulated quantumly for small cases.
citing papers explorer
-
Nonvariational quantum optimisation approaches to pangenome-guided sequence assembly
Iterative-QAOA solves pangenome assembly instances on current quantum hardware by using a fixed-ramp QAOA schedule with warm-start updates and a new HUBO encoding that cuts variables from O(N^{2}) to O(N log N).