Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2605.06167

Matrix encoding method in variational algorithm of calculating eigenvalues and generalized eigenvalues

Alexander I. Zenchuk, Junde Wu

quant-phSubmitted May 7, 2026• Announced May 8, 2026• 0 citations
arXivHTMLPDF

Abstract

We propose a variational method for constructing the eigenvalues and generalized eigenvalues for an arbitrary $N\times N$ complex matrix. The quantum part of our algorithm is based on encoding the matrix elements into the pure state of a quantum system and expressing the loss function with optimization parameters in terms of certain probability amplitudes in the superposition state. The principal step of this algorithm is the measurement of the ancilla state that removes all extra terms from the above superposition and allows to probabilistically construct the required loss function along with its derivatives with respect to the optimization parameters. These output data are used to find the new values of optimization parameters for the next iteration of the loss function in the gradient optimization method. The depth and size of the circuit for this algorithm are, respectively, $O(N^2 \log N)$ and $O(\log N)$.

Comments
16 pages, 3 figures

Related papers

Matrix Encoding Method in Variational Quantum Singular Value Decomposition

Alexander Ivanovich Zenchuk, Wentao Qi, Junde Wu

Abstract We propose the variational quantum singular value decomposition based on encoding the elements of the considered N × N matrix into the state of a quantum system of appropriate dimension. This method doesn’t use the expansion of this matrix in terms of the unitary matrices. Controlled measurement is involved to avoid small success probability in ancilla measurement. The objective function for maximization algorithm can be obtained probabilistically via measurement of the states of two one-qubit subsystems. The circuit requires O (log N ) qubits for realization of this algorithm whose depths is proportional to log N / ε , where ε is the precision required for calculation of singular values.

arXiv:2504.02838•Quantum Information and Computation•Aug 1, 2025•1 citation

Resource-efficient Variational Compilation of Block-Encodings

Leon Rullkötter, Sebastian Weber, Vamshi M. Katukuri +2 more

Block-encoding operators are one of the essential components in quantum algorithms based on Quantum Signal Processing. Their gate complexity largely determines the overall gate complexity of the full algorithm. Using variational methods, we compile single-ancilla block-encoding unitaries with near-optimal resource requirements for a large range of input matrices. We find that the number of variational parameters in the parameterized quantum circuit approaches the number of free parameters in the input matrices, depending on whether they are real, complex and/or hermitian. Additionally, symmetries present in the input matrix can be incorporated into the ansatz circuit, reducing the parameter count further and enhancing optimizability. While performing a variational compilation of block-encodings ceases to be computationally feasible for large system sizes, the constructed operators can be used as components of larger block-encodings via a linear combination of block-encodings.

arXiv:2507.17658•Jul 23, 2025•5 citations

Algorithm for initializing a generalized fermionic Gaussian state on a quantum computer

Michael Kaicher, Simon B Jäger, Frank K. Wilhelm

Abstract We present explicit expressions for the central piece of a variational method developed by Shi et al (2018 Ann. Phys. 390 245) which extends variational wave functions that are efficiently computable on classical computers beyond mean-field to generalized Gaussian states. In particular, we derive iterative analytical expressions for the evaluation of expectation values of products of fermionic creation and annihilation operators in a Grassmann variable-free representation. Using this result we find a closed expression for the energy functional and its gradient of a general fermionic quantum many-body Hamiltonian. We present a simple gradient-descent-based algorithm that can be used as an optimization subroutine in combination with imaginary time evolution, which by construction guarantees a monotonic decrease of the energy in each iteration step. Due to the simplicity of the quantum circuit implementing the variational state ansatz, the results of the algorithms discussed here and in Shi et al ’s work could serve as an improved, beyond mean-field initial state in quantum computation.

arXiv:2105.13047•Journal of Physics A Mathematical and Theoretical•Aug 19, 2021•3 citations

Variational quantum algorithm for generalized eigenvalue problems and its application to the finite-element method

Yuki Sato, Hiroshi C Watanabe, Rudy Raymond +5 more

