article

Self testing quantum apparatus

Authors:

Dominic Mayers,

Andrew YaoAuthors Info & Claims

Quantum Information & Computation, Volume 4, Issue 4

Pages 273 - 286

Published: 01 July 2004 Publication History

Abstract

We study, in the context of quantum information and quantum communication, a configuration of devices that includes (1) a source of some unknown bipartite quantum state that is claimed to be the Bell state Φ⁺ and (2) two spatially separated but otherwise unknown measurement apparatus one on each side, that are each claimed to execute an orthogonal measurement at an angle θ ∈ {-π/8, 0, π/8} that is chosen by the user. We show that, if the nine distinct probability distributions that are generated by the self checking configuration, one for each pair of angles, are consistent with the specifications, the source and the two measurement apparatus are guaranteed to be identical to the claimed specifications up to a local change of basis on each side. We discuss the connection with quantum cryptography.

References

[1]

D. Mayers, "Quantum key distribution and string oblivious transfer in noisy channel", Advances in Cryptology: Proceedings of Crypto'96, Lecture Notes in Comp. Sci., vol 1109, (Springer-Verlag, 1996), pp. 343-357; D. Mayers, "Unconditional security in quantum cryptography", Los Alamos preprint archive quant-ph/9802025 (1998).

[2]

C. H. Bennett and G. Brassard, "Quantum cryptography: Public key distribution and coin tossing", Proceedings of IEEE International Conference on Computers, Systems and Signal Processing, Bangalore, India, December 1984, pp. 175-179.

[3]

Bennett, C. H., Brassard, G. and Robert, J.-M., "Privacy amplification by public discussion", SIAM Journal on Computing, vol. 17, no. 2, April 1988, pp. 210-229.

Digital Library

[4]

A.K. Ekert, Quantum cryptography based on Bell's theorem, Physical Review Letters, vol. 67, no. 6, 5 August 1991, pp. 661-663.

[5]

G. Brassard, N. Lütkenhaus, T. Mor and B.C. Sanders, "Security Aspects of Practical Quantum Cryptography", Los Alamos preprint archive quant-ph/9911054 (1999).

[6]

C.H. Bennett, G. Brassard and N.D. Mermin, "Quantum Cryptography without Bell's Theorem", Physical Review Letters, vol. 68, no. 5, 3 February 1992, pp. 557-559.

[7]

D. Mayers and A. Yao, "Quantum Cryptography with Imperfect Apparatus", Proceedings of the 39th IEEE Conference on Foundations of Computer Science, 1998.

[8]

C.H. Bennett, F. Bessette, G. Brassard, L. Salvail and J. Smolin, "Experimental quantum cryptography", Journal of Cryptology, vol. 5, no 1, 1992, pp. 3-28.

[9]

D.S. Naik, C.G. Peterson, A.G. White, A.J. Berglund, P.G. Kwiat, "Entangled state quantum cryptography: Eacvsdropping on the Ekcrt protocol," PRL (tentatively accepted); also in Los Alamos preprint archive quant-ph/9912105 (December 1999).

[10]

T. Jennewein, C. Simon, G. Weihs, H. Weinfurter, A. Zeilinger, "Quantum Cryptography with Entangled Photons", PRL (tentatively accepted); also in Los Alamos preprint archive quant-ph/9912117 (December 1999).

[11]

Paul Kocher, Joshua Jaffe and Benjamin Jun, "Differential Power Analysis: Leaking Secrets", Advances in Cryptology: Proceedings of Crypto '99, Lecture Notes in Comp. Sci., vol 1666, Springer-Verlag, 1996.

[12]

G. Brassard, T. Mor and B.C. Sanders, "Quantum cryptography via parametric downconversion", Los Alamos preprint archive quant-ph/9906074 (1999).

[13]

M.A. Neumark, C.R. Acad. Sci. URSS, vol. 41, no. 9, 1943, pp. 359-361.

[14]

A. Peres, Quantum theory: concepts and methods, Kluwer Academic Press, Dordrecht (1995)

[15]

E. Schmidt, Math. Ann. 63 (1906) 433.

[16]

L. P. Hughston, Richard Jozsa and William K. Wootters, A complete classification of quantum ensembles having a given density matrix", Physics Letters A, vol. 183, pp. 14-18, 1993.

[17]

D. Mayers (in preparation).

Cited By

