A simple method for seniority-zero quantum state preparation

• URL: http://arxiv.org/abs/2508.21679v1
• Date: Fri, 29 Aug 2025 14:47:45 GMT
• Title: A simple method for seniority-zero quantum state preparation
• Authors: Michal Krompiec, Josh J. M. Kirsopp, Antonio Márquez Romero, Vicente Perez Soloviev,
• Abstract summary: We show that an orbital-optimized paired Cluster Doubles (oo-pCCD) method can describe the static correlation features of many strongly correlated singlet states.<n>We demonstrate that substituting leading oo-pCCD amplitudes into the UpCCD Ansatz allows to prepare high-fidelity singlet states for models of multiple-bond dissociation in ethene, ethyne and dinitrogen.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum Phase Estimation (QPE), the quantum algorithm for estimating eigenvalues of a given Hermitian matrix and preparing its eigenvectors, is considered the most promising approach to finding the ground states and their energies of electronic systems using a quantum computer. It requires, however, to be warm--started from an initial state with sufficiently high overlap with the ground state. For strongly-correlated states, where QPE is expected to have advantage over classical methods, preparation of such initial states requires deep quantum circuits and/or expensive hybrid quantum-classical optimization. It is well-known that orbital-optimized paired Coupled Cluster Doubles (oo-pCCD) method can describe the static correlation features of many strongly correlated singlet states. We show that pCCD and its unitary counterpart, UpCCD, become equivalent in the limit of small amplitudes if the amplitude matrix is sufficiently sparse. We demonstrate that substituting leading oo-pCCD amplitudes into the UpCCD Ansatz allows to prepare high-fidelity singlet states for models of multiple-bond dissociation in ethene, ethyne and dinitrogen, as well as for 1D Hubbard models at half-filling, with very shallow circuits. We envisage our method to be of general use for approximate preparation of singlet states for Quantum Phase Estimation and related algorithms.

Related papers

• Excited state preparation on a quantum computer through adiabatic light-matter coupling [0.0]
  We describe adiabatic state preparation technique for low-lying excited states using the explicit coupling between electrons and photons.<n>Our approach converges to the first optically accessible excited state and can target different symmetry sectors by changing the photon polarization.
  arXiv  Detail & Related papers  (2025-11-27T10:54:27Z)
• 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)
• Entanglement renormalization circuits for $2d$ Gaussian Fermion States [0.0]
  This work introduces a quantum circuit compression algorithm for Gaussian fermion states based on the multi-scale entanglement renormalization ansatz (MERA)<n>The algorithm is shown to accurately capture area-law entangled states including topologically trivial insulators, Chern insulators, and critical Dirac semimetals.<n>We also develop a novel fermion-to-qubit encoding scheme, based on an expanding $2d$ topological order, that enables implementing fermionic rotations via qubit Pauli rotations with constant Pauli weight independent of system size.
  arXiv  Detail & Related papers  (2025-06-04T17:44:17Z)
• Bayesian Quantum Amplitude Estimation [49.1574468325115]
  We present BAE, a problem-tailored and noise-aware Bayesian algorithm for quantum amplitude estimation.<n>In a fault tolerant scenario, BAE is capable of saturating the Heisenberg limit; if device noise is present, BAE can dynamically characterize it and self-adapt.<n>We propose a benchmark for amplitude estimation algorithms and use it to test BAE against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• 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)
• Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation [39.20075231137991]
  We investigate the feasibility of early fault-tolerant quantum algorithms focusing on ground-state energy estimation problems.<n> scaling these methods to larger system sizes reveals three key challenges: the smoothness of the CDF for large supports, the lack of tight lower bounds on the overlap with the true ground state, and the difficulty of preparing high-quality initial states.
  arXiv  Detail & Related papers  (2024-05-06T18:00:03Z)
• Capturing many-body correlation effects with quantum and classical computing [40.7853309684189]
  We show the efficiency of Quantum Phase Estor (QPE) in identifying core-level states relevant to x-ray photoelectron spectroscopy. We compare and validate the QPE predictions with exact diagonalization and real-time equation-of-motion coupled cluster formulations.
  arXiv  Detail & Related papers  (2024-02-18T01:26:45Z)
• 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)
• Probing Quantum Efficiency: Exploring System Hardness in Electronic Ground State Energy Estimation [0.0]
  We consider the question of how correlated the system hardness is between classical algorithms of electronic structure theory and quantum algorithms. For quantum algorithms, we have selected the Variational Quantum Eigensolver (VQE) and Quantum Phase Estimation (QPE) methods.
  arXiv  Detail & Related papers  (2023-10-31T20:07:15Z)
• Quantum Thermal State Preparation [39.91303506884272]
  We introduce simple continuous-time quantum Gibbs samplers for simulating quantum master equations. We construct the first provably accurate and efficient algorithm for preparing certain purified Gibbs states. Our algorithms' costs have a provable dependence on temperature, accuracy, and the mixing time.
  arXiv  Detail & Related papers  (2023-03-31T17:29:56Z)
• Sparse random Hamiltonians are quantumly easy [105.6788971265845]
  A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state. Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
  arXiv  Detail & Related papers  (2023-02-07T10:57:36Z)
• 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)

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.