Let the Qudit Do the Jacobi: A Structured Quantum Algorithm for Spectral Decomposition

• URL: http://arxiv.org/abs/2607.13244v1
• Date: Tue, 14 Jul 2026 20:14:44 GMT
• Title: Let the Qudit Do the Jacobi: A Structured Quantum Algorithm for Spectral Decomposition
• Abstract summary: We develop a qudit-native quantum realization of the Jacobi diagonalization algorithm for unknown unitary operators.<n>The proposed framework avoids explicit reconstruction of the operator and controlled-unitary operations.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Jacobi diagonalization is a long-established numerical algorithm for the spectral decomposition of Hermitian and, more generally, normal matrices. In this work, we develop a qudit-native quantum realization of the Jacobi diagonalization algorithm for unknown unitary operators. The proposed framework avoids explicit reconstruction of the operator and controlled-unitary operations. Each elementary two-parameter Givens rotation is implemented through two sequential single-parameter quantum variational optimizations that are directly accessible experimentally. An interferometric protocol is further introduced for extracting the eigenvalues of the diagonalized unitary, up to an overall global phase. Numerical simulations on ensembles of Haar-random unitary matrices demonstrate that the proposed algorithm preserves the characteristic convergence behavior of the classical Jacobi method and exhibits the expected quadratic scaling in the number of elementary operations with the dimension $d$, comparable to its classical counterpart. The results establish the proposed algorithm as a structured quantum numerical linear algebra algorithm naturally suited to qudit architectures and provide a bridge between classical iterative matrix algorithms and their quantum realizations.

Related papers

• Quantum algorithms for the fractional Poisson equation via rational approximation [20.497126318288906]
  We present a quantum algorithm for solving the fractional equation ((-)s u = f) with (s in (0,1)) on bounded domains.<n>The proposed approach combines rational approximation techniques with quantum linear system solvers to achieve exponential quantum advantage.
  arXiv  Detail & Related papers  (2026-04-01T08:08:33Z)
• Block encoding of sparse matrices with a periodic diagonal structure [67.45502291821956]
  We provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure.<n>Various applications for the presented methodology are discussed in the context of solving differential problems.
  arXiv  Detail & Related papers  (2026-02-11T07:24:33Z)
• An Introduction to the Quantum Approximate Optimization Algorithm [51.56484100374058]
  The tutorial begins by outlining variational quantum circuits and QUBO problems.<n>Next, it explores the QAOA in detail, covering its Hamiltonian formulation, gate decomposition, and example applications.<n>The tutorial extends these concepts to higher-order Hamiltonians and discussing the associated symmetries and circuit construction.
  arXiv  Detail & Related papers  (2025-11-23T09:54:20Z)
• Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things [0.6138671548064355]
  We present a novel framework for Linear Combination of Unitaries (LCU)-style decomposition tailored to structured sparse matrices.<n>LCU is a foundational primitive in both variational and fault-tolerant quantum algorithms.<n>We introduce the Sigma basis, a compact set of simple, non-unitary operators that can better capture sparsity and structure.
  arXiv  Detail & Related papers  (2025-07-04T17:05:07Z)
• Controlled measurement, Hermitian conjugation and normalization in matrix-manipulation algorithms [46.13392585104221]
  We introduce the concept of controlled measurement that solves the problem of small access probability to the desired state of ancilla.<n>Separate encoding of the real and imaginary parts of a complex matrix allows to include the Hermitian conjugation into the list of matrix manipulations.<n>We weaken the constraints on the absolute values of matrix elements unavoidably imposed by the normalization condition for a pure quantum state.
  arXiv  Detail & Related papers  (2025-03-27T08:49:59Z)
• Fast Expectation Value Calculation Speedup of Quantum Approximate Optimization Algorithm: HoLCUs QAOA [55.2480439325792]
  We present a new method for calculating expectation values of operators that can be expressed as a linear combination of unitary (LCU) operators.<n>This method is general for any quantum algorithm and is of particular interest in the acceleration of variational quantum algorithms.
  arXiv  Detail & Related papers  (2025-03-03T17:15:23Z)
• General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory [44.99833362998488]
  We introduce quantum algorithms that can efficiently simulate certain classes of interactions consisting of correlated changes in multiple quantum numbers. The lattice gauge theory studied is the SU(2) gauge theory in 1+1 dimensions coupled to one flavor of staggered fermions. The algorithms are shown to be applicable to higher-dimensional theories as well as to other Abelian and non-Abelian gauge theories.
  arXiv  Detail & Related papers  (2022-12-28T18:56:25Z)
• Classical and Quantum Iterative Optimization Algorithms Based on Matrix Legendre-Bregman Projections [1.5736899098702972]
  We consider Legendre-Bregman projections defined on the Hermitian matrix space and design iterative optimization algorithms based on them. We study both exact and approximate Bregman projection algorithms. In particular, our approximate iterative algorithm gives rise to the non-commutative versions of the generalized iterative scaling (GIS) algorithm for maximum entropy inference.
  arXiv  Detail & Related papers  (2022-09-28T15:59:08Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Preentangling Quantum Algorithms -- the Density Matrix Renormalization Group-assisted Quantum Canonical Transformation [0.0]
  We propose the use of parameter-free preentanglers as initial states for quantum algorithms. We find this strategy to require significantly less parameters than corresponding generalized unitary coupled cluster circuits.
  arXiv  Detail & Related papers  (2022-09-15T07:35:21Z)
• Quantum-Inspired Algorithms from Randomized Numerical Linear Algebra [53.46106569419296]
  We create classical (non-quantum) dynamic data structures supporting queries for recommender systems and least-squares regression. We argue that the previous quantum-inspired algorithms for these problems are doing leverage or ridge-leverage score sampling in disguise.
  arXiv  Detail & Related papers  (2020-11-09T01:13:07Z)
• Quantum Algorithm for a Convergent Series of Approximations towards the Exact Solution of the Lowest Eigenstates of a Hamiltonian [1.8895156959295205]
  We present quantum algorithms for Hamiltonians of linear combinations of local unitary operators. The algorithms implement a convergent series of approximations towards the exact solution of the full CI (configuration interaction) problem.
  arXiv  Detail & Related papers  (2020-09-08T06:16:07Z)
• Multi-View Spectral Clustering with High-Order Optimal Neighborhood Laplacian Matrix [57.11971786407279]
  Multi-view spectral clustering can effectively reveal the intrinsic cluster structure among data. This paper proposes a multi-view spectral clustering algorithm that learns a high-order optimal neighborhood Laplacian matrix. Our proposed algorithm generates the optimal Laplacian matrix by searching the neighborhood of the linear combination of both the first-order and high-order base.
  arXiv  Detail & Related papers  (2020-08-31T12:28:40Z)

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.