Ergodic Quantum Computing

We propose a (theoretical) model for quantum computation where the result can be read out from the time average of the Hamiltonian dynamics of a 2-dimensional crystal on a cylinder.The Hamiltonian is a spatially local interaction among Wigner–Seitz cells containing six qubits. The quantum circuit that is simulated is specified by the initialization of program qubits. As in Margolus’ Hamiltonian cellular automaton (implementing classical circuits), a propagating wave in a clock register controls asynchronously the application of the gates. However, in our approach all required initializations are basis states. After a while the synchronizing wave is essentially spread around the whole crystal. The circuit is designed such that the result is available with probability about 1/4 despite of the completely undefined computation step. This model reduces quantum computing to preparing basis states for some qubits, waiting, and measuring in the computational basis. Even though it may be unlikely to find our specific Hamiltonian in real solids, it is possible that also more natural interactions allow ergodic quantum computing.

[1]  Seth Lloyd,et al.  Adiabatic quantum computation is equivalent to standard quantum computation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[2]  D. W. Leung Two-qubit Projective Measurements are Universal for Quantum Computation , 2001 .

[3]  Lov K. Grover,et al.  Quantum computation , 1999, Proceedings Twelfth International Conference on VLSI Design. (Cat. No.PR00013).

[4]  W. H. Zurek Complexity, Entropy and the Physics of Information , 1990 .

[5]  D. Aharonov Quantum Computation , 1998, quant-ph/9812037.

[6]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .

[7]  Andris Ambainis,et al.  Quantum walks on graphs , 2000, STOC '01.

[8]  R. Feynman Quantum mechanical computers , 1986 .

[9]  Mikhail N. Vyalyi,et al.  Classical and Quantum Computation , 2002, Graduate studies in mathematics.

[10]  N. Margolus Parallel Quantum Computation ∗ , 1990 .

[11]  P. Benioff The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines , 1980 .

[12]  S. C. Benjamin Schemes for parallel quantum computation without local control of qubits , 2000 .

[13]  P. Wocjan Estimating mixing properties of local Hamiltonian dynamics and continuous quantum random walks is PSPACE-hard , 2004, quant-ph/0401184.

[14]  J. Ziman Principles of the Theory of Solids , 1965 .

[15]  Alexei Y. Kitaev,et al.  Quantum measurements and the Abelian Stabilizer Problem , 1995, Electron. Colloquium Comput. Complex..

[16]  On the Speed of Quantum Computers with Finite Size Clocks , 1995 .

[17]  Simon C Benjamin,et al.  Quantum computing without local control of qubit-qubit interactions. , 2001, Physical review letters.

[18]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[19]  P. Diaconis Group representations in probability and statistics , 1988 .

[20]  M. Biafore,et al.  Can quantum computers have simple Hamiltonians? , 1994, Proceedings Workshop on Physics and Computation. PhysComp '94.

[21]  H. Briegel,et al.  Quantum computing via measurements only , 2000, quant-ph/0010033.