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:1502.03010 · Journal of the Optical Society of America B

Verifying the quantumness of a channel with an untrusted device

Matthew F. Pusey

Published Mar 29, 2015• 70 citations
arXivHTMLPDF

Abstract

Suppose one wants to certify that a quantum channel is not entanglement breaking. I consider all four combinations of trusted and untrusted devices at the input and output of the channel, finding that the most interesting is a trusted preparation device at the input and an untrusted measurement device at the output. This provides a time-like analogue of EPR steering, which turns out to reduce to the problem of joint measurability, connecting these concepts in a different way to other recent work. I suggest a few applications of this connection, such as a resource theory of incompatibility. This perspective also sheds light on why the BB84 key distribution protocol can be secure, even with an untrusted measuring device, leading to an uncertainty relation for arbitrary pairs of ensembles.

DOI
10.1364/josab.32.000a56

Related papers

Faithful certification of steering- and incompatibility-breaking channels

Po-Ting Hsu, Shin-Liang Chen

We consider a quantum steering scenario where Alice prepares a bipartite state, sends one subsystem to Bob through a quantum channel, and aims to convince him that their shared state is entangled. Bob, however, will never be convinced if the channel is steering-breaking, that is, if the channel destroys steerability for any input state. To verify that a channel renders a state useless for demonstrating steering, one must consider all possible measurements performed by Alice and check if the conditional states Bob receives admit a local-hidden-state (LHS) model. This is generally a hard problem since it requires considering an infinite number of measurement combinations. Here, we show that the method proposed in [Phys. Rev. Lett. 117, 190401 (2016); Phys. Rev. Lett. 117, 190402 (2016)] can be utilized to tackle this problem. Furthermore, owing to the intimate relation between steering and measurement incompatibility, our approach can faithfully certify whether a channel destroys incompatibility for any set of measurements. Finally, we propose an experimental criterion for certifying steering- and incompatibility-breaking channels, which may be of independent interest.

quant-pharXiv:2609.13885•Sep 15, 2026•0 citations

Incompatibility breaking quantum channels

Teiko Heinosaari, Jukka Kiukas, Daniel Reitzner +1 more

Abstract A typical bipartite quantum protocol, such as EPR-steering, relies on two quantum features, entanglement of states and incompatibility of measurements. Noise can delete both of these quantum features. In this work we study the behavior of incompatibility under noisy quantum channels. The starting point for our investigation is the observation that compatible measurements cannot become incompatible by the action of any channel. We focus our attention to channels which completely destroy the incompatibility of various relevant sets of measurements. We call such channels incompatibility breaking , in analogy to the concept of entanglement breaking channels. This notion is relevant especially for the understanding of noise-robustness of the local measurement resources for steering.

arXiv:1504.05768•Journal of Physics A Mathematical and Theoretical•Oct 7, 2015•65 citations

Distributed sampling, quantum communication witnesses, and measurement incompatibility

Leonardo Guerini, Marco Túlio Quintino, Leandro Aolita

We study prepare-and-measure experiments where the sender (Alice) receives trusted quantum inputs but has an untrusted state-preparation device and the receiver (Bob) has a fully untrusted measurement device. A distributed-sampling task naturally arises in this scenario, where the goal is for Alice and Bob to reproduce the statistics of his measurements on her quantum inputs using a fixed communication channel. Their performance of this task can certify quantum communication (QC), and this is formalized by measurement-device-independent QC witnesses. Furthermore, we prove that QC can provide an advantage (over classical communication) for distributed sampling if and only if Bob's measurements are incompatible. This gives an operational interpretation to measurement incompatibility and motivates a generalized notion of it related to a subset of quantum states. Our findings have both fundamental and applied implications.

arXiv:1904.08435•Physical Review A•Oct 14, 2019•30 citations

Robust verification of quantum computation

Alexandru Gheorghiu

