{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T22:14:40Z","timestamp":1774995280176,"version":"3.50.1"},"reference-count":37,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2020,9,7]],"date-time":"2020-09-07T00:00:00Z","timestamp":1599436800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672014"],"award-info":[{"award-number":["61672014"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Cryptography Development Fund of China","award":["MMJJ20180109"],"award-info":[{"award-number":["MMJJ20180109"]}]},{"name":"Natural Science Foundation of Guangdong Province of China","award":["2019A1515011069"],"award-info":[{"award-number":["2019A1515011069"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Recent advances in theoretical and experimental quantum computing raise the problem of verifying the outcome of these quantum computations. The recent verification protocols using blind quantum computing are fruitful for addressing this problem. Unfortunately, all known schemes have relatively high overhead. Here we present a novel construction for the resource state of verifiable blind quantum computation. This approach achieves a better verifiability of 0.866 in the case of classical output. In addition, the number of required qubits is 2N+4cN, where N and c are the number of vertices and the maximal degree in the original computation graph, respectively. In other words, our overhead is less linear in the size of the computational scale. Finally, we utilize the method of repetition and fault-tolerant code to optimise the verifiability.<\/jats:p>","DOI":"10.3390\/e22090996","type":"journal-article","created":{"date-parts":[[2020,9,7]],"date-time":"2020-09-07T09:18:16Z","timestamp":1599470296000},"page":"996","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Improved Resource State for Verifiable Blind Quantum Computation"],"prefix":"10.3390","volume":"22","author":[{"given":"Qingshan","family":"Xu","sequence":"first","affiliation":[{"name":"College of Information Science and Technology, Jinan University, Guangzhou 510632, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoqing","family":"Tan","sequence":"additional","affiliation":[{"name":"College of Information Science and Technology, Jinan University, Guangzhou 510632, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8439-4526","authenticated-orcid":false,"given":"Rui","family":"Huang","sequence":"additional","affiliation":[{"name":"College of Information Science and Technology, Jinan University, Guangzhou 510632, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,9,7]]},"reference":[{"key":"ref_1","first-page":"456","article-title":"Secure assisted quantum computation","volume":"5","author":"Childs","year":"2005","journal-title":"Quantum Info. Comput."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Broadbent, A., Fitzsimons, J.F., and Kashefi, E. (2009, January 25\u201327). Universal blind quantum computation. Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, Atlanta, GA, USA.","DOI":"10.1109\/FOCS.2009.36"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1126\/science.1214707","article-title":"Demonstration of blind quantum computing","volume":"335","author":"Barz","year":"2012","journal-title":"Science"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1038\/ncomms2043","article-title":"Blind topological measurement-based quantum computation","volume":"3","author":"Morimae","year":"2012","journal-title":"Nat. Commun."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"230502","DOI":"10.1103\/PhysRevLett.109.230502","article-title":"Continuous-variable blind quantum computation","volume":"109","author":"Morimae","year":"2012","journal-title":"Phys. Rev. Lett."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"050301","DOI":"10.1103\/PhysRevA.87.050301","article-title":"Blind quantum computation protocol in which Alice only makesmeasurements","volume":"87","author":"Morimae","year":"2013","journal-title":"Phys. Rev. A"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"020502","DOI":"10.1103\/PhysRevLett.111.020502","article-title":"Secure entanglement distillation for double-server blind quantum computation","volume":"111","author":"Morimae","year":"2013","journal-title":"Phys. Rev. Lett."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"230502","DOI":"10.1103\/PhysRevLett.111.230502","article-title":"Optimal blind quantum computation","volume":"111","author":"Mantri","year":"2013","journal-title":"Phys. Rev. Lett."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"230501","DOI":"10.1103\/PhysRevLett.111.230501","article-title":"Efficient universal blind quantum computation","volume":"111","author":"Giovannetti","year":"2013","journal-title":"Phys. Rev. Lett."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"060301","DOI":"10.1103\/PhysRevA.87.060301","article-title":"Ancilla-driven universal blind quantum computation","volume":"87","author":"Sueki","year":"2013","journal-title":"Phys. Rev. A"},{"key":"ref_11","first-page":"200","article-title":"Ground state blind quantum computation on AKLT state","volume":"15","author":"Morimae","year":"2015","journal-title":"Quantum Inf. Comput."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"220502","DOI":"10.1103\/PhysRevLett.114.220502","article-title":"Iterated gate teleportation and blind quantum computation","volume":"114","author":"Fitzsimons","year":"2015","journal-title":"Phys. Rev. Lett."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"052307","DOI":"10.1103\/PhysRevA.93.052307","article-title":"Blind quantum computation over a collective-noise channel","volume":"93","author":"Takeuchi","year":"2016","journal-title":"Phys. Rev. A"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1038\/s41534-017-0025-3","article-title":"Private quantum computation: An introduction to blind quantum computing and related protocols","volume":"3","author":"Fitzsimons","year":"2017","journal-title":"NPJ Quantum Inf."},{"key":"ref_15","unstructured":"Zhang, X., Weng, J., Tan, X., Song, T., and Luo, W. (2018). Measurement-based universal blind quantum computation with minor resources. arXiv."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/s11128-018-1901-2","article-title":"Single-server blind quantum computation with quantum circuit model","volume":"17","author":"Zhang","year":"2018","journal-title":"Quantum Inf. Process."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"012303","DOI":"10.1103\/PhysRevA.96.012303","article-title":"Unconditionally verifiable blind quantum computation","volume":"96","author":"Fitzsimons","year":"2017","journal-title":"Phys. Rev. A"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1038\/nphys2763","article-title":"Experimental verification of quantum computation","volume":"9","author":"Barz","year":"2013","journal-title":"Nat. Phys."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"220502","DOI":"10.1103\/PhysRevLett.115.220502","article-title":"Verifiable measurement-only blind quantum computing with stabilizer testing","volume":"115","author":"Hayashi","year":"2015","journal-title":"Phys. Rev. Lett."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"083040","DOI":"10.1088\/1367-2630\/17\/8\/083040","article-title":"Robustness and device independence of verifiable blind quantum computing","volume":"17","author":"Gheorghiu","year":"2015","journal-title":"New J. Phys."},{"key":"ref_21","unstructured":"Hajdu\u0161ek, M., P\u00e9rez-Delgado, C.A., and Fitzsimons, J.F. (2015). Device-independent verifiable blind quantum computation. arXiv."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4086\/toc.2016.v012a003","article-title":"Interactive proofs for BQP via self-tested graph states","volume":"12","author":"McKague","year":"2016","journal-title":"Theor. Comput."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"013020","DOI":"10.1088\/1367-2630\/18\/1\/013020","article-title":"Demonstration of measurement-only blind quantum computing","volume":"18","author":"Greganti","year":"2016","journal-title":"New J. Phys."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"023043","DOI":"10.1088\/1367-2630\/aa5cff","article-title":"Rigidity of quantum steering and one-sided device-independent verifiable quantum computation","volume":"19","author":"Gheorghiu","year":"2017","journal-title":"New J. Phys."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"145306","DOI":"10.1088\/1751-8121\/aa5dac","article-title":"Optimised resource construction for verifiable quantum computation","volume":"50","author":"Kashefi","year":"2017","journal-title":"J. Phys. A Math. Theor."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"052308","DOI":"10.1103\/PhysRevA.97.052308","article-title":"Self-guaranteed measurement-based quantum computation","volume":"97","author":"Hayashi","year":"2018","journal-title":"Phys. Rev. A"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"040501","DOI":"10.1103\/PhysRevLett.120.040501","article-title":"Post hoc Verification of Quantum Computation","volume":"120","author":"Fitzsimons","year":"2018","journal-title":"Phys. Rev. Lett."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1007\/s00224-018-9872-3","article-title":"Verification of quantum computation: An overview of existing approaches","volume":"63","author":"Gheorghiu","year":"2019","journal-title":"Theory Comput. Syst."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1038\/s41534-019-0142-2","article-title":"Resource-efficient verification of quantum computing using Serfling\u2019s bound","volume":"5","author":"Takeuchi","year":"2019","journal-title":"NPJ Quantum Inf."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"022312","DOI":"10.1103\/PhysRevA.68.022312","article-title":"Measurement-based quantum computation on cluster states","volume":"68","author":"Raussendorf","year":"2003","journal-title":"Phys. Rev. A"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1038\/nphys1157","article-title":"Measurement-based quantum computation","volume":"5","author":"Briegel","year":"2009","journal-title":"Nat. Phys."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"5188","DOI":"10.1103\/PhysRevLett.86.5188","article-title":"A one-way quantum computer","volume":"86","author":"Raussendorf","year":"2001","journal-title":"Phys. Rev. Lett."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"3260","DOI":"10.1103\/PhysRevLett.77.3260","article-title":"Fault-tolerant error correction with efficient quantum codes","volume":"77","author":"DiVincenzo","year":"1996","journal-title":"Phys. Rev. Lett."},{"key":"ref_34","unstructured":"Nielsen, M.A., and Chuang, I.L. (2010). Quantum Computation and Quantum Information: 10th Anniversary Edition, Cambridge University Press."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"2242","DOI":"10.1016\/j.aop.2006.01.012","article-title":"A fault-tolerant one-way quantum computer","volume":"321","author":"Raussendorf","year":"2006","journal-title":"Ann. Phys."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1088\/1367-2630\/9\/6\/199","article-title":"Topological fault-tolerance in cluster state quantum computation","volume":"9","author":"Raussendorf","year":"2007","journal-title":"New J. Phys."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"190504","DOI":"10.1103\/PhysRevLett.98.190504","article-title":"Fault-tolerant quantum computation with high threshold in two dimensions","volume":"98","author":"Raussendorf","year":"2007","journal-title":"Phys. Rev. Lett."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/22\/9\/996\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T10:07:41Z","timestamp":1760177261000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/22\/9\/996"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,7]]},"references-count":37,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2020,9]]}},"alternative-id":["e22090996"],"URL":"https:\/\/doi.org\/10.3390\/e22090996","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,7]]}}}