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

A Computational Model for Quantum Measurement

Srikanth, R

Published Feb 20, 2003• 8 citations
OpenAlex

Abstract

Is the dynamical evolution of physical systems objectively a manifestation of information processing by the universe? We find that an affirmative answer has important consequences for the measurement problem. In particular, we calculate the amount of quantum information processing involved in the evolution of physical systems, assuming a finite degree of fine-graining of Hilbert space. This assumption is shown to imply that there is a finite capacity to sustain the immense entanglement that measurement entails. When this capacity is overwhelmed, the system's unitary evolution becomes computationally unstable and the system suffers an information transition (`collapse'). Classical behaviour arises from the rapid cycles of unitary evolution and information transitions. Thus, the fine-graining of Hilbert space determines the location of the `Heisenberg cut', the mesoscopic threshold separating the microscopic, quantum system from the macroscopic, classical environment. The model can be viewed as a probablistic complement to decoherence, that completes the measurement process by turning decohered improper mixtures of states into proper mixtures. It is shown to provide a natural resolution to the measurement problem and the basis problem.

Related papers

The Quantum Measurement Problem and Physical reality: A Computation Theoretic Perspective

R. Srikanth

Abstract. Is the universe computable? If yes, is it computationally a polynomial place? In standard quantum mechanics, which permits infinite parallelism and the infinitely precise specification of states, a negative answer to both questions is not ruled out. On the other hand, empirical evidence suggests that NP-complete problems are intractable in the physical world. Likewise, computational problems known to be algorithmically uncomputable do not seem to be computable by any physical algorithms on the one hand, and physical computers on the other, finds a natural explanation if the universe is assumed to be algorithmic; that is, that physical reality is the product of discrete subphysical information processing equivalent to the actions of a probabilistic Turing machine. This assumption can be reconciled with the observed exponentiality of quantum systems at microscopic scales, and the consequent possibility of implementing Shor's quantum polynomial time algorithm at that scale, provided the degree of superposition is intrinsically, finitely upper-bounded. If this bound is associated with the quantum-classical divide (the Heisenberg cut), a natural resolution to the quantum measurement problem arises. From this viewpoint, macroscopic classicality is an evidence that the universe is in BPP, and both questions raised above receive affirmative answers. A recently proposed computational model of quantum measurement, which relates the Heisenberg cut to the discreteness of Hilbert space, is briefly discussed. A connection to quantum gravity is noted. Our results are compatible with the philosophy that mathematical truths are independent of the laws of physics.

•Feb 14, 2006•8 citations

The quantum measurement problem as a witness to "It from bit"

R. Srikanth

A conceptual difficulty in the foundations of quantum mechanics is the quantum measurement problem (QMP), essentially concerned with the apparent non-unitarity of the measurement process and the classicality of macroscopic systems. In an information theoretic approach proposed by us earlier (Quantum Information Processing 2, 153, 2003), which we clarify and elaborate here, QMP is understood to signal a fundamental finite resolution of quantum states, or, equivalently, a discreteness of Hilbert space. This was motivated by the notion that physical reality is a manifestation of information stored and discrete computations performed at a deeper, sub-physical layer. This model entails that states of sufficiently complex, entangled systems will be unresolvable, or, {\em computationally unstable}. Wavefunction collapse is postulated as an error preventive response to such computational instability. In effect, sufficiently complex systems turn classical because of the finiteness of the computational resources available to the physical universe. We show that this model forms a reasonable complement to decoherence for resolving QMP, both in respect of the problem of definite outcomes and of the preferred basis problem. The model suggests that QMP, as a window on the sub-physical universe, serves as a witness to Wheeler's koan ``it from bit''. Some implications for quantum computation and quantum gravity are examined.

arXiv:quant-ph/0601062•Jan 10, 2006•0 citations

The Quantum Measurement Problem and Physical reality: A Computation Theoretic Perspective

R. Srikanth

Is the universe computable? If yes, is it computationally a polynomial place? In standard quantum mechanics, which permits infinite parallelism and the infinitely precise specification of states, a negative answer to both questions is not ruled out. On the other hand, empirical evidence suggests that NP‐complete problems are intractable in the physical world. Likewise, computational problems known to be algorithmically uncomputable do not seem to be computable by any physical means. We suggest that this close correspondence between the efficiency and power of abstract algorithms on the one hand, and physical computers on the other, finds a natural explanation if the universe is assumed to be algorithmic; that is, that physical reality is the product of discrete sub‐physical information processing equivalent to the actions of a probabilistic Turing machine. This assumption can be reconciled with the observed exponentiality of quantum systems at microscopic scales, and the consequent possibility of implementing Shor’s quantum polynomial time algorithm at that scale, provided the degree of superposition is intrinsically, finitely upper‐bounded. If this bound is associated with the quantum‐classical divide (the Heisenberg cut), a natural resolution to the quantum measurement problem arises. From this viewpoint, macroscopic classicality is an evidence that the universe is in BPP, and both questions raised above receive affirmative answers. A recently proposed computational model of quantum measurement, which relates the Heisenberg cut to the discreteness of Hilbert space, is briefly discussed. A connection to quantum gravity is noted. Our results are compatible with the philosophy that mathematical truths are independent of the laws of physics.

arXiv:quant-ph/0602114•AIP conference proceedings•Jan 1, 2006•4 citations

Computable Functions, the Church-Turing Thesis and the Quantum Measurement Problem

R. Srikanth

It is possible in principle to construct quantum mechanical observables and unitary operators which, if implemented in physical systems as measurements and dynamical evolution, would contradict the Church-Turing thesis, which lies at the foundation of computer science. Elsewhere we have argued that the quantum measurement problem implies a finite, computational model of the measurement and evolution of quantum states. If correct, this approach helps to identify the key feature that can reconcile quantum mechanics with the Church-Turing thesis: finitude of the degree of fine-graining of Hilbert space. This suggests that the Church-Turing thesis constrains the physical universe and thereby highlights a surprising connection between purely logical and algorithmic considerations on the one hand and physical reality on the other.

arXiv:quant-ph/0402128•Feb 18, 2004•5 citations

Resolution of the Quantum Measurement Problem in Self-Construction Theory

Sun Chong

Abstract: The quantum measurement problem has been the deepest conceptual difficulty since the birth of quantum mechanics. Standard quantum mechanics accepts wavefunction collapse as an independent postulate but never provides a physical explanation. The decoherence approach attributes collapse to the interaction between the system and its environment, but faces two fundamental limitations: the “infinite regress” problem and the “insufficiency of decoherence” problem. Within the framework of the Self-Construction Theory (SCT), this paper provides a complete resolution of the measurement problem. The core thesis is that quantum measurement is not a fundamental process independent of the laws of physical evolution, but rather a local manifestation of constructive renormalization—the scale evolution of the spacetime complex field $K$ from microscopic degrees of freedom to macroscopic effective descriptions. The origins of wavefunction collapse, decoherence, and the Born rule receive a unified first‑principles interpretation in this framework. SCT’s spontaneous decoherence mechanism is the key to the resolution. Constructive renormalization inherently involves information loss—the integrated‑out microscopic degrees of freedom no longer exist in the macroscopic effective description. During a measurement, the measuring apparatus possesses a huge number ($\sim10^{23}$) of microscopic degrees of freedom. When the apparatus interacts with the measured system, constructive renormalization triggers information compression of these degrees of freedom—the apparatus can no longer distinguish which branch of the superposition it is in, and quantum coherence is thus spontaneously lost. No “external environment” is needed—the constructive renormalization dynamics of spacetime itself is the ultimate source of decoherence, thereby completely solving the “infinite regress” problem. Among the probability distribution given by the Born rule, the weights of non‑maximal probability branches are further suppressed by information compression under the huge number of microscopic degrees of freedom, so that macroscopic observers can perceive only a definite outcome in the effective description. The information loss caused by constructive renormalization is ontological—it does not rely on any approximation or truncation, thus fundamentally solving the “insufficiency of decoherence” problem. The Born rule—that measurement outcomes occur with probabilities given by the squared amplitudes—is directly derived from the constructive integral structure in SCT. In the constructive renormalization limit, interference terms between different configurations are naturally suppressed by off‑diagonal phase randomization, and the system automatically switches to a classical probabilistic description. In the diagonal density matrix representation, the squared amplitude is the only natural weight that is simultaneously real and non‑negative. Hence the Born rule is not an additional postulate of quantum mechanics but a necessary and unique manifestation of the relative frequencies of the constructive integral in the constructive renormalization limit. This derivation is rigorous within the mathematical framework of constructive renormalization—it does not rely on any approximations or truncations. SCT’s quantum measurement theory is deeply unified with the black hole information paradox. The “collapse” in quantum measurement and the “information loss” in black hole evaporation are different manifestations of the same core mechanism—the redistribution of information due to constructive renormalization—in two extreme physical situations. In quantum measurement, information is redistributed into the degrees of freedom of the macroscopic apparatus; in black hole evaporation, information is redistributed into the time‑point configurations on the horizon. This unification is the strongest proof of the universality of constructive renormalization as an information‑processing mechanism. Keywords: quantum measurement; spontaneous decoherence; constructive renormalization; Born rule; wavefunction collapse; information redistribution; Self-Construction Theory

•Jun 2, 2026•0 citations

Computational solution to quantum foundational problems

Arkady Bolotin

This paper argues that the requirement of applicableness of quantum linearity to any physical level from molecules and atoms to the level of macroscopic extensional world, which leads to a main foundational problem in quantum theory referred to as the "measurement problem", actually has a computational character: It implies that there is a generic algorithm, which guarantees exact solutions to the Schrodinger equation for every physical system in a reasonable amount of time regardless of how many constituent microscopic particles it comprises. From the point of view of computational complexity theory, this requirement is equivalent to the assumption that the computational complexity classes P and NP are equal, which is widely believed to be very unlikely. As demonstrated in the paper, accepting the different computational assumption called the Exponential Time Hypothesis (that involves P!=NP) would justify the separation between a microscopic quantum system and a macroscopic apparatus (usually called the Heisenberg cut) since this hypothesis, if true, would imply that deterministic quantum and classical descriptions are impossible to overlap in order to obtain a rigorous derivation of complete properties of macroscopic objects from their microstates.

arXiv:1403.7686•Mar 30, 2014•0 citations
Is the dynamical evolution of physical systems objectively a manifestation of information processing by the universe? We find that an affirmative answer has important consequences for the measurement problem. In particular, we calculate the amount of quantum information processing involved in the evolution of physical systems, assuming a finite degree of fine-graining of Hilbert space. This assumption is shown to imply that there is a finite capacity to sustain the immense entanglement that measurement entails. When this capacity is overwhelmed, the system's unitary evolution becomes computationally unstable and the system suffers an information transition (collapse'). Classical behaviour arises from the rapid cycles of unitary evolution and information transitions. Thus, the fine-graining of Hilbert space determines the location of the Heisenberg cut', the mesoscopic threshold separating the microscopic, quantum system from the macroscopic, classical environment. The model can be viewed as a probablistic complement to decoherence, that completes the measurement process by turning decohered improper mixtures of states into proper mixtures. It is shown to provide a natural resolution to the measurement problem and the basis problem.
Abstract. Is the universe computable? If yes, is it computationally a polynomial place? In standard quantum mechanics, which permits infinite parallelism and the infinitely precise specification of states, a negative answer to both questions is not ruled out. On the other hand, empirical evidence suggests that NP-complete problems are intractable in the physical world. Likewise, computational problems known to be algorithmically uncomputable do not seem to be computable by any physical algorithms on the one hand, and physical computers on the other, finds a natural explanation if the universe is assumed to be algorithmic; that is, that physical reality is the product of discrete subphysical information processing equivalent to the actions of a probabilistic Turing machine. This assumption can be reconciled with the observed exponentiality of quantum systems at microscopic scales, and the consequent possibility of implementing Shor's quantum polynomial time algorithm at that scale, provided the degree of superposition is intrinsically, finitely upper-bounded. If this bound is associated with the quantum-classical divide (the Heisenberg cut), a natural resolution to the quantum measurement problem arises. From this viewpoint, macroscopic classicality is an evidence that the universe is in BPP, and both questions raised above receive affirmative answers. A recently proposed computational model of quantum measurement, which relates the Heisenberg cut to the discreteness of Hilbert space, is briefly discussed. A connection to quantum gravity is noted. Our results are compatible with the philosophy that mathematical truths are independent of the laws of physics.
A conceptual difficulty in the foundations of quantum mechanics is the quantum measurement problem (QMP), essentially concerned with the apparent non-unitarity of the measurement process and the classicality of macroscopic systems. In an information theoretic approach proposed by us earlier (Quantum Information Processing 2, 153, 2003), which we clarify and elaborate here, QMP is understood to signal a fundamental finite resolution of quantum states, or, equivalently, a discreteness of Hilbert space. This was motivated by the notion that physical reality is a manifestation of information stored and discrete computations performed at a deeper, sub-physical layer. This model entails that states of sufficiently complex, entangled systems will be unresolvable, or, {\em computationally unstable}. Wavefunction collapse is postulated as an error preventive response to such computational instability. In effect, sufficiently complex systems turn classical because of the finiteness of the computational resources available to the physical universe. We show that this model forms a reasonable complement to decoherence for resolving QMP, both in respect of the problem of definite outcomes and of the preferred basis problem. The model suggests that QMP, as a window on the sub-physical universe, serves as a witness to Wheeler's koan ``it from bit''. Some implications for quantum computation and quantum gravity are examined.
Is the universe computable? If yes, is it computationally a polynomial place? In standard quantum mechanics, which permits infinite parallelism and the infinitely precise specification of states, a negative answer to both questions is not ruled out. On the other hand, empirical evidence suggests that NP‐complete problems are intractable in the physical world. Likewise, computational problems known to be algorithmically uncomputable do not seem to be computable by any physical means. We suggest that this close correspondence between the efficiency and power of abstract algorithms on the one hand, and physical computers on the other, finds a natural explanation if the universe is assumed to be algorithmic; that is, that physical reality is the product of discrete sub‐physical information processing equivalent to the actions of a probabilistic Turing machine. This assumption can be reconciled with the observed exponentiality of quantum systems at microscopic scales, and the consequent possibility of implementing Shor’s quantum polynomial time algorithm at that scale, provided the degree of superposition is intrinsically, finitely upper‐bounded. If this bound is associated with the quantum‐classical divide (the Heisenberg cut), a natural resolution to the quantum measurement problem arises. From this viewpoint, macroscopic classicality is an evidence that the universe is in BPP, and both questions raised above receive affirmative answers. A recently proposed computational model of quantum measurement, which relates the Heisenberg cut to the discreteness of Hilbert space, is briefly discussed. A connection to quantum gravity is noted. Our results are compatible with the philosophy that mathematical truths are independent of the laws of physics.
It is possible in principle to construct quantum mechanical observables and unitary operators which, if implemented in physical systems as measurements and dynamical evolution, would contradict the Church-Turing thesis, which lies at the foundation of computer science. Elsewhere we have argued that the quantum measurement problem implies a finite, computational model of the measurement and evolution of quantum states. If correct, this approach helps to identify the key feature that can reconcile quantum mechanics with the Church-Turing thesis: finitude of the degree of fine-graining of Hilbert space. This suggests that the Church-Turing thesis constrains the physical universe and thereby highlights a surprising connection between purely logical and algorithmic considerations on the one hand and physical reality on the other.
Abstract: The quantum measurement problem has been the deepest conceptual difficulty since the birth of quantum mechanics. Standard quantum mechanics accepts wavefunction collapse as an independent postulate but never provides a physical explanation. The decoherence approach attributes collapse to the interaction between the system and its environment, but faces two fundamental limitations: the “infinite regress” problem and the “insufficiency of decoherence” problem. Within the framework of the Self-Construction Theory (SCT), this paper provides a complete resolution of the measurement problem. The core thesis is that quantum measurement is not a fundamental process independent of the laws of physical evolution, but rather a local manifestation of constructive renormalization—the scale evolution of the spacetime complex field KKK from microscopic degrees of freedom to macroscopic effective descriptions. The origins of wavefunction collapse, decoherence, and the Born rule receive a unified first‑principles interpretation in this framework. SCT’s spontaneous decoherence mechanism is the key to the resolution. Constructive renormalization inherently involves information loss—the integrated‑out microscopic degrees of freedom no longer exist in the macroscopic effective description. During a measurement, the measuring apparatus possesses a huge number (∼1023\sim10^{23}∼1023) of microscopic degrees of freedom. When the apparatus interacts with the measured system, constructive renormalization triggers information compression of these degrees of freedom—the apparatus can no longer distinguish which branch of the superposition it is in, and quantum coherence is thus spontaneously lost. No “external environment” is needed—the constructive renormalization dynamics of spacetime itself is the ultimate source of decoherence, thereby completely solving the “infinite regress” problem. Among the probability distribution given by the Born rule, the weights of non‑maximal probability branches are further suppressed by information compression under the huge number of microscopic degrees of freedom, so that macroscopic observers can perceive only a definite outcome in the effective description. The information loss caused by constructive renormalization is ontological—it does not rely on any approximation or truncation, thus fundamentally solving the “insufficiency of decoherence” problem. The Born rule—that measurement outcomes occur with probabilities given by the squared amplitudes—is directly derived from the constructive integral structure in SCT. In the constructive renormalization limit, interference terms between different configurations are naturally suppressed by off‑diagonal phase randomization, and the system automatically switches to a classical probabilistic description. In the diagonal density matrix representation, the squared amplitude is the only natural weight that is simultaneously real and non‑negative. Hence the Born rule is not an additional postulate of quantum mechanics but a necessary and unique manifestation of the relative frequencies of the constructive integral in the constructive renormalization limit. This derivation is rigorous within the mathematical framework of constructive renormalization—it does not rely on any approximations or truncations. SCT’s quantum measurement theory is deeply unified with the black hole information paradox. The “collapse” in quantum measurement and the “information loss” in black hole evaporation are different manifestations of the same core mechanism—the redistribution of information due to constructive renormalization—in two extreme physical situations. In quantum measurement, information is redistributed into the degrees of freedom of the macroscopic apparatus; in black hole evaporation, information is redistributed into the time‑point configurations on the horizon. This unification is the strongest proof of the universality of constructive renormalization as an information‑processing mechanism. Keywords: quantum measurement; spontaneous decoherence; constructive renormalization; Born rule; wavefunction collapse; information redistribution; Self-Construction Theory
This paper argues that the requirement of applicableness of quantum linearity to any physical level from molecules and atoms to the level of macroscopic extensional world, which leads to a main foundational problem in quantum theory referred to as the "measurement problem", actually has a computational character: It implies that there is a generic algorithm, which guarantees exact solutions to the Schrodinger equation for every physical system in a reasonable amount of time regardless of how many constituent microscopic particles it comprises. From the point of view of computational complexity theory, this requirement is equivalent to the assumption that the computational complexity classes P and NP are equal, which is widely believed to be very unlikely. As demonstrated in the paper, accepting the different computational assumption called the Exponential Time Hypothesis (that involves P!=NP) would justify the separation between a microscopic quantum system and a macroscopic apparatus (usually called the Heisenberg cut) since this hypothesis, if true, would imply that deterministic quantum and classical descriptions are impossible to overlap in order to obtain a rigorous derivation of complete properties of macroscopic objects from their microstates.