Local certification of programmable quantum devices of arbitrary high dimensionality

The onset of the era of fully-programmable error-corrected quantum computers will be marked by major breakthroughs in all areas of science and engineering. These devices promise to have significant technological and societal impact, notable examples being the analysis of big data through better machine learning algorithms and the design of new materials. Nevertheless, the capacity of quantum computers to faithfully implement quantum algorithms relies crucially on their ability to prepare specific high-dimensional and high-purity quantum states, together with suitable quantum measurements. Thus, the unambiguous certification of these requirements without assumptions on the inner workings of the quantum computer is critical to the development of trusted quantum processors. One of the most important approaches for benchmarking quantum devices is through the mechanism of self-testing that requires a pair of entangled non-communicating quantum devices. Nevertheless, although computation typically happens in a localized fashion, no local self-testing scheme is known to benchmark high dimensional states and measurements. Here, we show that the quantum self-testing paradigm can be employed to an individual quantum computer that is modelled as a programmable black box by introducing a noise-tolerant certification scheme. We substantiate the applicability of our scheme by providing a family of outcome statistics whose observation certifies that the computer is producing specific high-dimensional quantum states and implementing specific measurements.

[1]  Karoline Wiesner,et al.  Thermodynamical cost of some interpretations of quantum theory , 2015, 1509.03641.

[2]  Ivan vSupi'c,et al.  Self-testing of quantum systems: a review , 2019, Quantum.

[3]  A. Shimony,et al.  Proposed Experiment to Test Local Hidden Variable Theories. , 1969 .

[4]  Elad Eban,et al.  Interactive Proofs For Quantum Computations , 2017, 1704.04487.

[5]  Umesh V. Vazirani,et al.  Classical command of quantum systems , 2013, Nature.

[6]  J. Alonso,et al.  Probing the limits of correlations in an indivisible quantum system , 2017, Physical Review A.

[7]  M. A. Can,et al.  Simple test for hidden variables in spin-1 systems. , 2007, Physical review letters.

[8]  Michael L. Overton,et al.  Complementarity and nondegeneracy in semidefinite programming , 1997, Math. Program..

[9]  Stephen J. Summers,et al.  Bell’s inequalities and quantum field theory , 1990 .

[10]  Andrew Chi-Chih Yao,et al.  Self testing quantum apparatus , 2004, Quantum Inf. Comput..

[11]  A. Winter,et al.  Graph-theoretic approach to quantum correlations. , 2014, Physical review letters.

[12]  Lars Eirik Danielsen,et al.  Basic exclusivity graphs in quantum correlations , 2012, 1211.5825.

[13]  E. Kashefi,et al.  Unconditionally verifiable blind quantum computation , 2012, 1203.5217.

[14]  J. Roland,et al.  A simple proof of uniqueness of the KCBS inequality , 2018, 1811.05294.

[15]  C. Budroni Contextuality, memory cost and non-classicality for sequential measurements , 2019, Philosophical Transactions of the Royal Society A.

[16]  A. M. Murray The strong perfect graph theorem , 2019, 100 Years of Math Milestones.

[17]  Elham Kashefi,et al.  Universal Blind Quantum Computation , 2008, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[18]  Naqueeb Ahmad Warsi,et al.  Robust Self-Testing of Quantum Systems via Noncontextuality Inequalities. , 2018, Physical review letters.

[19]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[20]  J. S. BELLt Einstein-Podolsky-Rosen Paradox , 2018 .

[21]  Zhen-Peng Xu,et al.  Optimal Classical Simulation of State-Independent Quantum Contextuality. , 2017, Physical review letters.

[22]  Andrew Chi-Chih Yao,et al.  Quantum cryptography with imperfect apparatus , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[23]  Urmila Mahadev,et al.  Classical Verification of Quantum Computations , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[24]  Otfried Guhne,et al.  Memory cost of quantum contextuality , 2010, 1007.3650.

[25]  Donald E. Knuth The Sandwich Theorem , 1994, Electron. J. Comb..

[26]  M. Kleinmann,et al.  Memory cost for simulating all quantum correlations from the Peres–Mermin scenario , 2016, 1611.07515.

[27]  S. Popescu,et al.  Generic quantum nonlocality , 1992 .

[28]  B. Tsirelson Quantum analogues of the Bell inequalities. The case of two spatially separated domains , 1987 .