Quantum disentanglers

It is not possible to disentangle a qubit in an unknown state $|\psi>$ from a set of (N-1) ancilla qubits prepared in a specific reference state $|0>$. That is, it is not possible to {\em perfectly} perform the transformation $(|\psi,0...,0\r +|0,\psi,...,0\r +...+ |0,0,...\psi\r) \to |0,...,0>\otimes |\psi>$. The question is then how well we can do? We consider a number of different methods of extracting an unknown state from an entangled state formed from that qubit and a set of ancilla qubits in an known state. Measuring the whole system is, as expected, the least effective method. We present various quantum ``devices'' which disentangle the unknown qubit from the set of ancilla qubits. In particular, we present the optimal universal disentangler which disentangles the unknown qubit with the fidelity which does not depend on the state of the qubit, and a probabilistic disentangler which performs the perfect disentangling transformation, but with a probability less than one.Comment: 8 pages, 1 eps figur

Optimal Universal Disentangling Machine for Two Qubit Quantum States

We derive the optimal curve satisfied by the reduction factors, in the case of universal disentangling machine which uses only local operations. Impossibility of constructing a better disentangling machine, by using non-local operations, is discussed.Comment: 15 pages, 2 eps figures, 1 section added, 1 eps figure added, minor corrections, 2 reference numbers correcte

The intricate Galaxy disk: velocity asymmetries in Gaia-TGAS

We use the Gaia-TGAS data to compare the transverse velocities in Galactic longitude (coming from proper motions and parallaxes) in the Milky Way disk for negative and positive longitudes as a function of distance. The transverse velocities are strongly asymmetric and deviate significantly from the expectations for an axisymmetric Galaxy. The value and sign of the asymmetry changes at spatial scales of several tens of degrees in Galactic longitude and about 0.5 kpc in distance. The asymmetry is statistically significant at 95% confidence level for 57% of the region probed, which extends up to ~1.2 kpc. A percentage of 24% of the region studied shows absolute differences at this confidence level larger than 5 km/s and 7% larger than 10 km/s. The asymmetry pattern shows mild variations in the vertical direction and with stellar type. A first qualitative comparison with spiral arm models indicates that the arms are unlikely to be the main source of the asymmetry. We briefly discuss alternative origins. This is the first time that global all-sky asymmetries are detected in the Milky Way kinematics, beyond the local neighbourhood, and with a purely astrometric sample.Comment: Accepted for publication in A&A Letter

Realization of Optimal Disentanglement by Teleportation via Separable Channel

We discuss here the best disentanglement processes of states of two two-level systems which belong to (i) the universal set, (ii) the set in which the states of one party lie on a single great circle of the Bloch sphere, and (iii) the set in which the states of one party commute with each other, by teleporting the states of one party (on which the disentangling machine is acting) through three particular type of separable channels, each of which is a mixture of Bell states. In the general scenario, by teleporting one party's state of an arbitrary entangled state of two two-level parties through some mixture of Bell states, we have shown that this entangled state can be made separable by using a physically realizable map $\tilde{V}$, acting on one party's states, if $\tilde{V} (I) = I, \tilde{V} ({\sigma}_j) = {\lambda}_j {\sigma}_j$, where ${\lambda}_j \ge 0$ (for $j = 1, 2, 3$), and ${\lambda}_1 + {\lambda}_2 + {\lambda}_3 \le 1$.Comment: 20 pages Late

Nonlinear Qubit Transformations

We generalise our previous results of universal linear manipulations [Phys. Rev. A63, 032304 (2001)] to investigate three types of nonlinear qubit transformations using measurement and quantum based schemes. Firstly, nonlinear rotations are studied. We rotate different parts of a Bloch sphere in opposite directions about the z-axis. The second transformation is a map which sends a qubit to its orthogonal state (which we define as ORTHOG). We consider the case when the ORTHOG is applied to only a partial area of a Bloch sphere. We also study nonlinear general transformation, i.e. (theta,phi)->(theta-alpha,phi), again, applied only to part of the Bloch sphere. In order to achieve these three operations, we consider different measurement preparations and derive the optimal average (instead of universal) quantum unitary transformations. We also introduce a simple method for a qubit measurement and its application to other cases.Comment: minor corrections. To appear in PR

