2006
DOI: 10.1063/1.2400889
|View full text |Cite
|
Sign up to set email alerts
|

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

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 means. We suggest that this close … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
12
0

Year Published

2008
2008
2016
2016

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 7 publications
(13 citation statements)
references
References 42 publications
(68 reference statements)
1
12
0
Order By: Relevance
“…Since, as noted earlier, the coin makes the walk reversible, we have the interesting scenario that the relativistic causal structure is fundamentally a consequence of conservation of information. This is in accordance with some recent works that have studied possible information theoretical bases for the mathematical structure of quantum mechanics [39][40][41][42].…”
Section: A Decoupled Discrete-time Quantum Walk Equation In Klein-gosupporting
confidence: 92%
“…Since, as noted earlier, the coin makes the walk reversible, we have the interesting scenario that the relativistic causal structure is fundamentally a consequence of conservation of information. This is in accordance with some recent works that have studied possible information theoretical bases for the mathematical structure of quantum mechanics [39][40][41][42].…”
Section: A Decoupled Discrete-time Quantum Walk Equation In Klein-gosupporting
confidence: 92%
“…The Church-Turing thesis of computer science [22] may then be invoked to suggest that no physical process, interpreted as a procedure for computing a function, can be more powerful than Turing machines. Thus the incompleteness of physics could manifest in the physical uncomputability of Turing uncomputable problems [46].…”
Section: B Bhip Viewed As An Inconsistent Self-reference In Quantum G...mentioning
confidence: 99%
“…In Ref. [8], we speculate that this scale is related to a discretization of Hilbert space. This approach provides a possible computation theoretic resolution to the quantum measurement problem.…”
Section: Introductionmentioning
confidence: 95%
“…Other recent related works that have studied the computational power of variants of standard physical theories from a complexity or computability perspective are, respectively, Refs. [8,[13][14][15][16] and Refs. [8,13].…”
Section: Introductionmentioning
confidence: 99%