4,685 research outputs found
Physics as Quantum Information Processing: Quantum Fields as Quantum Automata
Can we reduce Quantum Field Theory (QFT) to a quantum computation? Can
physics be simulated by a quantum computer? Do we believe that a quantum field
is ultimately made of a numerable set of quantum systems that are unitarily
interacting? A positive answer to these questions corresponds to substituting
QFT with a theory of quantum cellular automata (QCA), and the present work is
examining this hypothesis. These investigations are part of a large research
program on a "quantum-digitalization" of physics, with Quantum Theory as a
special theory of information, and Physics as emergent from the same
quantum-information processing. A QCA-based QFT has tremendous potential
advantages compared to QFT, being quantum "ab-initio" and free from the
problems plaguing QFT due to the continuum hypothesis. Here I will show how
dynamics emerges from the quantum processing, how the QCA can reproduce the
Dirac-field phenomenology at large scales, and the kind of departures from QFT
that that should be expected at a Planck-scale discreteness. I will introduce
the notions of linear field quantum automaton and local-matrix quantum
automaton, in terms of which I will provide the solution to the Feynman's
problem about the possibility of simulating a Fermi field with a quantum
computer.Comment: This version: further improvements in notation. Added reference. Work
presented at the conference "Foundations of Probability and Physics-6" (FPP6)
held on 12-15 June 2011 at the Linnaeus University, Vaaxjo, Sweden. Many new
results, e.g. Feynman problem of qubit-ization of Fermi fields solved
Quasi-adiabatic Switching for Metal-Island Quantum-dot Cellular Automata
Recent experiments have demonstrated a working cell suitable for implementing
the Quantum-dot Cellular Automata (QCA) paradigm. These experiments have been
performed using metal island clusters. The most promising approach to QCA
operation involves quasi-adiabatically switching the cells. This has been
analyzed extensively in gated semiconductor cells. Here we present a metal
island cell structure that makes quasi-adiabatic switching possible. We show
how this permits quasi-adiabatic clocking, and enables a pipelined
architecture.Comment: 40 preprint-style double-spaced pages including 16 figure
On the state complexity of semi-quantum finite automata
Some of the most interesting and important results concerning quantum finite
automata are those showing that they can recognize certain languages with
(much) less resources than corresponding classical finite automata
\cite{Amb98,Amb09,AmYa11,Ber05,Fre09,Mer00,Mer01,Mer02,Yak10,ZhgQiu112,Zhg12}.
This paper shows three results of such a type that are stronger in some sense
than other ones because (a) they deal with models of quantum automata with very
little quantumness (so-called semi-quantum one- and two-way automata with one
qubit memory only); (b) differences, even comparing with probabilistic
classical automata, are bigger than expected; (c) a trade-off between the
number of classical and quantum basis states needed is demonstrated in one case
and (d) languages (or the promise problem) used to show main results are very
simple and often explored ones in automata theory or in communication
complexity, with seemingly little structure that could be utilized.Comment: 19 pages. We improve (make stronger) the results in section
- …