Eigenstate Preparation Through Near-Optimal Eigenprobability Filtering

• URL: http://arxiv.org/abs/2608.12297v1
• Date: Wed, 12 Aug 2026 17:39:15 GMT
• Title: Eigenstate Preparation Through Near-Optimal Eigenprobability Filtering
• Abstract summary: We introduce the Dominant Eigenstate Filtering via Eigenprobability Amplification and Thresholding (DEFEAT) algorithm.<n>DEFEAT identifies and filters the eigenstate with the largest overlap with the supplied initial state.<n>Our results provide a general eigenvalue-agnostic primitive for dominant eigenstate filtering and preparation, and for estimating properties of dominant eigenstates.
• Score: 3.2651468573861524
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum simulation is expected to be a main application of quantum computers with realistic utility in quantum chemistry, materials science and beyond. However, preparing excited or general eigenstates is a central challenge, particularly when the desired eigenvalue is not known in advance, or when the overlap with the initial state is insufficient. We introduce the Dominant Eigenstate Filtering via Eigenprobability Amplification and Thresholding (DEFEAT) algorithm that identifies and filters the eigenstate with the largest overlap with the supplied initial state. Our key observation is that we do not need prior knowledge of the target eigenvalue, as we construct efficient twirling superoperators that map initial states to eigenprobability density operators $ρ$, diagonal in the Hamiltonian eigenbasis and encoding its spectral weights, alongside its block-encoding implementation. Our crucial innovation is the quadratic amplification of probabilities via the factorisation $ρ=ρ_{\rm sqrt}^\daggerρ_{\rm sqrt}$, analogous to the recently introduced sum-of-squares spectral amplification (SOSSA), which we use here to amplify the separation between dominant and subdominant components. Thresholding then yields the dominant-eigenstate projector. Compared with conventional phase estimation, DEFEAT improves the dependence on the overlap with the initial state while requiring substantially fewer ancillary qubits. We prove that the query complexity of the filtering step is optimal up to logarithmic factors and establish a complementary lower bound for eigenstate preparation under purified query access to $ρ$. We validate in numerical simulations that the convergence rate of DEFEAT matches our theoretical results. Our results provide a general eigenvalue-agnostic primitive for dominant eigenstate filtering and preparation, and for estimating properties of dominant eigenstates.

Related papers

• Interpretable Activation-Selection Neural Networks for Symbolic Regression of Parameter-Dependent Hamiltonian Eigenvalues [45.88028371034407]
  We introduce an activation-selection network (ASN), a differentiable symbolic-regression architecture.<n>Each input node learns a sparse combination of predefined analytical functions, and the trained network can be converted directly into an explicit expression.<n>We apply the ASN to effective three- and four-site spin-chain Hamiltonians relevant to zero-quantum nuclear magnetic resonance.
  arXiv  Detail & Related papers  (2026-08-26T07:45:10Z)
• Diagnosing quantum reservoirs at scale based on expressivity and coverage [42.13843953705695]
  Quantum reservoirs offer a hardware-friendly route to quantum machine learning.<n>Because the reservoir is not optimized, performance depends entirely on the choice of reservoir family.<n>We introduce a scalable, hardware-agnostic framework built on two complementary quantities.
  arXiv  Detail & Related papers  (2026-07-10T14:16:13Z)
• Fault tolerant computation of the static structure factor and finite size effects [43.936586633107396]
  We develop a quantum post-processing strategy for the leading two-body finite-size correction.<n>After one-body shell effects are reduced by twist averaging, the dominant residual error is controlled by long-wavelength density fluctuations.<n>We also introduce adaptive global and local binary search procedures for identifying the infrared fitting window used to reconstruct the two-body finite size error correction.
  arXiv  Detail & Related papers  (2026-06-26T05:31:08Z)
• Quantum principal component analysis without eigenvector recovery [9.811303336285961]
  We introduce a measurement-based soft PCA framework replacing the hard top-$k$ projector with an entropy-regularized Fermi--Dirac filter.<n>This filter has a direct interpretation as a quantum measurement, which naturally suggests a quantum approach.<n>For new inputs, the same quantum circuit yields soft principal subspace scores, spectral energy profiles, and postselected filtered states.
  arXiv  Detail & Related papers  (2026-05-27T04:27:47Z)
• Standard Quantum Phase Estimation Detects All Eigenvalues via Randomized Initial States [0.0]
  The output distribution of standard QPE can be written as a superposition of Fejér kernels weighted by the squared overlaps with the eigenmodes.<n>We establish a rigorous peak-detection theory and derive a sufficient shot-count estimate for detecting all peaks.
  arXiv  Detail & Related papers  (2026-04-01T04:38:41Z)
• Filtered Spectral Projection for Quantum Principal Component Analysis [1.2318267573115809]
  Filtered Spectral Projection Algorithm (FSPA)<n>For amplitude-encoded centered data, the ensemble density matrix $=sum_i p_i|_iranglelangle_i|$ coincides with the covariance matrix.<n>For uncentered data, $$ corresponds to PCA without centering, and we derive eigenvalue interlacing bounds quantifying the deviation from standard PCA.
  arXiv  Detail & Related papers  (2026-03-13T11:55:39Z)
• Deterministic Ground State Preparation via Power-Cosine Filtering of Time Evolution Operators [0.0]
  We propose a non-variational protocol for ground state preparation using a Power-Cosine quantum signal processing filter.<n>By eschewing complex block-encoding techniques, our method directly utilizes coherent time-evolution operators controlled by a single ancillary qubit.
  arXiv  Detail & Related papers  (2026-02-23T07:01:30Z)
• Improving Expressive Power of Spectral Graph Neural Networks with Eigenvalue Correction [55.57072563835959]
  We propose an eigenvalue correction strategy that can free filters from the constraints of repeated eigenvalue inputs.<n>Concretely, the proposed eigenvalue correction strategy enhances the uniform distribution of eigenvalues, and improves the fitting capacity and expressive power of filters.
  arXiv  Detail & Related papers  (2024-01-28T08:12:00Z)
• Enhancing Scalability of Quantum Eigenvalue Transformation of Unitary Matrices for Ground State Preparation through Adaptive Finer Filtering [0.13108652488669736]
  Hamiltonian simulation is a domain where quantum computers have the potential to outperform classical counterparts.<n>One of the main challenges of such quantum algorithms is increasing the system size.<n>We present an approach to improve the scalability of eigenspace filtering for the ground state preparation of a given Hamiltonian.
  arXiv  Detail & Related papers  (2024-01-17T09:52:24Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• Bayes-optimal limits in structured PCA, and how to reach them [21.3083877172595]
  We study the paradigmatic matrix model of principal components analysis (PCA), where a rank-one matrix is corrupted by additive noise. We provide the first characterization of the Bayes-optimal limits of inference in this model. We propose a novel approximate message passing algorithm (AMP), inspired by the theory of Adaptive Thouless-Anderson-Palmer equations.
  arXiv  Detail & Related papers  (2022-10-03T21:31:41Z)
• On the Convergence Rate of Projected Gradient Descent for a Back-Projection based Objective [58.33065918353532]
  We consider a back-projection based fidelity term as an alternative to the common least squares (LS) We show that using the BP term, rather than the LS term, requires fewer iterations of optimization algorithms.
  arXiv  Detail & Related papers  (2020-05-03T00:58:23Z)

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.