Nayak AYuen H(2023)Rigidity of Superdense CodingACM Transactions on Quantum Computing10.1145/35935934:4(1-39)Online publication date: 25-Jul-2023
https://dl.acm.org/doi/10.1145/3593593
Chevalier CHermouet PVu Q(2023)Semi-quantum Copy-Protection and MoreTheory of Cryptography10.1007/978-3-031-48624-1_6(155-182)Online publication date: 29-Nov-2023
https://dl.acm.org/doi/10.1007/978-3-031-48624-1_6
Alagic GMajenz CRussell A(2020)Efficient Simulation of Random States and Random UnitariesAdvances in Cryptology – EUROCRYPT 202010.1007/978-3-030-45727-3_26(759-787)Online publication date: 10-May-2020
https://dl.acm.org/doi/10.1007/978-3-030-45727-3_26
Show More Cited By

Recommendations

Multi-party quantum state sharing of an arbitrary two-qubit state with Bell states

We present a new scheme for sharing an arbitrary two-qubit quantum state with n agents. In our scheme, the sender Alice first shares n Einsein-Podolsky-Rosen (EPR) pairs in Bell states with n agents. After setting up the secure quantum channel, ...
A no-summoning theorem in relativistic quantum theory

Alice gives Bob an unknown localized physical state at some point P. At some point Q in the causal future of P, Alice will ask Bob for the state back. Bob knows this, but does not know at which point Q until the request is made. Bob can satisfy Alice's ...
Probabilistic quantum key distribution

This work presents a new concept in quantum key distribution called the probabilistic quantum key distribution (PQKD) protocol, which is based on the measurement uncertainty in quantum phenomena. It allows two mutually untrusted communicants to ...

Comments

Information & Contributors

Information

Published In

cover image Quantum Information & Computation

Quantum Information & Computation Volume 4, Issue 4

July 2004

88 pages

ISSN:1533-7146

Issue’s Table of Contents

Publisher

Rinton Press, Incorporated

Paramus, NJ

Publication History

Published: 01 July 2004

Revised: 23 June 2004

Received: 28 July 2003

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Nayak AYuen H(2023)Rigidity of Superdense CodingACM Transactions on Quantum Computing10.1145/35935934:4(1-39)Online publication date: 25-Jul-2023
https://dl.acm.org/doi/10.1145/3593593
Chevalier CHermouet PVu Q(2023)Semi-quantum Copy-Protection and MoreTheory of Cryptography10.1007/978-3-031-48624-1_6(155-182)Online publication date: 29-Nov-2023
https://dl.acm.org/doi/10.1007/978-3-031-48624-1_6
Alagic GMajenz CRussell A(2020)Efficient Simulation of Random States and Random UnitariesAdvances in Cryptology – EUROCRYPT 202010.1007/978-3-030-45727-3_26(759-787)Online publication date: 10-May-2020
https://dl.acm.org/doi/10.1007/978-3-030-45727-3_26
Gheorghiu AKapourniotis TKashefi E(2019)Verification of Quantum ComputationTheory of Computing Systems10.1007/s00224-018-9872-363:4(715-808)Online publication date: 1-May-2019
https://dl.acm.org/doi/10.1007/s00224-018-9872-3
Coladangelo AGrilo AJeffery SVidick T(2019)Verifier-on-a-Leash: New Schemes for Verifiable Delegated Quantum Computation, with Quasilinear ResourcesAdvances in Cryptology – EUROCRYPT 201910.1007/978-3-030-17659-4_9(247-277)Online publication date: 19-May-2019
https://dl.acm.org/doi/10.1007/978-3-030-17659-4_9
Basak JMaitra S(2018)Clauser---Horne---Shimony---Holt versus three-party pseudo-telepathyQuantum Information Processing10.1007/s11128-018-1849-217:4(1-14)Online publication date: 1-Apr-2018
https://dl.acm.org/doi/10.1007/s11128-018-1849-2
Broadbent ASchaffner C(2016)Quantum cryptography beyond quantum key distributionDesigns, Codes and Cryptography10.1007/s10623-015-0157-478:1(351-382)Online publication date: 1-Jan-2016
https://dl.acm.org/doi/10.1007/s10623-015-0157-4
Adhikari SHome DMajumdar APan AShenoy H. ASrikanth R(2015)Toward secure communication using intra-particle entanglementQuantum Information Processing10.1007/s11128-015-0941-014:4(1451-1468)Online publication date: 1-Apr-2015
https://dl.acm.org/doi/10.1007/s11128-015-0941-0
Coudron MYuen HShmoys D(2014)Infinite randomness expansion with a constant number of devicesProceedings of the forty-sixth annual ACM symposium on Theory of computing10.1145/2591796.2591873(427-436)Online publication date: 31-May-2014
https://dl.acm.org/doi/10.1145/2591796.2591873
Mckague M(2011)Self-Testing Graph StatesRevised Selected Papers of the 6th Conference on Theory of Quantum Computation, Communication, and Cryptography - Volume 674510.1007/978-3-642-54429-3_7(104-120)Online publication date: 24-May-2011
https://dl.acm.org/doi/10.1007/978-3-642-54429-3_7
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents