References
- C.H. Papadimitriou, K. Steiglitz (1998). Combinatorial Optimization: Algorithms and Complexity. Dover Publications.
- B.H. Korte, J. Vygen, B. Korte, and J. Vygen (2011). Combinatorial Optimization, Volume 1. Springer.
- T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein (2022). Introduction to Algorithms. MIT Press.
- F. Glover, G. Kochenberger, R. Hennig, and Y. Du (2022). “Quantum bridge analytics I: a tutorial on formulating and using QUBO models.” Annals of Operations Research, 314: 1, 141–183.
- A. P. Punnen, ed. (2022). The Quadratic Unconstrained Binary Optimization Problem. Springer Cham.
- F. Barahona (1982). “On the computational complexity of Ising spin glass models.” Journal of Physics A: Mathematical and General, 15: 10, 3241.
- A. Abbas, A. Ambainis, B. Augustino, A. Bärtschi, H. Buhrman, C. Coffrin, G. Cortiana, V. Dunjko, D. J. Egger, B. G. Elmegreen, N. Franco, F. Fratini, B. Fuller, J. Gacon, C. Gonciulea, S. Gribling, S. Gupta, S. Hadfield, R. Heese, G.-h. Kircher, T. Kleinert, T. Koch, G. Korpas, S. Lenk, J. Marecek, V. Markov, G. Mazzola, S. Mensa, N. Mohseni, G. Nannicini, C. O’Meara, E. P. Tapia, S. Pokutta, M. Proissl, P. Rebentrost, E. Sahin, B. C. B. Symons, S. Tornow, V. Valls, S. Woerner, M. L. Wolf-Bauwens, J. Yard, S. Yarkoni, D. Zechiel, S. Zhuk, and C. Zoufal. (2024) “Challenges and opportunities in quantum optimization.” Nature Reviews Physics, 6: 12, 718–735.
- A. Lucas (2014). “Ising formulations of many NP problems.” Frontiers in Physics, 2.
- N. Mohseni, P. L. McMahon, and T. Byrnes (2022). “Ising machines as hardware solvers of combinatorial optimization problems.” Nature Reviews Physics, 4: 6, 363–379.
- A. Das and B. K. Chakrabarti (2008). “Colloquium: Quantum annealing and analog quantum computation.” Reviews of Modern Physics 80, 1061–1081.
- A. B. Finnila, M. A Gomez, C Sebenik, C. Stenson, J. D. Doll. (1994). “Quantum annealing: A new method for minimizing multidimensional functions.” Chemical Physics Letters, 219:5-6, 343–348.
- T. Kadowaki and H. Nishimori (1998). “Quantum annealing in the transverse Ising model.” Physical Review E, 58, 5355–5363.
- E. Farhi, J. Goldstone, and S. Gutmann. “A quantum approximate optimization algorithm.” arXiv preprint arXiv:1411.4028, 2014.
- S. Hadfield, Z. Wang, B. O’gorman, E. G. Rieffel, D. Venturelli, and R. Biswas. (2019). “From the quantum approximate optimization algorithm to a quantum alternating operator ansatz.” Algorithms, 12: 2, 34.
- The D-wave Advantage system: An overview. Available at: https://www.dwavequantum.com/media/s3qbjp3s/14-1049a-a_the_d-wave_advantage_system_an_overview.pdf (Accessed on 1 September 2024).
- K. Blekos, D. Brand, A. Ceschini, C.-H. Chou, R.-H. Li, K. Pandya, and A. Summer (2024). “A review on quantum approximate optimization algorithm and its variants.” Physics Reports, 1068, 1–66.
- G. Pagano, A. Bapat, P. Becker, K. S. Collins, A. De, P. W. Hess, H. B. Kaplan, A. Kyprianidis, W. L. Tan, C. Baldwin, et al. (2020). “Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator.” Proceedings of the National Academy of Sciences, 117: 41, 25396–25401.
- Y. Du, H. Wang, R. Hennig, A. Hulandageri, G. Kochenberger, and F. Glover. (2025). “New advances for quantum-inspired optimization.” International Transactions in Operational Research, 32: 1, 6–17.
- T. Hao, X. Huang, C. Jia, and C. Peng. (2022). “A quantum-inspired tensor network algorithm for constrained combinatorial optimization problems.” Frontiers in Physics, 10.
- L. Huynh, J. Hong, A. Mian, H. Suzuki, Y. Wu, and S. Camtepe. (2023). “Quantum-inspired ma-chine learning: a survey.” arXiv preprint arXiv:2308.11269.
- S. Mugel, C. Kuchkovsky, E. Sánchez, S. Fernández-Lorenzo, J. Luis-Hita, E. Lizaso, and R. Orús. (2022). “Dynamic portfolio optimization with real datasets using quantum processors and quantum-inspired tensor networks.” Physics Review Research, 4, 013006.
- S. Mücke. (2024). “A simple QUBO formulation of sudoku.” In Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO ’24 Companion, pp. 1958–1962, New York, NY. Association for Computing Machinery.
- F. Verstraete, V. Murg, and J. I. Cirac. (2008). “Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems.” Advances in Physics, 57: 2, 143–224.
- U. Schollwöck (2005). “The density-matrix renormalization group.” Reviews of Modern Physics, 77, 259–315.
- S. R. White. (1992). “Density matrix formulation for quantum renormalization groups.” Physical Review Letters, 69, 2863–2866.
- R. Orús. (2014). “A practical introduction to tensor networks: Matrix product states and projected entangled pair states.” Annals of Physics, 349, 117–158.
- T. Yato and T. Seta. (2003). “Complexity and completeness of finding another solution and its application to puzzles.” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 86: 5, 1052–1060.
- N. Ueda and T. Nagao. (1996). “NP-completeness results for NONOGRAM via parsimonious reductions.” Technical Report TR96-0008, Department of Computer Science, Tokyo Institute of Technology.
- D. Sherrington and S. Kirkpatrick. (1975). “Solvable model of a spin-glass.” Physical Review Letters, 35, 17921796.
- J. Vannimenus and G Toulouse. (1977). “Theory of the frustration effect. II. Ising spins on a square lattice.” Journal of Physics C: Solid State Physics, 10: 18, L537.
- S.Patra, S. Singh, and R. Orús. (2025). “Projected entangled pair states with flexible geometry.” Physical Review Research, 7, L012002.
- M. Fishman, S. R. White, and E. M. Stoudenmire. (2022). “The ITensor Software Library for tensor network calculations.” SciPost Physics Codebases, 4.
- R. Martoňák, G. E. Santoro, and E. Tosatti. (2002). “Quantum annealing by the path-integral Monte Carlo method: The two-dimensional random Ising model.” Physical Review B, 66, 094203.
- G. E. Santoro, R. Martonak, E. Tosatti, and R. Car. (2002). “Theory of quantum annealing of an Ising spin glass.” Science, 295: 5564, 2427–2430.
- Available at: https://www.nytimes.com/puzzles/sudoku (Accessed on 1 September 2024).
- Available at: https://nytsudoku.net (Accessed on 1 September 2024).
- R. M. Karp. (1972). Reducibility among Combinatorial Problems, pp. 85–103. Boston, MA: Springer US.
- F. Barahona, M. Grötschel, M. Jünger, and G. Reinelt. (1988). “An application of combinatorial optimization to statistical physics and circuit layout design.” Operations Research, 36: 3, 493–513.
- Available at: https://biqmac.aau.at/(Accessed on 1 September 2024).
- Available at: http://bqp.cs.uni-bonn.de/library/html/instances.html (Accessed on 1 September 2024).
- Available at: https://people.brunel.ac.uk/~mastjjb/jeb/info.html (Accessed on 1 September 2024).
- Available at: https://web.stanford.edu/~yyye/yyye/Gset/(Accessed on 1 September 2024).
- Y. Kim, A. Eddins, S. Anand, K. X. Wei, E. van den Berg, S. Rosenblatt, H. Nayfeh, Y. Wu, M. Zaletel, K. Temme, and A. Kandala. (2023). “Evidence for the utility of quantum computing before fault tolerance.” Nature, 618: 7965, 500–505.
- J. Tindall, M. Fishman, E. M. Stoudenmire, and D. Sels. (2024). “Efficient tensor network simulation of IBM’s Eagle kicked Ising experiment.” PRX Quantum, 5, 010308.
- M. Streif and M. Leib. (2020). “Training the quantum approximate optimization algorithm without access to a quantum processing unit.” Quantum Science and Technology, 5: 3, 034008.
- I. A. Luchnikov, E. S. Tiunov, T. Haug, and L. Aolita. (2024). “Large-scale quantum annealing simulation with tensor networks and belief propagation.” arXiv preprint arXiv:2409.12240.
- A. Bou-Comas, M. P3odzieñ, L. Tagliacozzo, and J. J. García-Ripoll (2025). “Quantics Tensor Train for solving Gross-Pitaevskii equation.” arXiv preprint arXiv:2507.03134.
- Q.-C. Chen, I.-K. Liu, J.-W. Li, and C.-M. Chung. (2025). “Solving the Gross-Pitaevskii equation with quantic tensor trains: ground states and nonlinear dynamics.” arXiv preprint arXiv:2507.04279.
- R. J. J. Connor, C. W. Duncan, and A. J. Daley. (2025). “Tensor network methods for the Gross-Pitaevskii equation on fine grids.” arXiv preprint arXiv:2507.01149.
- M. Niedermeier, A. Moulinas, T. Louvet, J. L. Lado, and X. Waintal. (2025). “Solving the Gross-Pitaevskii equation on multiple different scales using the quantics tensor train representation.” arXiv preprint arXiv:2507.04262.
- G. M. Crosswhite and D. Bacon (2008). “Finite automata for caching in matrix product algorithms.” Physical Review A, 78, 012356.
- I. Arad, A. Kitaev, Z. Landau, and U. Vazirani. (2013). “An area law and sub-exponential algorithm for 1D systems.” arXiv preprint arXiv: 1301.1162.
- M. B. Hastings. (2007). “An area law for one-dimensional quantum systems.” Journal of Statistical Mechanics: Theory and Experiment 2007: 08, P08024.
- A. Kay. (2007). “Quantum-Merlin-Arthur-complete translationally invariant Hamiltonian problem and the complexity of finding ground-state energies in physical systems.” Physical Review A, 76, 030307.
- N. Schuch, M.M. Wolf, F. Verstraete, and J. I. Cirac. (2008). “Entropy scaling and simulability by matrix product states.” Physical Review Letters, 100, 030504.
- F. Verstraete and J. I. Cirac. (2006). “Matrix product states represent ground states faithfully.” Physical Review B, 73, 094423.
- T. Kuwahara and K. Saito (2020). ”Area law of noncritical ground states in 1D long-range interacting systems.” Nature Communications, 11: 1, 4478.