1,098 research outputs found
Efficient quantum algorithms for simulating sparse Hamiltonians
We present an efficient quantum algorithm for simulating the evolution of a
sparse Hamiltonian H for a given time t in terms of a procedure for computing
the matrix entries of H. In particular, when H acts on n qubits, has at most a
constant number of nonzero entries in each row/column, and |H| is bounded by a
constant, we may select any positive integer such that the simulation
requires O((\log^*n)t^{1+1/2k}) accesses to matrix entries of H. We show that
the temporal scaling cannot be significantly improved beyond this, because
sublinear time scaling is not possible.Comment: 9 pages, 2 figures, substantial revision
Probabilistic instantaneous quantum computation
The principle of teleportation can be used to perform a quantum computation
even before its quantum input is defined. The basic idea is to perform the
quantum computation at some earlier time with qubits which are part of an
entangled state. At a later time a generalized Bell state measurement is
performed jointly on the then defined actual input qubits and the rest of the
entangled state. This projects the output state onto the correct one with a
certain exponentially small probability. The sufficient conditions are found
under which the scheme is of benefit.Comment: 4 pages, 1 figur
A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton
We describe a simple n-dimensional quantum cellular automaton (QCA) capable
of simulating all others, in that the initial configuration and the forward
evolution of any n-dimensional QCA can be encoded within the initial
configuration of the intrinsically universal QCA. Several steps of the
intrinsically universal QCA then correspond to one step of the simulated QCA.
The simulation preserves the topology in the sense that each cell of the
simulated QCA is encoded as a group of adjacent cells in the universal QCA.Comment: 13 pages, 7 figures. In Proceedings of the 4th International
Conference on Language and Automata Theory and Applications (LATA 2010),
Lecture Notes in Computer Science (LNCS). Journal version: arXiv:0907.382
Paired accelerated arames: The perfect interferometer with everywhere smooth wave amplitudes
Rindler's acceleration-induced partitioning of spacetime leads to a
nature-given interferometer. It accomodates quantum mechanical and wave
mechanical processes in spacetime which in (Euclidean) optics correspond to
wave processes in a ``Mach-Zehnder'' interferometer: amplitude splitting,
reflection, and interference. These processes are described in terms of
amplitudes which behave smoothly across the event horizons of all four Rindler
sectors. In this context there arises quite naturally a complete set of
orthonormal wave packet histories, one of whose key properties is their
"explosivity index". In the limit of low index values the wave packets trace
out fuzzy world lines. By contrast, in the asymptotic limit of high index
values, there are no world lines, not even fuzzy ones. Instead, the wave packet
histories are those of entities with non-trivial internal collapse and
explosion dynamics. Their details are described by the wave processes in the
above-mentioned Mach-Zehnder interferometer. Each one of them is a double slit
interference process. These wave processes are applied to elucidate the
amplification of waves in an accelerated inhomogeneous dielectric. Also
discussed are the properties and relationships among the transition amplitudes
of an accelerated finite-time detector.Comment: 38 pages, RevTex, 10 figures, 4 mathematical tutorials. Html version
of the figures and of related papers available at
http://www.math.ohio-state.edu/~gerlac
The diagonalization method in quantum recursion theory
As quantum parallelism allows the effective co-representation of classical
mutually exclusive states, the diagonalization method of classical recursion
theory has to be modified. Quantum diagonalization involves unitary operators
whose eigenvalues are different from one.Comment: 15 pages, completely rewritte
Sturmian morphisms, the braid group B_4, Christoffel words and bases of F_2
We give a presentation by generators and relations of a certain monoid
generating a subgroup of index two in the group Aut(F_2) of automorphisms of
the rank two free group F_2 and show that it can be realized as a monoid in the
group B_4 of braids on four strings. In the second part we use Christoffel
words to construct an explicit basis of F_2 lifting any given basis of the free
abelian group Z^2. We further give an algorithm allowing to decide whether two
elements of F_2 form a basis or not. We also show that, under suitable
conditions, a basis has a unique conjugate consisting of two palindromes.Comment: 25 pages, 4 figure
Volume element structure and roton-maxon-phonon excitations in superfluid helium beyond the Gross-Pitaevskii approximation
We propose a theory which deals with the structure and interactions of volume
elements in liquid helium II. The approach consists of two nested models linked
via parametric space. The short-wavelength part describes the interior
structure of the fluid element using a non-perturbative approach based on the
logarithmic wave equation; it suggests the Gaussian-like behaviour of the
element's interior density and interparticle interaction potential. The
long-wavelength part is the quantum many-body theory of such elements which
deals with their dynamics and interactions. Our approach leads to a unified
description of the phonon, maxon and roton excitations, and has noteworthy
agreement with experiment: with one essential parameter to fit we reproduce at
high accuracy not only the roton minimum but also the neighboring local maximum
as well as the sound velocity and structure factor.Comment: 9 pages, 6 figure
Experimental Implementation of the Quantum Random-Walk Algorithm
The quantum random walk is a possible approach to construct new quantum
algorithms. Several groups have investigated the quantum random walk and
experimental schemes were proposed. In this paper we present the experimental
implementation of the quantum random walk algorithm on a nuclear magnetic
resonance quantum computer. We observe that the quantum walk is in sharp
contrast to its classical counterpart. In particular, the properties of the
quantum walk strongly depends on the quantum entanglement.Comment: 5 pages, 4 figures, published versio
Digital Quantum Simulation with Rydberg Atoms
We discuss in detail the implementation of an open-system quantum simulator
with Rydberg states of neutral atoms held in an optical lattice. Our scheme
allows one to realize both coherent as well as dissipative dynamics of complex
spin models involving many-body interactions and constraints. The central
building block of the simulation scheme is constituted by a mesoscopic Rydberg
gate that permits the entanglement of several atoms in an efficient, robust and
quick protocol. In addition, optical pumping on ancillary atoms provides the
dissipative ingredient for engineering the coupling between the system and a
tailored environment. As an illustration, we discuss how the simulator enables
the simulation of coherent evolution of quantum spin models such as the
two-dimensional Heisenberg model and Kitaev's toric code, which involves
four-body spin interactions. We moreover show that in principle also the
simulation of lattice fermions can be achieved. As an example for controlled
dissipative dynamics, we discuss ground state cooling of frustration-free spin
Hamiltonians.Comment: submitted to special issue "Quantum Information with Neutral
Particles" of "Quantum Information Processing
- …