To enhance the variational quantum eigensolver (VQE), the CAFQA method can utilize classical computational capabilities to identify a better initial state than the Hartree-Fock method. Previous research has demonstrated that the initial state provided by CAFQA recovers more correlation energy than that of the Hartree-Fock method and results in faster convergence. In the present study, we advance the investigation of CAFQA by demonstrating its advantages on a high-fidelity trapped-ion quantum computer located at the Duke Quantum Center -- this is the first experimental demonstration of CAFQA-bootstrapped VQE on a TI device and on any academic quantum device. In our VQE experiment, we use LiH and BeH$_2$ as test cases to show that CAFQA achieves faster convergence and obtains lower energy values within the specified computational budget limits. To ensure the seamless execution of VQE on this academic device, we develop a novel hardware-software interface framework that supports independent software environments for both the circuit and hardware end. This mechanism facilitates the automation of VQE-type job executions as well as mitigates the impact of random hardware interruptions. This framework is versatile and can be applied to a variety of academic quantum devices beyond the trapped-ion quantum computer platform, with support for integration with customized packages.
To enhance the variational quantum eigensolver (VQE), the CAFQA method can utilize classical computational capabilities to identify a better initial state than the Hartree-Fock method. Previous research has demonstrated that the initial state provided by CAFQA recovers more correlation energy than that of the Hartree-Fock method and results in faster convergence. In the present study, we advance the investigation of CAFQA by demonstrating its advantages on a high-fidelity trapped-ion quantum computer located at the Duke Quantum Center -- this is the first experimental demonstration of CAFQA-bootstrapped VQE on a TI device and on any academic quantum device. In our VQE experiment, we use LiH and BeH2 as test cases to show that CAFQA achieves faster convergence and obtains lower energy values within the specified computational budget limits. To ensure the seamless execution of VQE on this academic device, we develop a novel hardware-software interface framework that supports independent software environments for both the circuit and hardware end. This mechanism facilitates the automation of VQE-type job executions as well as mitigates the impact of random hardware interruptions. This framework is versatile and can be applied to a variety of academic quantum devices beyond the trapped-ion quantum computer platform, with support for integration with customized packages.
Academic quantum computing platforms often face unique challenges in executing quantum workloads due to fragmented software environments and limited engineering support. Unlike commercial ecosystems, academic devices typically evolve without full-stack integration in mind, making it difficult to run complex applications—such as variational quantum algorithms (VQA)—reliably and efficiently. Issues such as incompatible software layers and lack of automated job management significantly increase the overhead of theory-experiment collaboration. To address these challenges, we develop a modular, end-to-end workflow that decouples application-layer code from low-level hardware control, automates circuit submission and result collection, and supports fine-grained circuit-level job scheduling and recovery. The architecture employs a dual-end application programming interface (API) design, enabling robust operation across unstable or resource-constrained hardware backends. For practical use, the framework is lightweight and user-friendly, allowing rapid prototyping of full-stack workflows using basic Python tools. We validate this workflow on a high-fidelity trapped-ion quantum computer by demonstrating a variational quantum eigensolver (VQE) experiment with a classically bootstrapped ansatz initialization technique. The system successfully executed over 60,000 circuits across multiple molecular test cases with minimal human intervention, highlighting the framework’s effectiveness in enabling reproducible, resilient quantum experimentation in academic settings.
Quantum computers have the potential to deliver speed-ups for solving certain important problems that are intractable for classical counterparts, making them a promising avenue for advancing modern computation. However, many quantum algorithms require deep quantum circuits, which are challenging to implement on current noisy devices. To address this limitation, variational quantum algorithms (VQAs) have been actively developed, enabling practical quantum computing in the noisy intermediate-scale quantum (NISQ) era. Among them, the variational quantum eigensolver (VQE) stands out as a leading approach for solving problems in quantum chemistry, many-body physics, and even integer factorization. The VQE algorithm can be implemented on various quantum hardware platforms, including photonic systems, quantum dots, trapped ions, neutral atoms, and superconducting circuits. In particular, photonic platforms offer several advantages: they operate at room temperature, exhibit low decoherence, and support multiple degrees of freedom, making them suitable for scalable, high-dimensional quantum computation. Here we present methodologies for realizing VQE on photonic systems, highlighting their potential for practical quantum computing. We first provide a theoretical overview of the VQE framework, focusing on the procedure for variationally estimating ground state energies. We then explore how photonic systems can implement these processes, showing that a wide variety of problems can be addressed using either multiple qubit states or a single qudit state.
Variational Quantum Algorithms (VQAs) are iterative algorithms suited to implementation on current-era quantum devices. VQAs employ classical optimization to minimize cost functions evaluated on quantum circuits. However, the extent to which VQAs manage noise is often insufficient for quantum chemistry applications. One method of improving VQAs is through accurate ansatz initialization. The CAFQA (Clifford Ansatz For Quantum Accuracy) protocol runs a discrete search through a classically simulatable subset of the entire state space to find a desirable initialization. Prior work has evaluated CAFQA applied to the Variational Quantum Eigensolver (VQE), a VQA that computes grounds states of a Hamiltonian. Motivated by CAFQA's success, we propose Excited-CAFQA initialization for Variational Quantum Deflation (VQD), a quantum algorithm that extends VQE by allowing the computation of excited states. VQD recursively computes excited states, by constraining the kth state to be orthogonal to the previous k-1 computed energy states via a penalty term appended to the standard VQE cost function. Just as with VQE, the VQD cost function can be efficiently computed classically for the states considered in the discrete CAFQA search, allowing for the discrete CAFQA optimizer to find good initial parameters for each energy level computation. Preliminary evaluation shows that Excited-CAFQA achieves 90 to 99+% accuracy across a variety of bond lengths and excited states for H2 and HeH+ molecular systems.
High Resolution Image Download MS PowerPoint Slide We investigate the variational quantum eigensolver (VQE) for estimating the ground-state energy of the BeH 2 molecule, emphasizing practical implementation and performance on current quantum hardware. Our research presents a comparative study of HEA and UCCSD ansätze on noiseless and noisy simulations and implements VQE on recent IBM quantum computer noise models and a real quantum computer, IBM Fez, providing a fully functional code employing Qiskit 1.2 . Our experiments confirm UCCSD’s reliability in ideal conditions, while the HEA demonstrates greater robustness to hardware noise, achieving chemical accuracy on state-vector simulation (SVS). The results reveal that achieving ground-state energy within chemical accuracy is feasible without error mitigation during VQE convergence. We demonstrate that current quantum devices effectively optimize circuit parameters despite misestimating simulated energies. The SVS-evaluated energies provide a more accurate representation of the solution quality compared to QPU-estimated energy values, indicating that VQE converges to the correct ground state despite quantum noise. Our study also applies noise mitigation as a postprocessing technique, using zero-noise extrapolation (ZNE) on a real quantum computer. The detailed methodologies presented in this study, including Hamiltonian construction and Fermionic-to-qubit transformations, facilitate flexible adaptation of the VQE approach for various algorithm variants and across different levels of algorithmic implementation.
Abstract Quantum computing leverages the quantum resources of superposition and entanglement to efficiently solve computational problems considered intractable for classical computers. Examples include calculating molecular and nuclear structure, simulating strongly interacting electron systems, and modeling aspects of material function. While substantial theoretical advances have been made in mapping these problems to quantum algorithms, there remains a large gap between the resource requirements for solving such problems and the capabilities of currently available quantum hardware. Bridging this gap will require a co-design approach, where the expression of algorithms is developed in conjunction with the hardware itself to optimize execution. Here we describe an extensible co-design framework for solving chemistry problems on a trapped-ion quantum computer and apply it to estimating the ground-state energy of the water molecule using the variational quantum eigensolver (VQE) method. The controllability of the trapped-ion quantum computer enables robust energy estimates using the prepared VQE ansatz states. The systematic and statistical errors are comparable to the chemical accuracy, which is the target threshold necessary for predicting the rates of chemical reaction dynamics, without resorting to any error mitigation techniques based on Richardson extrapolation.
While quantum computers are a very promising tool for the far future, in their current state of the art they remain limited both in size and quality. This has given rise to hybrid quantum-classical algorithms, where the quantum device performs only a small but vital part of the overall computation. Among these, variational quantum algorithms (VQAs), which combine a classical optimization procedure with quantum evaluation of a cost function, have emerged as particularly promising. However, barren plateaus and ill-conditioned optimization landscapes remain among the primary obstacles faced by VQAs, often leading to unstable convergence and high sensitivity to initialization. Motivated by this challenge, we investigate whether a purely classical remedy, standard L2 squared-norm regularization, can systematically stabilize hybrid quantum-classical optimization. Specifically, we augment the Variational Quantum Eigensolver (VQE) objective with a quadratic penalty proportional to the squared norm of the parameters, without modifying the quantum circuit or measurement process. Across all tested Hamiltonians, H2, LiH, and the Random Field Ising Model (RFIM), we observe improved performance over a broad window of the regularization strength. Our large-scale numerical results demonstrate that classical regularization provides a robust, system-independent mechanism for mitigating VQE instability, enhancing the reliability and reproducibility of variational quantum optimization without altering the underlying quantum circuit.