Presents a quantum Hamiltonian whose ground state encodes equivalence classes of expressions, enabling verification, counting, and structural queries on instances far beyond classical reach.
Classical simula- tion of quantum many-body systems with a tree tensor network
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Quantum annealing is described as a heuristic for discrete optimization and sampling that also serves as a platform for studying non-equilibrium many-body quantum dynamics with programmable spin systems.
citing papers explorer
-
Quantum algorithms for equational reasoning
Presents a quantum Hamiltonian whose ground state encodes equivalence classes of expressions, enabling verification, counting, and structural queries on instances far beyond classical reach.
-
Quantum Annealing: Optimisation, Sampling, and Many-Body Dynamics
Quantum annealing is described as a heuristic for discrete optimization and sampling that also serves as a platform for studying non-equilibrium many-body quantum dynamics with programmable spin systems.