- Open Access
Composable Framework for Device-Independent State Certification
PRX Quantum 6, 040356 – Published 5 December, 2025
DOI: https://doi.org/10.1103/1j5f-qjhx
Abstract
Certifying a quantum state in a device-independent (DI) manner, in which no trust is placed on the internal workings of any physical components, is a fundamental task bearing various applications in quantum information theory. The composability of a state-certification protocol is key to its integration as a subroutine within information-theoretic protocols. In this work, we present a composable certification of quantum states in a DI manner under the assumption that a source prepares a finite sequence of independent quantum states that are not necessarily identical. We show that the security relies on the DI analog of the fidelity, called the extractability. We develop methods to compute this quantity under local operations and classical communication in certain Bell scenarios that self-test the singlet state, which may also be of independent interest. Finally, we demonstrate our framework by certifying the singlet state in a composable and DI manner using the Clauser-Horne-Shimony-Holt inequality.
Physics Subject Headings (PhySH)
Popular Summary
Processing information with quantum resources holds great potential for applications, including secure communication and computing. A key step to achieving this so-called “quantum advantage” is the reliable generation of quantum states. For example, sharing entanglement, a feature not present in the classical theory, enables two parties to exchange secret messages with the strongest form of security known. Given an unknown device, how can we verify that it is actually producing good quality states? As quantum technologies become more widespread, the importance of developing techniques to answer this question has grown significantly. In this work, we provide a recipe for certifying quantum states under very weak assumptions, enabling their reliable use in further protocols.
Our state-certification protocol is device independent, meaning that we can certify the quality of a quantum state without knowing anything about its inner workings. Instead, we rely on observed measurement statistics, and from these alone we can deduce the structure of the state. One of the main features of our protocol is that it is composable: the certified states can be safely used in other quantum protocols without breaking security. This is vital for building scalable quantum networks, where many quantum systems interact in complex ways.
Our results pave the way for more secure, modular quantum technologies—tools that could help realize the promise of a truly quantum Internet.
Article Text
Supplemental Material
References (83)
- A. K. Ekert, Quantum cryptography based on Bell’s theorem, Phys. Rev. Lett. 67, 661 (1991).
- A. Acin, N. Brunner, N. Gisin, S. Massar, S. Pironio, and V. Scarani, Device-independent security of quantum cryptography against collective attacks, Phys. Rev. Lett. 98, 230501 (2007).
- R. Colbeck, Ph.D. thesis, Trinity College, University of Cambridge, 2007, also available as https://arxiv.org/abs/0911.3814.
- S. Pironio, A. Acin, S. Massar, A. Boyer de la Giroday, D. N. Matsukevich, P. Maunz, S. Olmschenk, D. Hayes, L. Luo, T. A. Manning, and C. Monroe, Random numbers certified by Bell’s theorem, Nature 464, 1021 (2010).
- J. Barrett, N. Linden, S. Massar, S. Pironio, S. Popescu, and D. Roberts, Nonlocal correlations as an information-theoretic resource, Phys. Rev. A 71, 022101 (2005).
- J.-D. Bancal, K. Redeker, P. Sekatski, W. Rosenfeld, and N. Sangouard, Self-testing with finite statistics enabling the certification of a quantum network link, Quantum 5, 401 (2021).
- A. Gočanin, I. Šupić, and B. Dakić, Sample-efficient device-independent quantum state verification and certification, PRX Quantum 3, 010317 (2022).
- D. Mayers and A. Yao, in Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS-98) (IEEE Computer Society, Los Alamitos, California, USA, 1998), p. 503.
- D. Mayers and A. Yao, Self testing quantum apparatus, QIC 4, 273 (2004).
- J. Kaniewski, Analytic and nearly optimal self-testing bounds for the Clauser-Horne-Shimony-Holt and Mermin inequalities, Phys. Rev. Lett. 117, 070402 (2016).
- R. Arnon-Friedman and J.-D. Bancal, Device-independent certification of one-shot distillable entanglement, New J. Phys. 21, 033010 (2019).
- A. Philip and M. M. Wilde, Device-independent certification of multipartite distillable entanglement, Phys. Rev. A 111, 012436 (2025).
- L. dos Santos Martins, N. Laurent-Puig, I. Šupić, D. Markham, and E. Diamanti, Experimental sample-efficient and device-independent GHZ state certification, ArXiv:2407.13529
- S. Storz, A. Kulikov, J. D. Schär, V. Barizien, X. Valcarce, F. Berterottière, N. Sangouard, J.-D. Bancal, and A. Wallraff, Complete self-testing of a system of remote superconducting qubits, Phys. Rev. Lett. 135, 030801 (2005).
- M. M. E. Schmid, M. Antesberger, H. Cao, W. hao Zhang, B. Dakič, L. A. Rozema, and P. Walther, in Quantum 2.0 Conference and Exhibition (Optica Publishing Group, Rotterdam, Netherlands, 2024), p. QM2C.7.
- J. Barrett, L. Hardy, and A. Kent, No signalling and quantum key distribution, Phys. Rev. Lett. 95, 010503 (2005).
- S. Pironio, A. Acin, N. Brunner, N. Gisin, S. Massar, and V. Scarani, Device-independent quantum key distribution secure against collective attacks, New J. Phys. 11, 045021 (2009).
- J. Barrett, R. Colbeck, and A. Kent, Unconditionally secure device-independent quantum key distribution with only two devices, Phys. Rev. A 86, 062326 (2012).
- U. Vazirani and T. Vidick, Fully device-independent quantum key distribution, Phys. Rev. Lett. 113, 140501 (2014).
- R. Arnon-Friedman, F. Dupuis, O. Fawzi, R. Renner, and T. Vidick, Practical device-independent quantum cryptography via entropy accumulation, Nat. Commun. 9, 459 (2018).
- R. Colbeck and A. Kent, Private randomness expansion with untrusted devices, J. Phys. A. Math. Gen. 44, 095305 (2011).
- C. A. Miller and Y. Shi, in Proceedings of the 46th Annual ACM Symposium on Theory of Computing, STOC ’14 (ACM, New York, USA, 2014), p. 417.
- C. A. Miller and Y. Shi, Universal security for randomness expansion from the spot-checking protocol, SIAM J. Comput. 46, 1304 (2017).
- R. Colbeck and R. Renner, Free randomness can be amplified, Nat. Phys. 8, 450 (2012).
- R. Renner, Ph.D. thesis, Swiss Federal Institute of Technology, Zurich, 2005, also available as https://arxiv.org/abs/quant-ph/0512258.
- C. Portmann and R. Renner, Cryptographic security of quantum key distribution, ArXiv:1409.3525
- I. Šupić and J. Bowles, Self-testing of quantum systems: A review, Quantum 4, 337 (2020).
- We refer to this scenario with two parties as the minimal Bell scenario.
- T. Coopmans, J. Kaniewski, and C. Schaffner, Robust self-testing of two-qubit states, Phys. Rev. A 99, 052123 (2019).
- See the Supplemental Material at http://link.aps.org/supplemental/10.1103/1j5f-qjhx for protocols, proofs, and additional discussions and including additional references [76, 77, 78, 79, 80, 81, 82, 83].
- E. Y.-Z. Tan, R. Schwonnek, K. T. Goh, I. W. Primaatmaja, and C. C.-W. Lim, Computing secure key rates for quantum cryptography with untrusted devices, npj Quantum Inf. 7, 158 (2021).
- R. Bhavsar, S. Ragy, and R. Colbeck, Improved device-independent randomness expansion rates using two sided randomness, New J. Phys. 25, 093035 (2023).
- P. Brown, H. Fawzi, and O. Fawzi, Device-independent lower bounds on the conditional von Neumann entropy, Quantum 8, 1445 (2024).
- F. Dupuis, O. Fawzi, and R. Renner, Entropy accumulation, Commun. Math. Phys. 379, 867 (2020).
- F. Dupuis and O. Fawzi, Entropy accumulation with improved second-order term, IEEE Trans. Inf. Theory 65, 7596 (2019).
- T. Metger, O. Fawzi, D. Sutter, and R. Renner, Generalised entropy accumulation, Commun. Math. Phys. 405, 261 (2024).
- Y. Zhang, H. Fu, and E. Knill, Efficient randomness certification by quantum probability estimation, Phys. Rev. Res. 2, 013016 (2020).
- C. Foreman, S. Wright, A. Edgington, M. Berta, and F. J. Curchod, Practical randomness amplification and privatisation with implementations on quantum computers, Quantum 7, 969 (2023).
- Y. Zhu, X. Zhang, and X. Ma, Interplay among entanglement, measurement incompatibility, and nonlocality, Quantum Sci. Technol. 9, 045008 (2024).
- F. Wiesner, Z. Chaoui, D. Kessler, A. Pappa, and M. Karvonen, Why quantum state verification cannot be both efficient and secure: A categorical approach, ArXiv:2411.04767.
- A. Rai, M. Pivoluska, S. Sasmal, M. Banik, S. Ghosh, and M. Plesch, Self-testing quantum states via nonmaximal violation in Hardy’s test of nonlocality, Phys. Rev. A 105, 052227 (2022).
- J. S. Bell, in Speakable and Unspeakable in Quantum Mechanics (Cambridge University Press, Cambridge, UK, 1987), Chap. 2.
- J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt, Proposed experiment to test local hidden-variable theories, Phys. Rev. Lett. 23, 880 (1969).
- N. Brunner, D. Cavalcanti, S. Pironio, V. Scarani, and S. Wehner, Bell nonlocality, Rev. Mod. Phys. 86, 419 (2014).
- Y. Wang, X. Wu, and V. Scarani, All the self-testings of the singlet for two binary measurements, New J. Phys. 18, 025021 (2016).
- T. P. Le, C. Meroni, B. Sturmfels, R. F. Werner, and T. Ziegler, Quantum correlations in the minimal scenario, Quantum 7, 947 (2023).
- V. Barizien, P. Sekatski, and J.-D. Bancal, Custom Bell inequalities from formal sums of squares, Quantum 8, 1333 (2024).
- L. Wooltorton, P. Brown, and R. Colbeck, Device-independent quantum key distribution with arbitrarily small nonlocality, Phys. Rev. Lett. 132, 210802 (2024).
- The notion of closeness referred to here, and throughout the paper, is with respect to the trace distance, unless stated otherwise. Specifically, a state is said to be -close to if , where denotes the trace norm.
- The assumption that the devices are noncommunicating can be justified in two standard ways: (i) by employing shielding mechanisms that prevent any exchange of information, or (ii) by enforcing spacelike separation during the measurement rounds, which guarantees that the devices cannot signal to one another.
- M. Ben-Or and D. Mayers, General security definition and composability for quantum & classical protocols, ArXiv:quant-ph/0409062.
- M. Ben-Or, M. Horodecki, D. W. Leung, D. Mayers, and J. Oppenheim, in Theory of Cryptography, edited by J. Kilian (Springer-Verlag, Berlin, 2005), p. 386.
- D. Unruh, Simulatable security for quantum protocols, ArXiv:quant-ph/0409125.
- R. Renner and R. König, in Theory of Cryptography Conference (Springer, Cambridge, MA, USA, 2005), p. 407.
- S. Pirandola, U. L. Andersen, L. Banchi, M. Berta, D. Bunandar, R. Colbeck, D. Englund, T. Gehring, C. Lupo, C. Ottaviani, J. L. Pereira, M. Razavi, J. S. Shaari, M. Tomamichel, V. C. Usenko, G. Vallone, P. Villoresi, and P. Wallden, Advances in quantum cryptography, Adv. Opt. Photon. 12, 1012 (2020).
- I. W. Primaatmaja, K. T. Goh, E. Y.-Z. Tan, J. T.-F. Khoo, S. Ghorai, and C. C.-W. Lim, Security of device-independent quantum key distribution protocols: A review, Quantum 7, 932 (2023).
- Recall that for binary projective measurements derived from observables with eigenvalues , the POVM elements are and , so that and .
- M. M. Wilde, Quantum Information Theory (Cambridge University Press, Cambridge, UK, 2013).
- C.-E. Bardyn, T. C. H. Liew, S. Massar, M. McKague, and V. Scarani, Device-independent state estimation based on Bell’s inequalities, Phys. Rev. A 80, 062327 (2009).
- J.-D. Bancal, M. Navascués, V. Scarani, T. Vértesi, and T. H. Yang, Physical characterization of quantum devices from nonlocal correlations, Phys. Rev. A 91, 022115 (2015).
- X. Valcarce, P. Sekatski, D. Orsucci, E. Oudot, J.-D. Bancal, and N. Sangouard, What is the minimum CHSH score certifying that a state resembles the singlet? Quantum 4, 246 (2020).
- The trivial extractability in this context is the maximum fidelity between any separable state and the target state (see Ref. [[27], Sec. 3.6] for details). This value can always be achieved regardless of the underlying state. See also Example 3.
- This follows from the fact that the maximum fidelity between and is achieved when is any pure separable state corresponding to the largest Schmidt coefficient of .
- C. Jordan, Essai sur la géométrie à n dimensions, Bull. Soc. Math. France 3, 103 (1875).
- R. Bhavsar, Ph.D. thesis, Department of Mathematics, University of York (2023), also available as https://arxiv.org/abs/2311.13528.
- S. Boyd and L. Vandenberghe, Convex Optimization (Cambridge University Press, Cambridge, United Kingdom, 2004).
- A. Acín, S. Massar, and S. Pironio, Randomness versus nonlocality and entanglement, Phys. Rev. Lett. 108, 100402 (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).
- Here, for ease of discussion, we have omitted the fact that both the DISC protocol and may abort.
- P. Sekatski, J.-D. Bancal, S. Wagner, and N. Sangouard, Certifying the building blocks of quantum computers from Bell’s theorem, Phys. Rev. Lett. 121, 180505 (2018).
- J. Barrett, R. Colbeck, and A. Kent, Memory attacks on device-independent quantum cryptography, Phys. Rev. Lett. 110, 010503 (2013).
- H. Zhu and M. Hayashi, General framework for verifying pure quantum states in the adversarial scenario, Phys. Rev. A 100, 062335 (2019).
- H. Zhu and M. Hayashi, Efficient verification of pure quantum states in the adversarial scenario, Phys. Rev. Lett. 123, 260504 (2019).
- M. Horodecki, P. Horodecki, and R. Horodecki, General teleportation channel, singlet fraction, and quasidistillation, Phys. Rev. A 60, 1888 (1999).
- E. Woodhead, A. Acín, and S. Pironio, Device-independent quantum key distribution with asymmetric CHSH inequalities, Quantum 5, 443 (2021).
- C. Fuchs and J. van de Graaf, Cryptographic distinguishability measures for quantum-mechanical states, IEEE Trans. Inf. Theory 45, 1216 (1999).
- L. Contento, A. Ern, and R. Vermiglio, A linear-time approximate convex envelope algorithm using the double Legendre-Fenchel transform with application to phase separation, Comput. Optim. Appl. 60, 231 (2015).
- A. M. Zubkov and A. A. Serov, A complete proof of universal inequalities for the distribution function of the binomial law, Theory Prob. Appl. 57, 539 (2013).
- S. Simons, in Minimax and Applications, edited by D.-Z. Du and P. M. Pardalos (Springer US, Boston, Massachusetts, 1995), p. 1.
- S. Boyd and L. Vandenberghe, Convex Optimization (Cambridge University Press, Cambridge, UK, 2004).
- F. Baccari, R. Augusiak, I. Šupić, J. Tura, and A. Acín, Scalable Bell inequalities for qubit graph states and robust self-testing, Phys. Rev. Lett. 124, 020402 (2020).
- G. Murta and F. Baccari, Self-testing with dishonest parties and device-independent entanglement certification in quantum communication networks, Phys. Rev. Lett. 131, 140201 (2023).
- T. Sharma, R. Bhavsar, J. Ramakrishnan, P. Chandravanshi, S. Prabhakar, A. Biswas, and R. P. Singh, Enhancing key rates of QKD protocol by coincidence detection, Adv. Quantum Technol. 8, 2400685 (2025).
