# Efficient charge-preserving excited state preparation with variational quantum algorithms

arXiv: https://arxiv.org/abs/2410.14357 · HTML: https://mlsanity.com/paper/2410.14357/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 18 Oct 2024.

## Built on by (most cited first, 2 of 2)

- [Quantum EigenGame for excited state calculation](https://mlsanity.com/paper/2503.13644/) (2025)
- [Platform-Agnostic Modular Architecture for Quantum Benchmarking](https://mlsanity.com/paper/2510.08469/) (2025)

## Abstract (arXiv)

Determining the spectrum and wave functions of excited states of a system is crucial in quantum physics and chemistry. Low-depth quantum algorithms, such as the Variational Quantum Eigensolver (VQE) and its variants, can be used to determine the ground-state energy. However, current approaches to computing excited states require numerous controlled unitaries, making the application of the original Variational Quantum Deflation (VQD) algorithm to problems in chemistry or physics suboptimal. In this study, we introduce a charge-preserving VQD (CPVQD) algorithm, designed to incorporate symmetry and the corresponding conserved charge into the VQD framework. This results in dimension reduction, significantly enhancing the efficiency of excited-state computations. We present benchmark results with GPU-accelerated simulations using systems up to 24 qubits, showcasing applications in high-energy physics, nuclear physics, and quantum chemistry. This work is performed on NERSC's Perlmutter system using NVIDIA's open-source platform for accelerated quantum supercomputing - CUDA-Q.