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:quant-ph/0506074

Generation of Matrices with Specified Eigenvalues and their Diagonalization

Habatwa Vincent Mweene

Published Jun 9, 2005• 0 citations
arXivHTMLPDF

Abstract

We present a prescription for forming matrices with specified eigenvalues and known eigenvectors. With this method, we can form Hermitian, anti-Hermitian, symmetric and general matrices with arbitrary eigenvalues. In addition we propose an algorithm for diagonalizing such matrices. The functions required for the realization of this are probability amplitudes connecting observables with discrete eigenvalue spectra and can be obtained from spin theory. For the example case of $5\times 5$ matrices, these functions are given.

DOI
10.48550/arxiv.quant-ph/0506074

Related papers

The quantum way to diagonalize hermitean matrices

Stefan Weigert

Abstract An entirely quantum mechanical approach to diagonalize hermitean matrices has been presented recently. The method is based on the measurement of quantum mechanical observables which provides the computational resource. In brief, quantum mechanics is able to directly address and output eigenvalues of hermitean matrices. Here, the example of (2×2) matrices is considered in detail. This simple case allows one to illustrate the conceptual features of the general method which is applicable to (N×N) hermitean matrices.

arXiv:quant-ph/0305140•Fortschritte der Physik•Feb 26, 2003•2 citations

Computing Eigenvalues of Diagonalizable Matrices on a Quantum Computer

Changpeng Shao

Computing eigenvalues of matrices is ubiquitous in numerical linear algebra problems. Currently, fast quantum algorithms for estimating eigenvalues of Hermitian and unitary matrices are known. However, the general case is far from fully understood in the quantum case. Based on a quantum algorithm for solving linear ordinary differential equations, we show how to estimate the eigenvalues of diagonalizable matrices that only have real eigenvalues. The output is a superposition of the eigenpairs, and the overall complexity is polylog in the dimension for sparse matrices. Under an assumption, we extend the algorithm to diagonalizable matrices with complex eigenvalues.

ACM Transactions on Quantum Computing•Apr 13, 2022•16 citations

Quantum diagonalization of Hermitean matrices

Stefan Weigert

