Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1802.02170 · Physical Review Letters

Certifying the Building Blocks of Quantum Computers from Bell’s Theorem

Pavel Sekatski, Jean-Daniel Bancal, Sebastian Wagner, Nicolas Sangouard

Published Nov 2, 2018• 79 citations
arXivHTMLPDF

Abstract

Bell's theorem has been proposed to certify, in a device-independent and robust way, blocks either producing or measuring quantum states. In this Letter, we provide a method based on Bell's theorem to certify coherent operations for the storage, processing, and transfer of quantum information. This completes the set of tools needed to certify all building blocks of a quantum computer. Our method distinguishes itself by its robustness to experimental imperfections, and so could be used to certify that today's quantum devices are qualified for usage in future quantum computers.

DOI
10.1103/physrevlett.121.180505

Related papers

Certification of Genuine Multipartite Entanglement with General and Robust Device-Independent Witnesses

Chao Zhang, Wen-Hao Zhang, Pavel Sekatski +12 more

Genuine multipartite entanglement represents the strongest type of entanglement, which is an essential resource for quantum information processing. Standard methods to detect genuine multipartite entanglement, e.g., entanglement witnesses, state tomography, or quantum state verification, require full knowledge of the Hilbert space dimension and precise calibration of measurement devices, which are usually difficult to acquire in an experiment. The most radical way to overcome these problems is to detect entanglement solely based on the Bell-like correlations of measurement outcomes collected in the experiment, namely, device independently. However, it is difficult to certify genuine entanglement of practical multipartite states in this way, and even more difficult to quantify it, due to the difficulty in identifying optimal multipartite Bell inequalities and protocols tolerant to state impurity. In this Letter, we explore a general and robust device-independent method that can be applied to various realistic multipartite quantum states in arbitrary finite dimension, while merely relying on bipartite Bell inequalities. Our method allows us both to certify the presence of genuine multipartite entanglement and to quantify it. Several important classes of entangled states are tested with this method, leading to the detection of genuinely entangled states. We also certify genuine multipartite entanglement in weakly entangled Greenberger-Horne-Zeilinger states, showing that the method applies equally well to less standard states.

arXiv:2108.12764•Physical Review Letters•Oct 31, 2022•10 citations

Self-Testing of a Single Quantum Device Under Computational Assumptions

Tony Metger, Thomas Vidick

Self-testing is a method to characterise an arbitrary quantum system based only on its classical input-output correlations, and plays an important role in device-independent quantum information processing as well as quantum complexity theory. Prior works on self-testing require the assumption that the system’s state is shared among multiple parties that only perform local measurements and cannot communicate. Here, we replace the setting of multiple non-communicating parties, which is difficult to enforce in practice, by a single computationally bounded party. Specifically, we construct a protocol that allows a classical verifier to robustly certify that a single computationally bounded quantum device must have prepared a Bell pair and performed single-qubit measurements on it, up to a change of basis applied to both the device’s state and measurements. This means that under computational assumptions, the verifier is able to certify the presence of entanglement, a property usually closely associated with two separated subsystems, inside a single quantum device. To achieve this, we build on techniques first introduced by Brakerski et al. (2018) and Mahadev (2018) which allow a classical verifier to constrain the actions of a quantum device assuming the device does not break post-quantum cryptography.

•Jan 1, 2021•5 citations

Self-testing of a single quantum device under computational assumptions

Tony Metger, Thomas Vidick

Self-testing is a method to characterise an arbitrary quantum system based only on its classical input-output correlations, and plays an important role in device-independent quantum information processing as well as quantum complexity theory. Prior works on self-testing require the assumption that the system’s state is shared among multiple parties that only perform local measurements and cannot communicate. Here, we replace the setting of multiple non-communicating parties, which is difficult to enforce in practice, by a single computationally bounded party. Specifically, we construct a protocol that allows a classical verifier to robustly certify that a single computationally bounded quantum device must have prepared a Bell pair and performed single-qubit measurements on it, up to a change of basis applied to both the device’s state and measurements. This means that under computational assumptions, the verifier is able to certify the presence of entanglement, a property usually closely associated with two separated subsystems, inside a single quantum device. To achieve this, we build on techniques first introduced by Brakerski et al. (2018) and Mahadev (2018) which allow a classical verifier to constrain the actions of a quantum device assuming the device does not break post-quantum cryptography.

•Jan 1, 2021•11 citations

Experimental Semi-Device-Independent Certification of Entangled Measurements

Adam Bennet, Tamás Vértesi, D. J. Saunders +2 more

