arXiv subjects

Paul Benioff

Publications and source records attributed to Paul Benioff.

46 records · Page 3Linked to original sources

arXiv2000

The Representation of Numbers by States in Quantum Mechanics

The representation of numbers by tensor product states of composite quantum systems is examined. Consideration is limited to k-ary representations of length L and arithmetic modulo k^{L}. An abstract representation on an L fold tensor product Hilbert space H^{arith} of number states and operators for the basic arithmetic operations is described. Unitary maps onto a physical parameter based tensor product space H^{phy} are defined and the relations between these two spaces and the dependence of algorithm dynamics on the unitary maps is discussed. The important condition of efficient implementation by physically realizable Hamiltonians of the basic arithmetic operations is also discussed.

quant-ph↗

arXiv1998

A simple Example of Definitions of Truth, Validity, Consistency, and Completeness in Quantum Mechanics

Besides their use for efficient computation, quantum computers are a base for studying quantum systems that create valid physical theories using mathematics and physics. An essential part of the validation process for quantum mechanics is the development of a coherent theory of mathematics and quantum mechanics together. Such a theory should combine mathematical logical concepts with quantum mechanics. That this might be possible is shown here by defining truth, validity, consistency, and completeness for a quantum mechanical version of a simple classical expression enumeration machine described by Smullyan. It is seen that for an interpretation based on a Feynman path sum over expression path states, truth, consistency, and completeness have different properties than for the classical system. For instance the truth of a sentence S is defined only on the paths containing S. It is undefined elsewhere. Also S and its negation can both be true provided they appear on separate paths. This satisfies the definition of consistency. It is seen that validity and completeness connect the system dynamics to the truth of the sentences. It is proved that validity implies consistency. The requirements of validity and maximal completeness strongly restrict the possible dynamics of the system. Aspects of the existence of a valid, maximally complete dynamics are discussed. An exponentially efficient quantum computer is described that is also valid and complete.

quant-ph↗

arXiv1998

Quantum Robots Plus Environments

A quantum robot is a mobile quantum system including an on bord quantum computer and ancillary systems, that interact with an environment of quantum systems. Quantum robots carry out tasks whose goals include carrying out measurements and physical experiments on the environment. Environments considered so far in the literature: oracles, data bases, and quantum registers, are shown to be special cases of environments considered here. It is noted that quantum robots should include a quantum computer and cannot be simply a multistate head. A model is discussed in which each task, as a sequence of computation and action phases, is described by a unitary step operator. Overall system dynamics is described in terms of a Feynman sum over paths of completed computation and action phases. A simple task example, measuring the distance between the quantum robot and a particle on a 1D space lattice, with quantum phase path and time duration dispersion present, is analyzed.

quant-ph↗

arXiv1998

Quantum Robots and Environments

Quantum robots and their interactions with environments of quantum systems are described and their study justified. A quantum robot is a mobile quantum system that includes a quantum computer and needed ancillary systems on board. Quantum robots carry out tasks whose goals include specified changes in the state of the environment or carrying out measurements on the environment. Each task is a sequence of alternating computation and action phases. Computation phase activities include determination of the action to be carried out in the next phase and possible recording of information on neighborhood environmental system states. Action phase activities include motion of the quantum robot and changes of neighborhood environment system states. Models of quantum robots and their interactions with environments are described using discrete space and time. To each task is associated a unitary step operator T that gives the single time step dynamics. T = T_{a}+T_{c} is a sum of action phase and computation phase step operators. Conditions that T_{a} and T_{c} should satisfy are given along with a description of the evolution as a sum over paths of completed phase input and output states. A simple example of a task carrying out a measurement on a very simple environment is analyzed. A decision tree for the task is presented and discussed in terms of sums over phase paths. One sees that no definite times or durations are associated with the phase steps in the tree and that the tree describes the successive phase steps in each path in the sum.

quant-ph↗

arXiv1997

Quantum Robots and Quantum Computers

Validation of a presumably universal theory, such as quantum mechanics, requires a quantum mechanical description of systems that carry out theoretical calculations and experiments. The description of quantum computers is under active development. No description of systems to carry out experiments has been given. A small step in this direction is taken here by giving a description of quantum robots as mobile systems with on board quantum computers that interact with environments. Some properties of these systems are discussed. A specific model based on the literature descriptions of quantum Turing machines is presented.

quant-ph↗

arXiv1997

Models of Quantum Turing machines

