Speakable in quantum mechanics

Hermens, Ronnie

doi:10.1007/s11229-012-0158-z

Cited by 3 publications

(7 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…And as a guide to such a logic one may take into account Bohr's demand that all well-defined experimental evidence, even if it cannot be analyzed in terms of classical physics, must be expressed in ordinary language making use of common logic. -Bohr [4] In this paper I continue the work done in [14] to meet this demand. Specifically, in section 2 I first introduce a lattice of experimental propositions S QM which is then extended to an intuitionistic logic L QM in section 3.…”

Section: Introductionmentioning

confidence: 86%

“…Specifically, in section 2 I first introduce a lattice of experimental propositions S QM which is then extended to an intuitionistic logic L QM in section 3. These results comprise a summary of some of the results in [14]. Then, also in section 3, this logic is extended to a classical logic CL QM for experimental propositions.…”

Section: Introductionmentioning

confidence: 90%

“…These assumptions are the ones also adopted in[14] although there the second was implicit and the first was formulated to also apply to other theories 3. This assumption is reminiscent of the FUNC rule adopted in the Kochen-Specker theorem (c.f.…”

mentioning

confidence: 99%

“…

This paper summarizes and elaborates on some of the results in [14]. The summary consists of a short version of the derivation of the intuitionistic quantum logic L QM (which was originally introduced in [6]).

…”

mentioning

confidence: 99%

See 3 more Smart Citations

Speakable in quantum mechanics: babbling on

Hermens

2014

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

This paper consists of a short version of the derivation of the intuitionistic quantum logic L_QM (which was originally introduced by Caspers, Heunen, Landsman and Spitters). The elaboration consists of extending this logic to a classical logic CL_QM. Some first steps are then taken towards setting up a probabilistic framework based on CL_QM in terms of R\'enyi's conditional probability spaces. Comparisons are then made with the traditional framework for quantum probabilities.Comment: In Proceedings QPL 2012, arXiv:1407.842

show abstract

Section: Introductionmentioning

confidence: 86%

Section: Introductionmentioning

confidence: 90%

mentioning

confidence: 99%

“…

…”

mentioning

confidence: 99%

See 2 more Smart Citations

Speakable in quantum mechanics: babbling on

Hermens

2014

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…3. Specific logical frameworks and analyses can -highlight features of the formalism [548], -contribute to understanding how that formalism relates to independent reality [481,549], and -assess whether or not quantum mechanics necessarily requires new notions of truth [550][551][552][553][554].…”

Section: Other Useful Framework: Modal Relational and Logical Appromentioning

confidence: 99%

Understanding quantum mechanics: a review and synthesis in precise language

Drummond¹

2019

Open Physics

View full text Add to dashboard Cite

This review, of the understanding of quantum mechanics, is broad in scope, and aims to reflect enough of the literature to be representative of the current state of the subject. To enhance clarity, the main findings are presented in the form of a coherent synthesis of the reviewed sources. The review highlights core characteristics of quantum mechanics. One is statistical balance in the collective response of an ensemble of identically prepared systems, to differing measurement types. Another is that states are mathematical terms prescribing probability aspects of future events, relating to an ensemble of systems, in various situations. These characteristics then yield helpful insights on entanglement, measurement, and widely-discussed experiments and analyses. The review concludes by considering how these insights are supported, illustrated and developed by some specific approaches to understanding quantum mechanics. The review uses non-mathematical language precisely (terms defined) and rigorously (consistent meanings), and uses only such language. A theory more descriptive of independent reality than is quantum mechanics may yet be possible. One step in the pursuit of such a theory is to reach greater consensus on how to understand quantum mechanics. This review aims to contribute to achieving that greater consensus, and so to that pursuit.

show abstract

Computing the Exit Complexity of Knowledge in Distributed Quantum Computers

Abbas¹

2012

IJACSA

View full text Add to dashboard Cite

Abstract-Distributed Quantum computers abide from the exit complexity of the knowledge. The exit complexity is the accrue of the nodal information needed to clarify the total egress system with deference to a distinguished exit node. The core objective of this paper is to compile an arrogant methodology for assessing the exit complexity of the knowledge in distributed quantum computers. The proposed methodology is based on contouring the knowledge using the unlabeled binary trees, hence building an benchmarked and a computer based model. The proposed methodology dramatizes knowledge autocratically calculates the exit complexity. The methodology consists of several amphitheaters, starting with detecting the baron aspect of the tree of others entitled express knowledge and then measure the volume of information and the complexity of behavior destining from the bargain of information. Then calculate egress resulting from episodes that do not lead to the withdrawal of the information. In the end is calculated total egress complexity and then appraised total exit complexity of the system. Given the complexity of the operations within the Distributed Computing Quantity, this research addresses effective transactions that could affect the three-dimensional behavior of knowledge. The results materialized that the best affair where total exit complexity as minimal as possible is a picture of a binary tree is entitled at the rate of positive and negative cardinal points medium value. It could be argued that these cardinal points should not amass the upper bound apex or minimum.

show abstract

Speakable in quantum mechanics

Cited by 3 publications

References 28 publications

Speakable in quantum mechanics: babbling on

Speakable in quantum mechanics: babbling on

Understanding quantum mechanics: a review and synthesis in precise language

Computing the Exit Complexity of Knowledge in Distributed Quantum Computers

Contact Info

Product

Resources

About