{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T17:06:04Z","timestamp":1763831164698,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Institute for Information and Communications Technology Planning and Evaluation","award":["IITP-2019-2018-0-01402"],"award-info":[{"award-number":["IITP-2019-2018-0-01402"]}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["2019R1I1A1A01050161"],"award-info":[{"award-number":["2019R1I1A1A01050161"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Mach. Intell."],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s42484-020-00019-5","type":"journal-article","created":{"date-parts":[[2020,7,21]],"date-time":"2020-07-21T11:02:45Z","timestamp":1595329365000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Quantum-classical reinforcement learning for decoding noisy classical parity information"],"prefix":"10.1007","volume":"2","author":[{"given":"Daniel K.","family":"Park","sequence":"first","affiliation":[]},{"given":"Jonghun","family":"Park","sequence":"additional","affiliation":[]},{"given":"June-Koo Kevin","family":"Rhee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,21]]},"reference":[{"issue":"11","key":"19_CR1","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"LG Valiant","year":"1984","unstructured":"Valiant L G (1984) A Theory of the Learnable. Commun ACM 27(11):1134. https:\/\/doi.org\/10.1145\/1968.1972","journal-title":"Commun ACM"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"012327","DOI":"10.1103\/PhysRevA.92.012327","volume":"92","author":"AW Cross","year":"2015","unstructured":"Cross AW, Smith G, Smolin J (2015) Quantum learning robust against noise. Phys Rev A 92:012327. https:\/\/doi.org\/10.1103\/PhysRevA.92.012327.","journal-title":"Phys Rev A"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/11538462_32","volume":"3624","author":"V Lyubashevsky","year":"2005","unstructured":"Lyubashevsky V (2005) The parity problem in the presence of noise, decoding random linear codes, and the subset sum problem (Springer, Berlin, Heidelberg. Lect Notes Comput Sci 3624:378\u2013389. https:\/\/doi.org\/10.1007\/11538462_32","journal-title":"Lect Notes Comput Sci"},{"key":"19_CR4","doi-asserted-by":"publisher","unstructured":"Regev O (2005) On Lattices, Learning with Errors, Random Linear Codes, and Cryptography. In: Proceedings of the 37th annual ACM symposium on theory of computing. https:\/\/doi.org\/10.1145\/1060590.1060603. ACM, New York, pp 84\u201393","DOI":"10.1145\/1060590.1060603"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Pietrzak K (2012) Cryptography from Learning Parity with Noise. In: Bielikov\u00e1 M., Friedrich G., Gottlob G., Katzenbeisser S., Tur\u00e1n G. (eds) SOFSEM 2012: Theory and practice of computer science. Springer , Berlin, pp 99\u2013114","DOI":"10.1007\/978-3-642-27660-6_9"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"4213","DOI":"10.1038\/ncomms5213","volume":"5","author":"A Peruzzo","year":"2014","unstructured":"Peruzzo A, McClean J, Shadbolt P, Yung M H, Zhou X Q, Love P J, Aspuru-Guzik A, O\u2019Brien J L (2014) A variational eigenvalue solver on a photonic quantum processor. Nature Communications 5:4213. https:\/\/doi.org\/10.1038\/ncomms5213","journal-title":"Nature Communications"},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"023023","DOI":"10.1088\/1367-2630\/18\/2\/023023","volume":"18","author":"JR McClean","year":"2016","unstructured":"McClean JR, Romero J, Babbush R, Aspuru-Guzik A (2016) The theory of variational hybrid quantum-classical algorithms. New J Phys 18(2):023023. https:\/\/doi.org\/10.1088\/1367-2630\/18\/2\/023023","journal-title":"New J Phys"},{"issue":"4","key":"19_CR8","doi-asserted-by":"publisher","first-page":"045001","DOI":"10.1088\/2058-9565\/aa8072","volume":"2","author":"J Romero","year":"2017","unstructured":"Romero J, Olson JP, Aspuru-Guzik A (2017) Quantum autoencoders for efficient compression of quantum data. Quantum Sci Technol 2(4):045001. https:\/\/doi.org\/10.1088\/2058-9565\/aa8072","journal-title":"Quantum Sci Technol"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1038\/nature23879","volume":"549","author":"A Kandala","year":"2017","unstructured":"Kandala A, Mezzacapo A, Temme K, Takita M, Brink M, Chow J M, Gambetta J M (2017) Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets. Nature 549 :242. https:\/\/doi.org\/10.1038\/nature23879","journal-title":"Nature"},{"issue":"3","key":"19_CR10","doi-asserted-by":"publisher","first-page":"030503","DOI":"10.1088\/2058-9565\/aab822","volume":"3","author":"N Moll","year":"2018","unstructured":"Moll N, Barkoutsos P, Bishop LS, Chow JM, Cross A , Egger DJ, Filipp S, Fuhrer A, Gambetta JM, Ganzhorn M, Kandala A, Mezzacapo A, M\u00fcller P, Riess W, Salis G, Smolin J, Tavernelli I, Temme K (2018) Quantum optimization using variational algorithms on near-term quantum devices. Quantum Sci Technol 3(3):030503. https:\/\/doi.org\/10.1088\/2058-9565\/aab822","journal-title":"Quantum Sci Technol"},{"key":"19_CR11","unstructured":"Otterbach J S, Manenti R, Alidoust N, Bestwick A, Block M, Bloom B, Caldwell S, Didier N, Schuyler Fried E, Hong S, Karalekas P, Osborn C B, Papageorge A, Peterson E C, Prawiroatmodjo G, Rubin N, Ryan C A, Scarabelli D, Scheer M, Sete E A, Sivarajah P, Smith R S, Staley A, Tezak N, Zeng W J, Hudson A, Johnson B R, Reagor M, da Silva M P, Rigetti C (2017) Unsupervised Machine Learning on a Hybrid Quantum Computer. arXiv:1712.05771"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"032309","DOI":"10.1103\/PhysRevA.98.032309","volume":"98","author":"K Mitarai","year":"2018","unstructured":"Mitarai K, Negoro M, Kitagawa M, Fujii K (2018) Quantum circuit learning. Phys Rev A 98:032309. https:\/\/doi.org\/10.1103\/PhysRevA.98.032309","journal-title":"Phys Rev A"},{"key":"19_CR13","unstructured":"Schuld M, Bocharov A, Svore K, Wiebe N (2018) Circuit-centric quantum classifiers. arXiv:1804.00633"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"012324","DOI":"10.1103\/PhysRevA.98.012324","volume":"98","author":"PL Dallaire-Demers","year":"2018","unstructured":"Dallaire-Demers P L, Killoran N (2018) Quantum generative adversarial networks. Phys Rev A 98:012324. https:\/\/doi.org\/10.1103\/PhysRevA.98.012324","journal-title":"Phys Rev A"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"031084","DOI":"10.1103\/PhysRevX.8.031084","volume":"8","author":"T F\u00f6sel","year":"2018","unstructured":"F\u00f6sel T, Tighineanu P, Weiss T, Marquardt F (2018) Reinforcement Learning with Neural Networks for Quantum Feedback. Phys Rev X 8:031084. https:\/\/doi.org\/10.1103\/PhysRevX.8.031084.","journal-title":"Phys Rev X"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Zoufal C, Lucchi A, Woerner S (2019) Quantum Generative Adversarial Networks for Learning and Loading Random Distributions. arXiv:1904.00043","DOI":"10.1038\/s41534-019-0223-2"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Romero J, Aspuru-Guzik A (2019) Variational quantum generators: Generative adversarial quantum machine learning for continuous distributions. arXiv:190100848","DOI":"10.1002\/qute.202000003"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"150503","DOI":"10.1103\/PhysRevLett.118.150503","volume":"118","author":"J Li","year":"2017","unstructured":"Li J, Yang X, Peng X, Sun CP (2017) Hybrid Quantum-Classical Approach to Quantum Optimal Control. Phys Rev Lett 118:150503. https:\/\/doi.org\/10.1103\/PhysRevLett.118.150503.","journal-title":"Phys Rev Lett"},{"issue":"4","key":"19_CR19","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1023\/A:1022873112823","volume":"2","author":"D Angluin","year":"1988","unstructured":"Angluin D, Laird P (1988) Learning From Noisy Examples. Mach Learn 2(4):343. https:\/\/doi.org\/10.1023\/A:1022873112823","journal-title":"Mach Learn"},{"issue":"4","key":"19_CR20","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1145\/792538.792543","volume":"50","author":"A Blum","year":"2003","unstructured":"Blum A, Kalai A, Wasserman H (2003) Noise-tolerant Learning, the Parity Problem, and the Statistical Query Model. J ACM 50(4):506. https:\/\/doi.org\/10.1145\/792538.792543","journal-title":"J ACM"},{"issue":"5","key":"19_CR21","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E Bernstein","year":"1997","unstructured":"Bernstein E, Vazirani U (1997) Quantum Complexity Theory. J SIAM Comput 26(5):1411. https:\/\/doi.org\/10.1137\/S0097539796300921","journal-title":"J SIAM Comput"},{"key":"19_CR22","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/11832072_24","volume":"4116","author":"\u00c9 Levieil","year":"2006","unstructured":"Levieil \u00c9, Fouque PA (2006) An improved LPN algorithm (Springer, Berlin, Heidelberg. Lect Notes Comput Sci 4116:348\u2013359. https:\/\/doi.org\/10.1007\/11832072_24","journal-title":"Lect Notes Comput Sci"},{"issue":"1","key":"19_CR23","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1038\/s41534-017-0017-3","volume":"3","author":"D Rist\u00e8","year":"2017","unstructured":"Rist\u00e8 D, da Silva M P, Ryan C A, Cross A W, C\u00f3rcoles AD, Smolin J A, Gambetta J M, Chow J M, Johnson BR (2017) Demonstration of quantum advantage in machine learning. npj Quantum Info 3(1):16. https:\/\/doi.org\/10.1038\/s41534-017-0017-3","journal-title":"npj Quantum Info"},{"key":"19_CR24","doi-asserted-by":"publisher","first-page":"5672","DOI":"10.1103\/PhysRevLett.81.5672","volume":"81","author":"E Knill","year":"1998","unstructured":"Knill E, Laflamme R (1998) Power of One Bit of Quantum Information. Phys Rev Lett 81:5672. https:\/\/doi.org\/10.1103\/PhysRevLett.81.5672.","journal-title":"Phys Rev Lett"},{"key":"19_CR25","doi-asserted-by":"publisher","first-page":"032327","DOI":"10.1103\/PhysRevA.97.032327","volume":"97","author":"DK Park","year":"2018","unstructured":"Park DK, Rhee JKK, Lee S (2018) Noise-tolerant parity learning with one quantum bit. Phys Rev A 97:032327. https:\/\/doi.org\/10.1103\/PhysRevA.97.032327.","journal-title":"Phys Rev A"},{"key":"19_CR26","doi-asserted-by":"publisher","first-page":"160501","DOI":"10.1103\/PhysRevLett.100.160501","volume":"100","author":"V Giovannetti","year":"2008","unstructured":"Giovannetti V, Lloyd S, Maccone L (2008) Quantum Random Access Memory. Phys Rev Lett 100:160501. https:\/\/doi.org\/10.1103\/PhysRevLett.100.160501.","journal-title":"Phys Rev Lett"},{"key":"19_CR27","doi-asserted-by":"publisher","first-page":"052310","DOI":"10.1103\/PhysRevA.78.052310","volume":"78","author":"V Giovannetti","year":"2008","unstructured":"Giovannetti V, Lloyd S, Maccone L (2008) Architectures for a quantum random access memory. Phys Rev A 78:052310. https:\/\/doi.org\/10.1103\/PhysRevA.78.052310.","journal-title":"Phys Rev A"},{"key":"19_CR28","doi-asserted-by":"publisher","first-page":"010306","DOI":"10.1103\/PhysRevA.86.010306","volume":"86","author":"FY Hong","year":"2012","unstructured":"Hong FY, Xiang Y, Zhu ZY, Jiang L.z. , Wu LN (2012) Robust quantum random access memory. Phys Rev A 86:010306. https:\/\/doi.org\/10.1103\/PhysRevA.86.010306.","journal-title":"Phys Rev A"},{"issue":"12","key":"19_CR29","doi-asserted-by":"publisher","first-page":"123010","DOI":"10.1088\/1367-2630\/17\/12\/123010","volume":"17","author":"S Arunachalam","year":"2015","unstructured":"Arunachalam S, Gheorghiu V, Jochym-O\u2019Connor T, Mosca M, Srinivasan PV (2015) On the robustness of bucket brigade quantum RAM. New J Phys 17(12):123010. http:\/\/stacks.iop.org\/1367-2630\/17\/i=12\/a=123010","journal-title":"New J Phys"},{"issue":"1","key":"19_CR30","doi-asserted-by":"publisher","first-page":"3949","DOI":"10.1038\/s41598-019-40439-3","volume":"9","author":"DK Park","year":"2019","unstructured":"Park D K, Petruccione F, Rhee J K K (2019) Circuit-Based Quantum Random Access Memory for Classical Data. Sci Rep 9(1):3949. https:\/\/doi.org\/10.1038\/s41598-019-40439-3","journal-title":"Sci Rep"},{"key":"19_CR31","doi-asserted-by":"publisher","first-page":"032314","DOI":"10.1103\/PhysRevA.99.032314","volume":"99","author":"AB Grilo","year":"2019","unstructured":"Grilo AB, Kerenidis I, Zijlstra T (2019) Learning-with-errors problem is easy with quantum samples. Phys Rev A 99:032314. https:\/\/doi.org\/10.1103\/PhysRevA.99.032314.","journal-title":"Phys Rev A"}],"container-title":["Quantum Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-020-00019-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42484-020-00019-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-020-00019-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T23:18:40Z","timestamp":1626823120000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42484-020-00019-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["19"],"URL":"https:\/\/doi.org\/10.1007\/s42484-020-00019-5","relation":{},"ISSN":["2524-4906","2524-4914"],"issn-type":[{"type":"print","value":"2524-4906"},{"type":"electronic","value":"2524-4914"}],"subject":[],"published":{"date-parts":[[2020,6]]},"assertion":[{"value":"1 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of interest"}}],"article-number":"8"}}