2,070 research outputs found
Asymptotic entanglement capacity of the Ising and anisotropic Heisenberg interactions
We compute the asymptotic entanglement capacity of the Ising interaction ZZ,
the anisotropic Heisenberg interaction XX + YY, and more generally, any
two-qubit Hamiltonian with canonical form K = a XX + b YY. We also describe an
entanglement assisted classical communication protocol using the Hamiltonian K
with rate equal to the asymptotic entanglement capacity.Comment: 5 pages, 1 figure; minor corrections, conjecture adde
Effects of Noise, Correlations and errors in the preparation of initial states in Quantum Simulations
In principle a quantum system could be used to simulate another quantum
system. The purpose of such a simulation would be to obtain information about
problems which cannot be simulated with a classical computer due to the
exponential increase of the Hilbert space with the size of the system and which
cannot be measured or controlled in an actual experiment. The system will
interact with the surrounding environment, with the other particles in the
system and be implemented using imperfect controls making it subject to noise.
It has been suggested that noise does not need to be controlled to the same
extent as it must be for general quantum computing. However the effects of
noise in quantum simulations and how to treat them are not completely
understood. In this paper we study an existing quantum algorithm for the
one-dimensional Fano-Anderson model to be simulated using a liquid-state NMR
device. We calculate the evolution of different initial states in the original
model, and then we add interacting spins to simulate a more realistic
situation. We find that states which are entangled with their environment, and
sometimes correlated but not necessarily entangled have an evolution which is
described by maps which are not completely positive. We discuss the conditions
for this to occur and also the implications.Comment: Revtex 4-1, 14 pages, 21 figures, version 2 has typos corrected and
acknowledgement adde
Comparison of unitary transforms
We analyze the problem of comparing unitary transformations. The task is to
decide, with minimal resources and maximal reliability, whether two given
unitary transformations are identical or different. It is possible to make such
comparisons without obtaining any information about the individual
transformations. Different comparison strategies are presented and compared
with respect to their efficiency. With an interferometric setup, it is possible
to compare two unitary transforms using only one test particle. Another
strategy makes use of a two-particle singlet state. This strategy is more
efficient than using a non-entangled two-particle test state, thus
demonstrating the benefit of entanglement. Generalisations to higher
dimensional transforms and to more than two transformations are made.Comment: 11 pages, 4 figures, revtex4, submitted to J. Phys.
Estimating the functional form for the density dependence from life history data
Two contrasting approaches to the analysis of population dynamics are currently popular: demographic approaches where the associations between demographic rates and statistics summarizing the population dynamics are identified; and time series approaches where the associations between population dynamics, population density, and environmental covariates are investigated. In this paper, we develop an approach to combine these methods and apply it to detailed data from Soay sheep (Ovis aries). We examine how density dependence and climate contribute to fluctuations in population size via age- and sex-specific demographic rates, and how fluctuations in demographic structure influence population dynamics. Density dependence contributes most, followed by climatic variation, age structure fluctuations and interactions between density and climate. We then simplify the density-dependent, stochastic, age-structured demographic model and derive a new phenomenological time series which captures the dynamics better than previously selected functions. The simple method we develop has potential to provide substantial insight into the relative contributions of population and individual-level processes to the dynamics of populations in stochastic environments
Fractional recurrence in discrete-time quantum walk
Quantum recurrence theorem holds for quantum systems with discrete energy
eigenvalues and fails to hold in general for systems with continuous energy. We
show that during quantum walk process dominated by interference of amplitude
corresponding to different paths fail to satisfy the complete quantum
recurrence theorem. Due to the revival of the fractional wave packet, a
fractional recurrence characterized using quantum P\'olya number can be seen.Comment: 10 pages, 11 figure : Accepted to appear in Central European Journal
of Physic
Hitting Time of Quantum Walks with Perturbation
The hitting time is the required minimum time for a Markov chain-based walk
(classical or quantum) to reach a target state in the state space. We
investigate the effect of the perturbation on the hitting time of a quantum
walk. We obtain an upper bound for the perturbed quantum walk hitting time by
applying Szegedy's work and the perturbation bounds with Weyl's perturbation
theorem on classical matrix. Based on the definition of quantum hitting time
given in MNRS algorithm, we further compute the delayed perturbed hitting time
(DPHT) and delayed perturbed quantum hitting time (DPQHT). We show that the
upper bound for DPQHT is actually greater than the difference between the
square root of the upper bound for a perturbed random walk and the square root
of the lower bound for a random walk.Comment: 9 page
Quantum Algorithm for Dynamic Programming Approach for DAGs. Applications for Zhegalkin Polynomial Evaluation and Some Problems on DAGs
In this paper, we present a quantum algorithm for dynamic programming
approach for problems on directed acyclic graphs (DAGs). The running time of
the algorithm is , and the running time of the
best known deterministic algorithm is , where is the number of
vertices, is the number of vertices with at least one outgoing edge;
is the number of edges. We show that we can solve problems that use OR,
AND, NAND, MAX and MIN functions as the main transition steps. The approach is
useful for a couple of problems. One of them is computing a Boolean formula
that is represented by Zhegalkin polynomial, a Boolean circuit with shared
input and non-constant depth evaluating. Another two are the single source
longest paths search for weighted DAGs and the diameter search problem for
unweighted DAGs.Comment: UCNC2019 Conference pape
Long-range coupling and scalable architecture for superconducting flux qubits
Constructing a fault-tolerant quantum computer is a daunting task. Given any
design, it is possible to determine the maximum error rate of each type of
component that can be tolerated while still permitting arbitrarily large-scale
quantum computation. It is an underappreciated fact that including an
appropriately designed mechanism enabling long-range qubit coupling or
transport substantially increases the maximum tolerable error rates of all
components. With this thought in mind, we take the superconducting flux qubit
coupling mechanism described in PRB 70, 140501 (2004) and extend it to allow
approximately 500 MHz coupling of square flux qubits, 50 um a side, at a
distance of up to several mm. This mechanism is then used as the basis of two
scalable architectures for flux qubits taking into account crosstalk and
fault-tolerant considerations such as permitting a universal set of logical
gates, parallelism, measurement and initialization, and data mobility.Comment: 8 pages, 11 figure
Green function approach for scattering quantum walks
In this work a Green function approach for scattering quantum walks is
developed. The exact formula has the form of a sum over paths and always can be
cast into a closed analytic expression for arbitrary topologies and position
dependent quantum amplitudes. By introducing the step and path operators, it is
shown how to extract any information about the system from the Green function.
The method relevant features are demonstrated by discussing in details an
example, a general diamond-shaped graph.Comment: 13 pages, 6 figures, this article was selected by APS for Virtual
Journal of Quantum Information, Vol 11, Iss 11 (2011
New Developments in Quantum Algorithms
In this survey, we describe two recent developments in quantum algorithms.
The first new development is a quantum algorithm for evaluating a Boolean
formula consisting of AND and OR gates of size N in time O(\sqrt{N}). This
provides quantum speedups for any problem that can be expressed via Boolean
formulas. This result can be also extended to span problems, a generalization
of Boolean formulas. This provides an optimal quantum algorithm for any Boolean
function in the black-box query model.
The second new development is a quantum algorithm for solving systems of
linear equations. In contrast with traditional algorithms that run in time
O(N^{2.37...}) where N is the size of the system, the quantum algorithm runs in
time O(\log^c N). It outputs a quantum state describing the solution of the
system.Comment: 11 pages, 1 figure, to appear as an invited survey talk at MFCS'201
- …