Matrix encoding method in variational algorithm of calculating eigenvalues and generalized eigenvalues
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910198073917440 |
|---|---|
| author | Zenchuk, Alexander I. Wu, Junde |
| author_facet | Zenchuk, Alexander I. Wu, Junde |
| contents | 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)$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_06167 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Matrix encoding method in variational algorithm of calculating eigenvalues and generalized eigenvalues Zenchuk, Alexander I. Wu, Junde Quantum Physics 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)$. |
| title | Matrix encoding method in variational algorithm of calculating eigenvalues and generalized eigenvalues |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2605.06167 |