Almost device-independent certification of GME states with minimal measurements
Abstract: Device-independent certification of quantum states allows the characterization of quantum states present inside a device by making minimal physical assumptions. A major problem in this regard is to certify quantum states using minimal resources. In this work, we consider the multipartite quantum steering scenario with an arbitrary number of parties but only one of which is trusted in the sense that the measurements performed by the trusted party are known. Consequently, the self-testing scheme is almost device-independent. Importantly, all the parties can only perform two measurements each which is the minimal number of measurements required to observe any form of quantum nonlocality. Then, we propose steering inequalities that are maximally violated by three major classes of genuinely multipartite entangled (GME) states, one, graph states of arbitrary local dimension, two, Schmidt states of arbitrary local dimension, and, three, $N$-qubit generalized W states. Using the proposed inequalities, we then provide an almost device-independent certification of the above GME states.
- J. S. Bell, On the Einstein Podolsky Rosen paradox, Physics Physique Fizika 1, 195 (1964).
- J. S. Bell, On the problem of hidden variables in quantum mechanics, Rev. Mod. Phys. 38, 447 (1966).
- T. H. Yang and M. Navascués, Robust self-testing of unknown quantum systems into any entangled two-qubit states, Phys. Rev. A 87, 050102 (2013).
- R. Colbeck and R. Renner, No extension of quantum theory can have improved predictive power, Nat. Comm. 2, 411 (2011).
- D. Mayers and A. Yao, Self testing quantum apparatus, Quantum Info. Comput. 4, 273–286 (2004).
- I. Šupić and J. Bowles, Self-testing of quantum systems: a review, Quantum 4, 337 (2020).
- M. McKague, T. H. Yang, and V. Scarani, Robust self-testing of the singlet, J. Phys. A: Math. Theor. 45, 455304 (2012).
- C. Bamps and S. Pironio, Sum-of-squares decompositions for a family of clauser-horne-shimony-holt-like inequalities and their application to self-testing, Phys. Rev. A 91, 052111 (2015).
- A. Coladangelo, K. T. Goh, and V. Scarani, All pure bipartite entangled states can be self-tested, Nature Communications 8, 15485 (2017).
- S. Sarkar and R. Augusiak, Self-testing of multipartite greenberger-horne-zeilinger states of arbitrary local dimension with arbitrary number of measurements per party, Phys. Rev. A 105, 032416 (2022).
- E. Panwar, P. Pandya, and M. Wieśniak, An elegant scheme of self-testing for multipartite bell inequalities, npj Quantum Inf. 9, 71 (2023).
- I. Šupić and M. J. Hoban, Self-testing through EPR-steering, New J. Phys. 18, 075006 (2016).
- A. Gheorghiu, P. Wallden, and E. Kashefi, Rigidity of quantum steering and one-sided device-independent verifiable quantum computation, New J. Phys. 19, 023043 (2017).
- H. Shrotriya, K. Bharti, and L.-C. Kwek, Phys. Rev. Research 3, 033093 (2021).
- S. Sarkar, D. Saha, and R. Augusiak, Certification of incompatible measurements using quantum steering, Phys. Rev. A 106, L040402 (2022).
- S. Sarkar, Certification of the maximally entangled state using nonprojective measurements, Physical Review A 107 (2023a).
- S. Sarkar, Network quantum steering enables randomness certification without seed randomness (2023b), arXiv:2307.08797 [quant-ph] .
- R. Jozsa, An introduction to measurement based quantum computation (2005), arXiv:quant-ph/0508124 [quant-ph] .
- D. Gottesman, Stabilizer codes and quantum error correction (1997), arXiv:quant-ph/9705052 [quant-ph] .
- M. Bahramgiri and S. Beigi, Graph states under the action of local clifford group in non-binary case (2007), arXiv:quant-ph/0610267 [quant-ph] .
- L. Mančinska, J. Prakash, and C. Schafhauser, Constant-sized robust self-tests for states and measurements of unbounded dimension (2021), arXiv:2103.01729 [quant-ph] .
- J. Volčič, Constant-sized self-tests for maximally entangled states and single projective measurements (2023), arXiv:2306.13498 [quant-ph] .
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.