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:2609.17970

The Fourier Uncertainty Principle Through the Lens of Infinite Banded Matrices

Cameron L. Williams, Lara C. Ortelli, Gael Silva

quant-phmath.FASubmitted Sep 16, 2026• Announced Sep 17, 2026• 0 citations
arXivHTMLPDF

Abstract

In this paper, we investigate the Fourier uncertainty principle through infinite banded matrices by way of a variational approach to minimizing the uncertainty product. Traditional methods for analyzing the Fourier uncertainty principle rely heavily on the Heisenberg--Weyl structure that underlie the Fourier transform and therefore do not generalize well beyond this setting. We provide three distinct approaches to developing the uncertainty principle based on the spectrum of a shifted quantum harmonic oscillator Hamiltonian, $H_{a,b}$. In the Hermite--Gauss basis, $H_{a,b}$ has an infinite, tridiagonal form which is central to the analysis. One approach exactly solves for the spectrum through analytic methods, another decomposes $H_{a,b}$ into an infinite sum of $2\times 2$ matrices, and the third approach is an algebraic approach to establishing the spectrum via a unitary equivalence with the quantum harmonic oscillator. The approaches taken herein provide alternate avenues that are more broadly applicable to other canonically conjugate operators for other integral transforms which maintain a tridiagonal form.

AI Summary

The paper revisits the Fourier uncertainty principle, asking how to establish its sharp bound through spectral and banded-matrix methods rather than relying primarily on the Heisenberg–Weyl algebra. It studies the shifted oscillator $H_{a,b}=(X-a)^2+(P-b)^2$, with arbitrary real centers $a,b$, as a model for approaches intended to extend to other integral transforms. A constrained variation of the uncertainty product, followed by dilation to balance the two quadratic terms, yields an eigenvalue problem for $H_{a,b}$. In the Hermite–Gauss basis this operator is tridiagonal. Three treatments follow: solving the coefficient recurrence analytically, with eigenvectors expressed using generalized Laguerre polynomials; decomposing $H_{a,b}-I$ into an infinite sum of positive, embedded $2\times2$ matrices; and establishing unitary equivalence to the ordinary oscillator through the displacement operator. The spectral treatments recover eigenvalues $2n+1$ and displaced Hermite–Gauss eigenfunctions. The positive-matrix decomposition establishes the lower bound without determining the full spectrum. These results give the additive inequality $\langle(X-a)^2\rangle+\langle(P-b)^2\rangle\geq1$ for normalized states with finite second moments. Optimizing over dilations yields $\langle(X-a)^2\rangle\langle(P-b)^2\rangle\geq1/4$, including the usual variance-product inequality when the centers equal the means. The displacement-operator argument explicitly depends on the Fourier setting’s Heisenberg–Weyl structure. Extensions of the positive-matrix method to Fourier–Bessel transforms and other operator pairs are deferred to future papers; the applicability of the analytic recurrence method beyond this example remains an open direction.

Little sign of AI-generated textIncrementalUnclear noveltyOverclaimsPossible error

Central claim may not hold: The Hermite–Gauss momentum formula has the wrong sign, and the matrix used in Sections 3–4 requires an unstated phase transformation and real radial parameter to represent the general shifted Hamiltonian. Section 3's completeness argument performs infinite column operations without transforming the unknown coordinates or establishing a valid invertible transformation, so it does not prove the asserted eigenbasis. Section 2 defines the Hamiltonian on its quadratic-form domain rather than a valid operator domain, leaving some displayed operator expressions undefined for allowed functions. The proposed applicability beyond the Fourier setting is not established by a theorem or worked example in this paper and remains prospective. The gamma-ratio expression for the recurrence coefficients drops the factor (-1)^n and contradicts the preceding product formula.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

The uncertainty principle and quantum wave functions that are their own Fourier transforms

Keith Zengel, Nick DeVitto, Nathanael Hillyer +2 more

We present several variations of a proof of the position-momentum uncertainty principle that are based on the calculus of variations and does not rely on the Cauchy–Schwartz inequality. We show that the stationary uncertainty wave functions are the Hermite–Gaussian solutions to the quantum harmonic oscillator problem, that the minimum uncertainty wave function is the Gaussian, and that stationary uncertainty wave functions must be their own Fourier transforms. We also provide a calculus of variations proof of the Cauchy–Schwartz inequality. Finally, we discuss the properties of wave functions that are their own Fourier transforms and provide examples of such functions that may be of interest to teachers of undergraduate and graduate level quantum mechanics courses.

