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

Transactions of the American Mathematical Society

Recursivity in Quantum Mechanics

John C. Baez

Published Jan 1, 1983• 3 citations
Publisher

Abstract

The techniques of effective descriptive set theory are applied to the mathematical formalism of quantum mechanics in order to see whether it actually provides effective algorithms for the computation of various physically significant quantities, e.g. matrix elements. Various Hamiltonians are proven to be recursive (effectively computable) and shown to generate unitary groups which act recursively on the Hilbert space of physical states. In particular, it is shown that the $n$-particle Coulombic Hamiltonian is recursive, and that the time evolution of $n$-particle quantum Coulombic systems is recursive.

DOI
10.1090/s0002-9947-1983-0712264-x

Related papers

Quantum computation and complexity theory

Karl Svozil

The Hilbert space formalism of quantum mechanics is reviewed with emphasis on applications to quantum computing. Standard interferomeric techniques are used to construct a physical device capable of universal quantum computation. Some consequences for recursion theory and complexity theory are discussed.

arXiv:hep-th/9412047•Dec 6, 1994•8 citations

Elementary quantum mechanics

Yuli V. Nazarov, Jeroen Danon

This book has grown out of a one term course on quantum mechanics for third year mathematics students taught in the School of Mathematics at the University of Bristol. The genesis of quantum mechanics is in the field of physics, but from early on the infusion of new mathematics into the field has often proven fruitful (e.g. Hilbert space, matrix theory, the mathematical framework of Hamiltonian mechanics, tensor products, etc.). This course seeks to develop the mathematical framework that will equip the student for further studies in quantum mechanics while, at the same time, providing some insight into “what it means” physically.

Cambridge University Press eBooks•Jan 3, 2013•5 citations

Annex: Basic mathematical tools of quantum mechanics

Franck Laloë

This chapter gives a summary of the mathematical formalism used in quantum mechanics, with a short bibliography put directly at its end. It should be seen as a complement, to be used by readers who wish to know more than what has been recalled about the mathematical tools in the other chapters. Some results are given without explicit proofs; they can be found for instance in Chapters II and IV of [1] . Many quantum mechanics textbooks introduce its general formalism in a more complete way, for instance Chapter VII of [2] , Chapter 3 of [3] , or Chapter 2 of [4] . We first summarize the general formalism of quantum mechanics for any physical system (§11.1), with the Dirac notation; we then study how this formalism treats the grouping of several physical systems into one single quantum system (§11.2); finally, we study a few simple special cases (§11.3), for instance a single particle in an external potential, with or without spin; the reader who prefers wave functions to more abstract reasonings in spaces of states may begin with this section. General physical system The general formalism of quantum mechanics applies to all physical systems, whether they contain a single particle, many particles of various sorts, one or several fields, etc. Quantum space of states The physical state of a system at each time is defined in quantum mechanics by a state vector which, in Dirac notation, is written ∣ ψ 〈 – or ∣ ψ(t) 〈 if one wishes to make the time dependence explicit.

Cambridge University Press eBooks•Aug 30, 2012•0 citations

Quantum mechanics from an epistemic state space

Per Östborn

We derive the Hilbert space formalism of quantum mechanics from epistemic principles. A key assumption is that a physical theory that relies on entities or distinctions that are unknowable in principle gives rise to wrong predictions. An epistemic formalism is developed, where concepts like individual and collective knowledge are used, and knowledge may be actual or potential. The physical state $S$ corresponds to the collective potential knowledge. The state $S$ is a subset of a state space $\mathcal{S}=\{Z\}$, such that $S$ always contains several elements $Z$, which correspond to unattainable states of complete potential knowledge of the world. The evolution of $S$ cannot be determined in terms of the individual evolution of the elements $Z$, unlike the evolution of an ensemble in classical phase space. The evolution of $S$ is described in terms of sequential time $n\in \mathbf{\mathbb{N}}$, which is updated according to $n\rightarrow n+1$ each time potential knowledge changes. In certain experimental contexts $C$, there is initial knowledge at time $n$ that a given series of properties $P,P',\ldots$ will be observed within a given time frame, meaning that a series of values $p,p',\ldots$ of these properties will become known. At time $n$, it is just known that these values belong to predefined, finite sets $\{p\},\{p'\},\ldots$. In such a context $C$, it is possible to define a complex Hilbert space $\mathcal{H}_{C}$ on top of $\mathcal{S}$, in which the elements are contextual state vectors $\bar{S}_{C}$. Born's rule to calculate the probabilities to find the values $p,p',\ldots$ is derived as the only generally applicable such rule. Also, we can associate a self-adjoint operator $\bar{P}$ with eigenvalues $\{p\}$ to each property $P$ observed within $C$. These operators obey $[\bar{P},\bar{P}']=0$ if and only if the precise values of $P$ and $P'$ are simultaneoulsy knowable.