Quantum computers promise to offer a considerable speed-up in solving certain problems, compared to the best classical algorithms. In many instances, the gap between quantum and classical running times is conjectured to be exponential. While this is great news for those applications where quantum computers would provide such an advantage, it also raises a significant challenge: how can classical computers verify the correctness of quantum computations? In attempting to answer this question, a number of protocols have been developed in which a classical client (referred to as verifier) can interact with one or more quantum servers (referred to as provers) in order to certify the correctness of a quantum computation performed by the server(s). These protocols are of one of two types: either there are multiple non-communicating provers, sharing entanglement, and the verifier is completely classical; or, there is a single prover and the classical verifier has a device for preparing or measuring quantum states. The latter type of protocols are, arguably, more relevant to near term quantum computers, since having multiple quantum computers that share a large amount of entanglement is, from a technological standpoint, extremely challenging. Before the realisation of practical single-prover protocols, a number of challenges need to be addressed: how robust are these protocols to noise on the verifier's device? Can the protocols be made fault-tolerant without significantly increasing the requirements of the verifier? How do we know that the verifier's device is operating correctly? Could this device be eliminated completely, thus having a protocol with a fully classical verifier and a single quantum prover? Our work attempts to provide answers to these questions. First, we consider a single-prover verification protocol developed by Fitzsimons and Kashefi and show that this protocol is indeed robust with respect to deviations on the quantum state prepared by the verifier. We show that this is true even if those deviations are the result of a correlation with the prover's system. We then use this result to give a verification protocol which is device- independent. The protocol consists of a verifier with a measurement device and a single prover. Device-independence means that the verifier need not trust the measurement device (nor the prover) which can be assumed to be fully malicious (though not communicating with the prover). A key element in realising this protocol is a robust technique of Reichardt, Unger and Vazirani for testing, using non-local correlations, that two untrusted devices share a large number of entangled states. This technique is referred to as rigidity of non-local correlations. Our second result is to prove a rigidity result for a type of quantum correlations known as steering correlations. To do this, we first show that steering correlations can be used in order to certify maximally entangled states, in a setting in which each test is independent of the previous one. We also show that the fidelity with which we characterise the state, in this specific test, is optimal. We then improve the previous result by removing the independence assumption. This then leads to our desired rigidity result. We make use of it, in a similar fashion to the device-independent case, in order to give a verification protocol that is one-sided device-independent. The importance of this application is to show how different trust assumptions affect the efficiency of the protocol. Next, we describe a protocol for fault-tolerantly verifying quantum computations, with minimal "quantum requirements" for the verifier. Specifically, the verifier only requires a device for measuring single-qubit states. Both this device, and the prover's operations are assumed to be prone to errors. We show that under standard assumptions about the error model, it is possible to achieve verification of quantum computation using fault-tolerant principles. As a proof of principle, and to better illustrate the inner workings of the protocol, we describe a toy implementation of the protocol in a quantum simulator, and present the results we obtained, when running it for a small computation. Finally, we explore the possibility of having a verification protocol, with a classical verifier and a single prover, such that the prover is blind with respect to the verifier's computation. We give evidence that this is not possible. In fact, our result is only concerned with blind quantum computation with a classical client, and uses complexity theoretic results to argue why it is improbable for such a protocol to exist. We then use these complexity theoretic techniques to show that a client, with the ability to prepare and send quantum states to a quantum server, would not be able to delegate arbitrary NP problems to that server. In other words, even a client with quantum capabilities cannot exploit those capabilities to delegate the computation of NP problems, while keeping the input, to that computation, private. This is again true, provided certain complexity theoretic conjectures are true.

•Nov 29, 2018•0 citations

Experimental measurement-device-independent verification of quantum steering

Sacha Kocsis, Michael J. W. Hall, Adam Bennet +2 more

Bell non-locality between distant quantum systems—that is, joint correlations which violate a Bell inequality—can be verified without trusting the measurement devices used, nor those performing the measurements. This leads to unconditionally secure protocols for quantum information tasks such as cryptographic key distribution. However, complete verification of Bell non-locality requires high detection efficiencies, and is not robust to typical transmission losses over long distances. In contrast, quantum or Einstein–Podolsky–Rosen steering, a weaker form of quantum correlation, can be verified for arbitrarily low detection efficiencies and high losses. The cost is that current steering-verification protocols require complete trust in one of the measurement devices and its operator, allowing only one-sided secure key distribution. Here we present measurement-device-independent steering protocols that remove this need for trust, even when Bell non-locality is not present. We experimentally demonstrate this principle for singlet states and states that do not violate a Bell inequality. Quantum steering is a form of quantum non-locality that can be verified for arbitrarily low detection efficiencies and high losses at the price of requiring complete trust in one of the parties. Here, Kocsis et al. present measurement-device-independent steering protocols that remove this need for trust.

arXiv:1408.0563•Nature Communications•Jan 7, 2015•87 citations

Verification of continuous-variable quantum memories

Paolo Abiuso

