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.

Concentrating entanglement by local actions: Beyond mean values

Abstract: Suppose two distant observers Alice and Bob share a pure bipartite quantum state. By applying local operations and communicating with each other using a classical channel, Alice and Bob can manipulate it into some other states. Previous investigations of entanglement manipulations have been largely limited to a small number of strategies and their average outcomes. Here we consider a general entanglement manipulation strategy, and go beyond the average property. For a pure entangled state shared between two separated persons Alice and Bob, we show that the mathematical interchange symmetry of the Schmidt decomposition can be promoted into a physical symmetry between the actions of Alice and Bob. Consequently, the most general (multistep two-way-communications) strategy of entanglement manipulation of a pure state is, in fact, equivalent to a strategy involving only a single (generalized) measurement by Alice followed by one-way communications of its result to Bob. We also prove that strategies with one-way communications are generally more powerful than those without communications. In summary, one-way communications is necessary and sufficient for entanglement manipulations of a pure bipartite state. The supremum probability of obtaining a maximally entangled state (of any dimension) from an arbitrary state is determined, and a strategy for achieving this probability is constructed explicitly. One important question is whether collective manipulations in quantum mechanics can greatly enhance the probability of large deviations from the average behavior. We answer this question in the negative by showing that, given n pairs of identical partly entangled pure states $(|\ensuremath{\Psi}〉)$ with entropy of entanglement $E(|\ensuremath{\Psi}〉),$ the probability of getting $\mathrm{nK}$ $[KgE(|\ensuremath{\Psi}〉)]$ singlets out of entanglement concentration tends to zero as n tends to infinity.

Cassette of lancet cartridges for sampling blood

Abstract: A cassette containing cartridges for sampling blood from a patient. The cassette includes a container for storing a plurality of cartridges and at least one cartridge in the container. The cartridge includes a cartridge case and a lancet. The lancet has a tip and is housed in the cartridge case. The lancet can be driven to extend the tip outside the cartridge case for lancing the skin of the patient to yield blood. The container has a compartment that contains at least one cartridge. A cartridge from the compartment can be loaded onto a glucometer that drives the lancet in the cartridge to lance the skin of a patient.

Qudit quantum-state tomography

Abstract: Recently quantum tomography has been proposed as a fundamental tool for prototyping a few qubit quantum device. It allows the complete reconstruction of the state produced from a given input into the device. From this reconstructed density matrix, relevant quantum information quantities such as the degree of entanglement and entropy can be calculated. Generally, orthogonal measurements have been discussed for this tomographic reconstruction. In this paper, we extend the tomographic reconstruction technique to two new regimes. First, we show how nonorthogonal measurements allow the reconstruction of the state of the system provided the measurements span the Hilbert space. We then detail how quantum-state tomography can be performed for multiqudits with a specific example illustrating how to achieve this in one- and two-qutrit systems.

Self-organized computation with unreliable, memristive nanodevices

Abstract: Nanodevices have terrible properties for building Boolean logic systems: high defect rates, high variability, high death rates, drift, and (for the most part) only two terminals. Economical assembly requires that they be dynamical. We argue that strategies aimed at mitigating these limitations, such as defect avoidance/reconfiguration, or applying coding theory to circuit design, present severe scalability and reliability challenges. We instead propose to mitigate device shortcomings and exploit their dynamical character by building self-organizing, self-healing networks that implement massively parallel computations. The key idea is to exploit memristive nanodevice behavior to cheaply implement adaptive, recurrent networks, useful for complex pattern recognition problems. Pulse-based communication allows the designer to make trade-offs between power consumption and processing speed. Self-organization sidesteps the scalability issues of characterization, compilation and configuration. Network dynamics supplies a graceful response to device death. We present simulation results of such a network—a self-organized spatial filter array—that demonstrate its performance as a function of defects and device variation.

Superresolution restoration of an image sequence: adaptive filtering approach

Abstract: This paper presents a new method based on adaptive filtering theory for superresolution restoration of continuous image sequences. The proposed methodology suggests least squares (LS) estimators which adapt in time, based on adaptive filters, least mean squares (LMS) or recursive least squares (RLS). The adaptation enables the treatment of linear space and time-variant blurring and arbitrary motion, both of them assumed known. The proposed new approach is shown to be of relatively low computational requirements. Simulations demonstrating the superresolution restoration algorithms are presented.