Efficient classical representation and quantum state preparation of complete active space wavefunctions

• URL: http://arxiv.org/abs/2606.19457v2
• Date: Sun, 21 Jun 2026 15:56:46 GMT
• Title: Efficient classical representation and quantum state preparation of complete active space wavefunctions
• Abstract summary: Quantum computers promise to solve the electronic structure problem for a large class of molecules.<n>For classically challenging molecules with strong electron correlation, starting from multi-reference states, such as complete active space (CAS) wavefunctions is necessary.<n>Here, we show that there exists an efficient classical representation of CAS states and to design a new state preparation routine outperforming previous ones.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computers promise to solve the electronic structure problem for a large class of molecules. However, the performance of relevant quantum algorithms hinges on preparing initial states with substantial overlap with the target eigenvector. For classically challenging molecules with strong electron correlation, starting from multi-reference states, such as complete active space (CAS) wavefunctions is necessary. Unfortunately, the most advanced state preparation protocols applied to such states result in a gate complexity that scales exponentially with the active space size $d$. In fact, even encoding a CAS state classically is traditionally believed to be intractable for chemically relevant systems. Here, we draw insights from the recently introduced Quantum Paldus Transform (QPT) to show that there exists an efficient classical representation of CAS states and to design a new state preparation routine outperforming previous ones. The QPT represents a transformation from the Fock basis to a friendlier symmetry-adapted basis. Our main contribution consists in showing that CAS states expanded in this basis can efficiently be represented as a matrix product state (MPS) with a bond dimension scaling as $O(d^2)$. One can then efficiently load the MPS on a quantum computer and use the inverse QPT to transform the state to the Fock basis. Moreover, our method can easily be extended to the efficient preparation of CAS states in first quantisation with similar complexity. Crucially, we demonstrate that the complexity of both state preparation protocols only grows polynomially as $O(d^3)$ , which constitutes to the best of our knowledge an exponential improvement over the state of the art.

Related papers

• Preparation of initial states with open and periodic boundary conditions on quantum devices using matrix product states [1.2114406358819847]
  We present a framework for preparing quantum states from matrix product states (MPS) with open and periodic boundary conditions on quantum devices.<n>States with periodic boundary conditions (pbc) can be represented efficiently as quantum circuits using ancilla qubits and post-selection after measurement.<n>Our approach provides a scalable method for preparing states on a quantum device, enabling efficient simulations of strongly correlated systems on near-term quantum computers.
  arXiv  Detail & Related papers  (2025-10-08T15:19:33Z)
• Qumode-Based Variational Quantum Eigensolver for Molecular Excited States [43.148034499498586]
  We introduce the Qumode Subspace Variational Quantum Eigensolver (QSS-VQE), a hybrid quantum-classical algorithm for computing molecular excited states.<n>We demonstrate the performance of QSS-VQE through simulations of molecular excited states, including dihydrogen and a conical intersection in cytosine.
  arXiv  Detail & Related papers  (2025-09-05T00:53:51Z)
• Quantum Homogenization as a Quantum Steady State Protocol on NISQ Hardware [42.52549987351643]
  Quantum homogenization is a reservoir-based quantum state approximation protocol.<n>We extend the standard quantum homogenization protocol to the dynamically-equivalent ($mathttSWAP$)$alpha$ formulation.<n>We show that our proposed protocol yields a completely positive, trace preserving (CPTP) map under which the code subspace is correctable.
  arXiv  Detail & Related papers  (2024-12-19T05:50:54Z)
• Mixed-Dimensional Qudit State Preparation Using Edge-Weighted Decision Diagrams [3.393749500700096]
  Quantum computers have the potential to solve intractable problems. One key element to exploiting this potential is the capability to efficiently prepare quantum states for multi-valued, or qudit, systems. In this paper, we investigate quantum state preparation with a focus on mixed-dimensional systems.
  arXiv  Detail & Related papers  (2024-06-05T18:00:01Z)
• Thermalization and Criticality on an Analog-Digital Quantum Simulator [133.58336306417294]
  We present a quantum simulator comprising 69 superconducting qubits which supports both universal quantum gates and high-fidelity analog evolution. We observe signatures of the classical Kosterlitz-Thouless phase transition, as well as strong deviations from Kibble-Zurek scaling predictions. We digitally prepare the system in pairwise-entangled dimer states and image the transport of energy and vorticity during thermalization.
  arXiv  Detail & Related papers  (2024-05-27T17:40:39Z)
• Quantum Generative Diffusion Model: A Fully Quantum-Mechanical Model for Generating Quantum State Ensemble [40.06696963935616]
  We introduce Quantum Generative Diffusion Model (QGDM) as their simple and elegant quantum counterpart. QGDM exhibits faster convergence than Quantum Generative Adversarial Network (QGAN) It can achieve 53.02% higher fidelity in mixed-state generation than QGAN.
  arXiv  Detail & Related papers  (2024-01-13T10:56:34Z)
• Sparse Quantum State Preparation for Strongly Correlated Systems [0.0]
  In principle, the encoding of the exponentially scaling many-electron wave function onto a linearly scaling qubit register offers a promising solution to overcome the limitations of traditional quantum chemistry methods. An essential requirement for ground state quantum algorithms to be practical is the initialisation of the qubits to a high-quality approximation of the sought-after ground state. Quantum State Preparation (QSP) allows the preparation of approximate eigenstates obtained from classical calculations, but it is frequently treated as an oracle in quantum information.
  arXiv  Detail & Related papers  (2023-11-06T18:53:50Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Orbital Expansion Variational Quantum Eigensolver: Enabling Efficient Simulation of Molecules with Shallow Quantum Circuit [0.5541644538483947]
  Variational Quantum Eigensolver (VQE) is a promising method to study ground state properties in quantum chemistry, materials science, and condensed physics. Here, we propose an Orbital Expansion VQE(OE-VQE) framework to construct an efficient convergence path. The path starts from a highly correlated compact active space and rapidly expands and converges to the ground state, enabling ground states with much shallower quantum circuits.
  arXiv  Detail & Related papers  (2022-10-13T10:47:01Z)
• Quantum Davidson Algorithm for Excited States [42.666709382892265]
  We introduce the quantum Krylov subspace (QKS) method to address both ground and excited states. By using the residues of eigenstates to expand the Krylov subspace, we formulate a compact subspace that aligns closely with the exact solutions. Using quantum simulators, we employ the novel QDavidson algorithm to delve into the excited state properties of various systems.
  arXiv  Detail & Related papers  (2022-04-22T15:03:03Z)
• Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
  We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves. We find both methods provide good estimates of the energy and ground state. gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
  arXiv  Detail & Related papers  (2020-11-02T19:52:04Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)
• Efficient State Preparation for Quantum Amplitude Estimation [0.951828574518325]
  Quantum Amplitude Estimation can achieve a quadratic speed-up for applications classically solved by Monte Carlo simulation. Currently known efficient techniques require problems based on log-concave probability distributions, involve learning an unknown distribution from empirical data, or fully rely on quantum arithmetic. We introduce an approach to simplify state preparation, together with a circuit optimization technique, both of which can help reduce the circuit complexity for QAE state preparation significantly.
  arXiv  Detail & Related papers  (2020-05-15T18:00:01Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.