Discrete quantum theories

We explore finite-field frameworks for quantum theory and quantum computation. The simplest theory, defined over unrestricted finite fields, is unnaturally strong. A second framework employs only finite fields with no solution to x2 + 1 = 0, and thus permits an elegant complex representation of the extended field by adjoining . Quantum theories over these fields recover much of the structure of conventional quantum theory except for the condition that vanishing inner products arise only from null states; unnaturally strong computational power may still occur. Finally, we are led to consider one more framework, with further restrictions on the finite fields, that recovers a local transitive order and a locally-consistent notion of inner product with a new notion of cardinal probability. In this framework, conventional quantum mechanics and quantum computation emerge locally (though not globally) as the size of the underlying field increases. Interestingly, the framework allows one to choose separate finite fields for system description and for measurement: the size of the first field quantifies the resources needed to describe the system and the size of the second quantifies the resources used by the observer. This resource-based perspective potentially provides insights into quantitative measures for actual computational power, the complexity of quantum system definition and evolution, and the independent question of the cost of the measurement process.

[1]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[2]  N. Mermin Quantum Computer Science: An Introduction , 2007 .

[3]  Andrew S. Glassner Quantum Computing, Part 3 , 2001, IEEE Computer Graphics and Applications.

[4]  Gary L. Mullen,et al.  Finite Fields and Applications , 2007, Student mathematical library.

[5]  Lov K. Grover From Schrödinger’s equation to the quantum search algorithm , 2001, quant-ph/0109116.

[6]  Neil J. A. Sloane,et al.  The encyclopedia of integer sequences , 1995 .

[7]  Benjamin Schumacher,et al.  Modal Quantum Theory , 2010, 1204.0701.

[8]  R. Feynman Simulating physics with computers , 1999 .

[9]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

[10]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[11]  David Corwin Galois Theory , 2009 .

[12]  N. Mermin Quantum Computer Science , 2007 .

[13]  L. Grove,et al.  Classical Groups and Geometric Algebra , 2001 .

[14]  E. Wright,et al.  An Introduction to the Theory of Numbers , 1939 .

[15]  C. Ross Found , 1869, The Dental register.

[16]  Donald L Reisler,et al.  Geometry Over a Finite Field , 1969 .

[17]  Amr Sabry,et al.  Geometry of discrete quantum computing , 2012, 1206.5823.

[18]  James Franklin,et al.  Divine proportions: Rational trigonometry to universal geometry , 2006 .

[19]  R. Landauer The physical nature of information , 1996 .

[20]  D. Minic,et al.  GALOIS FIELD QUANTUM MECHANICS , 2012, 1205.4800.

[21]  P. Freund,et al.  p-adic numbers in physics , 1993 .

[22]  Igor Volovich,et al.  p-adic quantum mechanics , 1989 .

[23]  G. Papadopoulos,et al.  Spinorial geometry, horizons and superconformal symmetry in six dimensions , 2014, 1404.3976.