arXiv:1703.08543•Mar 24, 2017•3 citations

Efficient Hamiltonian encoding algorithms for extracting quantum control mechanism as interfering pathway amplitudes in the Dyson series

Erez Abrams, Michael Kasprzak, Gaurav Bhole +2 more

Hamiltonian encoding is a methodology for revealing the mechanism behind the dynamics governing controlled quantum systems. In this paper, following Mitra and Rabitz \cite{abhra_1}, we define mechanism via pathways of eigenstates that describe the evolution of the system, where each pathway is associated with a complex-valued amplitude corresponding to a term in the Dyson series. The evolution of the system is determined by the constructive and destructive interference of these pathway amplitudes. Pathways with similar attributes can be grouped together into pathway classes. The amplitudes of pathway classes are computed by modulating the Hamiltonian matrix elements and decoding the subsequent evolution of the system rather than by direct computation of the individual terms in the Dyson series. The original implementation of Hamiltonian encoding was computationally intensive and became prohibitively expensive in large quantum systems. This paper presents two new encoding algorithms that calculate the amplitudes of pathway classes by using techniques from graph theory and algebraic topology to exploit patterns in the set of allowed transitions, greatly reducing the number of matrix elements that need to be modulated. These new algorithms provide an exponential decrease in both computation time and memory utilization with respect to the Hilbert space dimension of the system. To demonstrate the use of these techniques, they are applied to two illustrative state-to-state transition problems.

arXiv:2406.05585•Quantum•Feb 10, 2025•1 citation

Mathematical Results in Quantum Mechanics

J. Dittrich, Pavel Exner, Miloš Tater

At the age of almost three quarters of a century, quantum mechanics is by all accounts a mature theory. There were times when it seemed that it had borne its best fruit already and would give way to investigation of deeper levels of matter. Today this sounds like rash thinking. Modern experimental techniques have led to discoveries of numerous new quantum effects in solid state, optics and elsewhere. Quantum mechanics is thus gradually becoming a basis for many branches of applied physics, in this way entering our everyday life. While the dynamic laws of quantum mechanics are well known, a proper theoretical understanding requires methods which would allow us to de­ rive the abundance of observed quantum effects from the first principles. In many cases the rich structure hidden in the Schr6dinger equation can be revealed only using sophisticated tools. This constitutes a motivation to investigate rigorous methods which yield mathematically well-founded properties of quantum systems.