American Journal of Physics•Feb 21, 2024•3 citations

Algebraic Solution of the Harmonic Oscillator With Minimal Length Uncertainty Relations

Kay L. Gemba, Zvonimir Hlousek, Zoltán Papp

In quantum mechanics with minimal length uncertainty relations the Heisenberg-Weyl algebra of the one-dimensional harmonic oscillator is a deformed SU(1,1) algebra. The eigenvalues and eigenstates are constructed algebraically and they form the infinite-dimensional representation of the deformed SU(1,1) algebra. Our construction is independent of prior knowledge of the exact solution of the Schrödinger equation of the model. The approach can be generalized to the $D$-dimensional oscillator with non-commuting coordinates.

arXiv:0712.2078•Dec 13, 2007•5 citations

The Structural Origin of Heisenberg's Uncertainty Principle - Infinite-Dimensional Reality and Its Analytic, Functional, Geometric, and Algebraic Foundations

ming Cheng

This work develops a unified structural explanation of Heisenberg’s uncertainty principle based onthe infinite-dimensional nature of physical reality and its mathematical representation. Quantumstates are intrinsically wave-like and must be described by functions rather than finite-dimensionalvectors, forcing the use of an infinite-dimensional Hilbert space. Within this framework, fourindependent but mutually reinforcing structures emerge: analytic non-commutativity ofmultiplication and differentiation, Fourier duality and the mutual broadening of a function and itstransform, the symplectic geometry of phase space and its minimal area constraint, and thealgebraic rigidity encoded in the Weyl relations and the Stone–von Neumann theorem. Theselayers form a logical chain from finite-dimensional impossibility to infinite-dimensional necessity,revealing the uncertainty principle as a structural feature of the physical world. The paper furtherdiscusses extensions to the generalized uncertainty principle and the infinite-dimensionalstructure of quantum field theory.

•Mar 2, 2026•0 citations

A physical model of Fourier uncertainty principle

Rohan Singh, Parbati Biswas

Abstract Fourier transform is an integral part of harmonic analysis, information theory and signal processing with wide applications. The transformation between the Fourier pair is governed by an uncertainty relation, most generally captured by the Bandwidth theorem, . The usual approaches to the uncertainty principle employ sophisticated methods which lack physical interpretation of the origin and description of the uncertainty for real systems. In this paper, we have proposed a physically inspired model of the Fourier transform with an aim to describe its underlying dynamics and how it leads to the fundamental uncertainty principle. A signal is modeled as helical spring in 3D space, which is wrapped around a circle with controllable wrapping frequency. This process is formulated to reproduce the Fourier transform. The model is used to describe the origin of uncertainty, and to formulate a new generator-based approach to the Bandwidth theorem.

Europhysics Letters (EPL)•Jun 17, 2025•0 citations

Hermite functions and uncertainty principles for the Fourier and the windowed Fourier transforms

Aline Bonami, Bruno Demange, Philippe Jaming

We extend an uncertainty principle due to Beurling into a characterization of Hermite functions. More precisely, all functions f on \mathbb{R}^d which may be written as P(x)\exp (-\langle Ax, x\rangle) , with A a real symmetric definite positive matrix, are characterized by integrability conditions on the product f(x) \widehat{f}(y) . We then obtain similar results for the windowed Fourier transform (also known, up to elementary changes of functions, as the radar ambiguity function or the Wigner transform). We complete the paper with a sharp version of Heisenberg's inequality for this transform.

arXiv:math/0102111•Revista Matemática Iberoamericana•Apr 30, 2003•201 citations

Quantum Algorithm Uncertainty Principles

Ken Loo

