12,601 research outputs found
An explanation for the rise in Tc in the Tl- and Bi-based high temperature superconductors
Using the plasmon exchange model for the high T(sub c) superconductor, it is shown that the T(sub c) rises with an increase in the number of CuO layers per unit cell, which is in agreement with recent observations in the Tl- and Bi-based compounds. The calculation also suggests that the sample will become superconducting in successive stages and that there is a saturation effect, i.e., that T(sub c) cannot be raised indefinitely by increasing the number of CuO layers
Upward Point-Set Embeddability
We study the problem of Upward Point-Set Embeddability, that is the problem
of deciding whether a given upward planar digraph has an upward planar
embedding into a point set . We show that any switch tree admits an upward
planar straight-line embedding into any convex point set. For the class of
-switch trees, that is a generalization of switch trees (according to this
definition a switch tree is a -switch tree), we show that not every
-switch tree admits an upward planar straight-line embedding into any convex
point set, for any . Finally we show that the problem of Upward
Point-Set Embeddability is NP-complete
Quantum Computing with an 'Always On' Heisenberg Interaction
Many promising ideas for quantum computing demand the experimental ability to
directly switch 'on' and 'off' a physical coupling between the component
qubits. This is typically the key difficulty in implementation, and precludes
quantum computation in generic solid state systems, where interactions between
the constituents are 'always on'. Here we show that quantum computation is
possible in strongly coupled (Heisenberg) systems even when the interaction
cannot be controlled. The modest ability of 'tuning' the transition energies of
individual qubits proves to be sufficient, with a suitable encoding of the
logical qubits, to generate universal quantum gates. Furthermore, by tuning the
qubits collectively we provide a scheme with exceptional experimental
simplicity: computations are controlled via a single 'switch' of only six
settings. Our schemes are applicable to a wide range of physical
implementations, from excitons and spins in quantum dots through to bulk
magnets.Comment: 4 pages, 3 figs, 2 column format. To appear in PR
Lower bounds on the dilation of plane spanners
(I) We exhibit a set of 23 points in the plane that has dilation at least
, improving the previously best lower bound of for the
worst-case dilation of plane spanners.
(II) For every integer , there exists an -element point set
such that the degree 3 dilation of denoted by in the domain of plane geometric spanners. In the
same domain, we show that for every integer , there exists a an
-element point set such that the degree 4 dilation of denoted by
The
previous best lower bound of holds for any degree.
(III) For every integer , there exists an -element point set
such that the stretch factor of the greedy triangulation of is at least
.Comment: Revised definitions in the introduction; 23 pages, 15 figures; 2
table
Probabilistic Super Dense Coding
We explore the possibility of performing super dense coding with
non-maximally entangled states as a resource. Using this we find that one can
send two classical bits in a probabilistic manner by sending a qubit. We
generalize our scheme to higher dimensions and show that one can communicate
2log_2 d classical bits by sending a d-dimensional quantum state with a certain
probability of success. The success probability in super dense coding is
related to the success probability of distinguishing non-orthogonal states. The
optimal average success probabilities are explicitly calculated. We consider
the possibility of sending 2 log_2 d classical bits with a shared resource of a
higher dimensional entangled state (D X D, D > d). It is found that more
entanglement does not necessarily lead to higher success probability. This also
answers the question as to why we need log_2 d ebits to send 2 log_2 d
classical bits in a deterministic fashion.Comment: Latex file, no figures, 11 pages, Discussion changed in Section
- …