1,572 research outputs found
Exact quantum query complexity of
In the exact quantum query model a successful algorithm must always output
the correct function value. We investigate the function that is true if exactly
or of the input bits given by an oracle are 1. We find an optimal
algorithm (for some cases), and a nontrivial general lower and upper bound on
the minimum number of queries to the black box.Comment: 19 pages, fixed some typos and constraint
Quantum Energies of Interfaces
We present a method for computing the one-loop, renormalized quantum energies
of symmetrical interfaces of arbitrary dimension and codimension using
elementary scattering data. Internal consistency requires finite-energy sum
rules relating phase shifts to bound state energies.Comment: 8 pages, 1 figure, minor changes, Phys. Rev. Lett., in prin
Grover's algorithm on a Feynman computer
We present an implementation of Grover's algorithm in the framework of
Feynman's cursor model of a quantum computer. The cursor degrees of freedom act
as a quantum clocking mechanism, and allow Grover's algorithm to be performed
using a single, time-independent Hamiltonian. We examine issues of locality and
resource usage in implementing such a Hamiltonian. In the familiar language of
Heisenberg spin-spin coupling, the clocking mechanism appears as an excitation
of a basically linear chain of spins, with occasional controlled jumps that
allow for motion on a planar graph: in this sense our model implements the idea
of "timing" a quantum algorithm using a continuous-time random walk. In this
context we examine some consequences of the entanglement between the states of
the input/output register and the states of the quantum clock
Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm
In papers\cite{js,jsa}, the amplitudes of continuous-time quantum walk on
graphs possessing quantum decomposition (QD graphs) have been calculated by a
new method based on spectral distribution associated to their adjacency matrix.
Here in this paper, it is shown that the continuous-time quantum walk on any
arbitrary graph can be investigated by spectral distribution method, simply by
using Krylov subspace-Lanczos algorithm to generate orthonormal bases of
Hilbert space of quantum walk isomorphic to orthogonal polynomials. Also new
type of graphs possessing generalized quantum decomposition have been
introduced, where this is achieved simply by relaxing some of the constrains
imposed on QD graphs and it is shown that both in QD and GQD graphs, the unit
vectors of strata are identical with the orthonormal basis produced by Lanczos
algorithm. Moreover, it is shown that probability amplitude of observing walk
at a given vertex is proportional to its coefficient in the corresponding unit
vector of its stratum, and it can be written in terms of the amplitude of its
stratum. Finally the capability of Lanczos-based algorithm for evaluation of
walk on arbitrary graphs (GQD or non-QD types), has been tested by calculating
the probability amplitudes of quantum walk on some interesting finite
(infinite) graph of GQD type and finite (infinite) path graph of non-GQD type,
where the asymptotic behavior of the probability amplitudes at infinite limit
of number of vertices, are in agreement with those of central limit theorem of
Ref.\cite{nko}.Comment: 29 pages, 4 figure
A new perturbative approach to the adiabatic approximation
A new and intuitive perturbative approach to time-dependent quantum mechanics
problems is presented, which is useful in situations where the evolution of the
Hamiltonian is slow. The state of a system which starts in an instantaneous
eigenstate of the initial Hamiltonian is written as a power series which has a
straightforward diagrammatic representation. Each term of the series
corresponds to a sequence of "adiabatic" evolutions, during which the system
remains in an instantaneous eigenstate of the Hamiltonian, punctuated by
transitions from one state to another. The first term of this series is the
standard adiabatic evolution, the next is the well-known first correction to
it, and subsequent terms can be written down essentially by inspection.
Although the final result is perhaps not terribly surprising, it seems to be
not widely known, and the interpretation is new, as far as we know. Application
of the method to the adiabatic approximation is given, and some discussion of
the validity of this approximation is presented.Comment: 9 pages. Added references, discussion of previous results, expanded
upon discussion of main result and application of i
Casimir Effects in Renormalizable Quantum Field Theories
We review the framework we and our collaborators have developed for the study
of one-loop quantum corrections to extended field configurations in
renormalizable quantum field theories. We work in the continuum, transforming
the standard Casimir sum over modes into a sum over bound states and an
integral over scattering states weighted by the density of states. We express
the density of states in terms of phase shifts, allowing us to extract
divergences by identifying Born approximations to the phase shifts with low
order Feynman diagrams. Once isolated in Feynman diagrams, the divergences are
canceled against standard counterterms. Thus regulated, the Casimir sum is
highly convergent and amenable to numerical computation. Our methods have
numerous applications to the theory of solitons, membranes, and quantum field
theories in strong external fields or subject to boundary conditions.Comment: 27 pp., 11 EPS figures, LaTeX using ijmpa1.sty; email correspondence
to R.L. Jaffe ; based on talks presented by the authors at
the 5th workshop `QFTEX', Leipzig, September 200
Gravitational Force and the Cardiovascular System
Cardiovascular responses to changes in gravitational force are considered. Man is ideally suited to his 1-g environment. Although cardiovascular adjustments are required to accommodate to postural changes and exercise, these are fully accomplished for short periods (min). More challenging stresses are those of short-term microgravity (h) and long-term microgravity (days) and of gravitational forces greater than that of Earth. The latter can be simulated in the laboratory and quantitative studies can be conducted
Robustness of adiabatic quantum computation
We study the fault tolerance of quantum computation by adiabatic evolution, a
quantum algorithm for solving various combinatorial search problems. We
describe an inherent robustness of adiabatic computation against two kinds of
errors, unitary control errors and decoherence, and we study this robustness
using numerical simulations of the algorithm.Comment: 11 pages, 5 figures, REVTe
- …