Skip to content
Research Article Open access CC BY 4.0

The Computational Limit to Quantum Determinism and the Black Hole Information Loss Paradox

Arkady Bolotin

Physical Science International Journal · pp. 107–113 · Published 8 Jun 2015

10.9734/PSIJ/2015/18414

Abstract

The present paper scrutinizes the principle of quantum determinism, which maintains that the complete information about the initial quantum state of a physical system should determine the system’s quantum state at any other time. As it shown in the paper, assuming the strong exponential time hypothesis, SETH, which conjectures that known algorithms for solving computational NP-complete problems (often brute-force algorithms) are optimal, the quantum deterministic principle cannot be used generally, i.e., for randomly selected physical systems, particularly macroscopic systems. In other words, even if the initial quantum state of an arbitrary system were precisely known, as long as SETH is true it might be impossible in the real world to predict the system’s exact final quantum state. The paper suggests that the breakdown of quantum determinism in a process, in which a black hole forms and then completely evaporates, might actually be physical evidence supporting SETH.  

Determinism Schrödinger’s equation computational complexity NP-complete problems exact algorithms strong exponential time hypothesis information loss paradox

References (37)

  1. 1 Computers and Intractability: A Guide to the Theory of NP-Completeness
  2. 2 Particle creation by black holes [DOI]
  3. 3 Reducibility among Combinatorial Problems [DOI]
  4. 4 Combinatorial Optimization: Algorithms and Complexity. [DOI]
  5. 5 Combinatorial optimization:Algorithms and complexity [DOI]
  6. 6 Breakdown of predictability in gravitational collapse [DOI]
  7. 7 Ising formulations of many NP problems [DOI]
  8. 8 Particle creation by black holes [DOI]
  9. 9 Which Problems Have Strongly Exponential Complexity? [DOI]
  10. 10 Reducibility Among Combinatorial Problems
  11. 11 On the computational complexity of Ising spin glass models [DOI]
  12. 12 On the Complexity of k-SAT [DOI]
  13. 13 Black holes: Complementarity or firewalls?
  14. 14 The information paradox: a pedagogical introduction [DOI]
  15. 15 Exact Algorithms for NP-Hard Problems: A Survey [DOI]
  16. 16 Better Late than Never: Information Retrieval from Black Holes [DOI]
  17. 17 Exact Exponential Algorithms [DOI]
  18. 18 Lower Bounds Based on the Exponential-Time Hypothesis [DOI]
  19. 19 Black hole evaporation: a paradigm [DOI]
  20. 20 Phase Transitions in Combinatorial Optimization Problems [DOI]
  21. 21 On the possibility of faster SAT algorithms
  22. 22 Which problems have strongly exponential complexity? [DOI]
  23. 23 Sign- and Magnitude-Tunable Coupler for Superconducting Flux Qubits [DOI]
  24. 24 The Complexity of Satisfiability of Small Depth Circuits [DOI]
  25. 25 On Problems as Hard as CNF-SAT [DOI]
  26. 26 Benefits of Objective Collapse Models for Cosmology and Quantum Gravity [DOI]
  27. 27 The quantum adiabatic optimization algorithm and local minima [DOI]
  28. 28 A relational solution to the problem of time in quantum mechanics and quantum gravity: a fundamental mechanism for quantum decoherence [DOI]
  29. 29 On the possibility of faster SAT algorithms [DOI]
  30. 30 Exact exponential algorithms [DOI]
  31. 31 Realistic Clocks, Universal Decoherence, and the Black Hole Information Paradox [DOI]
  32. 32 On Moderately Exponential Time for SAT [DOI]
  33. 33 Less Interpretation and More Decoherence in Quantum Gravity and Inflationary Cosmology [DOI]
  34. 34 Entanglement as Topology: Hopf Linking as the Geometric Origin of Quantum Correlation [DOI]
  35. 35 How Powerful is Adiabatic Quantum Computation
  36. 36 The Quantum Adiabatic Algorithm applied to random optimization problems: the quantum spin glass perspective
  37. 37 Do Black Holes Destroy Information? [DOI]

Cited by 0

No indexed citations yet.

Related research

Article metrics

Real usage data collected on this platform.

10

Page views

0

PDF downloads

0

Outbound clicks

0

Citations

Views over time

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

Traffic sources

Referring site, by host.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.