quant-ph

# Title:Approximate Consistency and Prediction Algorithms in Quantum Mechanics

Abstract: This dissertation investigates questions arising in the consistent histories formulation of the quantum mechanics of closed systems. Various criteria for approximate consistency are analysed. The connection between the Dowker-Halliwell criterion and sphere packing problems is shown and used to prove several new bounds on the violation of probability sum rules. The quantum Zeno effect is also analysed within the consistent histories formalism and used to demonstrate some of the difficulties involved in discussing approximate consistency. The complications associated with null histories and infinite sets are briefly discussed.
The possibility of using the properties of the Schmidt decomposition to define an algorithm which selects a single, physically natural, consistent set for pure initial density matrices is investigated. The problems that arise are explained, and different possible algorithms discussed. Their properties are analysed with the aid of simple models. A set of computer programs is described which apply the algorithms to more complicated examples.
Another algorithm is proposed that selects the consistent set (formed using Schmidt projections) with the highest Shannon information. This is applied to a simple model and shown to produce physically sensible histories. The theory is capable of unconditional probabilistic prediction for closed quantum systems, and is strong enough to be falsifiable. Ideas on applying the theory to more complicated examples are discussed.
 Comments: 176 pages, 11 figures, 19 programs Subjects: Quantum Physics (quant-ph) Journal reference: Ph.D. Thesis, Cambridge (1996) Cite as: arXiv:quant-ph/9707053 (or for this version)

## Submission history

From: Jim McElwaine [view email]
[v1] Tue, 29 Jul 1997 07:05:00 UTC (159 KB)
{"extraction_info": {"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9264620542526245, "perplexity": 1130.7673004324263}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 5, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2019-39/segments/1568514573908.70/warc/CC-MAIN-20190920071824-20190920093824-00222.warc.gz"}