A tensor-network encoding of TSP tours with Boltzmann weighting and explicit constraint filters that supplies a marginal formula for optimal tours in the zero-temperature exact limit.
A quantum approximate opti- mization algorithm
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3verdicts
UNVERDICTED 3representative citing papers
QUBO formulations are derived for generalized LinkedIn Queens, Takuzu/Tango, Tents & Trees, and two new chess-piece problems to enable solution on quantum hardware.
Presents a hierarchy of private delegated quantum computation protocols separating state privacy, transcript ambiguity, and output privacy under stated leakage and collusion assumptions.
citing papers explorer
-
Tensor-Network Formulation of the Traveling Salesman Problem and Variants
A tensor-network encoding of TSP tours with Boltzmann weighting and explicit constraint filters that supplies a marginal formula for optimal tours in the zero-temperature exact limit.
-
A QUBO Formulation for the Generalized LinkedIn Queens and Takuzu/Tango Game
QUBO formulations are derived for generalized LinkedIn Queens, Takuzu/Tango, Tents & Trees, and two new chess-piece problems to enable solution on quantum hardware.
-
Private Delegated Quantum Computing for User-Level and Industry-Level Settings
Presents a hierarchy of private delegated quantum computation protocols separating state privacy, transcript ambiguity, and output privacy under stated leakage and collusion assumptions.