Controllable Gaussian-Qubit Interface for Extremal Quantum State Engineering

We study state engineering through bilinear interactions between two remote qubits and two-mode Gaussian light fields. The attainable two-qubit states span the entire physically allowed region in the entanglement-versus-global-purity plane. Two-mode Gaussian states with maximal entanglement at fixed global and marginal entropies produce maximally entangled two-qubit states in the corresponding entropic diagram. We show that a small set of parameters characterizing extremally entangled two-mode Gaussian states is sufficient to control the engineering of extremally entangled two-qubit states, which can be realized in realistic matter-light scenarios.

Multimode entanglement and telecloning in a noisy environment

We address the generation, propagation, and application of multipartite continuous variable entanglement in a noisy environment. In particular, we focus our attention on the multimode entangled states achievable by second-order nonlinear crystals-i.e., coherent states of the SU(m,1) group-which provide a generalization of the twin-beam state of a bipartite system. The full inseparability in the ideal case is shown, whereas thresholds for separability are given for the tripartite case in the presence of noise. We find that entanglement of tripartite states is robust against thermal noise, both in the generation process and during propagation. We then consider coherent states of SU(m,1) as a resource for multipartite distribution of quantum information and analyze a specific protocol for telecloning, proving its optimality in the case of symmetric cloning of pure Gaussian states. We show that the proposed protocol also provides the first example of a completely asymmetric 1 -> m telecloning and derive explicitly the optimal relation among the different fidelities of the m clones. The effect of noise in the various stages of the protocol is taken into account, and the fidelities of the clones are analytically obtained as a function of the noise parameters. In turn, this permits the optimization of the telecloning protocol, including its adaptive modifications to the noisy environment. In the optimized scheme the clones' fidelity remains maximal even in the presence of losses (in the absence of thermal noise), for propagation times that diverge as the number of modes increases. In the optimization procedure the prominent role played by the location of the entanglement source is analyzed in details. Our results indicate that, when only losses are present, telecloning is a more effective way to distribute quantum information than direct transmission followed by local cloning.

Distillable entanglement and area laws in spin and harmonic-oscillator systems

We address the presence of nondistillable (bound) entanglement in natural many-body systems. In particular, we consider standard harmonic and spin-1/2 chains, at thermal equilibrium and characterized by few interaction parameters. The existence of bound entanglement is addressed by calculating explicitly the negativity of entanglement for different partitions. This allows us to individuate a range of temperatures for which no entanglement can be distilled by means of local operations, despite the system being globally entangled. We discuss how the appearance of bound entanglement can be linked to entanglement-area laws, typical of these systems. Various types of interactions are explored, showing that the presence of bound entanglement is an intrinsic feature of these systems. In the harmonic case, we analytically prove that thermal bound entanglement persists for systems composed by an arbitrary number of particles. Our results strongly suggest the existence of bound entangled states in the macroscopic limit also for spin-1/2 systems.

The Kitai criterion and backward shifts

It is proved that for any separable infinite dimensional Banach space X, there is a bounded linear operator T on X such that T satisfies the Kitai criterion. The proof is based on a quasisimilarity argument and on showing that I + T satisfies the Kitai criterion for certain backward weighted shifts T.

Shock avoidance by discrimination learning in the shore crab (Carcinus maenas) is consistent with a key criterion for pain

Nociception allows for immediate reflex withdrawal whereas pain allows for longer-term protection via rapid learning. We examine here whether shore crabs placed within a brightly lit chamber learn to avoid one of two dark shelters when that shelter consistently results in shock. Crabs were randomly selected to receive shock or not prior to making their first choice and were tested again over 10 trials. Those that received shock in trial 2, irrespective of shock in trial 1, were more likely to switch shelter choice in the next trial and thus showed rapid discrimination. During trial 1, many crabs emerged from the shock shelter and an increasing proportion emerged in later trials, thus avoiding shock by entering a normally avoided light area. In a final test we switched distinctive visual stimuli positioned above each shelter and/or changed the orientation of the crab when placed in the chamber for the test. The visual stimuli had no effect on choice, but crabs with altered orientation now selected the shock shelter, indicating that they had discriminated between the two shelters on the basis of movement direction. These data, and those of other recent experiments, are consistent with key criteria for pain experience and are broadly similar to those from vertebrate studies. © 2013. Published by The Company of Biologists Ltd.

An optimal algorithm for low power multiplierless FIR filter design using chebychev criterion

In this paper, we propose a novel finite impulse response (FIR) filter design methodology that reduces the number of operations with a motivation to reduce power consumption and enhance performance. The novelty of our approach lies in the generation of filter coefficients such that they conform to a given low-power architecture, while meeting the given filter specifications. The proposed algorithm is formulated as a mixed integer linear programming problem that minimizes chebychev error and synthesizes coefficients which consist of pre-specified alphabets. The new modified coefficients can be used for low-power VLSI implementation of vector scaling operations such as FIR filtering using computation sharing multiplier (CSHM). Simulations in 0.25um technology show that CSHM FIR filter architecture can result in 55% power and 34% speed improvement compared to carry save multiplier (CSAM) based filters.

Existence of disjoint weakly mixing operators that fail to satisfy the Disjoint Hypercyclicity Criterion

Recently, Bès, Martin, and Sanders [11] provided examples of disjoint hypercyclic operators which fail to satisfy the Disjoint Hypercyclicity Criterion. However, their operators also fail to be disjoint weakly mixing. We show that every separable, infinite dimensional Banach space admits operators T1,T2,…,TN with N⩾2 which are disjoint weakly mixing, and still fail to satisfy the Disjoint Hypercyclicity Criterion, answering a question posed in [11]. Moreover, we provide examples of disjoint hypercyclic operators T1, T2 whose corresponding set of disjoint hypercyclic vectors is nowhere dense, answering another question posed in [11]. In fact, we explicitly describe their set of disjoint hypercyclic vectors. Those same disjoint hypercyclic operators fail to be disjoint topologically transitive. Lastly, we create examples of two families of d-hypercyclic operators which fail to have any d-hypercyclic vectors in common.