Hewlett-Packard

About: Hewlett-Packard is a company organization based out in Palo Alto, California, United States. It is known for research contribution in the topics: Signal & Layer (electronics). The organization has 34663 authors who have published 59808 publications receiving 1467218 citations. The organization is also known as: Hewlett Packard & Hewlett-Packard Company.

Experimental Realization of Teleporting an Unknown Pure Quantum State via Dual Classical and Einstein-Podolsky-Rosen Channels

Abstract: We report on a quantum optical experimental implementation of teleportation of unknown pure quantum states. This realizes all of the nonlocal aspects of the original scheme proposed by Bennett et al. and is equivalent to it up to a local operation. We exhibit results for the teleportation of a linearly polarized state and of an elliptically polarized state. We show that the experimental results cannot be explained in terms of a classical channel alone. The Bell measurement in our experiment can distinguish between all four Bell states simultaneously allowing, in the ideal case, a 100% success rate of teleportation. [S0031-9007(97)05275-7]

Search in Power-law networks

Abstract: Many communication and social networks have power-law link distributions, containing a few nodes that have a very high degree and many with low degree. The high connectivity nodes play the important role of hubs in communication and networking, a fact that can be exploited when designing efficient search algorithms. We introduce a number of local search strategies that utilize high degree nodes in power-law graphs and that have costs scaling sublinearly with the size of the graph. We also demonstrate the utility of these strategies on the GNUTELLA peer-to-peer network.

The future of electronics based on memristive systems

Abstract: A memristor is a resistive device with an inherent memory. The theoretical concept of a memristor was connected to physically measured devices in 2008 and since then there has been rapid progress in the development of such devices, leading to a series of recent demonstrations of memristor-based neuromorphic hardware systems. Here, we evaluate the state of the art in memristor-based electronics and explore where the future of the field lies. We highlight three areas of potential technological impact: on-chip memory and storage, biologically inspired computing and general-purpose in-memory computing. We analyse the challenges, and possible solutions, associated with scaling the systems up for practical applications, and consider the benefits of scaling the devices down in terms of geometry and also in terms of obtaining fundamental control of the atomic-level dynamics. Finally, we discuss the ways we believe biology will continue to provide guiding principles for device innovation and system optimization in the field. This Perspective evaluates the state of the art in memristor-based electronics and explores the future development of such devices in on-chip memory, biologically inspired computing and general-purpose in-memory computing.

Gaussian Interference Channel Capacity to Within One Bit

Abstract: The capacity of the two-user Gaussian interference channel has been open for thirty years. The understanding on this problem has been limited. The best known achievable region is due to Han-Kobayashi but its characterization is very complicated. It is also not known how tight the existing outer bounds are. In this work, we show that the existing outer bounds can in fact be arbitrarily loose in some parameter ranges, and by deriving new outer bounds, we show that a simplified Han-Kobayashi type scheme can achieve to within a single bit the capacity for all values of the channel parameters. We also show that the scheme is asymptotically optimal at certain high SNR regimes. Using our results, we provide a natural generalization of the point-to-point classical notion of degrees of freedom to interference-limited scenarios.

How to share a quantum secret

Abstract: We investigate the concept of quantum secret sharing. In a $(k,n)$ threshold scheme, a secret quantum state is divided into $n$ shares such that any $k$ of those shares can be used to reconstruct the secret, but any set of $k\ensuremath{-}1$ or fewer shares contains absolutely no information about the secret. We show that the only constraint on the existence of threshold schemes comes from the quantum ``no-cloning theorem,'' which requires that $nl2k$, and we give efficient constructions of all threshold schemes. We also show that, for $k\ensuremath{\le}nl2k\ensuremath{-}1$, then any $(k,n)$ threshold scheme must distribute information that is globally in a mixed state.