arXiv subjects

Hermann Kampermann

Publications and source records attributed to Hermann Kampermann.

At least 73 records · Page 4Linked to original sources

arXiv2017

Device-Independent Bounds on Detection Efficiency

In many quantum information applications, a minimum detection efficiency must be exceeded to ensure success. Protocols depending on the violation of a Bell inequality, for instance, may be subject to the so-called detection loophole: imperfect detectors may yield spurious violations, which consequently cannot be used to ensure, say, quantum cryptographic security. Hence, we investigate the possibility of giving lower bounds on detector efficiency even if an adversary has full control over both the source and the detectors. To this end, we present a technique to systematically derive Bell inequalities free from the detection loophole using only the observed measurements statistics. The violation of these inequalities certifies that the detectors used exceed a certain minimal efficiency.

quant-ph↗

arXiv2017

Multi-partite entanglement speeds up quantum key distribution in networks

The laws of quantum mechanics allow for the distribution of a secret random key between two parties. Here we analyse the security of a protocol for establishing a common secret key between N parties (i.e. a conference key), using resource states with genuine N-partite entanglement. We compare this protocol to conference key distribution via bipartite entanglement, regarding the required resources, achievable secret key rates and threshold qubit error rates. Furthermore we discuss quantum networks with bottlenecks for which our multipartite entanglement-based protocol can benefit from network coding, while the bipartite protocol cannot. It is shown how this advantage leads to a higher secret key rate.

quant-ph↗

arXiv2017

Measurement-device-independent randomness generation with arbitrary quantum states

Measurements of quantum systems can be used to generate classical data that is truly unpredictable for every observer. However, this true randomness needs to be discriminated from randomness due to ignorance or lack of control of the devices. We analyze the randomness gain of a measurement-device-independent setup, consisting of a well-characterized source of quantum states and a completely uncharacterized and untrusted detector. Our framework generalizes previous schemes as arbitrary input states and arbitrary measurements can be analyzed. Our method is used to suggest simple and realistic implementations that yield high randomness generation rates of more than one random bit per qubit for detectors of sufficient quality.

quant-ph↗

arXiv2016

Entanglement distribution and quantum discord

Establishing entanglement between distant parties is one of the most important problems of quantum technology, since long-distance entanglement is an essential part of such fundamental tasks as quantum cryptography or quantum teleportation. In this lecture we review basic properties of entanglement and quantum discord, and discuss recent results on entanglement distribution and the role of quantum discord therein. We also review entanglement distribution with separable states, and discuss important problems which still remain open. One such open problem is a possible advantage of indirect entanglement distribution, when compared to direct distribution protocols.

quant-ph↗

arXiv2016

Quantum Router with Network Coding

Many protocols of quantum information processing, like quantum key distribution or measurement-based quantum computation, "consume" entangled quantum states during their execution. When participants are located at distant sites, these resource states need to be distributed. Due to transmission losses quantum repeater become necessary for large distances (e.g. $\gtrsim$ 300 km). Here we generalize the concept of the graph state repeater to $D$-dimensional graph states and to repeaters that can perform basic measurement-based quantum computations, which we call quantum routers. This processing of data at intermediate network nodes is called quantum network coding. We describe how a scheme to distribute general two-colorable graph states via quantum routers with network coding can be constructed from classical linear network codes. The robustness of the distribution of graph states against outages of network nodes is analysed by establishing a link to stabilizer error correction codes. Furthermore we show, that for any stabilizer error correction code there exists a corresponding quantum network code with similar error correcting capabilities.

quant-ph↗

arXiv2016

Large-scale quantum networks based on graphs

Society relies and depends increasingly on information exchange and communication. In the quantum world, security and privacy is a built-in feature for information processing. The essential ingredient for exploiting these quantum advantages is the resource of entanglement, which can be shared between two or more parties. The distribution of entanglement over large distances constitutes a key challenge for current research and development. Due to losses of the transmitted quantum particles, which typically scale exponentially with the distance, intermediate quantum repeater stations are needed. Here we show how to generalise the quantum repeater concept to the multipartite case, by fully describing large-scale quantum networks, i.e. network nodes and their long-distance links, in the language of graphs and graph states. This unifying approach comprises both the distribution of multipartite entanglement across the network, and the protection against errors via encoding. The correspondence to graph states also provides a tool for optimising the architecture of quantum networks.

quant-ph↗

arXiv2016

Determining X-chains in graph states