Certifying the entanglement of quantum states with Bell inequalities allows one to guarantee the security of quantum information protocols independently of imperfections in the measuring devices. Here, we present a similar procedure for witnessing entangled measurements, which play a central role in many quantum information tasks. Our procedure is termed semi-device-independent, as it uses uncharacterized quantum preparations of fixed Hilbert space dimension. Using a photonic setup, we experimentally certify an entangled measurement using only measurement statistics. We also apply our techniques to certify unentangled but nevertheless inherently quantum measurements.

arXiv:1404.1422•Physical Review Letters•Aug 22, 2014•15 citations

Quantum Nonlocality and Device-Independent Randomness are Robust to Noisy Signaling Channels

Kuntal Sengupta, Lewis Wooltorton

Given a pair of isolated devices that accept random binary inputs and return binary outputs, a user can deduce from the observed data alone if the underlying mechanism can be explained classically. Bell's theorem further states that a classical explanation can be ruled out if the devices perform certain measurements on an entangled quantum state, underpinning the security of cryptographic protocols that are device-independent (DI). For certain protocols, such as those performed in a tight space, it might be difficult to perfectly enforce the non-signaling assumption required in Bell's theorem. This prompts the question: is quantum nonlocality robust to such imperfections? We show that if a binary channel sends a noisy copy of one party's input to the other before any measurements take place, the answer is yes. We completely characterize the vertices and facets of the local polytope in this scenario, and identify Bell inequalities that certify non-signaling quantum correlations. This is possible even when a near perfect copy of the input is sent. We go on to show that the identified inequalities are more robust to depolarizing noise than the Clauser-Horne-Shimony-Holt inequality when certifying DI randomness in this scenario. In addition, we characterize the local polytope when both parties receive a noisy copy of each other's input and make similar conclusions, leaving many new potential Bell inequalities to be explored.

quant-pharXiv:2605.21293•May 21, 2026•0 citations

Self-testing of a single quantum device under computational assumptions

Tony Metger, Thomas Vidick

Self-testing is a method to characterise an arbitrary quantum system based only on its classical input-output correlations, and plays an important role in device-independent quantum information processing as well as quantum complexity theory. Prior works on self-testing require the assumption that the system's state is shared among multiple parties that only perform local measurements and cannot communicate. Here, we replace the setting of multiple non-communicating parties, which is difficult to enforce in practice, by a single computationally bounded party. Specifically, we construct a protocol that allows a classical verifier to robustly certify that a single computationally bounded quantum device must have prepared a Bell pair and performed single-qubit measurements on it, up to a change of basis applied to both the device's state and measurements. This means that under computational assumptions, the verifier is able to certify the presence of entanglement, a property usually closely associated with two separated subsystems, inside a single quantum device. To achieve this, we build on techniques first introduced by Brakerski et al. (2018) and Mahadev (2018) which allow a classical verifier to constrain the actions of a quantum device assuming the device does not break post-quantum cryptography.