Previously, Bennet and Feynman asked if Heisenberg's uncertainty principle puts a limitation on a quantum computer (Quantum Mechanical Computers, Richard P. Feynman, Foundations of Physics, Vol. 16, No. 6, p597-531, 1986). Feynman's answer was negative. In this paper, we will revisit the same question for the discrete time Fourier transform uncertainty principle. We will show that the discrete time Fourier transform uncertainty principle plays a fundamental role in showing that Shor's type of quantum algorithms has efficient running time and conclude that the discrete time uncertainty principle is an aid in our current formulation and understanding of Shor's type of quantum algorithms. It turns out that for these algorithms, the probability of measuring an element in some set $T$ (at the end of the algorithm) can be written in terms of the time-limiting and band-limiting operators from finite Fourier analysis. Associated with these operators is the finite Fourier transform uncertainty principle. The uncertainty principle provides a lower bound for the above probability. We will derive lower bounds for these types of probabilities in general. We will call these lower bounds quantum algorithm uncertainty principles or QAUP. QAUP are important because they give us some sense of the probability of measuring something desirable. We will use these lower bounds to derive Shor's factoring and discrete log algorithms.

arXiv:math-ph/0210007•Oct 2, 2002•1 citation
In this paper, we investigate the Fourier uncertainty principle through infinite banded matrices by way of a variational approach to minimizing the uncertainty product. Traditional methods for analyzing the Fourier uncertainty principle rely heavily on the Heisenberg--Weyl structure that underlie the Fourier transform and therefore do not generalize well beyond this setting. We provide three distinct approaches to developing the uncertainty principle based on the spectrum of a shifted quantum harmonic oscillator Hamiltonian, Ha,bH_{a,b}Ha,b​. In the Hermite--Gauss basis, Ha,bH_{a,b}Ha,b​ has an infinite, tridiagonal form which is central to the analysis. One approach exactly solves for the spectrum through analytic methods, another decomposes Ha,bH_{a,b}Ha,b​ into an infinite sum of 2×22\times 22×2 matrices, and the third approach is an algebraic approach to establishing the spectrum via a unitary equivalence with the quantum harmonic oscillator. The approaches taken herein provide alternate avenues that are more broadly applicable to other canonically conjugate operators for other integral transforms which maintain a tridiagonal form.
The paper revisits the Fourier uncertainty principle, asking how to establish its sharp bound through spectral and banded-matrix methods rather than relying primarily on the Heisenberg–Weyl algebra. It studies the shifted oscillator Ha,b=(X−a)2+(P−b)2H_{a,b}=(X-a)^2+(P-b)^2Ha,b​=(X−a)2+(P−b)2, with arbitrary real centers a,ba,ba,b, as a model for approaches intended to extend to other integral transforms.
A constrained variation of the uncertainty product, followed by dilation to balance the two quadratic terms, yields an eigenvalue problem for Ha,bH_{a,b}Ha,b​. In the Hermite–Gauss basis this operator is tridiagonal. Three treatments follow: solving the coefficient recurrence analytically, with eigenvectors expressed using generalized Laguerre polynomials; decomposing Ha,b−IH_{a,b}-IHa,b​−I into an infinite sum of positive, embedded 2×22\times22×2 matrices; and establishing unitary equivalence to the ordinary oscillator through the displacement operator. The spectral treatments recover eigenvalues 2n+12n+12n+1 and displaced Hermite–Gauss eigenfunctions. The positive-matrix decomposition establishes the lower bound without determining the full spectrum.
These results give the additive inequality ⟨(X−a)2⟩+⟨(P−b)2⟩≥1\langle(X-a)^2\rangle+\langle(P-b)^2\rangle\geq1⟨(X−a)2⟩+⟨(P−b)2⟩≥1 for normalized states with finite second moments. Optimizing over dilations yields ⟨(X−a)2⟩⟨(P−b)2⟩≥1/4\langle(X-a)^2\rangle\langle(P-b)^2\rangle\geq1/4⟨(X−a)2⟩⟨(P−b)2⟩≥1/4, including the usual variance-product inequality when the centers equal the means.
The displacement-operator argument explicitly depends on the Fourier setting’s Heisenberg–Weyl structure. Extensions of the positive-matrix method to Fourier–Bessel transforms and other operator pairs are deferred to future papers; the applicability of the analytic recurrence method beyond this example remains an open direction.
We present several variations of a proof of the position-momentum uncertainty principle that are based on the calculus of variations and does not rely on the Cauchy–Schwartz inequality. We show that the stationary uncertainty wave functions are the Hermite–Gaussian solutions to the quantum harmonic oscillator problem, that the minimum uncertainty wave function is the Gaussian, and that stationary uncertainty wave functions must be their own Fourier transforms. We also provide a calculus of variations proof of the Cauchy–Schwartz inequality. Finally, we discuss the properties of wave functions that are their own Fourier transforms and provide examples of such functions that may be of interest to teachers of undergraduate and graduate level quantum mechanics courses.
In quantum mechanics with minimal length uncertainty relations the Heisenberg-Weyl algebra of the one-dimensional harmonic oscillator is a deformed SU(1,1) algebra. The eigenvalues and eigenstates are constructed algebraically and they form the infinite-dimensional representation of the deformed SU(1,1) algebra. Our construction is independent of prior knowledge of the exact solution of the Schrödinger equation of the model. The approach can be generalized to the DDD-dimensional oscillator with non-commuting coordinates.
This work develops a unified structural explanation of Heisenberg’s uncertainty principle based onthe infinite-dimensional nature of physical reality and its mathematical representation. Quantumstates are intrinsically wave-like and must be described by functions rather than finite-dimensionalvectors, forcing the use of an infinite-dimensional Hilbert space. Within this framework, fourindependent but mutually reinforcing structures emerge: analytic non-commutativity ofmultiplication and differentiation, Fourier duality and the mutual broadening of a function and itstransform, the symplectic geometry of phase space and its minimal area constraint, and thealgebraic rigidity encoded in the Weyl relations and the Stone–von Neumann theorem. Theselayers form a logical chain from finite-dimensional impossibility to infinite-dimensional necessity,revealing the uncertainty principle as a structural feature of the physical world. The paper furtherdiscusses extensions to the generalized uncertainty principle and the infinite-dimensionalstructure of quantum field theory.
Abstract Fourier transform is an integral part of harmonic analysis, information theory and signal processing with wide applications. The transformation between the Fourier pair is governed by an uncertainty relation, most generally captured by the Bandwidth theorem, . The usual approaches to the uncertainty principle employ sophisticated methods which lack physical interpretation of the origin and description of the uncertainty for real systems. In this paper, we have proposed a physically inspired model of the Fourier transform with an aim to describe its underlying dynamics and how it leads to the fundamental uncertainty principle. A signal is modeled as helical spring in 3D space, which is wrapped around a circle with controllable wrapping frequency. This process is formulated to reproduce the Fourier transform. The model is used to describe the origin of uncertainty, and to formulate a new generator-based approach to the Bandwidth theorem.
We extend an uncertainty principle due to Beurling into a characterization of Hermite functions. More precisely, all functions f on \mathbb{R}^d which may be written as P(x)\exp (-\langle Ax, x\rangle) , with A a real symmetric definite positive matrix, are characterized by integrability conditions on the product f(x) \widehat{f}(y) . We then obtain similar results for the windowed Fourier transform (also known, up to elementary changes of functions, as the radar ambiguity function or the Wigner transform). We complete the paper with a sharp version of Heisenberg's inequality for this transform.
Previously, Bennet and Feynman asked if Heisenberg's uncertainty principle puts a limitation on a quantum computer (Quantum Mechanical Computers, Richard P. Feynman, Foundations of Physics, Vol. 16, No. 6, p597-531, 1986). Feynman's answer was negative. In this paper, we will revisit the same question for the discrete time Fourier transform uncertainty principle. We will show that the discrete time Fourier transform uncertainty principle plays a fundamental role in showing that Shor's type of quantum algorithms has efficient running time and conclude that the discrete time uncertainty principle is an aid in our current formulation and understanding of Shor's type of quantum algorithms. It turns out that for these algorithms, the probability of measuring an element in some set TTT (at the end of the algorithm) can be written in terms of the time-limiting and band-limiting operators from finite Fourier analysis. Associated with these operators is the finite Fourier transform uncertainty principle. The uncertainty principle provides a lower bound for the above probability. We will derive lower bounds for these types of probabilities in general. We will call these lower bounds quantum algorithm uncertainty principles or QAUP. QAUP are important because they give us some sense of the probability of measuring something desirable. We will use these lower bounds to derive Shor's factoring and discrete log algorithms.