For a fixed number of Trotter steps, linear-schedule digitized quantum annealing has an optimal total time proportional to the step count; longer times produce the maximally disordered state.
On physical problems that are slightly more difficult than QMA
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We study the complexity of computational problems from quantum physics. Typically, they are studied using the complexity class QMA (quantum counterpart of NP) but some natural computational problems appear to be slightly harder than QMA. We introduce new complexity classes consisting of problems that are solvable with a small number of queries to a QMA oracle and use these complexity classes to quantify the complexity of several natural computational problems (for example, the complexity of estimating the spectral gap of a Hamiltonian).
fields
cond-mat.stat-mech 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Optimal working point in digitized quantum annealing
For a fixed number of Trotter steps, linear-schedule digitized quantum annealing has an optimal total time proportional to the step count; longer times produce the maximally disordered state.