Entanglement-Saving Channels

The set of Entanglement Saving (ES) quantum channels is introduced and characterized. These are completely positive, trace preserving transformations which when acting locally on a bipartite quantum system initially prepared into a maximally entangled configuration, preserve its entanglement even when applied an arbitrary number of times. In other words, a quantum channel $\psi$ is said to be ES if its powers $\psi^n$ are not entanglement-breaking for all integers $n$. We also characterize the properties of the Asymptotic Entanglement Saving (AES) maps. These form a proper subset of the ES channels that is constituted by those maps which, not only preserve entanglement for all finite $n$, but which also sustain an explicitly not null level of entanglement in the asymptotic limit~$n\rightarrow \infty$. Structure theorems are provided for ES and for AES maps which yield an almost complete characterization of the former and a full characterization of the latter.Comment: 26 page

Singular value decomposition and matrix reorderings in quantum information theory

We review Schmidt and Kraus decompositions in the form of singular value decomposition using operations of reshaping, vectorization and reshuffling. We use the introduced notation to analyse the correspondence between quantum states and operations with the help of Jamiolkowski isomorphism. The presented matrix reorderings allow us to obtain simple formulae for the composition of quantum channels and partial operations used in quantum information theory. To provide examples of the discussed operations we utilize a package for the Mathematica computing system implementing basic functions used in the calculations related to quantum information theory.Comment: 11 pages, no figures, see http://zksi.iitis.pl/wiki/projects:mathematica-qi for related softwar

Dynamic quantum clustering: a method for visual exploration of structures in data

A given set of data-points in some feature space may be associated with a Schrodinger equation whose potential is determined by the data. This is known to lead to good clustering solutions. Here we extend this approach into a full-fledged dynamical scheme using a time-dependent Schrodinger equation. Moreover, we approximate this Hamiltonian formalism by a truncated calculation within a set of Gaussian wave functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data-points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition or feature filtering.Comment: 15 pages, 9 figure

General criterion for the entanglement of two indistinguishable particles

We relate the notion of entanglement for quantum systems composed of two identical constituents to the impossibility of attributing a complete set of properties to both particles. This implies definite constraints on the mathematical form of the state vector associated with the whole system. We then analyze separately the cases of fermion and boson systems, and we show how the consideration of both the Slater-Schmidt number of the fermionic and bosonic analog of the Schmidt decomposition of the global state vector and the von Neumann entropy of the one-particle reduced density operators can supply us with a consistent criterion for detecting entanglement. In particular, the consideration of the von Neumann entropy is particularly useful in deciding whether the correlations of the considered states are simply due to the indistinguishability of the particles involved or are a genuine manifestation of the entanglement. The treatment leads to a full clarification of the subtle aspects of entanglement of two identical constituents which have been a source of embarrassment and of serious misunderstandings in the recent literature.Comment: 18 pages, Latex; revised version: Section 3.2 rewritten, new Theorems added, reference [1] corrected. To appear on Phys.Rev.A 70, (2004

Using a neural network approach for muon reconstruction and triggering

The extremely high rate of events that will be produced in the future Large Hadron Collider requires the triggering mechanism to take precise decisions in a few nano-seconds. We present a study which used an artificial neural network triggering algorithm and compared it to the performance of a dedicated electronic muon triggering system. Relatively simple architecture was used to solve a complicated inverse problem. A comparison with a realistic example of the ATLAS first level trigger simulation was in favour of the neural network. A similar architecture trained after the simulation of the electronics first trigger stage showed a further background rejection.Comment: A talk given at ACAT03, KEK, Japan, November 2003. Submitted to Nuclear Instruments and Methods in Physics Research, Section

Dynamical invariants and nonadiabatic geometric phases in open quantum systems

We introduce an operational framework to analyze non-adiabatic Abelian and non-Abelian, cyclic and non-cyclic, geometric phases in open quantum systems. In order to remove the adiabaticity condition, we generalize the theory of dynamical invariants to the context of open systems evolving under arbitrary convolutionless master equations. Geometric phases are then defined through the Jordan canonical form of the dynamical invariant associated with the super-operator that governs the master equation. As a by-product, we provide a sufficient condition for the robustness of the phase against a given decohering process. We illustrate our results by considering a two-level system in a Markovian interaction with the environment, where we show that the non-adiabatic geometric phase acquired by the system can be constructed in such a way that it is robust against both dephasing and spontaneous emission.Comment: 9 pages, 3 figures. v2: minor corrections and subsection IV.D added. Published versio

Connecting N-representability to Weyl's problem: The one particle density matrix for N = 3 and R = 6

An analytic proof is given of the necessity of the Borland-Dennis conditions for 3-representability of a one particle density matrix with rank 6. This may shed some light on Klyachko's recent use of Schubert calculus to find general conditions for N-representability

Observation of Three-dimensional Long-range Order in Smaller Ion Coulomb Crystals in an rf Trap

Three-dimensional long-range ordered structures in smaller and near-spherically symmetric Coulomb crystals of ^{40}Ca^+ ions confined in a linear rf Paul trap have been observed when the number of ions exceeds ~1000 ions. This result is unexpected from ground state molecular dynamics (MD) simulations, but found to be in agreement with MD simulations of metastable ion configurations. Previously, three-dimensional long-range ordered structures have only been reported in Penning traps in systems of ~50,000 ions or more.Comment: 5 pages; 4 figures; to appear in Phys. Rev. Lett.; changed content