Abstract A proper quantum memory is argued to consist in a quantum channel which cannot be simulated with a measurement followed by classical information storage and a final state preparation, i.e. with an entanglement breaking (EB) channel. The verification of quantum memories (non-EB channels) is a task in which an honest user wants to test the quantum memory of an untrusted, remote provider. This task is inherently suited for the class of protocols with trusted quantum inputs, sometimes called measurement-device-independent (MDI) protocols. Here, we study the MDI certification of non-EB channels in continuous variable (CV) systems. We provide a simple witness based on adversarial metrology, and describe an experimentally friendly protocol that can be used to verify all non Gaussian incompatibility breaking quantum memories. Our results can be tested with current technology and can be applied to test other devices resulting in non-EB channels, such as CV quantum transducers and transmission lines.

arXiv:2305.07513•Quantum Science and Technology•Nov 3, 2023•11 citations
Suppose one wants to certify that a quantum channel is not entanglement breaking. I consider all four combinations of trusted and untrusted devices at the input and output of the channel, finding that the most interesting is a trusted preparation device at the input and an untrusted measurement device at the output. This provides a time-like analogue of EPR steering, which turns out to reduce to the problem of joint measurability, connecting these concepts in a different way to other recent work. I suggest a few applications of this connection, such as a resource theory of incompatibility. This perspective also sheds light on why the BB84 key distribution protocol can be secure, even with an untrusted measuring device, leading to an uncertainty relation for arbitrary pairs of ensembles.
We consider a quantum steering scenario where Alice prepares a bipartite state, sends one subsystem to Bob through a quantum channel, and aims to convince him that their shared state is entangled. Bob, however, will never be convinced if the channel is steering-breaking, that is, if the channel destroys steerability for any input state. To verify that a channel renders a state useless for demonstrating steering, one must consider all possible measurements performed by Alice and check if the conditional states Bob receives admit a local-hidden-state (LHS) model. This is generally a hard problem since it requires considering an infinite number of measurement combinations. Here, we show that the method proposed in [Phys. Rev. Lett. 117, 190401 (2016); Phys. Rev. Lett. 117, 190402 (2016)] can be utilized to tackle this problem. Furthermore, owing to the intimate relation between steering and measurement incompatibility, our approach can faithfully certify whether a channel destroys incompatibility for any set of measurements. Finally, we propose an experimental criterion for certifying steering- and incompatibility-breaking channels, which may be of independent interest.
Abstract A typical bipartite quantum protocol, such as EPR-steering, relies on two quantum features, entanglement of states and incompatibility of measurements. Noise can delete both of these quantum features. In this work we study the behavior of incompatibility under noisy quantum channels. The starting point for our investigation is the observation that compatible measurements cannot become incompatible by the action of any channel. We focus our attention to channels which completely destroy the incompatibility of various relevant sets of measurements. We call such channels incompatibility breaking , in analogy to the concept of entanglement breaking channels. This notion is relevant especially for the understanding of noise-robustness of the local measurement resources for steering.
We study prepare-and-measure experiments where the sender (Alice) receives trusted quantum inputs but has an untrusted state-preparation device and the receiver (Bob) has a fully untrusted measurement device. A distributed-sampling task naturally arises in this scenario, where the goal is for Alice and Bob to reproduce the statistics of his measurements on her quantum inputs using a fixed communication channel. Their performance of this task can certify quantum communication (QC), and this is formalized by measurement-device-independent QC witnesses. Furthermore, we prove that QC can provide an advantage (over classical communication) for distributed sampling if and only if Bob's measurements are incompatible. This gives an operational interpretation to measurement incompatibility and motivates a generalized notion of it related to a subset of quantum states. Our findings have both fundamental and applied implications.
Quantum computers promise to offer a considerable speed-up in solving certain problems, compared to the best classical algorithms. In many instances, the gap between quantum and classical running times is conjectured to be exponential. While this is great news for those applications where quantum computers would provide such an advantage, it also raises a significant challenge: how can classical computers verify the correctness of quantum computations? In attempting to answer this question, a number of protocols have been developed in which a classical client (referred to as verifier) can interact with one or more quantum servers (referred to as provers) in order to certify the correctness of a quantum computation performed by the server(s). These protocols are of one of two types: either there are multiple non-communicating provers, sharing entanglement, and the verifier is completely classical; or, there is a single prover and the classical verifier has a device for preparing or measuring quantum states. The latter type of protocols are, arguably, more relevant to near term quantum computers, since having multiple quantum computers that share a large amount of entanglement is, from a technological standpoint, extremely challenging. Before the realisation of practical single-prover protocols, a number of challenges need to be addressed: how robust are these protocols to noise on the verifier's device? Can the protocols be made fault-tolerant without significantly increasing the requirements of the verifier? How do we know that the verifier's device is operating correctly? Could this device be eliminated completely, thus having a protocol with a fully classical verifier and a single quantum prover? Our work attempts to provide answers to these questions. First, we consider a single-prover verification protocol developed by Fitzsimons and Kashefi and show that this protocol is indeed robust with respect to deviations on the quantum state prepared by the verifier. We show that this is true even if those deviations are the result of a correlation with the prover's system. We then use this result to give a verification protocol which is device- independent. The protocol consists of a verifier with a measurement device and a single prover. Device-independence means that the verifier need not trust the measurement device (nor the prover) which can be assumed to be fully malicious (though not communicating with the prover). A key element in realising this protocol is a robust technique of Reichardt, Unger and Vazirani for testing, using non-local correlations, that two untrusted devices share a large number of entangled states. This technique is referred to as rigidity of non-local correlations. Our second result is to prove a rigidity result for a type of quantum correlations known as steering correlations. To do this, we first show that steering correlations can be used in order to certify maximally entangled states, in a setting in which each test is independent of the previous one. We also show that the fidelity with which we characterise the state, in this specific test, is optimal. We then improve the previous result by removing the independence assumption. This then leads to our desired rigidity result. We make use of it, in a similar fashion to the device-independent case, in order to give a verification protocol that is one-sided device-independent. The importance of this application is to show how different trust assumptions affect the efficiency of the protocol. Next, we describe a protocol for fault-tolerantly verifying quantum computations, with minimal "quantum requirements" for the verifier. Specifically, the verifier only requires a device for measuring single-qubit states. Both this device, and the prover's operations are assumed to be prone to errors. We show that under standard assumptions about the error model, it is possible to achieve verification of quantum computation using fault-tolerant principles. As a proof of principle, and to better illustrate the inner workings of the protocol, we describe a toy implementation of the protocol in a quantum simulator, and present the results we obtained, when running it for a small computation. Finally, we explore the possibility of having a verification protocol, with a classical verifier and a single prover, such that the prover is blind with respect to the verifier's computation. We give evidence that this is not possible. In fact, our result is only concerned with blind quantum computation with a classical client, and uses complexity theoretic results to argue why it is improbable for such a protocol to exist. We then use these complexity theoretic techniques to show that a client, with the ability to prepare and send quantum states to a quantum server, would not be able to delegate arbitrary NP problems to that server. In other words, even a client with quantum capabilities cannot exploit those capabilities to delegate the computation of NP problems, while keeping the input, to that computation, private. This is again true, provided certain complexity theoretic conjectures are true.
Bell non-locality between distant quantum systems—that is, joint correlations which violate a Bell inequality—can be verified without trusting the measurement devices used, nor those performing the measurements. This leads to unconditionally secure protocols for quantum information tasks such as cryptographic key distribution. However, complete verification of Bell non-locality requires high detection efficiencies, and is not robust to typical transmission losses over long distances. In contrast, quantum or Einstein–Podolsky–Rosen steering, a weaker form of quantum correlation, can be verified for arbitrarily low detection efficiencies and high losses. The cost is that current steering-verification protocols require complete trust in one of the measurement devices and its operator, allowing only one-sided secure key distribution. Here we present measurement-device-independent steering protocols that remove this need for trust, even when Bell non-locality is not present. We experimentally demonstrate this principle for singlet states and states that do not violate a Bell inequality. Quantum steering is a form of quantum non-locality that can be verified for arbitrarily low detection efficiencies and high losses at the price of requiring complete trust in one of the parties. Here, Kocsis et al. present measurement-device-independent steering protocols that remove this need for trust.
Abstract A proper quantum memory is argued to consist in a quantum channel which cannot be simulated with a measurement followed by classical information storage and a final state preparation, i.e. with an entanglement breaking (EB) channel. The verification of quantum memories (non-EB channels) is a task in which an honest user wants to test the quantum memory of an untrusted, remote provider. This task is inherently suited for the class of protocols with trusted quantum inputs, sometimes called measurement-device-independent (MDI) protocols. Here, we study the MDI certification of non-EB channels in continuous variable (CV) systems. We provide a simple witness based on adversarial metrology, and describe an experimentally friendly protocol that can be used to verify all non Gaussian incompatibility breaking quantum memories. Our results can be tested with current technology and can be applied to test other devices resulting in non-EB channels, such as CV quantum transducers and transmission lines.