3 papers
quant-ph2025
Leveraging commuting groups for an efficient variational Hamiltonian ansatz
Abhinav Anand, Kenneth R. Brown
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 b…
quant-ph2025
Hamiltonian-based graph-state ansatz for variational quantum algorithms
Abhinav Anand, Kenneth R. Brown
One promising application of near-term quantum devices is to prepare trial wavefunctions using short circuits for solving different problems via variational algorithms. For this pu…
quant-ph2025
Information flow in parameterized quantum circuits
Abhinav Anand, Lasse Bjørn Kristensen, Felix Frohnert +2
In this work, we introduce a new way to quantify information flow in quantum systems, especially for parameterized quantum circuits. We use a graph representation of the circuits a…