The quantum guesswork quantifies the minimum number of queries needed to guess state a ensemble if one is allowed query only at time. Previous approaches computation were based on standard semi-definite programming techniques and therefore lead approximated results. In contrast, we show that computing qubit ensembles with uniform probability distribution corresponds solving quadratic assignment...

— Using an approach that seems to be patterned after that of Yannakakis, Hofman argues that an NP-complete problem cannot be formulated as a polynomial bounded-sized linear programming problem. He then goes on to propose a " construct " that he claims to be a " counterexample " to recently published linear programming formulations of the Traveling Salesman Problem (TSP) and the Quadratic Assign...