Questions tagged [stoquatic-matrices]
For questions related to stoquastic matrices, also known as matrices having no sign problem. These are Hermitian matrices having real, non-positive off-diagonal entries. When viewed as Hamiltonians such matrices may be more efficiently computable than arbitrary Hamiltonians.
1
question
3
votes
0answers
89 views
If we can prepare a ground state efficiently, when can we prepare the second-lowest energy eigenstate?
I'd like to know if there's anything that can be said about whether and when we can efficiently prepare a state corresponding to the second-lowest eigenvalue of a given Hamiltonian, or in any other ...
