Hierarchical Fusion Method for Scalable Quantum Eigenstate Preparation

Abstract

Robust and efficient eigenstate preparation is a central challenge in quantum simulation. The Rodeo Algorithm (RA) offers exponential convergence to a target eigenstate but suffers from poor performance when the initial state has low overlap with the desired eigenstate, hindering the applicability of the original algorithm to larger systems. In this work, we introduce a fusion method that preconditions the RA state by an adiabatic ramp to overcome this limitation. By incrementally building up large systems from exactly solvable subsystems and using adiabatic preconditioning to enhance intermediate state overlaps, we ensure that the RA retains its exponential convergence even in large-scale systems. We demonstrate this hybrid approach using numerical simulations of the spin- 1/2 XX model and find that the Rodeo Algorithm exhibits robust exponential convergence across system sizes. We benchmark against using only an adiabatic ramp as well as using the unmodified RA, finding that for state preparation precision at the level of $10^{-3}$ infidelity or better there a decisive computational cost advantage to the fusion method. These results together demonstrate the scalability and effectiveness of the fusion method for practical quantum simulations.

8 pages, 4 figures

References in corpus (16)

• Adiabatic Quantum Computing
• Trapped-Ion Quantum Computing: Progress and Challenges
• Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
• Many-Body Physics with Individually-Controlled Rydberg Atoms
• Quantum error correction below the surface code threshold
• Generation and manipulation of Schrödinger cat states in Rydberg atom arrays
• Computational Studies of Quantum Spin Systems
• A Race Track Trapped-Ion Quantum Processor
• High-fidelity gates with mid-circuit erasure conversion in a metastable neutral atom qubit
• Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays
• Rodeo Algorithm for Quantum Computing
• Benchmarking a trapped-ion quantum computer with 30 qubits
• Accuracy vs run time in adiabatic quantum search
• Demonstration of the Rodeo Algorithm on a Quantum Computer
• Measurement-efficient quantum Krylov subspace diagonalisation
• Controlled Gate Networks: Theory and Application to Eigenvalue Estimation