CAFQA: A classical simulation bootstrap for variational quantum algorithms
Not on the map. Why?
Abstract (arXiv)
This work tackles the problem of finding a good ansatz initialization for Variational Quantum Algorithms (VQAs), by proposing CAFQA, a Clifford Ansatz For Quantum Accuracy. The CAFQA ansatz is a hardware-efficient circuit built with only Clifford gates. In this ansatz, the parameters for the tunable gates are chosen by searching efficiently through the Clifford parameter space via classical simulation. The resulting initial states always equal or outperform traditional classical initialization (e.g., Hartree-Fock), and enable high-accuracy VQA estimations. CAFQA is well-suited to classical computation because: a) Clifford-only quantum circuits can be exactly simulated classically in polynomial time, and b) the discrete Clifford space is searched efficiently via Bayesian Optimization. For the Variational Quantum Eigensolver (VQE) task of molecular ground state energy estimation (up to 18 qubits), CAFQA's Clifford Ansatz achieves a mean accuracy of nearly 99% and recovers as much as 99.99% of the molecular correlation energy that is lost in Hartree-Fock initialization. CAFQA achieves mean accuracy improvements of 6.4x and 56.8x, over the state-of-the-art, on different metrics. The scalability of the approach allows for preliminary ground state energy estimation of the challenging chromium dimer (Cr2) molecule. With CAFQA's high-accuracy initialization, the convergence of VQAs is shown to accelerate by 2.5x, even for small molecules. Furthermore, preliminary exploration of allowing a limited number of non-Clifford (T) gates in the CAFQA framework, shows that as much as 99.9% of the correlation energy can be recovered at bond lengths for which Clifford-only CAFQA accuracy is relatively limited, while remaining classically simulable.
Key facts. Cited by 6 papers in the map (data through 13 Oct 2026). First posted on arXiv 25 Feb 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 2; 2025: 2; 2026: 1.
6 papers.
- 2024'Eliv'agar: Efficient Quantum Circuit Search for Classificationcited by 12
- 2022NURD: Negative-Unlabeled Learning for Online Datacenter Straggler Predictioncited by 2
- 2024The Stabilizer Bootstrap of Quantum Machine Learning with up to 10000 qubitscited by 0
- 2025Quantum Methods for Managing Ambiguity in Natural Language Processingcited by 0
- 2025Three Birds with One Stone: Improving Performance, Convergence, and System Throughput with Nestcited by 0
- 2026Classical State Preparation for Variational Quantum Algorithms via Reinforcement Learningcited by 0
- 2026Classical State Preparation for Variational Quantum Algorithms via Reinforcement Learning22 May 2026
- 2025Three Birds with One Stone: Improving Performance, Convergence, and System Throughput with Nest10 Oct 2025
- 2025Quantum Methods for Managing Ambiguity in Natural Language Processing30 Mar 2025
- 2024The Stabilizer Bootstrap of Quantum Machine Learning with up to 10000 qubits16 Dec 2024
- 2024'Eliv'agar: Efficient Quantum Circuit Search for Classification17 Jan 2024
- 2022NURD: Negative-Unlabeled Learning for Online Datacenter Straggler Prediction16 Mar 2022