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/9412007 · Journal of Physics A Mathematical and General

Infinite matrices may violate the associative law

Ofir E. Alon, Nimrod Moiseyev, Asher Peres

Published Mar 23, 1995• 4 citations
arXivHTMLPDF

Abstract

The momentum operator for a particle in a box is represented by an infinite-order Hermitian matrix P. Its square P 2 is well-defined (and diagonal), but its cube P 3 is ill-defined, because P P 2 not=P 2 P. Truncating these matrices to a finite order restores the associative law, but leads to other curious results.
DOI
10.1088/0305-4470/28/6/027

Related papers

Some matrix calculations

John P. Killingbeck

The original version of matrix mechanics is little used in applications nowadays. In that early theory position, momentum and other quantities were represented by infinite matrices, whereas many modern applications of quantum mechanics represent such observables as operators. Infinite matrices are unwieldy to use and have some disturbing properties, e.g. they do not obey the associative rule. By far the most commonly appearing matrix in quantum mechanics is the matrix of the energy operator as set up in some finite basis of trial functions. The procedure has been used for perturbed oscillator problems; the recurrence relation approach is particularly simple when the matrix has only one non-zero element beyond the diagonal element in each row. It seems to the author that there are still many hybrid methods which need investigation.

CRC Press eBooks•Jan 18, 2018•0 citations

The particle in a box is not simple

Frank E. Cummings

Naive use of the position representation wave functions for a particle in either a finite or infinite square well predicts properties of the momentum distribution in disagreement with those calculated in the momentum representation. The discrepancy is removed by explicit consideration of the effects of the discontinuity in the potential at the walls on position space calculations.

American Journal of Physics•Feb 1, 1977•32 citations

Concerning a Kind of Truncated Quantized Linear Harmonic Oscillator

H. A. Buchdahl

In quantum mechanics the linear harmonic oscillator representatives of the canonical observables q and p are certain well-known infinite square matrices, qmn and pmn, with denumerable sets of rows and columns. It is pedagogically useful to investigate various problems which arise when one considers the finite matrices Qmn and Pmn which result when qmn and pmn are truncated after the Nth row and column, where N( 2≥2) is some preassigned positive integer. So that the enquiry may be more instructive, it begins with an abstract formulation of the problem of the “truncated harmonic oscillator.” Formally, the latter has the usual Hamiltonian H = 12( Q2+P2 ) , but Q and P are not canonical—their commutator [Q,P] now differing from i by a certain projection operator. The spectrum of H and the (finite) basis { |n〉} generated by H are found by standard methods, though there are now some complications which are absent from the theory of the linear harmonic oscillator. The diagonalization of Q and P presents no difficulties if full use is made of the classical theory of Hermite polynomials. The spectrum of Q is the set of N zeros hs of the Nth Hermite polynomial. Although the wavefunctions 〈 Q′|n〉 are therefore functions of the discrete variable hs, one can formally contemplate them as functions of a continuous real variable h; and some curious intimations of Schrödinger representation appear. The analog of a component of orbital angular momentum is considered, and its spectrum obtained. Finally, the asymptotic limit N → ∞ is briefly discussed, in order thus explicitly to dispel the impression that this limit might somehow represent the “usual” linear harmonic oscillator.

American Journal of Physics•Mar 1, 1967•42 citations

Revisiting completeness of the eigenstates of a Hermitian operator for a particle in 1-D: An alternative proof, an alternative description, and the possibility of quantum measurement of the momentum in a box

Shyamal Biswas, Kalyan Brata Chatterjee

Annals of Physics•Sep 17, 2026•0 citations

Quantum Simulation of Non-Hermitian Special Functions and Dynamics via Contour-based Matrix Decomposition

Chao Wang, Huan-Yu Liu, Cheng Xue +4 more

Simulating non-Hermitian dynamics on quantum computers is often hindered by the decay of success probability and the instability of non-diagonalizable matrices. Here, we present contour-based matrix decomposition (CBMD), a rigorous and versatile quantum functional calculus framework for simulating non-Hermitian matrix functions. By generalizing the matrix Cauchy residue theorem, CBMD decomposes holomorphic non-Hermitian operators into an analytic infinite contour-residue identity, followed by finite truncation with controlled error to yield linear combinations of Hermitian components. For first-order dynamics, CBMD achieves optimal query complexity across all parameters, strictly matching the optimal performance bounds within the linear combination of Hamiltonian simulation (LCHS) paradigm. Beyond first-order systems, the framework naturally generalizes to complex operator functions, including second-order wave dynamics and non-Hermitian special functions such as Bessel and Airy evolutions. Furthermore, CBMD systematically suppresses the asymptotic growth of non-Hermitian components, yielding a significant reduction in the required number of amplitude amplifications compared to the naive scheme of combining monomials via linear combination of unitaries (LCU) after Taylor expansion. Notably, CBMD avoids explicit dependence on matrix diagonalizability, effectively mitigating the long-standing challenges associated with ill-conditioned eigenvectors and Jordan blocks. Our work establishes a systematic matrix calculus that bridges high-performance classical numerics and fault-tolerant quantum algorithms. It should be noted that CBMD inherits standard LCU overheads, and requires the target function to have a bounded growth order on the real axis.

quant-pharXiv:2511.10267•Quantum Science and Technology•Nov 14, 2025•0 citations

Conditions for the existence of quantum error correction codes

