Optimal Robust Self-Testing by Binary Nonlocal XOR Games

نویسندگان

  • Carl A. Miller
  • Yaoyun Shi
چکیده

Self-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. 1998 ACM Subject Classification F.1.1 Models of Computation

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal robust quantum self-testing by binary nonlocal XOR games

Self-testing a quantum device means verifying the existence of a certain quantum state as well as the effect of the associated measurements based only on the statistics of the measurement outcomes. Robust, i.e., error-tolerant, self-testing quantum devices are critical building blocks for quantum cryptographic protocols that rely on imperfect or untrusted quantum devices. We give a criterion wh...

متن کامل

Nonlocal Quantum XOR Games for Large Number of Players

Nonlocal games are used to display differences between classical and quantum world. In this paper, we study nonlocal games with a large number of players. We give simple methods for calculating the classical and the quantum values for symmetric XOR games with onebit input per player, a subclass of nonlocal games. We illustrate those methods on the example of the N-player game (due to Ardehali [...

متن کامل

A lower bound on the value of entangled binary games

A two-player one-round binary game consists of two cooperative players who each one replies by one bit to a message that receives privately; they win the game if both questions and answers satisfy some predetermined property. A game is called entangled if the players are allowed to share a priori entanglement. It is well-known that the maximum winning probability (the value) of entangled XOR-ga...

متن کامل

Explicit lower and upper bounds on the entangled value of multiplayer XOR games

The study of quantum-mechanical violations of Bell inequalities is motivated by the investigation, and the eventual demonstration, of the nonlocal properties of entanglement. In recent years, Bell inequalities have found a fruitful re-formulation using the language of multiplayer games originating from Computer Science. This paper studies the nonlocal properties of entanglement in the context o...

متن کامل

Optimal Self-Testing Embedded Parity Checkers

This paper presents a new simple and straightforward method for designing Self-Testing Embedded (STE) parity checkers. The building block is the two-input XOR gate. During normal, fault-free operation, each XOR gate receives all possible input vectors. The great advantage of the proposed method is that it is the only one that gives, in a simple and straightforward way, optimal STE realizations ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013