A Flexible Design Platform for Si/SiGe Exchange-Only Qubits with Low Disorder.

Spin-based silicon quantum dots are an attractive qubit technology for quantum information processing with respect to coherence time, control, and engineering. Here we present an exchange-only Si qubit device platform that combines the throughput of CMOS-like wafer processing with the versatility of direct-write lithography. The technology, which we coin "SLEDGE", features dot-shaped gates that are patterned simultaneously on one topographical plane and subsequently connected by vias to interconnect metal lines. The process design enables nontrivial layouts as well as flexibility in gate dimensions, material selection, and additional device features such as for rf qubit control. We show that the SLEDGE process has reduced electrostatic disorder with respect to traditional overlapping gate devices with lift-off metallization, and we present spin coherent exchange oscillations and single qubit blind randomized benchmarking data.

On the equivalence between non-factorizable mixed-strategy classical games and quantum games.

A game-theoretic setting provides a mathematical basis for analysis of strategic interaction among competing agents and provides insights into both classical and quantum decision theory and questions of strategic choice. An outstanding mathematical question is to understand the conditions under which a classical game-theoretic setting can be transformed to a quantum game, and under which conditions there is an equivalence. In this paper, we consider quantum games as those that allow non-factorizable probabilities. We discuss two approaches for obtaining a non-factorizable game and study the outcome of such games. We demonstrate how the standard version of a quantum game can be analysed as a non-factorizable game and determine the limitations of our approach.

Functions of multivector variables.

As is well known, the common elementary functions defined over the real numbers can be generalized to act not only over the complex number field but also over the skew (non-commuting) field of the quaternions. In this paper, we detail a number of elementary functions extended to act over the skew field of Clifford multivectors, in both two and three dimensions. Complex numbers, quaternions and Cartesian vectors can be described by the various components within a Clifford multivector and from our results we are able to demonstrate new inter-relationships between these algebraic systems. One key relationship that we discover is that a complex number raised to a vector power produces a quaternion thus combining these systems within a single equation. We also find a single formula that produces the square root, amplitude and inverse of a multivector over one, two and three dimensions. Finally, comparing the functions over different dimension we observe that Cl(R(3)) provides a particularly versatile algebraic framework.

Analysis of two-player quantum games in an EPR setting using Clifford's geometric algebra.

The framework for playing quantum games in an Einstein-Podolsky-Rosen (EPR) type setting is investigated using the mathematical formalism of geometric algebra (GA). The main advantage of this framework is that the players' strategy sets remain identical to the ones in the classical mixed-strategy version of the game, and hence the quantum game becomes a proper extension of the classical game, avoiding a criticism of other quantum game frameworks. We produce a general solution for two-player games, and as examples, we analyze the games of Prisoners' Dilemma and Stag Hunt in the EPR setting. The use of GA allows a quantum-mechanical analysis without the use of complex numbers or the Dirac Bra-ket notation, and hence is more accessible to the non-physicist.

N-player quantum games in an EPR setting.

The N-player quantum games are analyzed that use an Einstein-Podolsky-Rosen (EPR) experiment, as the underlying physical setup. In this setup, 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 players' payoffs and mixed Nash equilibrium are determined. Players' N x N payoff matrices are then defined using 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 ≥ 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. By dispensing with the standard unitary transformations on state vectors in Hilbert space and using instead rotors and multivectors, based on Clifford's geometric algebra (GA), it is shown how the N-player case becomes tractable. The new mathematical approach presented here has wide implications in the areas of quantum information and quantum complexity, as it opens up a powerful way to tractably analyze N-partite qubit interactions.

Revisiting special relativity: a natural algebraic alternative to Minkowski spacetime.

Minkowski famously introduced the concept of a space-time continuum in 1908, merging the three dimensions of space with an imaginary time dimension [Formula: see text], with the unit imaginary producing the correct spacetime distance [Formula: see text], and the results of Einstein's then recently developed theory of special relativity, thus providing an explanation for Einstein's theory in terms of the structure of space and time. As an alternative to a planar Minkowski space-time of two space dimensions and one time dimension, we replace the unit imaginary [Formula: see text], with the Clifford bivector [Formula: see text] for the plane that also squares to minus one, but which can be included without the addition of an extra dimension, as it is an integral part of the real Cartesian plane with the orthonormal basis [Formula: see text] and [Formula: see text]. We find that with this model of planar spacetime, using a two-dimensional Clifford multivector, the spacetime metric and the Lorentz transformations follow immediately as properties of the algebra. This also leads to momentum and energy being represented as components of a multivector and we give a new efficient derivation of Compton's scattering formula, and a simple formulation of Dirac's and Maxwell's equations. Based on the mathematical structure of the multivector, we produce a semi-classical model of massive particles, which can then be viewed as the origin of the Minkowski spacetime structure and thus a deeper explanation for relativistic effects. We also find a new perspective on the nature of time, which is now given a precise mathematical definition as the bivector of the plane.

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.

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.