Quantum computing is a field with increasing relevance as quantum hardware improves and more applications of quantum computing are discovered. In this paper, we demonstrate the feasibility of modeling Ising Model Hamiltonians on the IBM quantum computer. We developed quantum circuits to simulate these systems more efficiently for both closed and open boundary Ising models, with and without perturbations. We tested these various geometries of systems in both 1-D and 2-D space to mimic two real systems: magnetic materials and biological neural networks (BNNs). Our quantum model is more efficient than classical computers, which can struggle to simulate large, complex systems of particles.
References
[1]
Bogobowicz, M., Gao, S., Masiowski, M., Mohr, N., Soller, N., Zemmel, R. and Zesko, M. (2023) Quantum Technology Sees Record Investments, Progress on Talent Gap. McKinsey Digital.
https://www.mckinsey.com/capabilities/mckinsey-digital/our-insights/quantum-technology-sees-record-investments-progress-on-talent-gap#/
[2]
Martonosi, M. and Roetteler, M. (2018) Next Steps in Quantum Computing: Computer Science’s Role. http://arxiv.org/abs/1903.10541
[3]
Gamble, S. (2018) Quantum Computing: What It Is, Why We Want It, and How We’re Trying to Get It. Frontiers of Engineering: Reports on Leading-Edge Engineering from the 2018 Symposium, 5-8.
https://nap.nationalacademies.org/read/25333/chapter/1
[4]
Bhatia, V. and Ramkumar, K. (2020) An Efficient Quantum Computing Technique for Cracking RSA Using Shor’s Algorithm. 2020 IEEE 5th International Conference on Computing Communication and Automation (ICCCA), Greater Noida, 30-31 October 2020, 89-94. https://doi.org/10.1109/ICCCA49541.2020.9250806
[5]
Li, J., Peng, X., Du, J. and Suter, D. (2012) An Efficient Exact Quantum Algorithm for the Integer Square-Free Decomposition Problem. Scientific Reports, 2, Article No. 260. https://doi.org/10.1038/srep00260
[6]
Brush, S. (1967) History of the Lenz-Ising Model. Reviews of Modern Physics, 39, 883-893. https://doi.org/10.1103/RevModPhys.39.883
[7]
Adelomou, A., Ribé, E. and Cardona, X. (2020) Formulation of the Social Workers’ Problem in Quadratic Unconstrained Binary Optimization Form and Solve It on a Quantum Computer. Journal of Computer and Communications, 8, 44-68.
https://doi.org/10.4236/jcc.2020.811004
[8]
Lima, F. (2022) Tax Evasion Dynamics via Ising Model Spin S = 1. Theoretical Economics Letters, 12, 400-410. https://doi.org/10.4236/tel.2022.122021
[9]
Singh, S. (2020) The Ising Model: Brief Introduction and Its Application. In: Sivasankaran, S., Nayak, P.K. and Günay, E., Eds., Metastable, Spintronics Materials and Mechanics of Deformable Bodies, IntechOpen, London, 19.
[10]
Obermeyer, J. (2020) The Ising Model in One and Two Dimensions. Seminar on Statistical Physics at the University of Heidelberg.
https://www.thphys.uni-heidelberg.de/~wolschin/statsem20_3s.pdf
[11]
Feiguin, A. (2009) Suzuki-Trotter Transformation and the Equivalent Classical System. Northeastern University, Boston.
https://web.northeastern.edu/afeiguin/phys5870/phys5870/node103.html
[12]
Zwerver, A.M.J., Krähenmann, T., Watson, T.F., Lampert, L., George, H.C., Pillarisetty, R., Bojarski, S.A., Amin, P., Amitonov, S.V., Boter, J.M., et al. (2009) Qubits Made by Advanced Semiconductor Manufacturing. Nature Electronics, 5, 184-190.
https://doi.org/10.1038/s41928-022-00727-9
[13]
IBM (2021) IBM Quantum Platform. https://quantum-computing.ibm.com/
[14]
Helmenstine, A. (2022) Paramagnetic vs Diamagnetic vs Ferromagnetic—Magnetism. Science Notes.
https://sciencenotes.org/paramagnetic-vs-diamagnetic-vs-ferromagnetic-magnetism
[15]
Jeffrey (2019) The Ising Model. https://stanford.edu/~jeffjar/statmech/intro4.html
Aleksandrowicz, G., Alexander, T., Barkoutsos, P., Bello, L., Ben-Halm, Y., Bucher, D., Cabrera-Hernández, F.J., Carballo-Franquis, J., Chen, A. and Chen, C. (2023) Qiskit: An Open-Source Framework for Quantum Computing.
[18]
Yang, X., Nie, X., Ji, Y., Xin, T., Lu, D. and Li, J. (2022) Improved Quantum Computing with Higher-Order Trotter Decomposition. Physical Review A, 106, Article ID: 042401. https://doi.org/10.1103/PhysRevA.106.042401
[19]
Cases, F., Murua, A. and Nadinic, M. (2012) Efficient Computation of the Zassenhaus Formula. Computer Physics Communications, 183, 2386-2391.
https://doi.org/10.1016/j.cpc.2012.06.006
[20]
Gould, H. and Tobochnik, J. (2009) Thermal and Statistical Physics.
https://press.princeton.edu/books/hardcover/9780691201894/statistical-and-thermal-physics
https://doi.org/10.1515/9781400837038
[21]
Bundy, A. and Wallen, L. (1984) Breadth-First Search. In: Bundy, A. and Wallen, L., Eds., Catalogue of Artificial Intelligence Tools, Springer, Berlin, 13.
https://doi.org/10.1007/978-3-642-96868-6_25
[22]
Clabaugh, C., Myszewski, D. and Pang, J. (2000) Neural Networks.
https://cs.stanford.edu/people/eroberts/courses/soco/projects/neural-networks/index.html
[23]
National Institute of Neurological Disorders and Stroke (n.d.) Brain Basics: The Life and Death of a Neuron.
https://www.ninds.nih.gov/health-information/public-education/brain-basics/brain-basics-life-and-death-neuron
[24]
Nordqvist, J. (2012) Surgical Errors Occur More than 4,000 Times a Year in the U.S. Medical News Today. https://www.medicalnewstoday.com/articles/254426#1
[25]
Nielson, M.A. and Chuang, I.L. (2010) Quantum Computation and Quantum Information. Cambridge University Press, Cambridge.
https://cds.cern.ch/record/465953/files/0521635039_TOC.pdf