arXiv:2001.09161•Quantum•Sep 16, 2021•38 citations
Bell's theorem has been proposed to certify, in a device-independent and robust way, blocks either producing or measuring quantum states. In this Letter, we provide a method based on Bell's theorem to certify coherent operations for the storage, processing, and transfer of quantum information. This completes the set of tools needed to certify all building blocks of a quantum computer. Our method distinguishes itself by its robustness to experimental imperfections, and so could be used to certify that today's quantum devices are qualified for usage in future quantum computers.
Genuine multipartite entanglement represents the strongest type of entanglement, which is an essential resource for quantum information processing. Standard methods to detect genuine multipartite entanglement, e.g., entanglement witnesses, state tomography, or quantum state verification, require full knowledge of the Hilbert space dimension and precise calibration of measurement devices, which are usually difficult to acquire in an experiment. The most radical way to overcome these problems is to detect entanglement solely based on the Bell-like correlations of measurement outcomes collected in the experiment, namely, device independently. However, it is difficult to certify genuine entanglement of practical multipartite states in this way, and even more difficult to quantify it, due to the difficulty in identifying optimal multipartite Bell inequalities and protocols tolerant to state impurity. In this Letter, we explore a general and robust device-independent method that can be applied to various realistic multipartite quantum states in arbitrary finite dimension, while merely relying on bipartite Bell inequalities. Our method allows us both to certify the presence of genuine multipartite entanglement and to quantify it. Several important classes of entangled states are tested with this method, leading to the detection of genuinely entangled states. We also certify genuine multipartite entanglement in weakly entangled Greenberger-Horne-Zeilinger states, showing that the method applies equally well to less standard states.
Self-testing is a method to characterise an arbitrary quantum system based only on its classical input-output correlations, and plays an important role in device-independent quantum information processing as well as quantum complexity theory. Prior works on self-testing require the assumption that the system’s state is shared among multiple parties that only perform local measurements and cannot communicate. Here, we replace the setting of multiple non-communicating parties, which is difficult to enforce in practice, by a single computationally bounded party. Specifically, we construct a protocol that allows a classical verifier to robustly certify that a single computationally bounded quantum device must have prepared a Bell pair and performed single-qubit measurements on it, up to a change of basis applied to both the device’s state and measurements. This means that under computational assumptions, the verifier is able to certify the presence of entanglement, a property usually closely associated with two separated subsystems, inside a single quantum device. To achieve this, we build on techniques first introduced by Brakerski et al. (2018) and Mahadev (2018) which allow a classical verifier to constrain the actions of a quantum device assuming the device does not break post-quantum cryptography.
Self-testing is a method to characterise an arbitrary quantum system based only on its classical input-output correlations, and plays an important role in device-independent quantum information processing as well as quantum complexity theory. Prior works on self-testing require the assumption that the system’s state is shared among multiple parties that only perform local measurements and cannot communicate. Here, we replace the setting of multiple non-communicating parties, which is difficult to enforce in practice, by a single computationally bounded party. Specifically, we construct a protocol that allows a classical verifier to robustly certify that a single computationally bounded quantum device must have prepared a Bell pair and performed single-qubit measurements on it, up to a change of basis applied to both the device’s state and measurements. This means that under computational assumptions, the verifier is able to certify the presence of entanglement, a property usually closely associated with two separated subsystems, inside a single quantum device. To achieve this, we build on techniques first introduced by Brakerski et al. (2018) and Mahadev (2018) which allow a classical verifier to constrain the actions of a quantum device assuming the device does not break post-quantum cryptography.
Certifying the entanglement of quantum states with Bell inequalities allows one to guarantee the security of quantum information protocols independently of imperfections in the measuring devices. Here, we present a similar procedure for witnessing entangled measurements, which play a central role in many quantum information tasks. Our procedure is termed semi-device-independent, as it uses uncharacterized quantum preparations of fixed Hilbert space dimension. Using a photonic setup, we experimentally certify an entangled measurement using only measurement statistics. We also apply our techniques to certify unentangled but nevertheless inherently quantum measurements.
Given a pair of isolated devices that accept random binary inputs and return binary outputs, a user can deduce from the observed data alone if the underlying mechanism can be explained classically. Bell's theorem further states that a classical explanation can be ruled out if the devices perform certain measurements on an entangled quantum state, underpinning the security of cryptographic protocols that are device-independent (DI). For certain protocols, such as those performed in a tight space, it might be difficult to perfectly enforce the non-signaling assumption required in Bell's theorem. This prompts the question: is quantum nonlocality robust to such imperfections? We show that if a binary channel sends a noisy copy of one party's input to the other before any measurements take place, the answer is yes. We completely characterize the vertices and facets of the local polytope in this scenario, and identify Bell inequalities that certify non-signaling quantum correlations. This is possible even when a near perfect copy of the input is sent. We go on to show that the identified inequalities are more robust to depolarizing noise than the Clauser-Horne-Shimony-Holt inequality when certifying DI randomness in this scenario. In addition, we characterize the local polytope when both parties receive a noisy copy of each other's input and make similar conclusions, leaving many new potential Bell inequalities to be explored.
Self-testing is a method to characterise an arbitrary quantum system based only on its classical input-output correlations, and plays an important role in device-independent quantum information processing as well as quantum complexity theory. Prior works on self-testing require the assumption that the system's state is shared among multiple parties that only perform local measurements and cannot communicate. Here, we replace the setting of multiple non-communicating parties, which is difficult to enforce in practice, by a single computationally bounded party. Specifically, we construct a protocol that allows a classical verifier to robustly certify that a single computationally bounded quantum device must have prepared a Bell pair and performed single-qubit measurements on it, up to a change of basis applied to both the device's state and measurements. This means that under computational assumptions, the verifier is able to certify the presence of entanglement, a property usually closely associated with two separated subsystems, inside a single quantum device. To achieve this, we build on techniques first introduced by Brakerski et al. (2018) and Mahadev (2018) which allow a classical verifier to constrain the actions of a quantum device assuming the device does not break post-quantum cryptography.