Adaptive identification of low-degree polynomials in quantum singular value transformation: application to nonlinear quantum properties estimation

• URL: http://arxiv.org/abs/2606.10994v1
• Date: Tue, 09 Jun 2026 15:28:24 GMT
• Title: Adaptive identification of low-degree polynomials in quantum singular value transformation: application to nonlinear quantum properties estimation
• Abstract summary: Estimating properties of unknown quantum states via quantum singular value transformation (QSVT) often requires high-degrees to handle small eigenvalues.<n>We propose a spectral cutoff method that truncates the negligible eigenvalue depending on the task, the target accuracy, and the state.<n>This two-stage algorithm significantly improves the overall estimation cost compared to known bounds.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Estimating properties of unknown quantum states via quantum singular value transformation (QSVT) often requires high-degree polynomials to handle small eigenvalues of density matrices. Specifically, the existing approaches determine the polynomial degree by relying on overly conservative worst-case bounds based on the minimum non-zero eigenvalue or the rank of the density matrices. In this work, we propose a spectral cutoff method that truncates the negligible eigenvalue tail depending on the task, the target accuracy, and the state, which enables the use of significantly lower-degree polynomials. To implement this, we develop a two-stage algorithm to estimate nonlinear properties, particularly von Neumann entropy and R{é}nyi entropy. In the first stage, we execute a search algorithm to identify the spectral cutoff directly from the unknown quantum state. In the second stage, we estimate the nonlinear properties utilizing QSVT with the degree of polynomial adaptively determined by the cutoff. This two-stage algorithm significantly improves the overall estimation cost compared to known bounds, even without knowing the minimum eigenvalue or the rank.

Related papers

• Improved Measurement Cost Scaling in the Nonorthogonal Quantum Eigensolver [1.6328866317851187]
  We study a bottleneck for the nonorthogonal quantum eigensolver (NOQE)<n>We show that, after overlap thresholding, the eigenvalue sensitivity is controlled by the condition number of the retained overlap matrix.<n>Experiments on hydrogen chains and rings suggest that, in practice, the measurement cost of structured NOQE instances can grow even more slowly than this linear bound.
  arXiv  Detail & Related papers  (2026-08-13T05:05:55Z)
• Matrix encoding method in variational algorithm of calculating eigenvalues and generalized eigenvalues [51.97380440677861]
  We propose a variational method for constructing the eigenvalues and generalized eigenvalues for an arbitrary $Ntimes N$ complex matrix.<n>The quantum part of our algorithm is based on encoding the matrix elements into the pure state of a quantum system.
  arXiv  Detail & Related papers  (2026-05-07T12:52:34Z)
• High-Rate Quantized Matrix Multiplication: Theory and Practice [29.75700570685703]
  This work investigates the problem of quantized matrix multiplication (MatMul)<n>We consider two settings: 1) Generic MatMul, where both matrices must be quantized (weight+ quantization); and 2) weight-only quantization, where the second matrix is only known through covariance matrix $_X$ of its columns.
  arXiv  Detail & Related papers  (2026-01-23T21:32:44Z)
• Polynomial-time certification of fidelity for many-body mixed states and mixed-state universality classes [23.9304612104967]
  We introduce a-time algorithm to compute certified lower and upper bounds for fidelity between matrix product density operators.<n>Our results offer an exponential improvement in precision over known moment-based bounds.
  arXiv  Detail & Related papers  (2026-01-19T19:13:28Z)
• Heisenberg limited multiple eigenvalue estimation via off-the-grid compressed sensing [0.0]
  Quantum phase estimation is the flagship algorithm for quantum simulation on fault-tolerant quantum computers.<n>We demonstrate that an emphoff-grid compressed sensing protocol, combined with a state-of-the-art signal classification method, enables the simultaneous estimation of multiple eigenvalues.<n>We argue that this algorithm may offer a potential quantum advantage by analyzing its resilience with respect to the quality of the initial input state.
  arXiv  Detail & Related papers  (2025-07-16T17:27:01Z)
• Quantum algorithm for solving generalized eigenvalue problems with application to the Schrödinger equation [0.0]
  Estimating excited-state energies is challenging for classical algorithms due to exponential scaling with system size.<n>We present a quantum algorithm for estimating eigenvalues and singular values of parameterized matrix families.
  arXiv  Detail & Related papers  (2025-06-16T14:24:30Z)
• Matrix encoding method in variational quantum singular value decomposition [49.494595696663524]
  We propose the variational quantum singular value decomposition based on encoding the elements of the considered $Ntimes N$ matrix into the state of a quantum system of appropriate dimension.<n> Controlled measurement is involved to avoid small success in ancilla measurement.
  arXiv  Detail & Related papers  (2025-03-19T07:01:38Z)
• Resolvent-based quantum phase estimation: Towards estimation of parametrized eigenvalues [0.0]
  We propose a novel approach for estimating the eigenvalues of non-normal matrices.<n>We construct the first efficient algorithm for estimating the phases of the unimodular eigenvalues of a given non-unitary matrix.<n>We then construct an efficient algorithm for estimating the real eigenvalues of a given non-Hermitian matrix.
  arXiv  Detail & Related papers  (2024-10-07T08:51:05Z)
• Quantum eigenvalue processing [0.0]
  Problems in linear algebra can be solved on a quantum computer by processing eigenvalues of the non-normal input matrices. We present a Quantum EigenValue Transformation (QEVT) framework for applying arbitrary transformations on eigenvalues of block-encoded non-normal operators. We also present a Quantum EigenValue Estimation (QEVE) algorithm for operators with real spectra.
  arXiv  Detail & Related papers  (2024-01-11T19:49:31Z)
• Quantum speedups for stochastic optimization [18.32349609443295]
  We consider the problem of minimizing a continuous function given quantumvitzvariance to an oracle. We provide two new methods for the special case of minimizing a Lipsch avvitz function.
  arXiv  Detail & Related papers  (2023-08-03T07:39:10Z)
• Analyzing Prospects for Quantum Advantage in Topological Data Analysis [35.423446067065576]
  We analyze and optimize an improved quantum algorithm for topological data analysis. We show that super-quadratic quantum speedups are only possible when targeting a multiplicative error approximation. We argue that quantum circuits with tens of billions of Toffoli can solve seemingly classically intractable instances.
  arXiv  Detail & Related papers  (2022-09-27T17:56:15Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Fundamental Limits of Ridge-Regularized Empirical Risk Minimization in High Dimensions [41.7567932118769]
  Empirical Risk Minimization algorithms are widely used in a variety of estimation and prediction tasks. In this paper, we characterize for the first time the fundamental limits on the statistical accuracy of convex ERM for inference.
  arXiv  Detail & Related papers  (2020-06-16T04:27:38Z)

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.