Gaia DR2 view of the Lupus V-VI clouds: the candidate diskless young stellar objects are mainly background contaminants

Extensive surveys of star-forming regions with Spitzer have revealed populations of disk-bearing young stellar objects. These have provided crucial constraints, such as the timescale of dispersal of protoplanetary disks, obtained by carefully combining infrared data with spectroscopic or X-ray data. While observations in various regions agree with the general trend of decreasing disk fraction with age, the Lupus V and VI regions appeared to have been at odds, having an extremely low disk fraction. Here we show, using the recent Gaia data release 2 (DR2), that these extremely low disk fractions are actually due to a very high contamination by background giants. Out of the 83 candidate young stellar objects (YSOs) in these clouds observed by Gaia, only five have distances of 150 pc, similar to YSOs in the other Lupus clouds, and have similar proper motions to other members in this star-forming complex. Of these five targets, four have optically thick (Class II) disks. On the one hand, this result resolves the conundrum of the puzzling low disk fraction in these clouds, while, on the other hand, it further clarifies the need to confirm the Spitzer selected diskless population with other tracers, especially in regions at low galactic latitude like Lupus V and VI. The use of Gaia astrometry is now an independent and reliable way to further assess the membership of candidate YSOs in these, and potentially other, star-forming regions.Comment: Accepted for publication on Astronomy&Astrophysics Letter

Finite lifetime eigenfunctions of coupled systems of harmonic oscillators

We find a Hermite-type basis for which the eigenvalue problem associated to the operator $H_{A,B}:=B(-\partial_x^2)+Ax^2$ acting on $L^2({\bf R};{\bf C}^2)$ becomes a three-terms recurrence. Here $A$ and $B$ are two constant positive definite matrices with no other restriction. Our main result provides an explicit characterization of the eigenvectors of $H_{A,B}$ that lie in the span of the first four elements of this basis when $AB\not= BA$.Comment: 11 pages, 1 figure. Some typos where corrected in this new versio

Convexity-Increasing Morphs of Planar Graphs

We study the problem of convexifying drawings of planar graphs. Given any planar straight-line drawing of an internally 3-connected graph, we show how to morph the drawing to one with strictly convex faces while maintaining planarity at all times. Our morph is convexity-increasing, meaning that once an angle is convex, it remains convex. We give an efficient algorithm that constructs such a morph as a composition of a linear number of steps where each step either moves vertices along horizontal lines or moves vertices along vertical lines. Moreover, we show that a linear number of steps is worst-case optimal. To obtain our result, we use a well-known technique by Hong and Nagamochi for finding redrawings with convex faces while preserving y-coordinates. Using a variant of Tutte's graph drawing algorithm, we obtain a new proof of Hong and Nagamochi's result which comes with a better running time. This is of independent interest, as Hong and Nagamochi's technique serves as a building block in existing morphing algorithms.Comment: Preliminary version in Proc. WG 201

Small grid embeddings of 3-polytopes

We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by $O(2^{7.55n})=O(188^{n})$. If the graph contains a triangle we can bound the integer coordinates by $O(2^{4.82n})$. If the graph contains a quadrilateral we can bound the integer coordinates by $O(2^{5.46n})$. The crucial part of the algorithm is to find a convex plane embedding whose edges can be weighted such that the sum of the weighted edges, seen as vectors, cancel at every point. It is well known that this can be guaranteed for the interior vertices by applying a technique of Tutte. We show how to extend Tutte's ideas to construct a plane embedding where the weighted vector sums cancel also on the vertices of the boundary face