Quantum Algorithms Refine Searches for Stable States in Noisy Computers

A new Variational Quantum Eigensolver (VQE) ansatz, the Projector Variational Ansatz (PVA), more closely mimics the structure of fault-tolerant algorithms by using a projector to identify the ground state, as proposed by Thomas Dumontier and colleagues at Université Paris-Saclay, CNRS. The PVA converges using shallower quantum circuits compared to the Adaptive Derivative-Assembled Pseudo-Trotter (ADAPT)-VQE method, offering a key advancement for quantum computation in the noisy intermediate-scale quantum (NISQ) era. This approach provides a strong improvement in determining the ground state of complex Hamiltonians and enables calculations with fewer quantum operations.

Projector Ansatz aligns with fault tolerance for efficient quantum computation

The Projector Variational Ansatz (PVA) converges using shallower circuits than the widely adopted ADAPT-VQE method, representing a strong improvement in quantum algorithm efficiency. Structurally aligning the PVA ansatz with Fault Tolerant Quantum Computing (FTQC) techniques resulted in this shallower convergence, employing a “projector” to identify ground states without direct construction, mirroring how FTQC algorithms verify calculations. Offering flexibility in implementation and compatibility with existing quantum hardware, the PVA ansatz can function equivalently to either an Intermediate Scale Quantum (ISQ)-Quantum Signal Processing (QSP) or ADAPT-VQE circuit. The significance of this lies in the ongoing challenge of bridging the gap between current NISQ devices and the future promise of FTQC; algorithms designed with FTQC principles in mind are more likely to be scalable and benefit directly from advancements in error correction.

Adopting a strategy reminiscent of FTQC enables the development of quantum algorithms more readily adaptable to future, more powerful quantum computers. A “projector” mechanism identifies ground states without directly building them, a process akin to how FTQC algorithms verify results. This structural alignment with FTQC allows the PVA to function flexibly, adapting to different quantum computing approaches. The projector operates by introducing ancillary qubits, additional quantum bits, which act as flags to indicate whether a potential solution corresponds to the ground state. This is achieved through a measurement process on the ancillary qubits, providing a clear signal for the optimisation routine. Furthermore, the PVA ansatz uses ancillary qubits to flag correct solutions, enhancing its efficiency and offering a potential bridge between NISQ and FTQC architectures. The number of ancillary qubits required scales with the complexity of the Hamiltonian being investigated, but the benefit of reduced circuit depth often outweighs this overhead, particularly for larger systems.

The ADAPT-VQE method, while effective, relies on iteratively refining a circuit based on gradient descent. This process can be computationally expensive and require deep circuits, making it susceptible to noise on NISQ devices. In contrast, the PVA’s projector-based approach aims to directly identify the ground state, reducing the need for extensive iterative refinement. The PVA ansatz achieves this by encoding the Hamiltonian into a form suitable for projection, allowing the algorithm to efficiently search for the lowest energy eigenstate. This is conceptually similar to how one might find the lowest point in a valley by directly measuring the altitude at various locations, rather than slowly descending using gradient information. The ability to function equivalently to both ISQ-QSP and ADAPT-VQE circuits provides researchers with a versatile tool, allowing them to choose the most appropriate implementation based on their specific hardware and problem constraints.

Reduced circuit depth accelerates molecular ground state computations on near-term quantum hardware

Determining molecular ground states is fundamental to fields like materials science and drug discovery, driving the need for ever-more-efficient quantum algorithms. Accurate knowledge of ground state energies is crucial for predicting molecular properties, reaction rates, and material stability. Current noisy intermediate-scale quantum (NISQ) devices require clever workarounds like Variational Quantum Eigensolvers (VQE) while fault-tolerant quantum computers promise ultimate scalability. A key tension exists between designing VQE circuits that are easy to implement now and those that align with the architecture of future, error-corrected machines. The challenge lies in balancing the need for short, shallow circuits, which are less susceptible to noise, with the desire for algorithms that can seamlessly transition to the FTQC regime.

Nevertheless, acknowledging that this new approach may ultimately require fault-tolerant hardware to fully realise its potential, the immediate benefits are still substantial. Calculations require fewer computational steps, meaning shorter quantum circuits for ground state calculations have been demonstrated compared to existing methods like ADAPT-VQE, expanding the size of molecules and materials that can be realistically modelled. Initial experiments demonstrate that the PVA converges using shallower quantum circuits than ADAPT-VQE, suggesting a reduction in required computational resources. The reduction in circuit depth translates directly to a decrease in the accumulation of errors, as each quantum gate introduces a small probability of error. By minimising the number of gates, the PVA ansatz improves the reliability of the computation on NISQ devices. Instead of directly constructing a solution, it employs a “projector” to identify the ground state, mirroring how future, error-corrected machines verify calculations. This approach offers a pathway towards more scalable quantum computation by aligning algorithms with fault-tolerant principles and potentially reducing the resources needed for complex simulations.

The PVA’s performance was evaluated on a range of benchmark molecular Hamiltonians, demonstrating consistent improvements over ADAPT-VQE in terms of circuit depth required to achieve a given level of accuracy. Specifically, the researchers observed a reduction in the number of CNOT gates, a common measure of circuit complexity, for several test cases. While the exact magnitude of the reduction varies depending on the specific molecule and the desired accuracy, the trend indicates a clear advantage for the PVA ansatz. Future work will focus on exploring the performance of the PVA on larger and more complex systems, as well as investigating its compatibility with different quantum hardware platforms. The development of robust and efficient VQE algorithms like the PVA is crucial for unlocking the full potential of quantum computing in the NISQ era and paving the way for transformative advances in fields like chemistry, materials science, and drug discovery.

The researchers developed a new variational quantum eigensolver ansatz, termed PVA, which demonstrated improved performance compared to existing ADAPT-VQE methods. This new approach constructs quantum circuits that are shallower, requiring fewer computational resources to model molecules and materials. By mirroring techniques used in fault-tolerant quantum computing, PVA reduces the accumulation of errors inherent in current noisy intermediate-scale quantum devices. The team intends to explore PVA’s performance on increasingly complex systems and various quantum hardware platforms.