VQCount applies QAOA as a solution sampler to achieve approximate counting with an exponentially reduced number of samples, demonstrated via proof and tensor-network simulations on two #P-hard problems.
M.; Due \ n as - Osorio, L.; and Vardi, M
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2verdicts
UNVERDICTED 2representative citing papers
Matrix product states coincide with nondeterministic edge-valued decision diagrams, and tree tensor networks correspond exactly to structured-decomposable circuits.
citing papers explorer
-
Counting with the quantum alternating operator ansatz
VQCount applies QAOA as a solution sampler to achieve approximate counting with an exponentially reduced number of samples, demonstrated via proof and tensor-network simulations on two #P-hard problems.
-
From Tensor Networks to Tractable Circuits, and back
Matrix product states coincide with nondeterministic edge-valued decision diagrams, and tree tensor networks correspond exactly to structured-decomposable circuits.