Verifiable Measurement-Only Blind Quantum Computing with Stabilizer Testing
Open accessThe DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Abstract
We introduce a simple protocol for verifiable measurement-only blind quantum computing. Alice, a client, can perform only single-qubit measurements, whereas Bob, a server, can generate and store entangled many-qubit states. Bob generates copies of a graph state, which is a universal resource state for measurement-based quantum computing, and sends Alice each qubit of them one by one. Alice adaptively measures each qubit according to her program. If Bob is honest, he generates the correct graph state, and, therefore, Alice can obtain the correct computation result. Regarding the security, whatever Bob does, Bob cannot get any information about Alice's computation because of the no-signaling principle. Furthermore, malicious Bob does not necessarily send the copies of the correct graph state, but Alice can check the correctness of Bob's state by directly verifying the stabilizers of some copies.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Mixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272 · cited 1×
“Furthermore, for Thus, the discrete-twirled state ρ ≡ X , [29].”
BackgroundRaussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
Topological fault-tolerance in cluster state quantum computation
Raussendorf, R., Harrington, J., & Goyal, K. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/199 · Cited by 617
Demonstration of Blind Quantum Computing
Barz, S., Kashefi, E., Broadbent, A., Fitzsimons, J. F., Zeilinger, A., & Walther, P. (2012) · Science · doi:10.1126/science.1214707 · Cited by 475 · cited 1×
“The first protocol of blind quantum computing that uses the measurement-based quantum computing [1] was proposed by Broadbent, Fitzsimons, and Kashefi [2], and a proof-of-principle experiment was demonstrated with photonic qubits [3].”
MethodUniversal blind quantum computationPreprint
Broadbent, A., Fitzsimons, J. F., & Kashefi, E. (2016) · Cited by 372
Classical command of quantum systems
Reichardt, B. W., Unger, F., & Vazirani, U. (2013) · Nature · doi:10.1038/nature12035 · Cited by 294 · cited 2×
“Some of them [9, 24, 25] elegantly achieve the completely classical client, but a trade-off is the requirement of more than two servers who do not communicate with each other.”
BackgroundNovel Schemes for Measurement-Based Quantum Computation
Gross, D., & Eisert, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.220503 · Cited by 255
Blind quantum computation protocol in which Alice only makes measurements
Morimae, T., & Fujii, K. (2013) · Physical Review A · doi:10.1103/physreva.87.050301 · Cited by 185
Self-citationTesting Statistical Hypotheses
Ziegel, E. (1987) · Technometrics · doi:10.1080/00401706.1987.10488294 · Cited by 183
Measurement-Based Quantum Computer in the Gapped Ground State of a Two-Body Hamiltonian
Brennen, G. K., & Miyake, A. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.010502 · Cited by 162 · cited 1×
“Since adaptive single-qubit measurements on certain states are universal [1, 21–23], Alice with only single-qubit measurements ability can perform universal quantum computing if Bob prepares the correct resource state.”
BackgroundBlind topological measurement-based quantum computation
Morimae, T., & Fujii, K. (2012) · Nature Communications · doi:10.1038/ncomms2043 · Cited by 158
Self-citationRobustness and device independence of verifiable blind quantum computing
Gheorghiu, A., Kashefi, E., & Wallden, P. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/8/083040 · Cited by 153 · cited 1×
“Some of them [9, 24, 25] elegantly achieve the completely classical client, but a trade-off is the requirement of more than two servers who do not communicate with each other.”
BackgroundExperimental verification of quantum computation
Barz, S., Fitzsimons, J. F., Kashefi, E., & Walther, P. (2013) · Nature Physics · doi:10.1038/nphys2763 · Cited by 148 · cited 1×
“An experimental demonstration of the idea was done with photonic qubits [26].”
MethodBlind Quantum Computing with Weak Coherent Pulses
Dunjko, V., Kashefi, E., & Leverrier, A. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.200502 · Cited by 141 · cited 1×
“For example, it was shown that instead of single-qubit states generation, single-qubit measurements [6] or coherent states generation [7] are sufficient for Alice.”
BackgroundInteractive proofs for BQP via self-tested graph states
McKague, M. (2016) · Theory of Computing · doi:10.4086/toc.2016.v012a003 · Cited by 134 · cited 4×
“[25] gave an elegant protocol that uses a device-independent graph state verification.”
BackgroundMethodInfluentialComposable Security of Delegated Quantum Computation
Dunjko, V., Fitzsimons, J. F., Portmann, C., & Renner, R. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-45608-8_22 · Cited by 125 · cited 1×
“[5] for a precise proof of the security.)”
BackgroundEfficient Universal Blind Quantum Computation
Giovannetti, V., Maccone, L., Morimae, T., & Rudolph, T. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.230501 · Cited by 118
Self-citationOptimal Blind Quantum Computation
Mantri, A., Pérez-Delgado, C. A., & Fitzsimons, J. F. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.230502 · Cited by 116
Verification for measurement-only blind quantum computing
Morimae, T. (2014) · Physical Review A · doi:10.1103/physreva.89.060302 · Cited by 112 · cited 3×
“[10] have been obtained [11, 41, 42], but all of them essentially use the same idea, namely, the trap technique.”
BackgroundMethodSelf-citationAncilla-driven universal blind quantum computation
Sueki, T., Koshiba, T., & Morimae, T. (2013) · Physical Review A · doi:10.1103/physreva.87.060301 · Cited by 90
Self-citationSecure Entanglement Distillation for Double-Server Blind Quantum Computation
Morimae, T., & Fujii, K. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.020502 · Cited by 86
Self-citationContinuous-Variable Blind Quantum Computation
Morimae, T. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.230502 · Cited by 86
Self-citationGround state blind quantum computation on AKLT state
Morimae, T., Dunjko, V., & Kashefi, E. (2015) · Quantum Information and Computation · doi:10.26421/qic15.3-4-2 · Cited by 84
Self-citationTriple-server blind quantum computation using entanglement swapping
Li, Q., Chan, W. H., Wu, C., & Wen, Z. (2014) · Physical Review A · doi:10.1103/physreva.89.040302 · Cited by 83
Device-Independent Verifiable Blind Quantum ComputationPreprint
Hajdušek, M., Pérez-Delgado, C. A., & Fitzsimons, J. F. (2015) · Kent Academic Repository (University of Kent) · doi:10.48550/arxiv.1502.02563 · Cited by 83
A study of LOCC-detection of a maximally entangled state using hypothesis testing
Hayashi, M., Matsumoto, K., & Tsuda, Y. (2006) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/39/46/013 · Cited by 82 · cited 3×
“The hypothesis testing of an entangled state by local measurements was initiated by the paper [33].”
BackgroundResultSelf-citationBugliesi, M., Wegener, I., Vladimiro Sassone, C., & Preneel, B. (2006) · Lecture notes in computer science · doi:10.1007/11786986 · Cited by 63
Self-testing of Quantum Circuits
Magniez, F., Mayers, D., Mosca, M., & Ollivier, H. (2006) · Lecture Notes in Computer Science · doi:10.1007/11786986_8 · Cited by 58
Robustness and device independence of verifiable blind quantum computing
Gheorghiu, A., Kashefi, E., & Wallden, P. (2015) · HAL · Cited by 58
Group theoretical study of LOCC-detection of maximally entangled states using hypothesis testing
Hayashi, M. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/4/043028 · Cited by 48 · cited 1×
“The next paper [34] derived its asymptotic optimal performance in the i.i.d. setting.”
BackgroundSelf-citationIterated Gate Teleportation and Blind Quantum Computation
Pérez-Delgado, C. A., & Fitzsimons, J. F. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.220502 · Cited by 47
Two-way classical communication remarkably improves local distinguishability
Owari, M., & Hayashi, M. (2008) · New Journal of Physics · doi:10.1088/1367-2630/10/1/013006 · Cited by 43 · cited 1×
“Then, the papers [35–38] extended these results to the case of a non-maximally entangled state.”
BackgroundSelf-citationSelf-testing of universal and fault-tolerant sets of quantum gates
van Dam, W., Magniez, F., Mosca, M., & Sántha, M. (2000) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/335305.335402 · Cited by 34 · cited 1×
“Note that there are several proposals for testing quantum gate operations [30, 31], but testing quantum circuit models assumes the identical and independent properties of each gate, and suffers from the scalability and complexity of the analysis.”
BackgroundHayashi, M., & Owari, M. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2687932 · Cited by 18
Self-citationAsymptotic local hypothesis testing between a pure bipartite state and the completely mixed state
Owari, M., & Hayashi, M. (2014) · Physical Review A · doi:10.1103/physreva.90.032327 · Cited by 14
Self-citationSelf-Testing of Universal and Fault-Tolerant Sets of Quantum Gates
van Dam, W., Magniez, F., Mosca, M., & Sántha, M. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539702404377 · Cited by 13
Mapping the spatial distribution of entanglement in optical lattices
Alba, E., Tóth, G., & García‐Ripoll, J. J. (2010) · Physical Review A · doi:10.1103/physreva.82.062321 · Cited by 13
Joo, J., Alba, E., García‐Ripoll, J. J., & Spiller, T. P. (2013) · Physical Review A · doi:10.1103/physreva.88.012328 · Cited by 7
Cited by
Photonic quantum information processing: a review
Flamini, F., Spagnolo, N., & Sciarrino, F. (2019) · Reports on Progress in Physics · doi:10.1088/1361-6633/aad5b2 · Cited by 770
Private quantum computation: an introduction to blind quantum computing and related protocols
Fitzsimons, J. F. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0025-3 · Cited by 295
Metadata
- Authors
- Hayashi, M., & Morimae, T.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2015-11-25
- Volume
- 115
- Issue
- 22
- Pages
- 220502-220502
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W365259755
- Cited by
- 192
- References
- 38
- FWCI
- 13.76
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.