It is already known that if the Hamiltonian is a sum of Poly(N) Pauli terms, it has an efficient implementation as a quantum circuit. This should mean that the circuit can be implemented with Poly(N) gates. Is the reverse true as well? Can we show that an implementable quantum circuit has a Hamiltonian with Poly(N) terms in its decomposition?
Asked
Active
Viewed 51 times
