Strong quantitative benchmarking of quantum optical devices

Quantum communication devices, such as quantum repeaters, quantum memories, or quantum channels, are unavoidably exposed to imperfections. However, the presence of imperfections can be tolerated, as long as we can verify such devices retain their quantum advantages. Benchmarks based on witnessing entanglement have proven useful for verifying the true quantum nature of these devices. The next challenge is to characterize how strongly a device is within the quantum domain. We present a method, based on entanglement measures and rigorous state truncation, which allows us to characterize the degree of quantumness of optical devices. This method serves as a quantitative extension to a large class of previously-known quantum benchmarks, requiring no additional information beyond what is already used for the non-quantitative benchmarks.Comment: 11 pages, 7 figures. Comments are welcome. ver 2: Improved figures, no changes to main tex

Study of the Distillability of Werner States Using Entanglement Witnesses and Robust Semidefinite Programs

We use Robust Semidefinite Programs and Entanglement Witnesses to study the distillability of Werner states. We perform exact numerical calculations which show 2-undistillability in a region of the state space which was previously conjectured to be undistillable. We also introduce bases which yield interesting expressions for the {\em distillability witnesses} and for a tensor product of Werner states with arbitrary number of copies.Comment: 16 pages, 2 figure

Entanglement Witnesses for Graph States: General Theory and Examples

We present a general theory for the construction of witnesses that detect genuine multipartite entanglement in graph states. First, we present explicit witnesses for all graph states of up to six qubits which are better than all criteria so far. Therefore, lower fidelities are required in experiments that aim at the preparation of graph states. Building on these results, we develop analytical methods to construct two different types of entanglement witnesses for general graph states. For many classes of states, these operators exhibit white noise tolerances that converge to one when increasing the number of particles. We illustrate our approach for states such as the linear and the 2D cluster state. Finally, we study an entanglement monotone motivated by our approach for graph states.Comment: 12 pages + appendix, 7 figure

Device-independent bounds for Hardy's experiment

In this Letter we compute an analogue of Tsirelson's bound for Hardy's test of nonlocality, that is, the maximum violation of locality constraints allowed by the quantum formalism, irrespective of the dimension of the system. The value is found to be the same as the one achievable already with two-qubit systems, and we show that only a very specific class of states can lead to such maximal value, thus highlighting Hardy's test as a device-independent self-test protocol for such states. By considering realistic constraints in Hardy's test, we also compute device-independent upper bounds on this violation and show that these bounds are saturated by two-qubit systems, thus showing that there is no advantage in using higher-dimensional systems in experimental implementations of such test.Comment: 4 pages, 2 figure

Optimal entanglement witnesses for continuous-variable systems

This paper is concerned with all tests for continuous-variable entanglement that arise from linear combinations of second moments or variances of canonical coordinates, as they are commonly used in experiments to detect entanglement. All such tests for bi-partite and multi-partite entanglement correspond to hyperplanes in the set of second moments. It is shown that all optimal tests, those that are most robust against imperfections with respect to some figure of merit for a given state, can be constructed from solutions to semi-definite optimization problems. Moreover, we show that for each such test, referred to as entanglement witness based on second moments, there is a one-to-one correspondence between the witness and a stronger product criterion, which amounts to a non-linear witness, based on the same measurements. This generalizes the known product criteria. The presented tests are all applicable also to non-Gaussian states. To provide a service to the community, we present the documentation of two numerical routines, FULLYWIT and MULTIWIT, which have been made publicly available.Comment: 14 pages LaTeX, 1 figure, presentation improved, references update

Entanglement verification for quantum key distribution systems with an underlying bipartite qubit-mode structure

We consider entanglement detection for quantum key distribution systems that use two signal states and continuous variable measurements. This problem can be formulated as a separability problem in a qubit-mode system. To verify entanglement, we introduce an object that combines the covariance matrix of the mode with the density matrix of the qubit. We derive necessary separability criteria for this scenario. These criteria can be readily evaluated using semidefinite programming and we apply them to the specific quantum key distribution protocol.Comment: 6 pages, 2 figures, v2: final versio

Bell inequalities for three systems and arbitrarily many measurement outcomes

We present a family of Bell inequalities for three parties and arbitrarily many outcomes, which can be seen as a natural generalization of the Mermin Bell inequality. For a small number of outcomes, we verify that our inequalities define facets of the polytope of local correlations. We investigate the quantum violations of these inequalities, in particular with respect to the Hilbert space dimension. We provide strong evidence that the maximal quantum violation can only be reached using systems with local Hilbert space dimension exceeding the number of measurement outcomes. This suggests that our inequalities can be used as multipartite dimension witnesses.Comment: v1 6 pages, 4 tables; v2 Published version with minor typos correcte

One-way quantum key distribution: Simple upper bound on the secret key rate

We present a simple method to obtain an upper bound on the achievable secret key rate in quantum key distribution (QKD) protocols that use only unidirectional classical communication during the public-discussion phase. This method is based on a necessary precondition for one-way secret key distillation; the legitimate users need to prove that there exists no quantum state having a symmetric extension that is compatible with the available measurements results. The main advantage of the obtained upper bound is that it can be formulated as a semidefinite program, which can be efficiently solved. We illustrate our results by analysing two well-known qubit-based QKD protocols: the four-state protocol and the six-state protocol. Recent results by Renner et al., Phys. Rev. A 72, 012332 (2005), also show that the given precondition is only necessary but not sufficient for unidirectional secret key distillation.Comment: 11 pages, 1 figur

Negativity and steering : a stronger Peres conjecture

The violation of a Bell inequality certifies the presence of entanglement even if neither party trusts their measurement devices. Recently Moroder et al. [T. Moroder, J.-D. Bancal, Y.-C. Liang, M. Hofmann, and O. Gühne, Phys. Rev. Lett. 111, 030501 (2013)] showed how to make this statement quantitative, using semidefinite programming to calculate how much entanglement is certified by a given violation. Here I adapt their techniques to the case in which Bob's measurement devices are in fact trusted, the setting for Einstein-Podolsky-Rosen steering inequalities. Interestingly, all of the steering inequalities studied turn out to require negativity for their violations. This supports a significant strengthening of Peres's conjecture that negativity is required to violate a bipartite Bell inequality

A reduced complexity numerical method for optimal gate synthesis

Although quantum computers have the potential to efficiently solve certain problems considered difficult by known classical approaches, the design of a quantum circuit remains computationally difficult. It is known that the optimal gate design problem is equivalent to the solution of an associated optimal control problem, the solution to which is also computationally intensive. Hence, in this article, we introduce the application of a class of numerical methods (termed the max-plus curse of dimensionality free techniques) that determine the optimal control thereby synthesizing the desired unitary gate. The application of this technique to quantum systems has a growth in complexity that depends on the cardinality of the control set approximation rather than the much larger growth with respect to spatial dimensions in approaches based on gridding of the space, used in previous literature. This technique is demonstrated by obtaining an approximate solution for the gate synthesis on $SU(4)$- a problem that is computationally intractable by grid based approaches.Comment: 8 pages, 4 figure