Skip to main content
Log in

The set partitioning problem in a quantum context

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

The set partitioning problem and its decision variant (i.e., the exact cover problem) are combinatorial optimization problems that were historically crucial in the quantum optimization community. This problem is also employed in the main problem of the branch-and-price approach in many real-world optimization problems, including, but not limited to, redistricting and scheduling. Motivated by recent claims on the capability of quantum computers in “solving” hard combinatorial optimization problems, we propose a quadratic unconstrained binary optimization (\({\text {QUBO}}\)) formulation for the set partitioning problem with penalty coefficients that are at least as tight as the existing naive ones. We also employ five reduction techniques of Garfinkel and Nemhauser (Operations Research 17(5):848–856, 1969) to reduce the size of an existing set of benchmark instances. We finally use variational quantum eigensolver (\({\text {VQE}}\)) as a heuristic to find feasible solutions for the problem. Our computational experiments show the efficacy of employing the proposed penalty coefficients and the existing classical reduction techniques in the quantum context. Our codes and data are available on GitHub.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

Notes

  1. The goal of demonstrating that a quantum computer with a tailored quantum algorithm can efficiently perform a task that its classical counterparts cannot.

  2. Here, index gs stands for ground state.

References

  1. Alidaee, B., Kochenberger, G., Lewis, K., Lewis, M., Wang, H.: A new approach for modeling and solving set packing problems. Eur. J. Oper. Res. 186(2), 504–512 (2008)

    Article  MathSciNet  Google Scholar 

  2. Balinski, M.L., Quandt, R.E.: On an integer program for a delivery problem. Oper. Res. 12(2), 300–304 (1964)

    Article  Google Scholar 

  3. Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., Preda, D.: A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem. Science 292(5516), 472–475 (2001)

    Article  MathSciNet  Google Scholar 

  4. Farhi, E., Gutmann, S.: Quantum computation and decision trees. Phys. Rev. A 58(2), 915 (1998)

    Article  MathSciNet  Google Scholar 

  5. Garey, M.R., Johnson, D.S.: Computers and intractability, vol. 174. Freeman San Francisco (1979)

  6. Garfinkel, R.S., Nemhauser, G.L.: The set-partitioning problem: set covering with equality constraints. Oper. Res. 17(5), 848–856 (1969)

    Article  Google Scholar 

  7. Glover, F., Kochenberger, G., Hennig, R., Du, Y.: Quantum bridge analytics I: a tutorial on formulating and using qubo models. Ann. Oper. Res. pp. 1–43 (2022)

  8. Kolner, T.: Some highlights of a scheduling matrix generator system. In: United Airlines, presented at the Sixth AGIFORS Symposium (1966)

  9. Lewis, M., Kochenberger, G., Alidaee, B.: A new modeling and solution approach for the set-partitioning problem. Comput. Oper. Res. 35(3), 807–813 (2008)

    Article  MathSciNet  Google Scholar 

  10. Nannicini, G.: Performance of hybrid quantum-classical variational heuristics for combinatorial optimization. Phys. Rev. E 99, 013304 (2019). https://doi.org/10.1103/PhysRevE.99.013304

    Article  Google Scholar 

  11. Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.H., Zhou, X.Q., Love, P.J., Aspuru-Guzik, A., O’Brien, J.L.: A variational eigenvalue solver on a photonic quantum processor. Nat. Commun. 5, 4213 (2014)

    Article  Google Scholar 

  12. Punnen, A.P.: The quadratic unconstrained binary optimization problem. Springer, Tech. rep. (2022)

    Book  Google Scholar 

  13. Svensson, M., Andersson, M., Grönkvist, M., Vikstål, P., Dubhashi, D., Ferrini, G., Johansson, G.: A hybrid quantum-classical heuristic to solve large-scale integer linear programs. arXiv preprint arXiv:2103.15433 (2021)

  14. tA v, A., ANIS, M.S., Abby-Mitchell, Abraham, H., AduOffei, Agarwal, R., Agliardi, G., Aharoni, M., Ajith, V., Akhalwaya, I.Y., Aleksandrowicz, G., Alexander, T., Amy, M., Anagolum, S., Anthony-Gandon, Araujo, I.F., Arbel, E., Asfaw, A., Ashimine, I.E., Athalye, A., Avkhadiev, A., Azaustre, C., BHOLE, P., Bajpe, V., Banerjee, A., Banerjee, S., Bang, W., Bansal, A., Barkoutsos, P., Barnawal, A., Barron, G., Barron, G.S., Bello, L., Ben-Haim, Y., Bennett, M.C., Bevenius, D., Bhatnagar, D., Bhatnagar, P., Bhobe, A., Bianchini, P., Bishop, L.S., Blank, C., Bolos, S., Bopardikar, S., Bosch, S., Brandhofer, S., Brandon, Bravyi, S., Bryce-Fuller, Bucher, D., Burgholzer, L., Burov, A., Cabrera, F., Calpin, P., Capelluto, L., Carballo, J., Carrascal, G., Carriker, A., Carvalho, I., Chakrabarti, R., Chen, A., Chen, C.F., Chen, E., Chen, J.C., Chen, R., Chevallier, F., Chinda, K., Cholarajan, R., Chow, J.M., Churchill, S., CisterMoke, Claus, C., Clauss, C., Clothier, C., Cocking, R., Cocuzzo, R., Connor, J., Correa, F., Crockett, Z., Cross, A.J., Cross, A.W., Cross, S., Cruz-Benito, J., Culver, C., Córcoles-Gonzales, A.D., D, N., Dague, S., Dandachi, T.E., Dangwal, A.N., Daniel, J., DanielAja, Daniels, M., Dartiailh, M., Davila, A.R., Debouni, F., Dekusar, A., Deshmukh, A., Deshpande, M., Ding, D., Doi, J., Dow, E.M., Downing, P., Drechsler, E., Drudis, M.S., Dumitrescu, E., Dumon, K., Duran, I., EL-Safty, K., Eastman, E., Eberle, G., Ebrahimi, A., Eendebak, P., Egger, D., EgrettaThula, ElePT, Elsayed, I., Emilio, Espiricueta, A., Everitt, M., Facoetti, D., Farida, Fernández, P.M., Ferracin, S., Ferrari, D., Ferrera, A.H., Fouilland, R., Frisch, A., Fuhrer, A., Fuller, B., GEORGE, M., Gacon, J., Gago, B.G., Gambella, C., Gambetta, J.M., Gammanpila, A., Garcia, L., Garg, T., Garion, S., Garrison, J.R., Garrison, J., Gates, T., Gavrielov, N., Gentinetta, G., Georgiev, H., Gil, L., Gilliam, A., Giridharan, A., Glen, Gomez-Mosquera, J., Gonzalo, de la Puente González, S., Gorzinski, J., Gould, I., Greenberg, D., Grinko, D., Guan, W., Guijo, D., Guillermo-Mijares-Vilarino, Gunnels, J.A., Gupta, H., Gupta, N., Günther, J.M., Haglund, M., Haide, I., Hamamura, I., Hamido, O.C., Harkins, F., Hartman, K., Hasan, A., Havlicek, V., Hellmers, J., Herok, Ł., Hill, R., Hillmich, S., Hincks, I., Hong, C., Horii, H., Howington, C., Hu, S., Hu, W., Huang, C.H., Huang, J., Huisman, R., Imai, H., Imamichi, T., Ishizaki, K., Ishwor, Iten, R., Itoko, T., Ivrii, A., Javadi, A., Javadi-Abhari, A., Javed, W., Jianhua, Q., Jivrajani, M., Johns, K., Johnstun, S., Jonathan-Shoemaker, JosDenmark, JoshDumo, Judge, J., Kachmann, T., Kale, A., Kanazawa, N., Kane, J., Kang-Bae, Kapila, A., Karazeev, A., Kassebaum, P., Kato, T., Kehrer, T., Kelso, J., Kelso, S., van Kemenade, H., Khanderao, V., King, S., Kobayashi, Y., Kovi11Day, Kovyrshin, A., Krishna, J., Krishnakumar, R., Krishnamurthy, P., Krishnan, V., Krsulich, K., Kumkar, P., Kus, G., LNoorl, LaRose, R., Lacal, E., Lambert, R., Landa, H., Lapeyre, J., Lasecki, D., Latone, J., Lawrence, S., Lee, C., Li, G., Liang, T.J., Lishman, J., Liu, D., Liu, P., Lolcroc, M, A.K., Madden, L., Maeng, Y., Maheshkar, S., Majmudar, K., Malyshev, A., Mandouh, M.E., Manela, J., Manjula, Marecek, J., Marques, M., Marwaha, K., Maslov, D., Maszota, P., Mathews, D., Matsuo, A., Mazhandu, F., McClure, D., McElaney, M., McElroy, J., McGarry, C., McKay, D., McPherson, D., Meesala, S., Meirom, D., Mendell, C., Metcalfe, T., Mevissen, M., Meyer, A., Mezzacapo, A., Midha, R., Millar, D., Miller, D., Miller, H., Minev, Z., Mitchell, A., Mohammad, A., Moll, N., Montanez, A., Monteiro, G., Mooring, M.D., Morales, R., Moran, N., Morcuende, D., Mostafa, S., Motta, M., Moyard, R., Murali, P., Murata, D., Müggenburg, J., NEMOZ, T., Nadlinger, D., Nakanishi, K., Nannicini, G., Nation, P., Navarro, E., Naveh, Y., Neagle, S.W., Neuweiler, P., Ngoueya, A., Nguyen, T., Nicander, J., Nick-Singstock, Niroula, P., Norlen, H., NuoWenLei, O’Riordan, L.J., Ogunbayo, O., Ollitrault, P., Onodera, T., Otaolea, R., Oud, S., Padilha, D., Paik, H., Pal, S., Pang, Y., Panigrahi, A., Pascuzzi, V.R., Perriello, S., Peterson, E., Phan, A., Pilch, K., Piro, F., Pistoia, M., Piveteau, C., Plewa, J., Pocreau, P., Possel, C., Pozas-Kerstjens, A., Pracht, R., Prokop, M., Prutyanov, V., Puri, S., Puzzuoli, D., Pythonix, Pérez, J., Quant02, Quintiii, Rahman, R.I., Raja, A., Rajeev, R., Rajput, I., Ramagiri, N., Rao, A., Raymond, R., Reardon-Smith, O., Redondo, R.M.C., Reuter, M., Rice, J., Riedemann, M., Rietesh, Risinger, D., Rivero, P., Rocca, M.L., Rodríguez, D.M., RohithKarur, Rosand, B., Rossmannek, M., Ryu, M., SAPV, T., Sa, N.R.C., Saha, A., Ash-Saki, A., Salman, A., Sanand, S., Sandberg, M., Sandesara, H., Sapra, R., Sargsyan, H., Sarkar, A., Sathaye, N., Savola, N., Schmitt, B., Schnabel, C., Schoenfeld, Z., Scholten, T.L., Schoute, E., Schuhmacher, J., Schulterbrandt, M., Schwarm, J., Schweigert, P., Seaward, J., Sergi, Serrano, D.E., Sertage, I.F., Setia, K., Shah, F., Shammah, N., Shanks, W., Sharma, R., Shaw, P., Shi, Y., Shoemaker, J., Silva, A., Simonetto, A., Singh, D., Singh, D., Singh, P., Singkanipa, P., Siraichi, Y., Siri, Sistos, J., Sistos, J., Sitdikov, I., Sivarajah, S., Slavikmew, Sletfjerding, M.B., Smolin, J.A., Soeken, M., Sokolov, I.O., Sokolov, I., Soloviev, V.P., SooluThomas, Starfish, Steenken, D., Stypulkoski, M., Suau, A., Sun, S., Sung, K.J., Suwama, M., Słowik, O., Taeja, R., Takahashi, H., Takawale, T., Tavernelli, I., Taylor, C., Taylour, P., Thomas, S., Tian, K., Tillet, M., Tod, M., Tomasik, M., Tornow, C., de la Torre, E., Toural, J.L.S., Trabing, K., Treinish, M., Trenev, D., TrishaPe, Truger, F., TsafrirA, Tsilimigkounakis, G., Tsuoka, K., Tulsi, D., Tuna, D., Turner, W., Vaknin, Y., Valcarce, C.R., Varchon, F., Vartak, A., Vazquez, A.C., Vijaywargiya, P., Villar, V., Vishnu, B., Vogt-Lee, D., Vuillot, C., WQ, Weaver, J., Weidenfeller, J., Wieczorek, R., Wildstrom, J.A., Wilson, J., Winston, E., WinterSoldier, Woehr, J.J., Woerner, S., Woo, R., Wood, C.J., Wood, R., Wood, S., Wootton, J., Wright, M., Xing, L., YU, J., Yaiza, Yang, B., Yang, U., Yao, J., Yeralin, D., Yonekura, R., Yonge-Mallo, D., Yoshida, R., Young, R., Yu, J., Yu, L., Yuma-Nakamura, Zachow, C., Zdanski, L., Zhang, H., Zheltonozhskii, E., Zidaru, I., Zimmermann, B., Zindorf, B., Zoufal, C., a matsuo, aeddins ibm, alexzhang13, b63, bartek bartlomiej, bcamorrison, brandhsn, nick bronn, chetmurthy, choerst ibm, comet, dalin27, deeplokhande, dekel.meirom, derwind, dime10, ehchen, ewinston, fanizzamarco, fs1132429, gadial, galeinston, georgezhou20, georgios ts, gruu, hhorii, hhyap, hykavitha, itoko, jeppevinkel, jessica angel7, jezerjojo14, jliu45, johannesgreiner, jscott2, kUmezawa, klinvill, krutik2966, ma5x, michelle4654, msuwama, nico lgrs, nrhawkins, ntgiwsvp, ordmoj, sagar pahwa, pritamsinha2304, rithikaadiga, ryancocuzzo, saktar unr, saswati qiskit, sebastian mair, septembrr, sethmerkel, sg495, shaashwat, smturro2, sternparky, strickroman, tigerjack, tsura crisaldo, upsideon, vadebayo49, welien, willhbang, wmurphy collabstar, yang.luh, yuri@FreeBSD, Čepulkovskis, M.: Qiskit: An open-source framework for quantum computing (2021). https://doi.org/10.5281/zenodo.2573505

  15. Vikstål, P., Grönkvist, M., Svensson, M., Andersson, M., Johansson, G., Ferrini, G.: Applying the quantum approximate optimization algorithm to the tail-assignment problem. Phys. Rev. Appl. 14(3), 034009 (2020)

    Article  Google Scholar 

  16. Young, A., Knysh, S., Smelyanskiy, V.: Size dependence of the minimum excitation gap in the quantum adiabatic algorithm. Phys. Rev. Lett. 101(17), 170503 (2008)

    Article  Google Scholar 

  17. Young, A., Knysh, S., Smelyanskiy, V.: First-order phase transition in the quantum adiabatic algorithm. Phys. Rev. Lett. 104(2), 020502 (2010)

    Article  Google Scholar 

Download references

Acknowledgements

The authors acknowledge the High Performance Computing Center (HPCC) at Texas Tech University for providing computational resources that have contributed to the research results reported within this paper. The authors thank the anonymous reviewer for helpful comments.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hamidreza Validi.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

This paper is dedicated to the memory of our coauthor, Ismael R. de Farias Jr., who sadly passed away on Wednesday, August 3rd, 2022.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Cacao, R., Cortez, L.R.C.T., Forner, J. et al. The set partitioning problem in a quantum context. Optim Lett 18, 1–17 (2024). https://doi.org/10.1007/s11590-023-02029-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-023-02029-1

Keywords

Navigation