To measure an observable of a quantum mechanical system leaves it in one of its eigenstates and the result of the measurement is one of its eigenvalues. This process is shown to be a computational resource : Hermitean ( N × N ) matrices can be diagonalized, in principle, by performing appropriate quantum mechanical measurements. To do so, one considers the given matrix as an observable of a single spin with appropriate length s which can be measured using a generalized Stern-Gerlach apparatus. Then, each run provides one eigenvalue of the observable. As the underlying working principle is the `collapse of the wavefunction' associated with a measurement, the procedure is neither a digital nor an analogue calculation - it defines thus a new example of a quantum mechanical method of computation.

arXiv:quant-ph/0001082•Journal of Physics A Mathematical and General•Jun 27, 2001•3 citations

Observables as Operators

Tilak Sinha

With the postulates already formulated in the language of an abstract inner product spaces, this chapter shows how an observable can be naturally expressed as a linear Hermitian operator acting on the inner product space where the states live. We start by introducing linear operators acting on vector spaces and their representations. Next, we discuss the systems of eigenvalues and eigenvectors associated with such operators. The important case of Hermitian operator and the properties of their eigenvalues and eigenvectors, relevant to quantum mechanics, are introduced. After developing the necessary background in linear algebra, the connection of Hermitian operators with quantum observables is established. We then proceed to explain what this connection actually accomplishes. In particular, we show how it translates the target questions of quantum mechanics into an eigenvalue problem. This makes it evident what the nature of the input to a quantum theory should be. This input enters the formalism through what are known as “quantization rules”. I discuss this in the last section of this chapter. An illustration using a disguised spin-half system winds up the chapter.

Chapman & Hall/CRC eBooks•Jun 18, 2021•0 citations

Computing eigenvalues of diagonalizable matrices in a quantum computer

Changpeng Shao

Solving linear systems and computing eigenvalues are two fundamental problems in linear algebra. For solving linear systems, many efficient quantum algorithms have been discovered. For computing eigenvalues, currently, we have efficient quantum algorithms for Hermitian and unitary matrices. However, the general case is far from fully understood. Combining quantum phase estimation, quantum algorithm to solve linear differential equations and quantum singular value estimation, we propose two quantum algorithms to compute the eigenvalues of diagonalizable matrices that only have real eigenvalues and normal matrices. The output of the quantum algorithms is a superposition of the eigenvalues and the corresponding eigenvectors. The complexities are dominated by solving a linear system of ODEs and performing quantum singular value estimation, which usually can be solved efficiently in a quantum computer. In the special case when the matrix $M$ is $s$-sparse, the complexity is $\widetilde{O}(sρ^2 κ^2/ε^2)$ for diagonalizable matrices that only have real eigenvalues, and $\widetilde{O}(sρ\|M\|_{\max} /ε^2)$ for normal matrices. Here $ρ$ is an upper bound of the eigenvalues, $κ$ is the conditioning of the eigenvalue problem, and $ε$ is the precision to approximate the eigenvalues. We also extend the quantum algorithm to diagonalizable matrices with complex eigenvalues under an extra assumption.

arXiv:1912.08015•Dec 17, 2019•12 citations

Universal Complex Quantum-Like Bits from Hermitian Weighted Graphs

Ethan Dickey, Sabre Kais

We study when block-coupled regular graphs can realize prescribed complex quantum-like (QL) bit states as exact synchronized eigenstates. Two regular subgraphs $G_A$ and $G_B$ supply normalized all-ones eigenvectors $V_A$ and $V_B$, and algebraically regular bipartite couplings reduce the full graph-supported operator exactly to a $2\times 2$ effective block on $\mathcal S=\operatorname{span} \{ \lvert 0\rangle, \lvert 1\rangle \}$. Within this reduction we prove that two natural symmetric complexifications are not universal for state synthesis under a real-spectrum requirement: complex symmetric coupling with real diagonal regularities forces the target computational basis amplitude ratio $r=ω_2/ω_1$, for $\lvert ψ\rangle = ω_1\lvert 0\rangle + ω_2\lvert 1\rangle$, to satisfy $r^2\in\R$, while real symmetric coupling with complex diagonal regularities forces $r+1/r\in\R$. Replacing complex symmetry by Hermitian coupling removes this phase obstruction. For any nonbasis target state, any prescribed real eigenvalue, and any prescribed nonzero signed spectral gap, a Hermitian weighted coupling realizes the target exactly. Additionally, an independently tuned directed-coupling model gives a second universality mechanism. We then pass from continuous effective parameters to finite weighted graphs with entries in $\{0, \pm1, \pm i\}$ (the fourth roots of unity and zero), characterize the balanced discrete coupling lattice by perfect matchings, and show that exact discrete Hermitian realizations are dense in the synchronized pure-state space. These results give a state-synthesis universality taxonomy for complex QL-bits and identify Hermitian conjugate pairing as the robust structural mechanism that supports arbitrary complex amplitudes with real two-level spectra.

quant-pharXiv:2604.23991•Apr 28, 2026•2 citations
We present a prescription for forming matrices with specified eigenvalues and known eigenvectors. With this method, we can form Hermitian, anti-Hermitian, symmetric and general matrices with arbitrary eigenvalues. In addition we propose an algorithm for diagonalizing such matrices. The functions required for the realization of this are probability amplitudes connecting observables with discrete eigenvalue spectra and can be obtained from spin theory. For the example case of 5×55\times 55×5 matrices, these functions are given.
Abstract An entirely quantum mechanical approach to diagonalize hermitean matrices has been presented recently. The method is based on the measurement of quantum mechanical observables which provides the computational resource. In brief, quantum mechanics is able to directly address and output eigenvalues of hermitean matrices. Here, the example of (2×2) matrices is considered in detail. This simple case allows one to illustrate the conceptual features of the general method which is applicable to (N×N) hermitean matrices.
Computing eigenvalues of matrices is ubiquitous in numerical linear algebra problems. Currently, fast quantum algorithms for estimating eigenvalues of Hermitian and unitary matrices are known. However, the general case is far from fully understood in the quantum case. Based on a quantum algorithm for solving linear ordinary differential equations, we show how to estimate the eigenvalues of diagonalizable matrices that only have real eigenvalues. The output is a superposition of the eigenpairs, and the overall complexity is polylog in the dimension for sparse matrices. Under an assumption, we extend the algorithm to diagonalizable matrices with complex eigenvalues.
To measure an observable of a quantum mechanical system leaves it in one of its eigenstates and the result of the measurement is one of its eigenvalues. This process is shown to be a computational resource : Hermitean ( N × N ) matrices can be diagonalized, in principle, by performing appropriate quantum mechanical measurements. To do so, one considers the given matrix as an observable of a single spin with appropriate length s which can be measured using a generalized Stern-Gerlach apparatus. Then, each run provides one eigenvalue of the observable. As the underlying working principle is the `collapse of the wavefunction' associated with a measurement, the procedure is neither a digital nor an analogue calculation - it defines thus a new example of a quantum mechanical method of computation.
With the postulates already formulated in the language of an abstract inner product spaces, this chapter shows how an observable can be naturally expressed as a linear Hermitian operator acting on the inner product space where the states live. We start by introducing linear operators acting on vector spaces and their representations. Next, we discuss the systems of eigenvalues and eigenvectors associated with such operators. The important case of Hermitian operator and the properties of their eigenvalues and eigenvectors, relevant to quantum mechanics, are introduced. After developing the necessary background in linear algebra, the connection of Hermitian operators with quantum observables is established. We then proceed to explain what this connection actually accomplishes. In particular, we show how it translates the target questions of quantum mechanics into an eigenvalue problem. This makes it evident what the nature of the input to a quantum theory should be. This input enters the formalism through what are known as “quantization rules”. I discuss this in the last section of this chapter. An illustration using a disguised spin-half system winds up the chapter.
Solving linear systems and computing eigenvalues are two fundamental problems in linear algebra. For solving linear systems, many efficient quantum algorithms have been discovered. For computing eigenvalues, currently, we have efficient quantum algorithms for Hermitian and unitary matrices. However, the general case is far from fully understood. Combining quantum phase estimation, quantum algorithm to solve linear differential equations and quantum singular value estimation, we propose two quantum algorithms to compute the eigenvalues of diagonalizable matrices that only have real eigenvalues and normal matrices. The output of the quantum algorithms is a superposition of the eigenvalues and the corresponding eigenvectors. The complexities are dominated by solving a linear system of ODEs and performing quantum singular value estimation, which usually can be solved efficiently in a quantum computer. In the special case when the matrix MMM is sss-sparse, the complexity is O~(sρ2κ2/ε2)\widetilde{O}(sρ^2 κ^2/ε^2)O(sρ2κ2/ε2) for diagonalizable matrices that only have real eigenvalues, and O~(sρ∥M∥max⁡/ε2)\widetilde{O}(sρ\|M\|_{\max} /ε^2)O(sρ∥M∥max​/ε2) for normal matrices. Here ρρρ is an upper bound of the eigenvalues, κκκ is the conditioning of the eigenvalue problem, and εεε is the precision to approximate the eigenvalues. We also extend the quantum algorithm to diagonalizable matrices with complex eigenvalues under an extra assumption.
We study when block-coupled regular graphs can realize prescribed complex quantum-like (QL) bit states as exact synchronized eigenstates. Two regular subgraphs GAG_AGA​ and GBG_BGB​ supply normalized all-ones eigenvectors VAV_AVA​ and VBV_BVB​, and algebraically regular bipartite couplings reduce the full graph-supported operator exactly to a 2×22\times 22×2 effective block on S=span⁡{∣0⟩,∣1⟩}\mathcal S=\operatorname{span} \{ \lvert 0\rangle, \lvert 1\rangle \}S=span{∣0⟩,∣1⟩}. Within this reduction we prove that two natural symmetric complexifications are not universal for state synthesis under a real-spectrum requirement: complex symmetric coupling with real diagonal regularities forces the target computational basis amplitude ratio r=ω2/ω1r=ω_2/ω_1r=ω2​/ω1​, for ∣ψ⟩=ω1∣0⟩+ω2∣1⟩\lvert ψ\rangle = ω_1\lvert 0\rangle + ω_2\lvert 1\rangle∣ψ⟩=ω1​∣0⟩+ω2​∣1⟩, to satisfy r2∈Rr^2\in\Rr2∈R, while real symmetric coupling with complex diagonal regularities forces r+1/r∈Rr+1/r\in\Rr+1/r∈R. Replacing complex symmetry by Hermitian coupling removes this phase obstruction. For any nonbasis target state, any prescribed real eigenvalue, and any prescribed nonzero signed spectral gap, a Hermitian weighted coupling realizes the target exactly. Additionally, an independently tuned directed-coupling model gives a second universality mechanism. We then pass from continuous effective parameters to finite weighted graphs with entries in {0,±1,±i}\{0, \pm1, \pm i\}{0,±1,±i} (the fourth roots of unity and zero), characterize the balanced discrete coupling lattice by perfect matchings, and show that exact discrete Hermitian realizations are dense in the synchronized pure-state space. These results give a state-synthesis universality taxonomy for complex QL-bits and identify Hermitian conjugate pairing as the robust structural mechanism that supports arbitrary complex amplitudes with real two-level spectra.