On universality of hardware-efficient ansatzes

Abstract: The hardware-efficient ansatz (HEA) is one of the most important class of parametrized quantum circuits for near-term applications of quantum computing. We show that the problem of simulating some major classes of the HEA is BQP-complete by explicitly demonstrating that any relevant quantum circuit can be efficiently represented as an HEA circuit of those classes.