arXiv subjects

James M. Chappell

Publications and source records attributed to James M. Chappell.

30 records · Page 2Linked to original sources

arXiv2013

Physical-layer encryption on the public internet: a stochastic approach to the Kish-Sethuraman cipher

While information-theoretic security is often associated with the one-time pad and quantum key distribution, noisy transport media leave room for classical techniques and even covert operation. Transit times across the public internet exhibit a degree of randomness, and cannot be determined noiselessly by an eavesdropper. We demonstrate the use of these measurements for information-theoretically secure communication over the public internet.

cs.CR↗

arXiv2012

The double-padlock problem: is secure classical information transmission possible without key exchange?

The idealized Kish-Sethuraman (KS) cipher is theoretically known to offer perfect security through a classical information channel. However, realization of the protocol is hitherto an open problem, as the required mathematical operators have not been identified in the previous literature. A mechanical analogy of this protocol can be seen as sending a message in a box using two padlocks; one locked by the Sender and the other locked by the Receiver, so that theoretically the message remains secure at all times. We seek a mathematical representation of this process, considering that it would be very unusual if there was a physical process with no mathematical description and indeed we find a solution within a four dimensional Clifford algebra. The significance of finding a mathematical description that describes the protocol, is that it is a possible step toward a physical realization having benefits in increased security with reduced complexity.

physics.class-ph↗

arXiv2012

An explanation for galaxy rotation curves using a Clifford multivector spacetime framework

We explore the consequences of space and time described within the Clifford multivector of three dimensions $ Cl_{3,0}$, where space consists of three-vectors and time is described with the three bivectors of this space. When describing the curvature around massive bodies, we show that this model of spacetime when including the Hubble expansion naturally produces the correct galaxy rotation curves without the need for dark matter.

math-ph↗

arXiv2012

The gravitational field of a cube

Large astronomical objects such as stars or planets, produce approximately spherical shapes due to the large gravitational forces, and if the object is rotating rapidly, it becomes an oblate spheroid. In juxtaposition to this, we conduct a thought experiment regarding the properties of a planet being in the form of a perfect cube. We firstly calculate the gravitational potential and from the equipotentials, we deduce the shape of the lakes that would form on the surface of such an object. We then consider the formation of orbits around such objects both with a static and a rotating cube. A possible practical application of these results is that, because cuboid objects can be easily stacked together, we can calculate the field of more complicated shapes, using the principle of superposition, by simply adding the field from a set of component shapes.

physics.class-ph↗

arXiv2012

N-player quantum games in an EPR setting

The $N$-player quantum game is analyzed in the context of an Einstein-Podolsky-Rosen (EPR) experiment. In this setting, a player's strategies are not unitary transformations as in alternate quantum game-theoretic frameworks, but a classical choice between two directions along which spin or polarization measurements are made. The players' strategies thus remain identical to their strategies in the mixed-strategy version of the classical game. In the EPR setting the quantum game reduces itself to the corresponding classical game when the shared quantum state reaches zero entanglement. We find the relations for the probability distribution for $N$-qubit GHZ and W-type states, subject to general measurement directions, from which the expressions for the mixed Nash equilibrium and the payoffs are determined. Players' payoffs are then defined with linear functions so that common two-player games can be easily extended to the $N$-player case and permit analytic expressions for the Nash equilibrium. As a specific example, we solve the Prisoners' Dilemma game for general $ N \ge 2 $. We find a new property for the game that for an even number of players the payoffs at the Nash equilibrium are equal, whereas for an odd number of players the cooperating players receive higher payoffs.

quant-ph↗

arXiv2012

An improved formalism for the Grover search algorithm

The Grover search algorithm is one of the two key algorithms in the field of quantum computing, and hence it is of significant interest to describe it in the most efficient mathematical formalism. We show firstly, that Clifford's formalism of geometric algebra, provides a significantly more efficient representation than the conventional Bra-ket notation, and secondly, that the basis defined by the states of maximum and minimum weight in the Grover search space, allows a simple visualization of the Grover search as the precession of a spin-1/2 particle. Using this formalism we efficiently solve the exact search problem, as well as easily representing more general search situations.