Quantum Turing machines are discussed and reviewed in this paper. Most of the paper is concerned with processes defined by a step operator $T$ that is used to construct a Hamiltonian $H$ according to Feynman's prescription. Differences between these models and the models of Deutsch are discussed and reviewed. It is emphasized that the models with $H$ constructed from $T$ include fully quantum mechanical processes that take computation basis states into linear superpositions of these states. The requirement that $T$ be distinct path generating is reviewed. The advantage of this requirement is that Schrödinger evolution under $H$ is one dimensional along distinct finite or infinite paths of nonoverlapping states in some basis $B_{T}$. It is emphasized that $B_{T}$ can be arbitrarily complex with extreme entanglements between states of component systems. The new aspect of quantum Turing machines introduced here is the emphasis on the structure of graphs obtained when the states in the $B_{T}$ paths are expanded as linear superpositions of states in a reference basis such as the computation basis $B_{C}$. Examples are discussed that illustrate the main points of the paper. For one example the graph structures of the paths in $B_{T}$ expanded as states in $B_{C}$ include finite stage binary trees and concatenated finite stage binary trees with or without terminal infinite binary trees. Other examples are discussed in which the graph structures correspond to interferometers and iterations of interferometers.

quant-ph↗

arXiv1997

The Landauer Resistance and Band Spectra for the Counting Quantum Turing Machine

The generalized counting quantum Turing machine (GCQTM) is a machine which, for any N, enumerates the first $2^{N}$ integers in succession as binary strings. The generalization consists of associating a potential with read-1 steps only. The Landauer Resistance (LR) and band spectra were determined for the tight binding Hamiltonians associated with the GCQTM for energies both above and below the potential height. For parameters and potentials in the electron region, the LR fluctuates rapidly between very high and very low values as a function of momentum. The rapidity and extent of the fluctuations increases rapidly with increasing N. For N=18, the largest value considered, the LR shows good transmission probability as a function of momentum with numerous holes of very high LR values present. This is true for energies above and below the potential height. It is suggested that the main features of the LR can be explained by coherent superposition of the component waves reflected from or transmitted through the $2^{N-1}$ potentials in the distribution. If this explanation is correct, it provides a dramatic illustration of the effects of quantum nonlocality.

quant-ph↗

arXiv1997

Transmission and Spectral Aspects of Tight Binding Hamiltonians for the Counting Quantum Turing Machine

It was recently shown that a generalization of quantum Turing machines (QTMs), in which potentials are associated with elementary steps or transitions of the computation, generates potential distributions along computation paths of states in some basis B. The distributions are computable and are thus periodic or have deterministic disorder. These generalized machines (GQTMs) can be used to investigate the effect of potentials in causing reflections and reducing the completion probability of computations. This work is extended here by determination of the spectral and transmission properties of an example GQTM which enumerates the integers as binary strings. A potential is associated with just one type of step. For many computation paths the potential distributions are initial segments of a quasiperiodic distribution that corresponds to a substitution sequence. The energy band spectra and Landauer Resistance (LR) are calculated for energies below the barrier height by use of transfer matrices. The LR fluctuates rapidly with momentum with minima close to or at band-gap edges. For several values of the parameters, there is good transmission over some momentum regions.

cond-mat↗

arXiv1996

Tight Binding Hamiltonians and Quantum Turing Machines

This paper extends work done to date on quantum computation by associating potentials with different types of computation steps. Quantum Turing machine Hamiltonians, generalized to include potentials, correspond to sums over tight binding Hamiltonians each with a different potential distribution. Which distribution applies is determined by the initial state. An example, which enumerates the integers in succession as binary strings, is analyzed. It is seen that for some initial states the potential distributions have quasicrystalline properties and are similar to a substitution sequence.

quant-ph↗

arXiv1996

Quantum Ballistic Evolution in Quantum Mechanics: Application to Quantum Computers

Quantum computers are important examples of processes whose evolution can be described in terms of iterations of single step operators or their adjoints. Based on this, Hamiltonian evolution of processes with associated step operators $T$ is investigated here. The main limitation of this paper is to processes which evolve quantum ballistically, i.e. motion restricted to a collection of nonintersecting or distinct paths on an arbitrary basis. The main goal of this paper is proof of a theorem which gives necessary and sufficient conditions that T must satisfy so that there exists a Hamiltonian description of quantum ballistic evolution for the process, namely, that T is a partial isometry and is orthogonality preserving and stable on some basis. Simple examples of quantum ballistic evolution for quantum Turing machines with one and with more than one type of elementary step are discussed. It is seen that for nondeterministic machines the basis set can be quite complex with much entanglement present. It is also proved that, given a step operator T for an arbitrary deterministic quantum Turing machine, it is decidable if T is stable and orthogonality preserving, and if quantum ballistic evolution is possible. The proof fails if T is a step operator for a nondeterministic machine. It is an open question if such a decision procedure exists for nondeterministic machines. This problem does not occur in classical mechanics.

quant-ph↗