Birkhäuser Basel eBooks•Jan 1, 1999•22 citations
The techniques of effective descriptive set theory are applied to the mathematical formalism of quantum mechanics in order to see whether it actually provides effective algorithms for the computation of various physically significant quantities, e.g. matrix elements. Various Hamiltonians are proven to be recursive (effectively computable) and shown to generate unitary groups which act recursively on the Hilbert space of physical states. In particular, it is shown that the nnn-particle Coulombic Hamiltonian is recursive, and that the time evolution of nnn-particle quantum Coulombic systems is recursive.
This book has grown out of a one term course on quantum mechanics for third year mathematics students taught in the School of Mathematics at the University of Bristol. The genesis of quantum mechanics is in the field of physics, but from early on the infusion of new mathematics into the field has often proven fruitful (e.g. Hilbert space, matrix theory, the mathematical framework of Hamiltonian mechanics, tensor products, etc.). This course seeks to develop the mathematical framework that will equip the student for further studies in quantum mechanics while, at the same time, providing some insight into “what it means” physically.
This chapter gives a summary of the mathematical formalism used in quantum mechanics, with a short bibliography put directly at its end. It should be seen as a complement, to be used by readers who wish to know more than what has been recalled about the mathematical tools in the other chapters. Some results are given without explicit proofs; they can be found for instance in Chapters II and IV of [1] . Many quantum mechanics textbooks introduce its general formalism in a more complete way, for instance Chapter VII of [2] , Chapter 3 of [3] , or Chapter 2 of [4] . We first summarize the general formalism of quantum mechanics for any physical system (§11.1), with the Dirac notation; we then study how this formalism treats the grouping of several physical systems into one single quantum system (§11.2); finally, we study a few simple special cases (§11.3), for instance a single particle in an external potential, with or without spin; the reader who prefers wave functions to more abstract reasonings in spaces of states may begin with this section. General physical system The general formalism of quantum mechanics applies to all physical systems, whether they contain a single particle, many particles of various sorts, one or several fields, etc. Quantum space of states The physical state of a system at each time is defined in quantum mechanics by a state vector which, in Dirac notation, is written ∣ ψ 〈 – or ∣ ψ(t) 〈 if one wishes to make the time dependence explicit.
We derive the Hilbert space formalism of quantum mechanics from epistemic principles. A key assumption is that a physical theory that relies on entities or distinctions that are unknowable in principle gives rise to wrong predictions. An epistemic formalism is developed, where concepts like individual and collective knowledge are used, and knowledge may be actual or potential. The physical state SSS corresponds to the collective potential knowledge. The state SSS is a subset of a state space S={Z}\mathcal{S}=\{Z\}S={Z}, such that SSS always contains several elements ZZZ, which correspond to unattainable states of complete potential knowledge of the world. The evolution of SSS cannot be determined in terms of the individual evolution of the elements ZZZ, unlike the evolution of an ensemble in classical phase space. The evolution of SSS is described in terms of sequential time n∈Nn\in \mathbf{\mathbb{N}}n∈N, which is updated according to n→n+1n\rightarrow n+1n→n+1 each time potential knowledge changes. In certain experimental contexts CCC, there is initial knowledge at time nnn that a given series of properties P,P′,…P,P',\ldotsP,P′,… will be observed within a given time frame, meaning that a series of values p,p′,…p,p',\ldotsp,p′,… of these properties will become known. At time nnn, it is just known that these values belong to predefined, finite sets {p},{p′},…\{p\},\{p'\},\ldots{p},{p′},…. In such a context CCC, it is possible to define a complex Hilbert space HC\mathcal{H}_{C}HC​ on top of S\mathcal{S}S, in which the elements are contextual state vectors SˉC\bar{S}_{C}SˉC​. Born's rule to calculate the probabilities to find the values p,p′,…p,p',\ldotsp,p′,… is derived as the only generally applicable such rule. Also, we can associate a self-adjoint operator Pˉ\bar{P}Pˉ with eigenvalues {p}\{p\}{p} to each property PPP observed within CCC. These operators obey [Pˉ,Pˉ′]=0[\bar{P},\bar{P}']=0[Pˉ,Pˉ′]=0 if and only if the precise values of PPP and P′P'P′ are simultaneoulsy knowable.
Hamiltonian encoding is a methodology for revealing the mechanism behind the dynamics governing controlled quantum systems. In this paper, following Mitra and Rabitz \cite{abhra_1}, we define mechanism via pathways of eigenstates that describe the evolution of the system, where each pathway is associated with a complex-valued amplitude corresponding to a term in the Dyson series. The evolution of the system is determined by the constructive and destructive interference of these pathway amplitudes. Pathways with similar attributes can be grouped together into pathway classes. The amplitudes of pathway classes are computed by modulating the Hamiltonian matrix elements and decoding the subsequent evolution of the system rather than by direct computation of the individual terms in the Dyson series. The original implementation of Hamiltonian encoding was computationally intensive and became prohibitively expensive in large quantum systems. This paper presents two new encoding algorithms that calculate the amplitudes of pathway classes by using techniques from graph theory and algebraic topology to exploit patterns in the set of allowed transitions, greatly reducing the number of matrix elements that need to be modulated. These new algorithms provide an exponential decrease in both computation time and memory utilization with respect to the Hilbert space dimension of the system. To demonstrate the use of these techniques, they are applied to two illustrative state-to-state transition problems.
At the age of almost three quarters of a century, quantum mechanics is by all accounts a mature theory. There were times when it seemed that it had borne its best fruit already and would give way to investigation of deeper levels of matter. Today this sounds like rash thinking. Modern experimental techniques have led to discoveries of numerous new quantum effects in solid state, optics and elsewhere. Quantum mechanics is thus gradually becoming a basis for many branches of applied physics, in this way entering our everyday life. While the dynamic laws of quantum mechanics are well known, a proper theoretical understanding requires methods which would allow us to de­ rive the abundance of observed quantum effects from the first principles. In many cases the rich structure hidden in the Schr6dinger equation can be revealed only using sophisticated tools. This constitutes a motivation to investigate rigorous methods which yield mathematically well-founded properties of quantum systems.