The representation of graph states in the X-basis as well as the calculation of graph state overlaps can efficiently be performed by using the concept of X-Chains [Phys. Rev. A 92(1) 012322]. We present a necessary and sufficient criterion for X-chains and show that they can efficiently be determined by Bareiss algorithm. An analytical approach for searching X-chain groups of a graph state is proposed. Furthermore we generalize the concept of X-chains to so-called Euler chains, whose induced subgraphs are Eulerian. This approach helps to determine if a given vertex set is an X-chain and we show how Euler chains can be used in the construction of multipartite Bell inequalities for graph states.

quant-ph↗

arXiv2016

Witnessing entanglement by proxy

Entanglement is a ubiquitous feature of low temperature systems and believed to be highly relevant for the dynamics of condensed matter properties and quantum computation even at higher temperatures. The experimental certification of this paradigmatic quantum effect in macroscopic high temperature systems is constrained by the limited access to the quantum state of the system. In this paper we show how macroscopic observables beyond the energy of the system can be exploited as proxy witnesses for entanglement detection. Using linear and semi-definite relaxations we show that all previous approaches to this problem can be outperformed by our proxies, i.e. entanglement can be certified at higher temperatures without access to any local observable. For an efficient computation of proxy witnesses one can resort to a generalized grand canonical ensemble, enabling entanglement certification even in complex systems with macroscopic particle numbers.

quant-ph↗

arXiv2015

Detecting Entanglement of Unknown Quantum States with Random Measurements

In quantum information theory, the reliable and effective detection of entanglement is of paramount importance. However, given an unknown state, assessing its entanglement is a challenging task. To attack this problem, we investigate the use of random local measurements, from which entanglement witnesses are then constructed via semidefinite programming methods. We propose a scheme of successively increasing the number of measurements until the presence of entanglement can be unambiguously concluded, and investigate its performance in various examples.

quant-ph↗

arXiv2015

On the error analysis of quantum repeaters with encoding

Losses of optical signals scale exponentially with the distance. Quantum repeaters are devices that tackle these losses in quantum communication by splitting the total distance into shorter parts. Today two types of quantum repeaters are subject of research in the field of quantum information: Those that use two-way communication and those that only use one-way communication. Here we explain the details of the performance analysis for repeaters of the second type. Furthermore we compare the two different schemes. Finally we show how the performance analysis generalizes to large-scale quantum networks.

quant-ph↗

arXiv2015

Group structures and representations of graph states

A special configuration of graph state stabilizers, which contains only Pauli $σ_X$ operators, is studied. The vertex sets $ξ$ associated with such configurations are defined as what we call X-chains of graph states. The X-chains of a general graph state can be determined efficiently. They form a group structure such that one can obtain the explicit representation of graph states in the X-basis via the so-called X-chain factorization diagram. We show that graph states with different X-chain groups can have different probability distributions of X-measurement outcomes, which allows one to distinguish certain graph states with X-measurements. We provide an approach to find the Schmidt decomposition of graph states in the X-basis. The existence of X-chains in a subsystem facilitates error correction in the entanglement localization of graph states. In all of these applications, the difficulty of the task decreases with increasing number of X-chains. Furthermore, we show that the overlap of two graph states can be efficiently determined via X-chains, while its computational complexity with other known methods increases exponentially.

quant-ph↗

arXiv2015

A quantum mechanical bound for CHSH-type Bell inequalities

Many typical Bell experiments can be described as follows. A source repeatedly distributes particles among two spacelike separated observers. Each of them makes a measurement, using an observable randomly chosen out of several possible ones, leading to one of two possible outcomes. After collecting a sufficient amount of data one calculates the value of a so-called Bell expression. An important question in this context is whether the result is compatible with bounds based on the assumptions of locality, realism and freedom of choice. Here we are interested in bounds on the obtained value derived from quantum theory, so-called Tsirelson bounds. We describe a simple Tsirelson bound, which is based on a singular value decomposition. This mathematical result leads to some physical insights. In particular the optimal observables can be obtained. Furthermore statements about the dimension of the underlying Hilbert space are possible. Finally, Bell inequalities can be modified to match rotated measurement settings, e.g. if the two parties do not share a common reference frame.

quant-ph↗

arXiv2014

Randomized Graph States and their Entanglement Properties

