Minimizing State Preparations in Variational Quantum Eigensolver by Partitioning into Commuting Families

Understand

Variational quantum eigensolver (VQE) is a promising algorithm suitable for near-term quantum machines.

• VQE aims to approximate the lowest eigenvalue of an exponentially sized matrix in polynomial time.
• It minimizes quantum resource requirements both by co-processing with a classical processor and by structuring computation into many subproblems.
• Each quantum subproblem involves a separate state preparation terminated by the measurement of one Pauli string.