A New Quantum Computing Architecture: Measurement as Geometric Collapse v4.0

David Michael Doy

PAPER · v1.0 · 2026-07-11 · human

Formal Sciences Computer Science Computer architecture

Abstract

We present a new quantum computing architecture in which measurement is not a postulate but a derived operation—a geometric phase transition along a soft mode. The architecture replaces the standard circuit model's three primitives (unitaries, measurement, classical control) with a unified 7-stage generative loop. Unitary gates correspond to variational flow and coherence ascent. Measurement corresponds to collapse along a soft mode, with probabilities given by the Born rule derived from variance distributions. Classical control corresponds to invariant update and loop nesting. The architecture provides: A mechanistic origin for ℏeffℏeff​ A geometric interpretation of error correction as coherence maintenance A unified framework for quantum computation, quantum foundations, and cognition A connection to measurement-induced phase transitions (MIPT) Hardware implications including new gate types, qubit types, and error correction A new complexity class: GQC (Generative Quantum Computation) Experimental signatures testable in near-term quantum hardware We illustrate the architecture with Grover's algorithm and discuss implications for measurement-based quantum computing, fault tolerance, and the quantum-to-classical transition. Key Results Measurement is derived, not postulated—it is geometric collapse along a soft mode Collapse is a local phase transition triggered by λmin⁡(C)=0λmin​(C)=0 The Born rule is derived from GG-variance distributions ℏeffℏeff​ has a mechanistic origin as GG-fluctuations Error correction is coherence maintenance inside the coherence cone Quantum circuits are generative loops; classical control is invariant update Grover's algorithm emerges naturally as a trajectory inside the coherence cone Unifies quantum computation, collapse physics, and cognition under a single framework The Unified Generative Hamiltonian H^gen=H^A+H^C+H^collapse H^gen​=H^A​+H^C​+H^collapse​ where: H^AH^A​ generates unitary evolution (variational flow) H^CH^C​ generates entangling gates (coherence ascent) H^collapseH^collapse​ drives collapse along the soft mode (measurement) This is the first Hamiltonian that unifies unitary evolution and collapse in a single operator.

Keywords

quantum computing measurement problem quantum error quantum foundations

Download PDF