Searcharxiv⌕ Search

arXiv subjects

Dagmar Bruss

Publications and source records attributed to Dagmar Bruss.

33 records · Page 2Linked to original sources
arXiv2005

Dense coding with multipartite quantum states

We consider generalisations of the dense coding protocol with an arbitrary number of senders and either one or two receivers, sharing a multiparty quantum state, and using a noiseless channel. For the case of a single receiver, the capacity of such information transfer is found exactly. It is shown that the capacity is not enhanced by allowing the senders to perform joint operations. We provide a nontrivial upper bound on the capacity in the case of two receivers. We also give a classification of the set of all multiparty states in terms of their usefulness for dense coding. We provide examples for each of these classes, and discuss some of their properties.

quant-ph↗
arXiv2004

Distributed quantum dense coding

We introduce the notion of distributed quantum dense coding, i.e. the generalization of quantum dense coding to more than one sender and more than one receiver. We show that global operations (as compared to local operations) of the senders do not increase the information transfer capacity, in the case of a single receiver. For the case of two receivers, using local operations and classical communication, a non-trivial upper bound for the capacity is derived. We propose a general classification scheme of quantum states according to their usefulness for dense coding. In the bipartite case (for any dimensions), bound entanglement is not useful for this task.

quant-ph↗
arXiv2004

A two-way algorithm for the entanglement problem

We propose an algorithm which proves a given bipartite quantum state to be separable in a finite number of steps. Our approach is based on the search for a decomposition via a countable subset of product states, which is dense within all product states. Performing our algorithm simultaneously with the algorithm by Doherty, Parrilo and Spedalieri (which proves a quantum state to be entangled in a finite number of steps) leads to a two-way algorithm that terminates for any input state. Only for a set of arbitrary small measure near the border between separable and entangled states the result is inconclusive.

quant-ph↗
arXiv2004

Witnessing multipartite entanglement

We present the experimental detection of genuine multipartite entanglement using entanglement witness operators. To this aim we introduce a canonical way of constructing and decomposing witness operators so that they can be directly implemented with present technology. We apply this method to three- and four-qubit entangled states of polarized photons, giving experimental evidence that the considered states contain true multipartite entanglement.

quant-ph↗
arXiv2004

Generation and detection of bound entanglement

We propose a method for the experimental generation of two different families of bound entangled states of three qubits. Our method is based on the explicit construction of a quantum network that produces a purification of the desired state. We also suggest a route for the experimental detection of bound entanglement, by employing a witness operator plus a test of the positivity of the partial transposes.

quant-ph↗
arXiv2004

Simplifying Schmidt number witnesses via higher-dimensional embeddings

We apply the generalised concept of witness operators to arbitrary convex sets, and review the criteria for the optimisation of these general witnesses. We then define an embedding of state vectors and operators into a higher-dimensional Hilbert space. This embedding leads to a connection between any Schmidt number witness in the original Hilbert space and a witness for Schmidt number two (i.e. the most general entanglement witness) in the appropriate enlarged Hilbert space. Using this relation we arrive at a conceptually simple method for the construction of Schmidt number witnesses in bipartite systems.

quant-ph↗
arXiv2003

Tomographic Quantum Cryptography: Equivalence of Quantum and Classical Key Distillation

The security of a cryptographic key that is generated by communication through a noisy quantum channel relies on the ability to distill a shorter secure key sequence from a longer insecure one. For an important class of protocols, which exploit tomographically complete measurements on entangled pairs of any dimension, we show that the noise threshold for classical advantage distillation is identical with the threshold for quantum entanglement distillation. As a consequence, the two distillation procedures are equivalent: neither offers a security advantage over the other.

quant-ph↗
arXiv2001

Characterizing Entanglement

Quantum entanglement is at the heart of many tasks in quantum information. Apart from simple cases (low dimensions, few particles, pure states), however, the mathematical structure of entanglement is not yet fully understood. This tutorial is an introduction to our present knowledge about how to decide whether a given state is separable or entangled, how to characterize entanglement via witness operators, how to classify entangled states according to their usefulness (i.e. distillability), and how to quantify entanglement with appropriate measures.

quant-ph↗
arXiv2000

Quantum Cloning and Distributed Measurements

We study measurements on various subsystems of the output of a universal 1 to 2 cloning machine, and establish a correspondence between these measurements at the output and effective measurements on the original input. We show that one can implement sharp effective measurement elements by measuring only two out of the three output systems. Additionally, certain complete sets of sharp measurements on the input can be realised by measurements on the two clones. Furthermore, we introduce a scheme that allows to restore the original input in one of the output bits, by using measurements and classical communication -- a protocol that resembles teleportation.

quant-ph↗
arXiv2000

Schmidt number witnesses and bound entanglement

The Schmidt number of a mixed state characterizes the minimum Schmidt rank of the pure states needed to construct it. We investigate the Schmidt number of an arbitrary mixed state by constructing a Schmidt number witness that detects it. We present a canonical form of such witnesses and provide constructive methods for their optimization. Finally, we present strong evidence that all bound entangled states with positive partial transpose in two qutrit systems have Schmidt number 2.

quant-ph↗
arXiv1999

Entanglement splitting of pure bipartite quantum states

The concept of entanglement splitting is introduced by asking whether it is possible for a party possessing half of a pure bipartite quantum state to transfer some of his entanglement with the other party to a third party. We describe the unitary local transformation for symmetric and isotropic splitting of a singlet into two branches that leads to the highest entanglement of the output. The capacity of the resulting quantum channels is discussed. Using the same transformation for less than maximally entangled pure states, the entanglement of the resulting states is found. We discuss whether they can be used to do teleportation and to test the Bell inequality. Finally we generalize to entanglement splitting into more than two branches.

quant-ph↗
arXiv1999

Reversible quantum teleportation in an optical lattice

We propose a protocol, based on entanglement procedures recently suggested by [D. Jaksch et al., Phys. Rev. Lett. 82, 1975 (1999)], which allows the teleportation of an unknown state of a neutral atom in an optical lattice to another atom in another site of the lattice, without any irreversible detection.

quant-ph↗
arXiv1998

Optimal eavesdropping in quantum cryptography with six states

A generalization of the quantum cryptographic protocol by Bennett and Brassard is discussed, using three conjugate bases, i.e. six states. By calculating the optimal mutual information between sender and eavesdropper it is shown that this scheme is safer against eavesdropping on single qubits than the one based on two conjugate bases. We also address the question for a connection between the maximal classical correlation in a generalized Bell inequality and the intersection of mutual informations between sender/receiver and sender/eavesdropper.

quant-ph↗