{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:56:52Z","timestamp":1760241412564,"version":"build-2065373602"},"reference-count":30,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2018,2,22]],"date-time":"2018-02-22T00:00:00Z","timestamp":1519257600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Hard problems have recently become an important issue in computing. Various methods, including a heuristic approach that is inspired by physical phenomena, are being explored. In this paper, we propose the use of simulated quantum annealing (SQA) to find a Hadamard matrix, which is itself a hard problem. We reformulate the problem as an energy minimization of spin vectors connected by a complete graph. The computation is conducted based on a path-integral Monte-Carlo (PIMC) SQA of the spin vector system, with an applied transverse magnetic field whose strength is decreased over time. In the numerical experiments, the proposed method is employed to find low-order Hadamard matrices, including the ones that cannot be constructed trivially by the Sylvester method. The scaling property of the method and the measurement of residual energy after a sufficiently large number of iterations show that SQA outperforms simulated annealing (SA) in solving this hard problem.<\/jats:p>","DOI":"10.3390\/e20020141","type":"journal-article","created":{"date-parts":[[2018,2,22]],"date-time":"2018-02-22T11:52:25Z","timestamp":1519300345000},"page":"141","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Finding a Hadamard Matrix by Simulated Quantum Annealing"],"prefix":"10.3390","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4785-4156","authenticated-orcid":false,"given":"Andriyan","family":"Suksmono","sequence":"first","affiliation":[{"name":"Telecommunication Engineering Scientific and Research Group (TESRG), School of Electrical Engineering and Informatics and The Research Center on Information and Communication Technology (PPTIK-ITB), Institut Teknologi Bandung, Jl. Ganesha No.10, Bandung 40132, Indonesia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,2,22]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.3389\/fphy.2014.00005","article-title":"Ising formulations of many NP problem","volume":"2","author":"Lucas","year":"2014","journal-title":"Front. Phys."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","article-title":"Equation of state calculations by fast computing machines","volume":"21","author":"Metropolis","year":"1953","journal-title":"J. Chem. Phys."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","article-title":"Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm","volume":"45","author":"Cerny","year":"1985","journal-title":"J. Optim. Theory Appl."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"5355","DOI":"10.1103\/PhysRevE.58.5355","article-title":"Quantum annealing in the transverse Ising model","volume":"58","author":"Kadowaki","year":"1988","journal-title":"Phys. Rev. E"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"2427","DOI":"10.1126\/science.1068774","article-title":"Theory of quantum annealing of an Ising spin glass","volume":"295","author":"Santoro","year":"2002","journal-title":"Science"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1038\/nphys2900","article-title":"Evidence for quantum annealing with more than one hundred qubits","volume":"10","author":"Boixo","year":"2014","journal-title":"Nat. Phys."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1126\/science.aaa4170","article-title":"Quantum versus classical annealing of Ising spin glasses","volume":"348","author":"Heim","year":"2015","journal-title":"Science"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1126\/science.1252319","article-title":"Defining and detecting quantum speedup","volume":"345","author":"Wang","year":"2014","journal-title":"Science"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"180402","DOI":"10.1103\/PhysRevLett.117.180402","article-title":"Understanding Quantum Tunneling through Quantum Monte Carlo Simulation","volume":"117","author":"Isakov","year":"2016","journal-title":"Phys. Rev. Lett."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"134305","DOI":"10.1103\/PhysRevB.96.134305","article-title":"Quantum Monte Carlo Tunneling from quantum chemistry to quantum annealing","volume":"96","author":"Mazzola","year":"2017","journal-title":"Phys. Rev. B"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Martonak, R., Santoro, G.E., and Tosatti, E. (2004). Quantum annealing of the traveling-salesman problem. Phys. Rev. E, 70.","DOI":"10.1103\/PhysRevE.70.057701"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/j.disopt.2010.12.001","article-title":"Quantum annealing of the graph coloring problem","volume":"8","author":"Titiloye","year":"2011","journal-title":"Discret. Optim."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"11168","DOI":"10.1038\/srep11168","article-title":"Experimental quantum annealing: Case study involving the graph isomorphism problem","volume":"5","author":"Zick","year":"2015","journal-title":"Sci. Rep."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"012012","DOI":"10.1088\/1742-6596\/856\/1\/012012","article-title":"Finding a Hadamard matrix by simulated annealing of spin-vectors","volume":"856","author":"Suksmono","year":"2012","journal-title":"J. Phys. Conf. Ser."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1454","DOI":"10.1143\/PTP.56.1454","article-title":"Relationship between d-dimensional quantal spin systems and (d+1)-dimensional Ising systems: Equivalence, critical exponents and systematic approximants of the partition function and spin correlations","volume":"56","author":"Suzuki","year":"1976","journal-title":"Prog. Theor. Phys."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1090\/S0002-9939-1959-0108732-6","article-title":"On the product of semi-groups of operators","volume":"10","author":"Trotter","year":"1959","journal-title":"Proc. Am. Math. Soc."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1080\/14786446708639914","article-title":"Thoughts on inverse orthogonal matrices, simultaneous sign successions, and tessellated pavements in two or more colours, with applications to Newton\u2019s Rule, ornamental tile-work, and the theory of numbers","volume":"34","author":"Sylvester","year":"1867","journal-title":"Lond. Edinb. Dublin Philos. Mag. J. Sci."},{"key":"ref_19","first-page":"240","article-title":"Resolution d\u2019une question relative aux determinants","volume":"17","author":"Hadamard","year":"1893","journal-title":"Bull. Sci. Math."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1214\/aos\/1176344370","article-title":"Hadamard Matrices and Their Applications","volume":"6","author":"Hedayat","year":"1978","journal-title":"Ann. Stat."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Horadam, K.J. (2007). Hadamard Matrices and Their Applications, Princeton University Press.","DOI":"10.1515\/9781400842902"},{"key":"ref_22","unstructured":"Garg, V. (2007). Wireless Communications and Networking, Morgan-Kaufman."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s00184-005-0415-y","article-title":"On some applications of Hadamard matrices","volume":"62","author":"Seberry","year":"2005","journal-title":"Metrika"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1002\/sapm1933121311","article-title":"On Orthogonal Matrices","volume":"12","author":"Paley","year":"1933","journal-title":"J. Math. Phys."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1307\/mmj\/1028998229","article-title":"The construction of Hadamard matrices","volume":"6","author":"Dade","year":"1959","journal-title":"Mich. Math. J."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1215\/S0012-7094-44-01108-7","article-title":"Hadamard\u2019s determinant theorem and the sum of four squares","volume":"11","author":"Williamson","year":"1944","journal-title":"Duke Math. J."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/0097-3165(71)90005-7","article-title":"Unbalanced Hadamard matrices and finite projective planes of even order","volume":"11","author":"Bush","year":"1971","journal-title":"J. Comb. Theory Ser. A"},{"key":"ref_28","unstructured":"Bush, K.A. (1971). Atti del Convegno di Geometria Combinatoria e sue Applicazioni, University Perugia."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/0097-3165(76)90062-5","article-title":"On the existence of Hadamard matrices","volume":"21","author":"Wallis","year":"1976","journal-title":"J. Comb. Theory A"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"066707","DOI":"10.1103\/PhysRevE.71.066707","article-title":"Optimization by quantum annealing: Lessons from hard satisfiability problems","volume":"71","author":"Battaglia","year":"2005","journal-title":"Phys. Rev. E"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/20\/2\/141\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T14:55:54Z","timestamp":1760194554000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/20\/2\/141"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,22]]},"references-count":30,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2018,2]]}},"alternative-id":["e20020141"],"URL":"https:\/\/doi.org\/10.3390\/e20020141","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2018,2,22]]}}}