If a measurement is made on one half of a bipartite system then, conditioned on the outcome, the other half has a new reduced state. If these reduced states defy classical explanation — that is, if shared randomness cannot produce these reduced states for all possible measurements — the bipartite state is said to be steerable. Determining which states are steerable is a challenging problem even for low dimensions. In the case of two-qubit systems a criterion is known for T-states (that is, those with maximally mixed marginals) under projective measurements. In the current work we introduce the concept of keyring models — a special class of local hidden state model. When the measurements made correspond to real projectors, these allow us to study steerability beyond T-states. Using keyring models, we completely solve the steering problem for real projective measurements when the state arises from mixing a pure two-qubit state with uniform noise. We also give a partial solution in the case when the uniform noise is replaced by independent depolarizing channels. Our results imply that Werner states, which are a special case of the previous states, are unsteerable under real projective measurements if and only if their efficiency is at most 2/π.

%B Journal of Mathematical Physics %V 59 %P 022103 %8 2018/01/02 %G eng %U http://aip.scitation.org/doi/full/10.1063/1.5006199 %R 10.1063/1.5006199 %0 Journal Article %D 2017 %T Parallel Device-Independent Quantum Key Distribution %A Rahul Jain %A Carl Miller %A Yaoyun Shi %XA prominent application of quantum cryptography is the distribution of cryptographic keys with unconditional security. Recently, such security was extended by Vazirani and Vidick (Physical Review Letters, 113, 140501, 2014) to the device-independent (DI) scenario, where the users do not need to trust the integrity of the underlying quantum devices. The protocols analyzed by them and by subsequent authors all require a sequential execution of N multiplayer games, where N is the security parameter. In this work, we prove unconditional security of a protocol where all games are executed in parallel. Our result further reduces the requirements for QKD (allowing for arbitrary information leakage within each players' lab) and opens the door to more efficient implementation. To the best of our knowledge, this is the first parallel security proof for a fully device-independent QKD protocol. Our protocol tolerates a constant level of device imprecision and achieves a linear key rate.

%8 2017/03/15 %G eng %U https://arxiv.org/abs/1703.05426 %0 Journal Article %J Quantum Information and Computation %D 2017 %T Randomness in nonlocal games between mistrustful players %A Carl Miller %A Yaoyun Shi %XIf two quantum players at a nonlocal game G achieve a superclassical score, then their measurement outcomes must be at least partially random from the perspective of any third player. This is the basis for device-independent quantum cryptography. In this paper we address a related question: does a superclassical score at G guarantee that one player has created randomness from the perspective of the other player? We show that for complete-support games, the answer is yes: even if the second player is given the first player's input at the conclusion of the game, he cannot perfectly recover her output. Thus some amount of local randomness (i.e., randomness possessed by only one player) is always obtained when randomness is certified from nonlocal games with quantum strategies. This is in contrast to non-signaling game strategies, which may produce global randomness without any local randomness. We discuss potential implications for cryptographic protocols between mistrustful parties.

%B Quantum Information and Computation %V 17 %P 0595-0610 %8 2017/06/15 %G eng %U https://arxiv.org/abs/1706.04984 %N 7&8 %0 Journal Article %J SIAM Journal on Computing %D 2017 %T Universal Security for Randomness Expansion from the Spot-Checking Protocol %A Carl Miller %A Yaoyun Shi %XColbeck (Thesis, 2006) proposed using Bell inequality violations to generate certified random numbers. While full quantum-security proofs have been given, it remains a major open problem to identify the broadest class of Bell inequalities and lowest performance requirements to achieve such security. In this paper, working within the broad class of spot-checking protocols, we prove exactly which Bell inequality violations can be used to achieve full security. Our result greatly improves the known noise tolerance for secure randomness expansion: for the commonly used CHSH game, full security was only known with a noise tolerance of 1.5%, and we improve this to 10.3%. We also generalize our results beyond Bell inequalities and give the first security proof for randomness expansion based on Kochen-Specker inequalities. The central technical contribution of the paper is a new uncertainty principle for the Schatten norm, which is based on the uniform convexity inequality of Ball, Carlen, and Lieb (Inventiones mathematicae, 115:463-482, 1994).

%B SIAM Journal on Computing %V 46 %8 2017/08/01 %G eng %U http://epubs.siam.org/doi/10.1137/15M1044333 %N 4 %R 10.1137/15M1044333 %0 Journal Article %J Journal of the ACM %D 2016 %T Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices %A Carl Miller %A Yaoyun Shi %K key distribution %K nonlocal games %K privacy %K quantum cryptography %K random-number generation %K untrusted device %XRandomness is a vital resource for modern-day information processing, especially for cryptography. A wide range of applications critically rely on abundant, high-quality random numbers generated securely. Here, we show how to expand a random seed at an exponential rate without trusting the underlying quantum devices. Our approach is secure against the most general adversaries, and has the following new features: cryptographic level of security, tolerating a constant level of imprecision in devices, requiring only unit size quantum memory (for each device component) in an honest implementation, and allowing a large natural class of constructions for the protocol. In conjunction with a recent work by Chung et al. [2014], it also leads to robust unbounded expansion using just 2 multipart devices. When adapted for distributing cryptographic keys, our method achieves, for the first time, exponential expansion combined with cryptographic security and noise tolerance. The proof proceeds by showing that the Rényi divergence of the outputs of the protocol (for a specific bounding operator) decreases linearly as the protocol iterates. At the heart of the proof are a new uncertainty principle on quantum measurements and a method for simulating trusted measurements with untrusted devices.

%B Journal of the ACM %V 63 %P 33:1–33:63 %8 2016/10/26 %G eng %U http://doi.acm.org/10.1145/2885493 %N 4 %R 10.1145/2885493 %0 Book Section %B 8th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2013 %D 2013 %T Optimal robust self-testing by binary nonlocal XOR games %A Carl Miller %A Yaoyun Shi %K nonlocal games %K quantum cryptography %K Random number generation %K Self-testing %XSelf-testing a quantum apparatus means verifying the existence of a certain quantum state as well as the effect of the associated measuring devices based only on the statistics of the measurement outcomes. Robust (i.e., error-tolerant) self-testing quantum apparatuses are critical building blocks for quantum cryptographic protocols that rely on imperfect or untrusted devices. We devise a general scheme for proving optimal robust self-testing properties for tests based on nonlocal binary XOR games. We offer some simplified proofs of known results on self-testing, and also prove some new results.

%B 8th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2013 %I Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing %V 22 %P 254–262 %G eng %R 10.4230/LIPIcs.TQC.2013.254