{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T08:56:28Z","timestamp":1772355388395,"version":"3.50.1"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11671001"],"award-info":[{"award-number":["11671001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004502","name":"Doctor Training Program, Chongqing University of Posts and Telecommunications, China","doi-asserted-by":"publisher","award":["BYJS201915"],"award-info":[{"award-number":["BYJS201915"]}],"id":[{"id":"10.13039\/501100004502","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3025958","type":"journal-article","created":{"date-parts":[[2020,9,23]],"date-time":"2020-09-23T20:35:33Z","timestamp":1600893333000},"page":"174265-174278","source":"Crossref","is-referenced-by-count":10,"title":["A Quantum Entanglement-Based Approach for Computing Sentence Similarity"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2076-7172","authenticated-orcid":false,"given":"Yan","family":"Yu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4088-5371","authenticated-orcid":false,"given":"Dong","family":"Qiu","sequence":"additional","affiliation":[]},{"given":"Ruiteng","family":"Yan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2877363"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TASLP.2016.2517318"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.11.013"},{"key":"ref32","first-page":"115","article-title":"Learning precise timing with LSTM recurrent networks","volume":"3","author":"gers","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P15-1162"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/578"},{"key":"ref37","first-page":"161","article-title":"Accuracy of unit under test identification using latent semantic analysis and latent Dirichlet allocation","author":"matej","year":"2019","journal-title":"Proc IEEE 15th Int Sci Conf Inform"},{"key":"ref36","first-page":"194","article-title":"Multilingual semantic textual similarity using multilingual word representations","author":"mahtab","year":"2020","journal-title":"Proc Int Conf Semantic Comput"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2019.101460"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2019.03.012"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/S16-1081"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P16-1089"},{"key":"ref27","first-page":"3294","article-title":"Skip-thought vectors","volume":"28","author":"kiros","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref29","first-page":"1","article-title":"Towards universal paraphrastic sentence embeddings","volume":"2016","author":"wieting","year":"0","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.120.240501"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TASLP.2019.2899494"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.98.042114"},{"key":"ref22","first-page":"2","article-title":"End-to-end quantum-like language models with application to question answering","author":"zhang","year":"2018","journal-title":"Proc AAAI Conf Artif Intell (AAAI)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.116.020502"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.48"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TASLP.2016.2644863"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00143"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"ref50","article-title":"RoBERTa: A robustly optimized BERT pretraining approach","author":"liu","year":"2019"},{"key":"ref51","article-title":"Unified language model pre-training for natural language understanding and generation","author":"dong","year":"2019"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/S15-2045"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/S14-2010"},{"key":"ref57","first-page":"385","article-title":"SemEval-2012 Task 6: A pilot on semantic textual similarity","author":"agirre","year":"2012","journal-title":"Proc Conf Lexical Comput Semantics"},{"key":"ref56","year":"0"},{"key":"ref55","year":"0"},{"key":"ref54","first-page":"1","article-title":"Language models are unsupervised multitask learners","volume":"1","author":"radford","year":"2019","journal-title":"Open AI blog"},{"key":"ref53","article-title":"Deep learning based text classification: A comprehensive review","author":"minaee","year":"2020"},{"key":"ref52","article-title":"UniLMv2: Pseudo-masked language models for unified language model pre-training","author":"bao","year":"2020","journal-title":"arXiv 2002 12804"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.114.140504"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.113.130503"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2985685"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.121.050502"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.121.010501"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.120.170502"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.114.110504"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2763975"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.120.160502"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-018-0307-8"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1038\/nature24047"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-018-28212-4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-019-0174-7"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.120.257204"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-018-07520-3"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1038\/nature23474","article-title":"Quantum machine learning","volume":"549","author":"biamonte","year":"2017","journal-title":"Nature"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.120.160502"},{"key":"ref49","article-title":"Cross-lingual language model pretraining","author":"lample","year":"2019","journal-title":"arXiv 1901 07291"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2013.2283574"},{"key":"ref46","first-page":"5733","article-title":"XLNet: Generalized autoregressive pretraining for language understanding","author":"yang","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N18-1202"},{"key":"ref48","article-title":"ALBERT: A lite BERT for self-supervised learning of language representations","author":"lan","year":"2019"},{"key":"ref47","article-title":"BERT: Pre-training of deep bidirectional transformers for language understanding","author":"devlin","year":"2018","journal-title":"arXiv 1810 04805"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2017.2690222"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2890628"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.205"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.02.026"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09204644.pdf?arnumber=9204644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:56:07Z","timestamp":1639770967000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9204644\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":60,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3025958","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}