Quantum State Preparation Of Multiconfigurational States For Quantum Chemistry

• URL: http://arxiv.org/abs/2508.05390v1
• Date: Thu, 07 Aug 2025 13:40:59 GMT
• Title: Quantum State Preparation Of Multiconfigurational States For Quantum Chemistry
• Authors: Gabriel Greene-Diniz, Georgia Prokopiou, David Zsolt Manrique, David Muñoz Ramo,
• Abstract summary: We implement and investigate two methods of quantum circuit preparation for multiconfigurational states for quantum chemical applications.<n>We implement a method to automatically find the external controls required for utilizing Givens rotations to prepare multiconfigurational states on a quantum circuit.<n>We demonstrate the benefits of these techniques in a range of applications, including the ground states of a strongly correlated molecule.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The ability to prepare states for quantum chemistry is a promising feature of quantum computers, and efficient techniques for chemical state preparation is an active area of research. In this paper, we implement and investigate two methods of quantum circuit preparation for multiconfigurational states for quantum chemical applications. It has previously been shown that controlled Givens rotations are universal for quantum chemistry. To prepare a selected linear combination of Slater determinants (represented as occupation number configurations) using Givens rotations, the gates that rotate between the reference and excited determinants need to be controlled on qubits outside the excitation (external controls), in general. We implement a method to automatically find the external controls required for utilizing Givens rotations to prepare multiconfigurational states on a quantum circuit. We compare this approach to an alternative technique that exploits the sparsity of the chemical state vector and find that the latter can outperform the method of externally controlled Givens rotations; highly reduced circuits can be obtained by taking advantage of the sparse nature (where the number of basis states is significantly less than 2$^{n_q}$ for $n_q$ qubits) of chemical wavefunctions. We demonstrate the benefits of these techniques in a range of applications, including the ground states of a strongly correlated molecule, matrix elements of the Q-SCEOM algorithm for excited states, as well as correlated initial states for a quantum subspace method based on quantum computed moments and quantum phase estimation.

Related papers

• Exponential quantum speedups in quantum chemistry with linear depth [0.0]
  We prove a connection to particle number conserving matchgate circuits with fermionic magic state inputs.<n>We apply this result to quantum multi-reference methods designed for near-term hardware.<n>We discuss the implications for achieving exponential quantum advantage in quantum chemistry on near-term hardware.
  arXiv  Detail & Related papers  (2025-03-26T23:15:32Z)
• Quantum-selected configuration interaction with time-evolved state [0.0]
  Quantum-selected configuration interaction (QSCI) utilizes an input quantum state on a quantum device to select important bases.<n>We propose using a time-evolved state by the target Hamiltonian as an input of QSCI.<n>We numerically investigate the accuracy of the energy obtained by the proposed method for quantum chemistry Hamiltonians.
  arXiv  Detail & Related papers  (2024-12-18T13:33:16Z)
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [39.58317527488534]
  We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
  arXiv  Detail & Related papers  (2024-11-25T20:33:47Z)
• Solving an Industrially Relevant Quantum Chemistry Problem on Quantum Hardware [31.15746974078601]
  We calculate the lowest energy eigenvalue of active space Hamiltonians of industrially relevant and strongly correlated metal chelates on trapped ion quantum hardware. We are able to achieve chemical accuracy by training a variational quantum algorithm on quantum hardware, followed by a classical diagonalization in the subspace of states measured as outputs of the quantum circuit.
  arXiv  Detail & Related papers  (2024-08-20T12:50:15Z)
• Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers [37.69303106863453]
  We propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers. Our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28% and 57% on average.
  arXiv  Detail & Related papers  (2024-06-17T14:10:10Z)
• Simulating electronic structure on bosonic quantum computers [34.84696943963362]
  We propose an approach to map the electronic Hamiltonian into a qumode bosonic problem that can be solved on bosonic quantum devices.<n>This work establishes a new pathway for simulating many-fermion systems, highlighting the potential of hybrid qubit-qumode quantum devices.
  arXiv  Detail & Related papers  (2024-04-16T02:04:11Z)
• Enhanced quantum state transfer: Circumventing quantum chaotic behavior [35.74056021340496]
  We show how to transfer few-particle quantum states in a two-dimensional quantum network. Our approach paves the way to short-distance quantum communication for connecting distributed quantum processors or registers.
  arXiv  Detail & Related papers  (2024-02-01T19:00:03Z)
• ADAPT-QSCI: Adaptive Construction of an Input State for Quantum-Selected Configuration Interaction [0.0]
  We present a quantum-classical hybrid algorithm for calculating the ground state and its energy of the quantum many-body Hamiltonian.<n>We numerically illustrate that our method, dubbed ADAPT-QSCI, can yield accurate ground-state energies for small molecules.
  arXiv  Detail & Related papers  (2023-11-02T09:15:50Z)
• 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)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Quantum Phases of Matter on a 256-Atom Programmable Quantum Simulator [41.74498230885008]
  We demonstrate a programmable quantum simulator based on deterministically prepared two-dimensional arrays of neutral atoms. We benchmark the system by creating and characterizing high-fidelity antiferromagnetically ordered states. We then create and study several new quantum phases that arise from the interplay between interactions and coherent laser excitation.
  arXiv  Detail & Related papers  (2020-12-22T19:00: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)
• 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.