Daniel Mark Lucas

In this dissertation, we consider quantum errors, represented by quantum channels defined on the space of n x n complex matrices, M(n). We begin with a quantum channel T defined on M(n). The Kraus operators of this channel can be used to generate an operator system S, which is guaranteed to have a basis of Hermitian matrices A_1,...,A_m in M(n). Given natural numbers k and m, we find a lower bound on n above which there is always an n x k matrix U with orthonormal columns such that U*A_1U,...,U*A_mU are diagonal k x k matrices. We then extend this to a lower bound on n above which there is always a k-dimensional quantum error correction code for any quantum channel T on M(n) with an associated operator system S with dim(S) < m+2. Such a bound is equivalent to a lower bound on n above which the joint rank-k numerical range of any m Hermitian matrices in M(n) is non-empty. So, we further extend our result to a lower bound on n above which the rank-k numerical range of any m Hermitian matrices in M(n) is star-shaped.

•Jan 1, 2020•0 citations
The original version of matrix mechanics is little used in applications nowadays. In that early theory position, momentum and other quantities were represented by infinite matrices, whereas many modern applications of quantum mechanics represent such observables as operators. Infinite matrices are unwieldy to use and have some disturbing properties, e.g. they do not obey the associative rule. By far the most commonly appearing matrix in quantum mechanics is the matrix of the energy operator as set up in some finite basis of trial functions. The procedure has been used for perturbed oscillator problems; the recurrence relation approach is particularly simple when the matrix has only one non-zero element beyond the diagonal element in each row. It seems to the author that there are still many hybrid methods which need investigation.
In quantum mechanics the linear harmonic oscillator representatives of the canonical observables q and p are certain well-known infinite square matrices, qmn and pmn, with denumerable sets of rows and columns. It is pedagogically useful to investigate various problems which arise when one considers the finite matrices Qmn and Pmn which result when qmn and pmn are truncated after the Nth row and column, where N( 2≥2) is some preassigned positive integer. So that the enquiry may be more instructive, it begins with an abstract formulation of the problem of the “truncated harmonic oscillator.” Formally, the latter has the usual Hamiltonian H = 12( Q2+P2 ) , but Q and P are not canonical—their commutator [Q,P] now differing from i by a certain projection operator. The spectrum of H and the (finite) basis { |n〉} generated by H are found by standard methods, though there are now some complications which are absent from the theory of the linear harmonic oscillator. The diagonalization of Q and P presents no difficulties if full use is made of the classical theory of Hermite polynomials. The spectrum of Q is the set of N zeros hs of the Nth Hermite polynomial. Although the wavefunctions 〈 Q′|n〉 are therefore functions of the discrete variable hs, one can formally contemplate them as functions of a continuous real variable h; and some curious intimations of Schrödinger representation appear. The analog of a component of orbital angular momentum is considered, and its spectrum obtained. Finally, the asymptotic limit N → ∞ is briefly discussed, in order thus explicitly to dispel the impression that this limit might somehow represent the “usual” linear harmonic oscillator.
Simulating non-Hermitian dynamics on quantum computers is often hindered by the decay of success probability and the instability of non-diagonalizable matrices. Here, we present contour-based matrix decomposition (CBMD), a rigorous and versatile quantum functional calculus framework for simulating non-Hermitian matrix functions. By generalizing the matrix Cauchy residue theorem, CBMD decomposes holomorphic non-Hermitian operators into an analytic infinite contour-residue identity, followed by finite truncation with controlled error to yield linear combinations of Hermitian components. For first-order dynamics, CBMD achieves optimal query complexity across all parameters, strictly matching the optimal performance bounds within the linear combination of Hamiltonian simulation (LCHS) paradigm. Beyond first-order systems, the framework naturally generalizes to complex operator functions, including second-order wave dynamics and non-Hermitian special functions such as Bessel and Airy evolutions. Furthermore, CBMD systematically suppresses the asymptotic growth of non-Hermitian components, yielding a significant reduction in the required number of amplitude amplifications compared to the naive scheme of combining monomials via linear combination of unitaries (LCU) after Taylor expansion. Notably, CBMD avoids explicit dependence on matrix diagonalizability, effectively mitigating the long-standing challenges associated with ill-conditioned eigenvectors and Jordan blocks. Our work establishes a systematic matrix calculus that bridges high-performance classical numerics and fault-tolerant quantum algorithms. It should be noted that CBMD inherits standard LCU overheads, and requires the target function to have a bounded growth order on the real axis.
In this dissertation, we consider quantum errors, represented by quantum channels defined on the space of n x n complex matrices, M(n). We begin with a quantum channel T defined on M(n). The Kraus operators of this channel can be used to generate an operator system S, which is guaranteed to have a basis of Hermitian matrices A_1,...,A_m in M(n). Given natural numbers k and m, we find a lower bound on n above which there is always an n x k matrix U with orthonormal columns such that U*A_1U,...,U*A_mU are diagonal k x k matrices. We then extend this to a lower bound on n above which there is always a k-dimensional quantum error correction code for any quantum channel T on M(n) with an associated operator system S with dim(S) < m+2. Such a bound is equivalent to a lower bound on n above which the joint rank-k numerical range of any m Hermitian matrices in M(n) is non-empty. So, we further extend our result to a lower bound on n above which the rank-k numerical range of any m Hermitian matrices in M(n) is star-shaped.