Table of Contents
Fetching ...

From Heisenberg and Schrödinger to the P vs. NP Problem

Galina Weinstein

TL;DR

The paper reframes the historical development of quantum mechanics as an epistemic split between procedural construction (matrix mechanics, Heisenberg) and recognitional representation (wave mechanics, Schrödinger), unified later by Hilbert-space formalism. It then translates this split into computational terms, using P vs NP and BQP to illuminate why construction and recognition can diverge in principle even when theories are mathematically equivalent. Quantum computation is shown to partially bridge the gap via interference, enabling certain recognitional patterns to emerge from procedural dynamics, but the author argues that NP problems resist efficient quantum construction (NP ⊄ BQP) in line with physical and computational evidence. The discussion culminates in a broader view: von Neumann’s unification is a linguistic consolidation of two epistemic styles, while complexity theory provides a contemporary framework for understanding the limits of what nature can construct versus what it can reveal by recognition. The work has implications for understanding the foundations of science, the interpretation of quantum theory, and the limits of computational approaches to physical knowledge, including scenarios like black-hole information processing.

Abstract

This essay offers an epistemological reinterpretation of the foundational divide between matrix mechanics and wave mechanics. Though formally equivalent, the two theories embody distinct modes of knowing: procedural construction and recognitional verification. These epistemic architectures anticipate, in philosophical form, the logical asymmetry expressed by the P versus NP problem in computational complexity. Here, the contrast between efficient generation and efficient recognition is treated not as a mathematical taxonomy but as a framework for understanding how knowledge is produced and validated across physics, computation, and cognition. The essay reconstructs the mathematical history of quantum mechanics through the original derivations of Werner Heisenberg, Max Born, Pascual Jordan, Paul Dirac, Erwin Schrödinger, Paul Ehrenfest, and Wolfgang Pauli, culminating in John von Neumann's unification of both approaches within the formalism of Hilbert space. By juxtaposing Heisenberg's algorithmic formalism with Schrödinger's representational one, it argues that their divergence reveals a structural feature of scientific reasoning itself-the enduring tension between what can be procedurally constructed and what can only be recognized.

From Heisenberg and Schrödinger to the P vs. NP Problem

TL;DR

The paper reframes the historical development of quantum mechanics as an epistemic split between procedural construction (matrix mechanics, Heisenberg) and recognitional representation (wave mechanics, Schrödinger), unified later by Hilbert-space formalism. It then translates this split into computational terms, using P vs NP and BQP to illuminate why construction and recognition can diverge in principle even when theories are mathematically equivalent. Quantum computation is shown to partially bridge the gap via interference, enabling certain recognitional patterns to emerge from procedural dynamics, but the author argues that NP problems resist efficient quantum construction (NP ⊄ BQP) in line with physical and computational evidence. The discussion culminates in a broader view: von Neumann’s unification is a linguistic consolidation of two epistemic styles, while complexity theory provides a contemporary framework for understanding the limits of what nature can construct versus what it can reveal by recognition. The work has implications for understanding the foundations of science, the interpretation of quantum theory, and the limits of computational approaches to physical knowledge, including scenarios like black-hole information processing.

Abstract

This essay offers an epistemological reinterpretation of the foundational divide between matrix mechanics and wave mechanics. Though formally equivalent, the two theories embody distinct modes of knowing: procedural construction and recognitional verification. These epistemic architectures anticipate, in philosophical form, the logical asymmetry expressed by the P versus NP problem in computational complexity. Here, the contrast between efficient generation and efficient recognition is treated not as a mathematical taxonomy but as a framework for understanding how knowledge is produced and validated across physics, computation, and cognition. The essay reconstructs the mathematical history of quantum mechanics through the original derivations of Werner Heisenberg, Max Born, Pascual Jordan, Paul Dirac, Erwin Schrödinger, Paul Ehrenfest, and Wolfgang Pauli, culminating in John von Neumann's unification of both approaches within the formalism of Hilbert space. By juxtaposing Heisenberg's algorithmic formalism with Schrödinger's representational one, it argues that their divergence reveals a structural feature of scientific reasoning itself-the enduring tension between what can be procedurally constructed and what can only be recognized.

Paper Structure

This paper contains 29 sections, 144 equations, 1 table.