Robust self-testing of the singlet

McKague, Matthew; Yang, Tzyh Haur; Scarani, Valerio

doi:10.1088/1751-8113/45/45/455304

Cited by 205 publications

(324 citation statements)

References 17 publications

Supporting

Mentioning

318

Contrasting

Unclassified

Order By: Relevance

“…18 However, as in the previous section, robustness is important: we expect that if a protocol wins the CHSH game with close-to-maximal probability, then its entangled state must be close to an EPR-pair, and its measurement operators must be in some sense close to those of the standard protocol. Such a robust result was proved independently in [127,128] 19 :…”

Section: Self-testing Protocolsmentioning

confidence: 81%

“…Theorem 16 ( [127,128]). Suppose Alice and Bob run a protocol for CHSH that starts with a shared pure state |ψ , where Alice applies ±1-valued observables A 0 or A 1 depending on her input x, and Bob applies ±1-valued observables B 0 or B 1 depending on y.…”

Section: Self-testing Protocolsmentioning

confidence: 99%

“…Note that this also implies that A 0 , A 1 , B 0 , B 1 behave like the observables of the standard protocol P * . We give the proof of [127] here for the special case where ε = 0. This allows us to describe the main ideas, without going into the technical but straightforward details needed to keep track of the errors and approximations.…”

Section: Self-testing Protocolsmentioning

confidence: 99%

“…McKague et al [127] give a more general framework for bipartite robust self-testing that subsumes the CHSH inequality, the Mayers-Yao self-test (simplifying [121]), as well as others. Yang and Navascués [170] give robust self-tests for any entangled two-qubit states, not just maximally entangled ones; the noise-resistance was further improved in [25].…”

Section: Self-testing Protocolsmentioning

confidence: 99%

See 3 more Smart Citations

Untitled

Montanaro¹,

Wolf²

2016

Theory of Comput.

View full text Add to dashboard Cite

Section: Self-testing Protocolsmentioning

confidence: 81%

Section: Self-testing Protocolsmentioning

confidence: 99%

Section: Self-testing Protocolsmentioning

confidence: 99%

Section: Self-testing Protocolsmentioning

confidence: 99%

See 2 more Smart Citations

Untitled

Montanaro¹,

Wolf²

2016

Theory of Comput.

View full text Add to dashboard Cite

“…This model is related to the well known setting of the Bell nonlocality tests as well as to self-testing [6].…”

mentioning

confidence: 99%

Multipartite Entanglement Verification Resistant against Dishonest Parties

Pappa

Chailloux²,

Wehner³

et al. 2012

Phys. Rev. Lett.

View full text Add to dashboard Cite

Future quantum information networks will consist of quantum and classical agents, who have the ability to communicate in a variety of ways with trusted and untrusted parties and securely delegate computational tasks to untrusted large-scale quantum computing servers. Multipartite quantum entanglement is a fundamental resource for such a network and hence it is imperative to study the possibility of verifying a multipartite entanglement source in a way that is efficient and provides strong guarantees even in the presence of multiple dishonest parties. In this Letter, we show how an agent of a quantum network can perform a distributed verification of a source creating multipartite Greenberger-Horne-Zeilinger (GHZ) states with minimal resources, which is, nevertheless, resistant against any number of dishonest parties. Moreover, we provide a tight tradeoff between the level of security and the distance between the state produced by the source and the ideal GHZ state. Last, by adding the resource of a trusted common random source, we can further provide security guarantees for all honest parties in the quantum network simultaneously. Entanglement plays a key role in the study and development of quantum information theory. It has been widely used in all aspects of quantum information and has been essential to show the advantages obtained compared to the classical setting. Initially defined for bipartite states, the notion of entanglement has been generalized to multipartite systems and despite the complexity this notion acquires in this case, many interesting properties of multipartite entangled states are known. If we consider, for example, the quantum correlations of the Greenberger-Horne-Zeilinger (GHZ) state [1] and its nparty generalization, we can find a nonlocal game that can be won with probability 1 in the quantum setting, while any classical local theory can win the game with probability at most 3/4 [2].Multipartite entangled states are a fundamental resource when quantum networks are considered. Indeed, they allow network agents to create strong correlations in order to perform distributed tasks, to delegate computation to untrusted servers [3], or to compute, for example through the Measurement-Based Quantum Computation model [4]. A natural and fundamental question that arises then is whether the network agents should be required to trust the source that provides them with such multipartite entangled states or whether they are able to verify the entanglement.In this work, we show that a quantum agent can verify efficiently with respect to the necessary resources, that an untrusted source creates entanglement, even in the presence of dishonest parties.The model -We start our analysis by first describing in detail our model and its relation to previous work.Source: The source is untrusted. It is supposed to create the n-party GHZ state 1 √ 2 n |0 n + |1 n and distribute it to n parties. By applying a Hadamard and a phase shift ( √ Z) gate to each qubit, the GHZ state can be expressed by the locally equivale...

show abstract

Parallel self‐testing for device‐independent verifiable blind quantum computation

Tan

Huang

et al. 2020

Quantum Engineering

View full text Add to dashboard Cite

With advances in experimental quantum computing, the requirement for verifying the correctness of quantum computation is urgent. The recent protocols of device‐independent verifiable blind quantum computation provide a fruitful solution. However, all existing approaches have relatively high overhead. In this paper, we present a parallel self‐testing technology to extract the presence of tensor products of Pauli observables on maximally entangled state. We then utilize our parallel self‐testing to propose a device‐independent verification protocol. Finally, compared to other existing protocols, our scheme has a lower overhead, which costs Ofalse(n11lognfalse) Bell pairs, where n is the size of original computation.

show abstract

Robust self-testing of the singlet

Cited by 205 publications

References 17 publications

Untitled

Untitled

Multipartite Entanglement Verification Resistant against Dishonest Parties

Parallel self‐testing for device‐independent verifiable blind quantum computation

Contact Info

Product

Resources

About