4,293 research outputs found
The Effects of Symmetries on Quantum Fidelity Decay
We explore the effect of a system's symmetries on fidelity decay behavior.
Chaos-like exponential fidelity decay behavior occurs in non-chaotic systems
when the system possesses symmetries and the applied perturbation is not tied
to a classical parameter. Similar systems without symmetries exhibit
faster-than-exponential decay under the same type of perturbation. This
counter-intuitive result, that extra symmetries cause the system to behave in a
chaotic fashion, may have important ramifications for quantum error correction.Comment: 5 pages, 3 figures, to be published Phys. Rev. E Rapid Communicatio
Dynamical polarizability of graphene beyond the Dirac cone approximation
We compute the dynamical polarizability of graphene beyond the usual Dirac
cone approximation, integrating over the full Brillouin zone. We find
deviations at ( the hopping parameter) which amount to a
logarithmic singularity due to the van Hove singularity and derive an
approximate analytical expression. Also at low energies, we find deviations
from the results obtained from the Dirac cone approximation which manifest
themselves in a peak spitting at arbitrary direction of the incoming wave
vector \q. Consequences for the plasmon spectrum are discussed.Comment: 8 pages, 6 figure
The evolution of the cover time
The cover time of a graph is a celebrated example of a parameter that is easy
to approximate using a randomized algorithm, but for which no constant factor
deterministic polynomial time approximation is known. A breakthrough due to
Kahn, Kim, Lovasz and Vu yielded a (log log n)^2 polynomial time approximation.
We refine this upper bound, and show that the resulting bound is sharp and
explicitly computable in random graphs. Cooper and Frieze showed that the cover
time of the largest component of the Erdos-Renyi random graph G(n,c/n) in the
supercritical regime with c>1 fixed, is asymptotic to f(c) n \log^2 n, where
f(c) tends to 1 as c tends to 1. However, our new bound implies that the cover
time for the critical Erdos-Renyi random graph G(n,1/n) has order n, and shows
how the cover time evolves from the critical window to the supercritical phase.
Our general estimate also yields the order of the cover time for a variety of
other concrete graphs, including critical percolation clusters on the Hamming
hypercube {0,1}^n, on high-girth expanders, and on tori Z_n^d for fixed large
d. For the graphs we consider, our results show that the blanket time,
introduced by Winkler and Zuckerman, is within a constant factor of the cover
time. Finally, we prove that for any connected graph, adding an edge can
increase the cover time by at most a factor of 4.Comment: 14 pages, to appear in CP
Thermal entanglement in the nanotubular system Na_2V_3O_7
Macroscopic entanglement witnesses have been put forward recently to reveal
nonlocal quantum correlations between individual constituents of the solid at
nonzero temperatures. Here we apply a recently proposed universal entanglement
witness, the magnetic susceptibility [New J. Phys. {\bf 7}, 258 (2005)] for the
estimation of the critical temperature in the nanotubular system below which thermal entanglement is present. As a result of an
analysis based on the experimental data for dc-magnetic susceptibility, we show
that K, which is approximately three times higher than the
critical temperature corresponding to the bipartite entanglement.Comment: 6 pages, 3 figures, REVTeX
No directed fractal percolation in zero area
We show that fractal (or "Mandelbrot") percolation in two dimensions produces
a set containing no directed paths, when the set produced has zero area. This
improves a similar result by the first author in the case of constant retention
probabilities to the case of retention probabilities approaching 1
Quantum network architecture of tight-binding models with substitution sequences
We study a two-spin quantum Turing architecture, in which discrete local
rotations \alpha_m of the Turing head spin alternate with quantum controlled
NOT-operations. Substitution sequences are known to underlie aperiodic
structures. We show that parameter inputs \alpha_m described by such sequences
can lead here to a quantum dynamics, intermediate between the regular and the
chaotic variant. Exponential parameter sensitivity characterizing chaotic
quantum Turing machines turns out to be an adequate criterion for induced
quantum chaos in a quantum network.Comment: Accepted for publication in J. mod. Optics [Proc. Workshop
"Entanglement and Decoherence", Gargnano (Italy), Sept 1999], 3 figure
Wigner's little group and Berry's phase for massless particles
The ``little group'' for massless particles (namely, the Lorentz
transformations that leave a null vector invariant) is isomorphic to
the Euclidean group E2: translations and rotations in a plane. We show how to
obtain explicitly the rotation angle of E2 as a function of and we
relate that angle to Berry's topological phase. Some particles admit both signs
of helicity, and it is then possible to define a reduced density matrix for
their polarization. However, that density matrix is physically meaningless,
because it has no transformation law under the Lorentz group, even under
ordinary rotations.Comment: 4 pages revte
From qubits to black holes: entropy, entanglement and all that
Entropy plays a crucial role in characterization of information and
entanglement, but it is not a scalar quantity and for many systems it is
different for different relativistic observers. Loop quantum gravity predicts
the Bekenstein-Hawking term for black hole entropy and logarithmic correction
to it. The latter originates in the entanglement between the pieces of spin
networks that describe black hole horizon. Entanglement between gravity and
matter may restore the unitarity in the black hole evaporation process. If the
collapsing matter is assumed to be initially in a pure state, then entropy of
the Hawking radiation is exactly the created entanglement between matter and
gravity.Comment: Honorable Mention in the 2005 Gravity Research Foundation Essay
Competitio
- âŠ