Detecting entanglement using a double quantum dot turnstile

We propose a scheme based on using the singlet ground state of an electron spin pair in a double quantum dot nanostructure as a suitable set-up for detecting entanglement between electron spins via the measurement of an optimal entanglement witness. Using time-dependent gate voltages and magnetic fields the entangled spins are separated and coherently rotated in the quantum dots and subsequently detected at spin-polarized quantum point contacts. We analyze the coherent time evolution of the entangled pair and show that by counting coincidences in the four exits an entanglement test can be done. This set-up is close to present-day experimental possibilities and can be used to produce pairs of entangled electrons ``on demand''.Comment: 5 pages, 2 figures - published versio

Simulating quantum operations with mixed environments

We study the physical resources required to implement general quantum operations, and provide new bounds on the minimum possible size which an environment must be in order to perform certain quantum operations. We prove that contrary to a previous conjecture, not all quantum operations on a single-qubit can be implemented with a single-qubit environment, even if that environment is initially prepared in a mixed state. We show that a mixed single-qutrit environment is sufficient to implement a special class of operations, the generalized depolarizing channels.Comment: 4 pages Revtex + 1 fig, pictures at http://stout.physics.ucla.edu/~smolin/tetrahedron .Several small correction

From Majorana Fermions to Topological Order

We consider a system consisting of a 2D network of links between Majorana fermions on superconducting islands. We show that the fermionic Hamiltonian modeling this system is topologically-ordered in a region of parameter space. In particular we show that Kitaev's toric code emerges in fourth-order perturbation theory. By using a Jordan-Wigner transformation we can map the model onto a family of signed 2D Ising models in a transverse field where the signs (FM or AFM) are determined by additional gauge bits. Our mapping allows an understanding of the non-perturbative regime and the phase transition to a non-topological phase. We discuss the physics behind a possible implementation of this model and argue how it can be used for topological quantum computation by adiabatic changes in the Hamiltonian.Comment: 4+4 pages, 5 figures. v2 has a new reference and a few new comments. In v3: yet another new reference and Supplementary Material is renamed Appendix. In v4: several typos are corrected, to appear in Phys. Rev. Let

Separable approximations of density matrices of composite quantum systems

We investigate optimal separable approximations (decompositions) of states rho of bipartite quantum systems A and B of arbitrary dimensions MxN following the lines of Ref. [M. Lewenstein and A. Sanpera, Phys. Rev. Lett. 80, 2261 (1998)]. Such approximations allow to represent in an optimal way any density operator as a sum of a separable state and an entangled state of a certain form. For two qubit systems (M=N=2) the best separable approximation has a form of a mixture of a separable state and a projector onto a pure entangled state. We formulate a necessary condition that the pure state in the best separable approximation is not maximally entangled. We demonstrate that the weight of the entangled state in the best separable approximation in arbitrary dimensions provides a good entanglement measure. We prove in general for arbitrary M and N that the best separable approximation corresponds to a mixture of a separable and an entangled state which are both unique. We develop also a theory of optimal separable approximations for states with positive partial transpose (PPT states). Such approximations allow to decompose any density operator with positive partial transpose as a sum of a separable state and an entangled PPT state. We discuss procedures of constructing such decompositions.Comment: 12 pages, 2 figure

Further results on entanglement detection and quantification from the correlation matrix criterion

The correlation matrix (CM) criterion is a recently derived powerful sufficient condition for the presence of entanglement in bipartite quantum states of arbitrary dimensions. It has been shown that it can be stronger than the positive partial transpose (PPT) criterion, as well as the computable cross norm or realignment (CCNR) criterion in different situations. However, it remained as an open question whether there existed sets of states for which the CM criterion could be stronger than both criteria simultaneously. Here, we give an affirmative answer to this question by providing examples of entangled states that scape detection by both the PPT and CCNR criteria whose entanglement is revealed by the CM condition. We also show that the CM can be used to measure the entanglement of pure states and obtain lower bounds for the entanglement measure known as tangle for general (mixed) states.Comment: 13 pages, no figures; added references, minor changes; section 4.3 added, to appear in J. Phys.

Multipartite bound entangled states that violate Bell's inequality

We study the relation between distillability of multipartite states and violation of Bell's inequality. We prove that there exist multipartite bound entangled states (i.e. non-separable, non-distillable states) that violate a multipartite Bell inequality. This implies that (i) violation of Bell's inequality is not a sufficient condition for distillability and (ii) some bound entangled states cannot be described by a local hidden variable model.Comment: 4 pages, no figure

Topological fault-tolerance in cluster state quantum computation

We describe a fault-tolerant version of the one-way quantum computer using a cluster state in three spatial dimensions. Topologically protected quantum gates are realized by choosing appropriate boundary conditions on the cluster. We provide equivalence transformations for these boundary conditions that can be used to simplify fault-tolerant circuits and to derive circuit identities in a topological manner. The spatial dimensionality of the scheme can be reduced to two by converting one spatial axis of the cluster into time. The error threshold is 0.75% for each source in an error model with preparation, gate, storage and measurement errors. The operational overhead is poly-logarithmic in the circuit size.Comment: 20 pages, 12 figure

Quantum Algorithms for Fermionic Simulations

We investigate the simulation of fermionic systems on a quantum computer. We show in detail how quantum computers avoid the dynamical sign problem present in classical simulations of these systems, therefore reducing a problem believed to be of exponential complexity into one of polynomial complexity. The key to our demonstration is the spin-particle connection (or generalized Jordan-Wigner transformation) that allows exact algebraic invertible mappings of operators with different statistical properties. We give an explicit implementation of a simple problem using a quantum computer based on standard qubits.Comment: 38 pages, 2 psfigur

Quantum search without entanglement

Entanglement of quantum variables is usually thought to be a prerequisite for obtaining quantum speed-ups of information processing tasks such as searching databases. This paper presents methods for quantum search that give a speed-up over classical methods, but that do not require entanglement. These methods rely instead on interference to provide a speed-up. Search without entanglement comes at a cost: although they outperform analogous classical devices, the quantum devices that perform the search are not universal quantum computers and require exponentially greater overhead than a quantum computer that operates using entanglement. Quantum search without entanglement is compared to classical search using waves.Comment: 9 pages, TeX, submitted to Physical Review Letter

Experimental investigation of classical and quantum correlations under decoherence

It is well known that many operations in quantum information processing depend largely on a special kind of quantum correlation, that is, entanglement. However, there are also quantum tasks that display the quantum advantage without entanglement. Distinguishing classical and quantum correlations in quantum systems is therefore of both fundamental and practical importance. In consideration of the unavoidable interaction between correlated systems and the environment, understanding the dynamics of correlations would stimulate great interest. In this study, we investigate the dynamics of different kinds of bipartite correlations in an all-optical experimental setup. The sudden change in behaviour in the decay rates of correlations and their immunity against certain decoherences are shown. Moreover, quantum correlation is observed to be larger than classical correlation, which disproves the early conjecture that classical correlation is always greater than quantum correlation. Our observations may be important for quantum information processing.Comment: 7 pages, 4 figures, to appear in Nature Communication