Speaker
Zhongtian Dong
(University of Kansas)
Description
We revisit the combinatorial problem at the LHC, taking $t\bar{t}$ production as an example. The combinatorial ambiguity in this case can be reformulated in terms of a quadratic unconstrained binary optimization problem. Finding the solution to the combinatorial problem becomes equivalent to finding the ground state of the Ising Hamiltonian. We explore several variational quantum algorithms to find the global minimum of the problem Hamiltonian and compare our results against the existing methods.
