Related papers: Parallel self-testing of EPR pairs under computati…
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…
We propose a proof of the security of EPR-based quantum key distribution against enemies with unlimited computational power. The proof holds for a protocol using interactive error-reconciliation scheme. We assume in this paper that the…
Characterizing large quantum systems with minimal assumptions is a central challenge in quantum information science. Self-testing provides the strongest form of certification by identifying the underlying quantum state solely from observed…
In the device-independent quantum information approach, the implementation of a given task can be self-tested solely from the recorded statistics and without detailed models for the employed devices. Even though experimentally demanding, it…
We consider a new model for the testing of untrusted quantum devices, consisting of a single polynomial-time bounded quantum device interacting with a classical polynomial-time verifier. In this model we propose solutions to two tasks - a…
In this perspective we discuss verification of quantum devices in the context of specific examples, formulated as proposed experiments. Our first example is verification of analog quantum simulators as Hamiltonian learning, where the input…
Self-testing is a method to certify devices from the result of a Bell test. Although examples of noise tolerant self-testing are known, it is not clear how to deal efficiently with a finite number of experimental trials to certify the…
Self testing is a device-independent technique based on non-local correlations whose aim is to certify the effective uniqueness of the quantum state and measurements needed to produce these correlations. It is known that the maximal…
A proof of quantumness is a protocol through which a classical machine can test whether a purportedly quantum device, with comparable time and memory resources, is performing a computation that is impossible for classical computers.…
The intrinsic non-locality of correlations in Quantum Mechanics allow us to certify the behaviour of a quantum mechanism in a device independent way. In particular, we present a new protocol that allows an unbounded amount of randomness to…
Quantum position verification (QPV) aims to verify an untrusted prover's location by timing communication with them. To reduce uncertainty, it is desirable for this verification to occur in a single round. However, previous protocols…
Self-testing protocols enable the certification of quantum systems in a device-independent manner, i.e. without knowledge of the inner workings of the quantum devices under test. Here, we demonstrate this high standard for characterization…
We introduce a protocol for authenticated teleportation, which can be proven secure even when the receiver does not trust their measurement devices, and is experimentally accessible. We use the technique of self-testing from the…
We propose a simple protocol for the verification of quantum computation after the computation has been performed. Our construction can be seen as an improvement on previous results in that it requires only a single prover, who is…
We study a configuration of devices that includes (1) a source of some unknown bipartite quantum state that is claimed to be the Bell state $\Phi^+$ and (2) two commuting but otherwise unknown measurement apparatus, one on each side, that…
We present a method to test quantum behavior of quantum information processing devices, such as quantum memories, teleportation devices, channels and quantum key distribution protocols. The test of quantum behavior can be phrased as the…
We present a device-independent (DI) self-testing protocol in a constrained prepare-measure scenario, based on the $n-$bit parity-oblivious multiplexing (POM) task. In this scenario, a parity-oblivious constraint is imposed on the…
In the seminal paper [Metger and Vidick, Quantum '21], they proposed a computational self-testing protocol for Bell states in a single quantum device. Their protocol relies on the fact that the target states are stabilizer states, and hence…
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier's verdict is a function of the XOR of the two bits received. We show that, when the provers are allowed to…
Self-testing refers to a method with which a classical user can certify the state and measurements of quantum systems in a device-independent way. Especially, the self-testing of entangled states is of great importance in quantum…