{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T16:31:05Z","timestamp":1775579465412,"version":"3.50.1"},"reference-count":42,"publisher":"Frontiers Media SA","license":[{"start":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T00:00:00Z","timestamp":1701907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002770","name":"Cabinet Office, Government of Japan","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002770","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["frontiersin.org"],"crossmark-restriction":true},"short-container-title":["Front. Comput. Sci."],"abstract":"<jats:p>In this study, the maze generation using quantum annealing is proposed. We reformulate a standard algorithm to generate a maze into a specific form of a quadratic unconstrained binary optimization problem suitable for the input of the quantum annealer. To generate more difficulty mazes, we introduce an additional cost function <jats:italic>Q<\/jats:italic><jats:sub><jats:italic>update<\/jats:italic><\/jats:sub> to increase the difficulty. The difficulty of the mazes was evaluated by the time to solve the maze of 12 human subjects. To check the efficiency of our scheme to create the maze, we investigated the time-to-solution of a quantum processing unit, classical computer, and hybrid solver. The results show that <jats:italic>Q<\/jats:italic><jats:sub><jats:italic>update<\/jats:italic><\/jats:sub> generates difficult mazes tailored to the individual. Furthermore, it show that the quantum processing unit is more efficient at generating mazes than other solvers. Finally, we also present applications how our results could be used in the future.<\/jats:p>","DOI":"10.3389\/fcomp.2023.1285962","type":"journal-article","created":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T09:11:57Z","timestamp":1701940317000},"update-policy":"https:\/\/doi.org\/10.3389\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Individual subject evaluated difficulty of adjustable mazes generated using quantum annealing"],"prefix":"10.3389","volume":"5","author":[{"given":"Yuto","family":"Ishikawa","sequence":"first","affiliation":[]},{"given":"Takuma","family":"Yoshihara","sequence":"additional","affiliation":[]},{"given":"Keita","family":"Okamura","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Ohzeki","sequence":"additional","affiliation":[]}],"member":"1965","published-online":{"date-parts":[[2023,12,7]]},"reference":[{"key":"B1","unstructured":""},{"key":"B2","unstructured":""},{"key":"B3","unstructured":""},{"key":"B4","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.8.021050","article-title":"Quantum Boltzmann machine","author":"Amin","year":"2018","journal-title":"Phys. Rev"},{"key":"B5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.3.033006","article-title":"Mean field analysis of reverse annealing for code-division multiple-access multiuser detection","author":"Arai","year":"","journal-title":"Phys. Rev. Res"},{"key":"B6","doi-asserted-by":"publisher","DOI":"10.7566\/JPSJ.90.074002","article-title":"Teacher-student learning for a binary perceptron with quantum fluctuations","author":"Arai","year":"","journal-title":"J. Phys. Soc. Jpn"},{"key":"B7","doi-asserted-by":"publisher","first-page":"022607","DOI":"10.1103\/PhysRevA.104.022607","article-title":"Simulated quantum annealing as a simulator of nonequilibrium quantum dynamics","volume":"104","author":"Bando","year":"2021","journal-title":"Phys. Rev. A"},{"key":"B8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.2.033369","article-title":"Probing the universality of topological defect formation in a quantum annealer: Kibble-zurek mechanism and beyond","author":"Bando","year":"2020","journal-title":"Phys. Rev. Res"},{"key":"B9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s42979-021-00466-2","article-title":"Implementation of a hybrid classical-quantum annealing algorithm for logistic network design","volume":"2","author":"Ding","year":"2021","journal-title":"SN Comp. Sci"},{"key":"B10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.3389\/fict.2019.00013","article-title":"A hybrid solution method for the capacitated vehicle routing problem using a quantum annealer","volume":"6","author":"Feld","year":"2019","journal-title":"Front. ICT"},{"key":"B11","article-title":"Online calibration scheme for training restricted boltzmann machines with quantum annealing","author":"Goto","year":"2023","journal-title":"arXiv [Preprint]."},{"key":"B12","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-022-22704-0","article-title":"Travel time optimization on multi-agv routing by reverse annealing","author":"Haba","year":"2022","journal-title":"Sci. Rep"},{"key":"B13","article-title":"Kernel learning by quantum annealer","author":"Hasegawa","year":"2023","journal-title":"arXiv [Preprint]"},{"key":"B14","doi-asserted-by":"publisher","DOI":"10.7566\/JPSJ.92.113002","article-title":"Efficient algorithm for binary quadratic problem by column generation and quantum annealing","author":"Hirama","year":"2023","journal-title":"arXiv"},{"key":"B15","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1109\/TTE.2020.2980744","article-title":"Optimal sizing of battery energy storage system in a fast ev charging station considering power outages","volume":"6","author":"Hussain","year":"2020","journal-title":"IEEE Transact. Transport. Electr"},{"key":"B16","first-page":"91","article-title":"\u201cMaximum likelihood channel decoding with quantumannealingmachine,\u201d","author":"Ide","year":"2020","journal-title":"2020 International Symposium on Information Theory and Its Applications (ISITA)"},{"key":"B17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-021-82740-0","article-title":"Traffic signal optimization on a square lattice with quantum annealing","volume":"11","author":"Inoue","year":"2021","journal-title":"Sci. Rep"},{"key":"B18","doi-asserted-by":"publisher","first-page":"5355","DOI":"10.1103\/PhysRevE.58.5355","article-title":"Quantum annealing in the transverse ising model","volume":"58","author":"Kadowaki","year":"1998","journal-title":"Phys. Rev. E"},{"key":"B19","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aada1f","article-title":"Quantum variational autoencoder","author":"Khoshaman","year":"2018","journal-title":"Quant. Sci. Technol"},{"key":"B20","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.1038\/s41567-022-01741-6","article-title":"Coherent quantum annealing in a programmable 2,000 qubit ising chain","volume":"18","author":"King","year":"2022","journal-title":"Nat. Phys"},{"key":"B21","doi-asserted-by":"publisher","DOI":"10.7566\/JPSJ.90.064001","article-title":"Benchmark test of black-box optimization using d-wave quantum annealer","author":"Koshikawa","year":"2021","journal-title":"J. Phys. Soc. Jpn"},{"key":"B22","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-017-1809-2","article-title":"Quantum annealing for combinatorial clustering","author":"Kumar","year":"2018","journal-title":"Quant. Inf. Process"},{"key":"B23","article-title":"Graph minor embedding of degenerate systems in quantum annealing","author":"Maruyama","year":"2021","journal-title":"arXiv [Preprint]."},{"key":"B24","volume-title":"Generation of an Arbitrary Shaped Large Maze by Assembling Mazes","author":"mok Bae","year":"2015"},{"key":"B25","doi-asserted-by":"publisher","first-page":"29","DOI":"10.3389\/fict.2017.00029","article-title":"Traffic flow optimization using a quantum annealer","volume":"4","author":"Neukart","year":"2017","journal-title":"Front. ICT"},{"key":"B26","first-page":"333","article-title":"\u201cQboost: large scale classifier training withadiabatic quantum optimization,\u201d","volume-title":"Asian Conference on Machine Learning (PMLR)","author":"Neven","year":"2012"},{"key":"B27","doi-asserted-by":"publisher","DOI":"10.3389\/fcomp.2019.00002","article-title":"Item listing optimization for e-commerce websites based on diversity","author":"Nishimura","year":"2019","journal-title":"Front. Comput. Sci"},{"key":"B28","doi-asserted-by":"publisher","first-page":"e0206653","DOI":"10.1371\/journal.pone.0206653","article-title":"Nonnegative\/binary matrix factorization with a d-wave quantum annealer","volume":"13","author":"OM\u0301alley","year":"2018","journal-title":"PLoS ONE"},{"key":"B29","unstructured":"2023"},{"key":"B30","doi-asserted-by":"publisher","first-page":"060301","DOI":"10.1103\/PhysRevA.99.060301","article-title":"Forecasting financial crashes with quantum computing","volume":"99","author":"Or\u00fas","year":"2019","journal-title":"Phys. Rev. A"},{"key":"B31","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-022-06070-5","article-title":"Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization","author":"Oshiyama","year":"2022","journal-title":"Sci. Rep"},{"key":"B32","doi-asserted-by":"crossref","DOI":"10.1145\/3149526.3149532","article-title":"\u201cNavigating a maze using a quantum annealer,\u201d","volume-title":"ITiCSE-WGR 2017 - Proceedings of the 2017 ITiCSE Conference onWorking Group Reports","author":"Pakin","year":"2017"},{"key":"B33","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1109\/JSTSP.2016.2574703","article-title":"Solving the optimal trading trajectory problem using a quantum annealer","volume":"10","author":"Rosenberg","year":"2016","journal-title":"IEEE J. Sel. Top. Signal Process"},{"key":"B34","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-021-92295-9","article-title":"Assessment of image generation by quantum annealer","author":"Sato","year":"2021","journal-title":"Sci. Rep"},{"key":"B35","doi-asserted-by":"publisher","first-page":"164","DOI":"10.3902\/jnns.29.164","article-title":"Black-box optimization by anneling machines","volume":"29","author":"Shu Tanaka","year":"2022","journal-title":"J. Neural Circ. Soc. Jpn."},{"key":"B36","article-title":"Hybrid algorithm of linear programming relaxation and quantum annealing","author":"Takabayashi","year":"2023","journal-title":"arXiv [Preprint]."},{"key":"B37","doi-asserted-by":"publisher","DOI":"10.7566\/JPSJ.92.023001","article-title":"Virtual screening of chemical space based on quantum annealing","author":"Tanaka","year":"2023","journal-title":"J. Phys. Soc. Jpn"},{"key":"B38","doi-asserted-by":"publisher","DOI":"10.7566\/JPSJ.91.074008","article-title":"Comparing the effects of boltzmann machines as associative memory in generative adversarial networks between classical and quantum samplings","author":"Urushibata","year":"2022","journal-title":"J. Phys. Soc. Jpn"},{"key":"B39","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s42484-019-00001-w","article-title":"Reverse quantum annealing approach to portfolio optimization problems","volume":"1","author":"Venturelli","year":"2019","journal-title":"Quant. Mach. Intell"},{"key":"B40","article-title":"Quantum annealing implementation of job-shop scheduling","author":"Venturelli","year":"2016","journal-title":"arXiv [Preprint]."},{"key":"B41","doi-asserted-by":"publisher","DOI":"10.7566\/JPSJ.89.025002","article-title":"Fair sampling by simulated annealing on quantum annealer","author":"Yamamoto","year":"2020","journal-title":"J. Phys. Soc. Jpn"},{"key":"B42","doi-asserted-by":"publisher","first-page":"1874","DOI":"10.2355\/isijinternational.ISIJINT-2022-019","article-title":"Quantum optimization with lagrangian decomposition for multiple-process scheduling in steel manufacturing","volume":"62","author":"Yonaga","year":"2022","journal-title":"ISIJ Int"}],"container-title":["Frontiers in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fcomp.2023.1285962\/full","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T09:12:04Z","timestamp":1701940324000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fcomp.2023.1285962\/full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,7]]},"references-count":42,"alternative-id":["10.3389\/fcomp.2023.1285962"],"URL":"https:\/\/doi.org\/10.3389\/fcomp.2023.1285962","relation":{},"ISSN":["2624-9898"],"issn-type":[{"value":"2624-9898","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,7]]},"article-number":"1285962"}}