quant-ph↗

arXiv2011

Analyzing three-player quantum games in an EPR type setup

We use the formalism of Clifford Geometric Algebra (GA) to develop an analysis of quantum versions of three-player non-cooperative games. The quantum games we explore are played in an Einstein-Podolsky-Rosen (EPR) type setting. In this setting, the players' strategy sets remain identical to the ones in the mixed-strategy version of the classical game that is obtained as a proper subset of the corresponding quantum game. Using GA we investigate the outcome of a realization of the game by players sharing GHZ state, W state, and a mixture of GHZ and W states. As a specific example, we study the game of three-player Prisoners' Dilemma.

quant-ph↗

arXiv2011

Analysis of two-player quantum games in an EPR setting using geometric algebra

The framework for playing quantum games in an Einstein-Podolsky-Rosen (EPR) type setting is investigated using the mathematical formalism of Clifford geometric algebra (GA). In this setting, the players' strategy sets remain identical to the ones in the classical mixed-strategy version of the game, which is then obtained as proper subset of the corresponding quantum game. As examples, using GA we analyze the games of Prisoners' Dilemma and Stag Hunt when played in the EPR type setting.

quant-ph↗

arXiv2011

A Precise Error Bound for Quantum Phase Estimation

Quantum phase estimation is one of the key algorithms in the field of quantum computing, but up until now, only approximate expressions have been derived for the probability of error. We revisit these derivations, and find that by ensuring symmetry in the error definitions, an exact formula can be found. This new approach may also have value in solving other related problems in quantum computing, where an expected error is calculated. Expressions for two special cases of the formula are also developed, in the limit as the number of qubits in the quantum computer approaches infinity and in the limit as the extra added qubits to improve reliability goes to infinity. It is found that this formula is useful in validating computer simulations of the phase estimation procedure and in avoiding the overestimation of the number of qubits required in order to achieve a given reliability. This formula thus brings improved precision in the design of quantum computers.

quant-ph↗

arXiv2010

A simplified approach to electromagnetism using geometric algebra

A new simplified approach for teaching electromagnetism is presented using the formalism of geometric algebra (GA) which does not require vector calculus or tensor index notation, thus producing a much more accessible presentation for students. The four-dimensional spacetime proposed is completely symmetrical between the space and time dimensions, thus fulfilling Minkowski's original vision. In order to improve student reception we also focus on forces and the conservation of energy and momentum, which take a very simple form in GA, so that students can easily build on established intuitions in using these laws developed from studying Newtonian mechanics. The potential formulation is also integrated into the presentation that allows an alternate solution path, as well as an introduction to the Lagrangian approach. Several problems are solved throughout the text to make the implementation clear. We extend previous treatment of this area, through including the potential formulation, the conservation of energy and momentum, the generalization for magnetic monopoles, as well as simplifying previously reported results through eliminating the need for the spacetime metric.

physics.ed-ph↗

arXiv2010

Constructing quantum games from symmetric non-factorizable joint probabilities

We construct quantum games from a table of non-factorizable joint probabilities, coupled with a symmetry constraint, requiring symmetrical payoffs between the players. We give the general result for a Nash equilibrium and payoff relations for a game based on non-factorizable joint probabilities, which embeds the classical game. We study a quantum version of Prisoners' Dilemma, Stag Hunt, and the Chicken game constructed from a given table of non-factorizable joint probabilities to find new outcomes in these games. We show that this approach provides a general framework for both classical and quantum games without recourse to the formalism of quantum mechanics.

quant-ph↗

arXiv2009

An Analysis of the Quantum Penny Flip Game using Geometric Algebra

We analyze the quantum penny flip game using geometric algebra and so determine all possible unitary transformations which enable the player Q to implement a winning strategy. Geometric algebra provides a clear visual picture of the quantum game and its strategies, as well as providing a simple and direct derivation of the winning transformation, which we demonstrate can be parametrized by two angles. For comparison we derive the same general winning strategy by conventional means using density matrices.

quant-ph↗