We introduce a class of mixed multiqubit states, that corresponds to a randomized version of graph states. Such states arise when a graph state is prepared with noisy or imperfect controlled-Z gates. We study the entanglement features of these states by investigating both bipartite and genuine multipartite entanglement. Bipartite entanglement is studied via the concepts of connectedness and persistency, which are related to measurement based quantum computation. The presence of multipartite entanglement is instead revealed by the use of witness operators which are subsequently adapted to study nonlocal properties through the violation of suitable Bell inequalities. We also present results on the entanglement detection of particular randomized graph states, by deriving explicit thresholds for entanglement and nonlocality in terms of the noise parameter that characterizes the controlled-Z gates exploited for their generation. Finally, we propose a method to further improve the detection of genuine multipartite entanglement in this class of states.

quant-ph↗

arXiv2014

Optimisation of Bell inequalities with invariant Tsirelson bound

We consider a subclass of bipartite CHSH-type Bell inequalities. We investigate operations, which leave their Tsirelson bound invariant, but change their classical bound. The optimal observables are unaffected except for a relative rotation of the two laboratories. We illustrate the utility of these operations by giving explicit examples: We prove that for a fixed quantum state and fixed measurement setup except for a relative rotation of the two laboratories, there is a Bell inequality that is maximally violated for this rotation, and we optimise some Bell inequalities with respect to the maximal violation. Finally we optimise the qutrit to qubit ratio of some dimension witnessing Bell inequalities.

quant-ph↗

arXiv2014

Secret key rates for an encoded quantum repeater

We investigate secret key rates for the quantum repeater using encoding [L. Jiang et al., Phys. Rev. A 79, 032325 (2009)] and compare them to the standard repeater scheme by Briegel, Dür, Cirac, and Zoller. The former scheme has the advantage of a minimal consumption of classical communication. We analyze the trade-off in the secret key rate between the communication time and the required resources. For this purpose, we introduce an error model for the repeater using encoding which allows for input Bell states with a fidelity smaller than one, in contrast to the model given in [L. Jiang et al., Phys. Rev. A 79, 032325 (2009)]. We show that one can correct additional errors in the encoded connection procedure of this repeater and develop a suitable decoding algorithm. Furthermore, we derive the rate of producing entangled pairs for the quantum repeater using encoding and give the minimal parameters (gate quality and initial fidelity) for establishing a nonzero secret key. We find that the generic quantum repeater is optimal regarding the secret key rate per memory per second and show that the encoded quantum repeater using the simple three-qubit repetition code can even have an advantage with respect to the resources compared to other recent quantum repeater schemes with encoding.

quant-ph↗

arXiv2013

Designing Bell inequalities from a Tsirelson bound

We present a simple analytic bound on the quantum value of general correlation type Bell inequalities, similar to Tsirelson's bound. It is based on the maximal singular value of the coefficient matrix associated with the inequality. We provide a criterion for tightness of the bound and show that the class of inequalities where our bound is tight covers many famous examples from the literature. We describe how this bound helps to construct Bell inequalities, in particular inequalities that witness the dimension of the measured observables.

quant-ph↗

arXiv2013

Finite-range multiplexing enhances quantum key distribution via quantum repeaters

Quantum repeaters represent one possible way to achieve long-distance quantum key distribution. Collins et al. in [Phys. Rev. Lett. 98, 060502 (2007)] proposed multiplexing as method to increase the repeater rate and to decrease the requirement in memory coherence time. Motivated by the experimental fact that long-range connections are practically demanding, in this paper we extend the original quantum repeater multiplexing protocol to the case of short-range connection. We derive analytical formulas for the repeater rate and we show that for short connection lengths it is possible to have most of the benefits of a full-range multiplexing protocol. Then we incorporate decoherence of quantum memories and we study the optimal matching for the Bell-state measurement protocol permitting to minimize memory requirements. Finally, we calculate the secret key rate and we show that the improvement via finite-range multiplexing is of the same order of magnitude as via full-range multiplexing.

quant-ph↗

arXiv2013

Limits for entanglement distribution with separable states

Entanglement distribution with separable states has recently attracted considerable attention. Recent results suggest that quantum discord - a measure for quantum correlations beyond entanglement - is responsible for this counterintuitive phenomenon. In this work we study this question from a different perspective, and find minimal requirements for a separable state to be useful for entanglement distribution. Surprisingly, we find that the presence of quantum discord is not sufficient to ensure entanglement distribution: there exist states with nonzero quantum discord which nevertheless cannot be used for entanglement distribution. As a result, we show that entanglement distribution is not possible with rank two separable states. Our work sheds new light on the task of entanglement distribution with separable states, and reveals a new classification of quantum states with respect to their usefulness for this task.

quant-ph↗