Generalized eigenvalue problems (GEPs) play an important role in the variety of fields including engineering, machine learning, and quantum chemistry. Especially, many problems in these fields can be reduced to finding the minimum or maximum eigenvalue of GEPs. One of the key problems to handle GEPs is that the memory usage and computational complexity explode as the size of the system of interest grows. This paper aims at extending sequential quantum optimizers for GEPs. Sequential quantum optimizers are a family of algorithms that iteratively solve the analytical optimization of single-qubit gates in a coordinate descent manner. The contribution of this paper is as follows. First, we formulate the GEP as the minimization or maximization problem of the fractional form of the expectations of two Hermitians. We then show that the fractional objective function can be analytically minimized or maximized with respect to a single-qubit gate by solving a GEP of a $4\ifmmode\times\else\texttimes\fi{}4$ matrix. Second, we show that a system of linear equations characterized by a positive-definite Hermitian can be formulated as a GEP and thus be attacked using the proposed method. Finally, we demonstrate two applications to important engineering problems formulated with the finite-element method. Through the demonstration, we have the following bonus finding; a problem having a real-valued solution can be solved more effectively using quantum gates generating a complex-valued state vector, which demonstrates the effectiveness of the proposed method.

arXiv:2302.12602•Physical Review A•Aug 28, 2023•17 citations

Remarks on controlled measurement and quantum algorithm for calculating Hermitian conjugate

Edward B. Fel’dman, Alexander Ivanovich Zenchuk, Wentao Qi +1 more

We present two new aspects for the recently proposed algorithms for matrix manipulating based on the special encoding the matrix elements into the superposition state of a quantum system. First aspect is the controlled measurement which allows to avoid the problem of small access probability to the required ancilla state at the final step of algorithms needed to remove the garbage of the states. Application of controlled measurement to the earlier developed algorithm is demonstrated. The second aspect is the algorithm for calculating the Hermitian conjugate of an arbitrary matrix, which supplements the algorithms proposed earlier. The appropriate circuits are presented.

arXiv:2501.16028•Jan 27, 2025•3 citations

Hermitian Matrix Function Synthesis without Block-Encoding

Anuradha Mahasinghe, Kaushika De Silva, Xavier Cadet +3 more

Implementing polynomial functions of Hermitian matrices on quantum hardware is a foundational task in quantum computing, critical for accurate Hamiltonian simulation, quantum linear system solving, high-fidelity state preparation, machine learning kernels, and other advanced quantum algorithms. Existing state-of-the-art techniques, including Qubitization, Quantum Singular Value Transformation (QSVT), and Quantum Signal Processing (QSP), rely heavily on block-encoding the Hermitian matrix. These methods are often constrained by the complexity of preparing the block-encoded state, the overhead associated with the required ancillary qubits, or the challenging problem of angle synthesis for the polynomial's phase factors, which limits the achievable circuit depth and overall efficiency. In this work, we propose a novel and resource-efficient approach to implement arbitrary polynomials of a Hermitian matrix by leveraging the Generalized Quantum Signal Processing (GQSP) framework. Our method circumvents the need for block-encoding and avoids the compounding post-selection overheads characteristic of LCU-based constructions, achieving a stable, degree-independent success probability. We derive closed-form expressions for symmetric polynomial expansions and demonstrate how linear combinations of GQSP circuits can realize the desired transformation. This approach reduces resource overhead and opens new pathways for quantum algorithm design for functions of Hermitian matrices, particularly in settings where the Hermitian operator arises naturally from symmetric combinations of unitaries.

