Abstract:
In many settings it is desirable to ensure that a quantum algorithm ensures that the solution is constrained to a specific subspace that corresponds to feasible states of a given problem. Based on recent work (https://arxiv.org/abs/2306.17083), we present a way to both understand and construct Hamiltonians that preserve a given subspace. We make use of the stabilizer formalism used in constructing error correcting codes.