Searcharxiv⌕ Search

arXiv subjects

Jim McElwaine

Publications and source records attributed to Jim McElwaine.

5 recordsLinked to original sources

Laws of Granular Solids. Geometry and Topology

In a granular solid, mechanical equilibrium requires a delicate balance of forces at the disordered grain scale. To understand how macroscopic rigidity can emerge in this amorphous solid, it is crucial that we understand how Newton's laws pass from the disordered grain scale to the laboratory scale. In this work, we introduce an exact discrete calculus, in which Newton's laws appear as differential relations at the scale of a single grain. Using this calculus, we introduce gauge variables which describe identically force- and torque-balanced configurations. In a first, intrinsic formulation, we use the topology of the contact network, but not its geometry. In a second, extrinsic formulation, we introduce geometry with the Delaunay triangulation. These formulations show, with exact methods, how topology and geometry in a disordered medium are related by constraints. In particular, we derive Airy's expression for a divergence-free, symmetric stress tensor in two and three dimensions.

cond-mat.soft↗

Random Hamiltonian Models and Quantum Prediction Algorithms

This paper describes an algorithm for selecting a consistent set within the consistent histories approach to quantum mechanics and investigates its properties. The algorithm select from among the consistent sets formed by projections defined by the Schmidt decomposition by making projections at the earliest possible time. The algorithm unconditionally predicts the possible events in closed quantum systems and ascribes probabilities to these events. A simple random Hamiltonian model is described and the results of applying the algorithm to this model using computer programs are discussed and compared with approximate analytic calculations.

quant-ph↗

Approximate Consistency and Prediction Algorithms in Quantum Mechanics

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.

quant-ph↗

Maximum Information and Quantum Prediction Algorithms

This paper describes an algorithm for selecting a consistent set within the consistent histories approach to quantum mechanics and investigates its properties. The algorithm uses a maximum information principle to select from among the consistent sets formed by projections defined by the Schmidt decomposition. The algorithm unconditionally predicts the possible events in closed quantum systems and ascribes probabilities to these events. A simple spin model is described and a complete classification of all exactly consistent sets of histories formed from Schmidt projections in the model is proved. This result is used to show that for this example the algorithm selects a physically realistic set. Other tentative suggestions in the literature for set selection algorithms using ideas from information theory are discussed.

quant-ph↗

Quantum Prediction Algorithms

The consistent histories formulation of the quantum theory of a closed system with pure initial state defines an infinite number of incompatible consistent sets, each of which gives a possible description of the physics. We investigate the possibility of using the properties of the Schmidt decomposition to define an algorithm which selects a single, physically natural, consistent set. We explain the problems which arise, set out some possible algorithms, and explain their properties with the aid of simple models. Though the discussion is framed in the language of the consistent histories approach, it is intended to highlight the difficulty in making any interpretation of quantum theory based on decoherence into a mathematically precise theory.

gr-qc↗