quant-pharXiv:2512.18249•Dec 23, 2025•2 citations
We propose a variational method for constructing the eigenvalues and generalized eigenvalues for an arbitrary N×NN\times NN×N complex matrix. The quantum part of our algorithm is based on encoding the matrix elements into the pure state of a quantum system and expressing the loss function with optimization parameters in terms of certain probability amplitudes in the superposition state. The principal step of this algorithm is the measurement of the ancilla state
that removes all extra terms from the above superposition and allows to probabilistically construct the required loss function along with its derivatives with respect to the optimization parameters. These output data are used to find the new values of optimization parameters for the next iteration of the loss function in the gradient optimization method. The depth and size of the circuit for this algorithm are, respectively, O(N2log⁡N)O(N^2 \log N)O(N2logN) and O(log⁡N)O(\log N)O(logN).
Abstract We propose the variational quantum singular value decomposition based on encoding the elements of the considered N × N matrix into the state of a quantum system of appropriate dimension. This method doesn’t use the expansion of this matrix in terms of the unitary matrices. Controlled measurement is involved to avoid small success probability in ancilla measurement. The objective function for maximization algorithm can be obtained probabilistically via measurement of the states of two one-qubit subsystems. The circuit requires O (log N ) qubits for realization of this algorithm whose depths is proportional to log N / ε , where ε is the precision required for calculation of singular values.
Block-encoding operators are one of the essential components in quantum algorithms based on Quantum Signal Processing. Their gate complexity largely determines the overall gate complexity of the full algorithm. Using variational methods, we compile single-ancilla block-encoding unitaries with near-optimal resource requirements for a large range of input matrices. We find that the number of variational parameters in the parameterized quantum circuit approaches the number of free parameters in the input matrices, depending on whether they are real, complex and/or hermitian. Additionally, symmetries present in the input matrix can be incorporated into the ansatz circuit, reducing the parameter count further and enhancing optimizability. While performing a variational compilation of block-encodings ceases to be computationally feasible for large system sizes, the constructed operators can be used as components of larger block-encodings via a linear combination of block-encodings.
Abstract We present explicit expressions for the central piece of a variational method developed by Shi et al (2018 Ann. Phys. 390 245) which extends variational wave functions that are efficiently computable on classical computers beyond mean-field to generalized Gaussian states. In particular, we derive iterative analytical expressions for the evaluation of expectation values of products of fermionic creation and annihilation operators in a Grassmann variable-free representation. Using this result we find a closed expression for the energy functional and its gradient of a general fermionic quantum many-body Hamiltonian. We present a simple gradient-descent-based algorithm that can be used as an optimization subroutine in combination with imaginary time evolution, which by construction guarantees a monotonic decrease of the energy in each iteration step. Due to the simplicity of the quantum circuit implementing the variational state ansatz, the results of the algorithms discussed here and in Shi et al ’s work could serve as an improved, beyond mean-field initial state in quantum computation.
Generalized eigenvalue problems (GEPs) play an important role in the variety of fields including engineering, machine learning, and quantum chemistry. Especially, many problems in these fields can be reduced to finding the minimum or maximum eigenvalue of GEPs. One of the key problems to handle GEPs is that the memory usage and computational complexity explode as the size of the system of interest grows. This paper aims at extending sequential quantum optimizers for GEPs. Sequential quantum optimizers are a family of algorithms that iteratively solve the analytical optimization of single-qubit gates in a coordinate descent manner. The contribution of this paper is as follows. First, we formulate the GEP as the minimization or maximization problem of the fractional form of the expectations of two Hermitians. We then show that the fractional objective function can be analytically minimized or maximized with respect to a single-qubit gate by solving a GEP of a $4\ifmmode\times\else\texttimes\fi{}4$ matrix. Second, we show that a system of linear equations characterized by a positive-definite Hermitian can be formulated as a GEP and thus be attacked using the proposed method. Finally, we demonstrate two applications to important engineering problems formulated with the finite-element method. Through the demonstration, we have the following bonus finding; a problem having a real-valued solution can be solved more effectively using quantum gates generating a complex-valued state vector, which demonstrates the effectiveness of the proposed method.
We present two new aspects for the recently proposed algorithms for matrix manipulating based on the special encoding the matrix elements into the superposition state of a quantum system. First aspect is the controlled measurement which allows to avoid the problem of small access probability to the required ancilla state at the final step of algorithms needed to remove the garbage of the states. Application of controlled measurement to the earlier developed algorithm is demonstrated. The second aspect is the algorithm for calculating the Hermitian conjugate of an arbitrary matrix, which supplements the algorithms proposed earlier. The appropriate circuits are presented.
Implementing polynomial functions of Hermitian matrices on quantum hardware is a foundational task in quantum computing, critical for accurate Hamiltonian simulation, quantum linear system solving, high-fidelity state preparation, machine learning kernels, and other advanced quantum algorithms. Existing state-of-the-art techniques, including Qubitization, Quantum Singular Value Transformation (QSVT), and Quantum Signal Processing (QSP), rely heavily on block-encoding the Hermitian matrix. These methods are often constrained by the complexity of preparing the block-encoded state, the overhead associated with the required ancillary qubits, or the challenging problem of angle synthesis for the polynomial's phase factors, which limits the achievable circuit depth and overall efficiency. In this work, we propose a novel and resource-efficient approach to implement arbitrary polynomials of a Hermitian matrix by leveraging the Generalized Quantum Signal Processing (GQSP) framework. Our method circumvents the need for block-encoding and avoids the compounding post-selection overheads characteristic of LCU-based constructions, achieving a stable, degree-independent success probability. We derive closed-form expressions for symmetric polynomial expansions and demonstrate how linear combinations of GQSP circuits can realize the desired transformation. This approach reduces resource overhead and opens new pathways for quantum algorithm design for functions of Hermitian matrices, particularly in settings where the Hermitian operator arises naturally from symmetric combinations of unitaries.