Leveraging commuting groups for an efficient variational Hamiltonian ansatz

Understand

Efficiently calculating the low-lying eigenvalues of Hamiltonians, written as sums of Pauli operators, is a fundamental challenge in quantum computing.

• While various methods have been proposed to reduce the complexity of quantum circuits for this task, there remains room for further improvement.
• In this article, we introduce a new circuit design using commuting groups within the Hamiltonian to further reduce the circuit complexity of Hamiltonian-based quantum circuits.
• Our approach involves partitioning the Pauli operators into mutually commuting clusters and finding Clifford unitaries that diagonalize each cluster.