Papers › Iterative Qubit Coupled Cluster using only Clifford circuits
Iterative Qubit Coupled Cluster using only Clifford circuits
James Brown, Marc P. Coons, Erika Lloyd, Alexandre Fleury, Krzysztof Bieniasz, Valentin Senicourt, Arman Zaribafiyan
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The performance of quantum algorithms for ground-state energy estimation is directly impacted by the quality of the initial state, where quality is traditionally defined in terms of the overlap of the input state with the target state. An ideal state preparation protocol can be characterized by being easily generated classically and can be transformed to a quantum circuit with minimal overhead while having a significant overlap with the targeted eigenstate of a given Hamiltonian. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) approach, which exclusively uses Clifford circuits. These circuits can be efficiently simulated on a classical computer, with polynomial scaling according to the Gottesman-Knill theorem. Since the iQCC method has been developed as a quantum algorithm firstly, our variant can be mapped naturally to quantum hardware. We additionally implemented several optimizations to the algorithm enhancing its scalability. We demonstrate the algorithm's correctness in ground-state simulations for small molecules such as H2, LiH, and H2O, and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space, requiring 40 qubits. Results show that the convergence of the algorithm is well-behaved, and the ground state can be represented accurately. Moreover, we show an automated workflow for restricting the qubit active space, thus relieving computational resources by considering only qubits affected by non-trivial operations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections