SpringerLink
Log in

Applications of Quantum Annealing to Music Theory

  • Chapter
  • First Online:
Quantum Computer Music

Abstract

With the emergence of quantum computers, a new field of algorithmic music composition has been initiated. The vast majority of previous work focuses on music generation using gate-based quantum computers. An alternative model of computation is adiabatic quantum computing (AQC), and a heuristic algorithm known as quantum annealing running in the framework of AQC is a promising method for solving optimization problems. In this chapter, we lay the groundwork for music composition using quantum annealing. We approach the process of music composition as an optimization problem. We describe the fundamental methodologies needed for generating different aspects of music including melody, rhythm, and harmony. The discussed techniques are illustrated through examples to ease the understanding. The music pieces generated using D-Wave’s quantum annealers are among the first examples of their kind and presented within the scope of the chapter.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
EUR 29.95
Price includes VAT (Germany)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 160.49
Price includes VAT (Germany)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 213.99
Price includes VAT (Germany)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info
Hardcover Book
EUR 213.99
Price includes VAT (Germany)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    D-Wave is the company that produces publicly available quantum annealers. https://www.dwavesys.com/.

  2. 2.

    Although there are more clever methods than trying all the routes one by one, the best known exact algorithm has still exponential time complexity.

  3. 3.

    In the original text, the set is taken as \(\{c,d,e,f,g,a,b,C\}\) where C denotes the note one octave above c.

References

  1. Lovelace, A. A. (1843). Sketch of the analytical engine invented by Charles Babbage by LF Menabrea of Turin, officer of the military engineers, with notes by the translator. Bibliotheque Universelle de Geneve.

    Google Scholar 

  2. Hiller, L. A., & Isaacson, L. M. (1979). Experimental music; composition with an electronic computer. Greenwood Publishing Group Inc..

    Google Scholar 

  3. Papadopoulos, G., & Wiggins, G. (1999). AI methods for algorithmic composition: A survey, a critical view and future prospects. In AISB Symposium on Musical Creativity (Vol. 124, pp. 110–117).

    Google Scholar 

  4. Miranda, E. R. (2020). Quantum computer: Hello, music! ar**v:2006.13849.

  5. Kirke, A. (2018). Programming gate-based hardware quantum computers for music. Musicology, 24, 21–37.

    Google Scholar 

  6. Kirke, A. (2019). Applying quantum hardware to non-scientific problems: Grover’s algorithm and rule-based algorithmic music composition. ar**v:1902.04237.

  7. Aharonov, D., Van Dam, W., Kempe, J., Landau, Z., Lloyd, S., & Regev, O. (2008). Adiabatic quantum computation is equivalent to standard quantum computation. SIAM Review, 50(4), 755–787.

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Kirke, A., & Miranda, E. R. (2017). Experiments in sound and music quantum computing. In Guide to Unconventional Computing for Music (pp. 121–157). Springer.

    Google Scholar 

  10. Doornbusch, P. (2017). Early computer music experiments in Australia and England. Organised Sound, 22(2), 297–307.

    Article  Google Scholar 

  11. Bogdanov, V., Woodstra, C., Bush, J., & Erlewine, S. T. (2001). All music guide to electronica: The definitive guide to electronic music. CMP Media.

    Google Scholar 

  12. Manning, P. (2013). Electronic and computer music. Oxford University Press.

    Google Scholar 

  13. Short history of computer music. http://artsites.ucsc.edu/EMS/Music/equipment/computers/history/history.html. Accessed 15 Dec. 2021.

  14. Miranda, E. (2001). Composing music with computers. CRC Press.

    Google Scholar 

  15. Manaris, B., Roos, P., Machado, P., Krehbiel, D., Pellicoro, L., & Romero, J. (2007). A corpus-based hybrid approach to music analysis and composition. In Proceedings of the National Conference on Artificial Intelligence (Vol. 22, p. 839).

    Google Scholar 

  16. Funk, T. (2016). Zen and the art of software performance: John Cage and Lejaren A. Hiller Jr.’s HPSCHD (1967–1969). Ph.D. thesis. University of Illinois at Chicago.

    Google Scholar 

  17. Conklin, D. (2003). Music generation from statistical models. In Proceedings of the AISB 2003 Symposium on Artificial Intelligence and Creativity in the Arts and Sciences (pp. 30–35).

    Google Scholar 

  18. Apt, K. (2003). Principles of constraint programming. Cambridge University Press.

    Google Scholar 

  19. Van Beek, P., & Chen, X. (1999). CPlan: A constraint programming approach to planning. In AAAI/IAAI (pp. 585–590).

    Google Scholar 

  20. Truchet, C., Agon, C., & Codognet, P. (2001). A constraint programming system for music composition, preliminary results. In In the Seventh International Conference on Principles and Practice of Constraint Programming, Musical Constraints Workshop, Paphos.

    Google Scholar 

  21. Anders, T. (2018). Compositions created with constraint programming. In R. T. Dean & A. McLean (Eds.), The Oxford handbook of algorithmic music (ch. 10). Oxford University Press.

    Google Scholar 

  22. Biles, J. A. (2007). Evolutionary computation for musical tasks. In J. A. Biles & E. R. Miranda (Eds.), Evolutionary computer music. Springer.

    Google Scholar 

  23. Horner, A., & Goldberg, D. E. (1991). Genetic algorithms and computer-assisted music composition (Vol. 51). Michigan Publishing, University of Michigan Library.

    Google Scholar 

  24. Gibson, P., & Byrne, J. (1991). NEUROGEN, musical composition using genetic algorithms and cooperating neural networks. In 1991 Second International Conference on Artificial Neural Networks (pp. 309–313).

    Google Scholar 

  25. Spector, L., & Alpern, A. (1995). Induction and recapitulation of deep musical structure. Proceedings of International Joint Conference on Artificial Intelligence, IJCAI, 95, 20–25.

    Google Scholar 

  26. Samadani, R., & Zhang, T. (2007). Music Genie: Interactive, content-based browsing of music based on thumbnail playback. Tech. Rep. HPL-2007-38, HP Laboratories.

    Google Scholar 

  27. Todd, P. (1988). A sequential network design for musical applications. In Proceedings of the 1988 Connectionist Models Summer School (pp. 76–84).

    Google Scholar 

  28. Marinescu, A.-I. (2019). Bach 2.0—Generating classical music using recurrent neural networks. Procedia Computer Science, 159, 117–124.

    Article  Google Scholar 

  29. Kotecha, N., & Young, P. (2018). Generating music using an LSTM network. ar**v:1804.07300.

  30. Briot, J.-P., Hadjeres, G., & Pachet, F.-D. (2020). Deep learning techniques for music generation (Vol. 1). Springer.

    Google Scholar 

  31. Payne, C. (2019). Musenet. https://openai.com/blog/musenet/. Accessed 15 Dec. 2021.

  32. Park, S.-W., Ko, J.-S., Huh, J.-H., & Kim, J.-C. (2021). Review on generative adversarial networks: Focusing on computer vision and its applications. Electronics, 10(10), 1216.

    Article  Google Scholar 

  33. Tanaka, T., Bemman, B., & Meredith, D. (2016). Integer programming formulation of the problem of generating milton babbitt’s all-partition arrays. In The 17th International Society for Music Information Retrieval Conference.

    Google Scholar 

  34. Cunha, N. d. S., Subramanian, A., & Herremans, D. (2018). Generating guitar solos by integer programming. Journal of the Operational Research Society, 69(6), 971–985.

    Google Scholar 

  35. Conforti, M., Cornuéjols, G., Zambelli, G., et al. (2014). Integer programming (Vol. 271). Springer.

    Google Scholar 

  36. Glover, F. (1990). Tabu search-part II. ORSA Journal on Computing, 2(1), 4–32.

    Article  MATH  Google Scholar 

  37. Harvey, C. A. D. K., Salkin, M. (1975). The Knapsack problem: A survey. Naval Research Logistics, 22, 127–144.

    Google Scholar 

  38. David, V. C., Applegate, L., Bixby, R. E., & Cook, W. J. (2007). The traveling salesman problem: A computational study. Princeton University Press.

    Google Scholar 

  39. Tommy, B. T., Jensen, R. (1994). Graph coloring problems. Wiley-Interscience.

    Google Scholar 

  40. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability (Vol. 174).

    Google Scholar 

  41. Kelley, J. J. E. (1960). The cutting-plane method for solving convex programs. Journal of the Society for Industrial and Applied Mathematics, 8, 703–712.

    Article  MathSciNet  MATH  Google Scholar 

  42. Lawler, D. E. W. E. L. (1966). Branch-and-bound methods: A survey. Operations Research, 14, 699–719.

    Article  MathSciNet  MATH  Google Scholar 

  43. Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598), 671–680.

    Article  MathSciNet  MATH  Google Scholar 

  44. Dorigo, M., Birattari, M., & Stutzle, T. (2006). Ant colony optimization. IEEE Computational Intelligence Magazine, 1, 28–39.

    Google Scholar 

  45. Lucas, A. (2014). Ising formulations of many NP problems. Frontiers in Physics, 2, 5.

    Article  Google Scholar 

  46. Karimi, S., & Ronagh, P. (2019). Practical integer-to-binary map** for quantum annealers. Quantum Information Processing, 18(4), 1–24.

    Article  MathSciNet  MATH  Google Scholar 

  47. Geoffrion, A. M. (2010). Lagrangian relaxation for integer programming. In 50 years of integer programming 1958–2008 (pp. 243–281). Springer.

    Google Scholar 

  48. Glover, F., Kochenberger, G., & Du, Y. (2019). Quantum bridge analytics I: A tutorial on formulating and using QUBO models. 4OR, 17(4), 335–371.

    Google Scholar 

  49. Rosenberg, I. G. (1975). Reduction of bivalent maximization to the quadratic case. Cahiers du Centre d’etudes de Recherche Operationnelle, 17, 71–74.

    MathSciNet  MATH  Google Scholar 

  50. Apolloni, B., Carvalho, C., & De Falco, D. (1989). Quantum stochastic optimization. Stochastic Processes and their Applications, 33(2), 233–244.

    Article  MathSciNet  MATH  Google Scholar 

  51. Kadowaki, T., & Nishimori, H. (1998). Quantum annealing in the transverse Ising model. Physical Review E, 58(5), 5355.

    Article  Google Scholar 

  52. Johnson, M. W., Amin, M. H., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A. J., Johansson, J., Bunyk, P., et al. (2011). Quantum annealing with manufactured spins. Nature, 473(7346), 194–198.

    Article  Google Scholar 

  53. Neukart, F., Compostella, G., Seidel, C., Von Dollen, D., Yarkoni, S., & Parney, B. (2017). Traffic flow optimization using a quantum annealer. Frontiers in ICT, 4, 29.

    Article  Google Scholar 

  54. Domino, K., Kundu, A., Salehi, Ö., & Krawiec, K. (2022). Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing. Quantum Information Processing, 21(2), 1–30.

    Google Scholar 

  55. Rebentrost, P., & Lloyd, S. (2018). Quantum computational finance: quantum algorithm for portfolio optimization. ar**v:1811.03975.

  56. Perdomo-Ortiz, A., Dickson, N., Drew-Brook, M., Rose, G., & Aspuru-Guzik, A. (2012). Finding low-energy conformations of lattice protein models by quantum annealing. Scientific Reports, 2(1), 1–7.

    Article  Google Scholar 

  57. Venturelli, D., Marchand, D. J., & Rojo, G. (2015). Quantum annealing implementation of job-shop scheduling. ar**v:1506.08479.

  58. Farhi, E., Goldstone, J., Gutmann, S., & Sipser, M. (2000). Quantum computation by adiabatic evolution. ar**v:quant-ph/0001106.

  59. Barahona, F. (1982). On the computational complexity of Ising spin glass models. Journal of Physics A: Mathematical and General, 15, 3241–3253.

    Article  MathSciNet  Google Scholar 

  60. McGeoch, C. C. (2014). Adiabatic quantum computation and quantum annealing: Theory and practice (Vol. 5). Morgan & Claypool Publishers.

    Google Scholar 

  61. Rønnow, T. F., Wang, Z., Job, J., Boixo, S., Isakov, S. V., Wecker, D., Martinis, J. M., Lidar, D. A., & Troyer, M. (2014). Defining and detecting quantum speedup. Science, 345(6195), 420–424.

    Article  Google Scholar 

  62. Hen, I., Job, J., Albash, T., Rønnow, T. F., Troyer, M., & Lidar, D. A. (2015). Probing for quantum speedup in spin-glass problems with planted solutions. Physical Review A, 92(4), 042325.

    Article  Google Scholar 

  63. Katzgraber, H. G., Hamze, F., Zhu, Z., Ochoa, A. J., & Munoz-Bauza, H. (2015). Seeking quantum speedup through spin glasses: The good, the bad, and the ugly. Physical Review X, 5(3), 031026.

    Article  Google Scholar 

  64. Mandra, S., & Katzgraber, H. G. (2018). A deceptive step towards quantum speedup detection. Quantum Science and Technology, 3(4), 04LT01.

    Google Scholar 

  65. Hybrid solver for constrained quadratic models. https://www.dwavesys.com/media/rldh2ghw/14-1055a-a_hybrid_solver_for_constrained_quadratic_models.pdf. Accessed 15 Dec. 2021.

  66. Spitzer, F. (1971). Markov random fields and Gibbs ensembles. The American Mathematical Monthly, 78(2), 142–154.

    Article  MathSciNet  MATH  Google Scholar 

  67. Preston, C. J. (1973). Generalized Gibbs states and Markov random fields. Advances in Applied probability, 5(2), 242–261.

    Article  MathSciNet  MATH  Google Scholar 

  68. Kindermann, R., & Snell, J. L. (1980). Markov random fields and their applications. American Mathematical Society.

    Google Scholar 

  69. Blake, A., Kohli, P., & Rother, C. (2011). Markov random fields for vision and image processing. MIT press.

    Google Scholar 

  70. Salehi, Ö., Cañete., & Miszczak, J. A. (2022). Unconstrained binary models of the travelling salesman problem variants for quantum optimization. Quantum Information Processing, 21(2), 1–30.

    Google Scholar 

  71. Freedline, A. Algorhythms: Generating music with D-Wave’s quantum annealer. https://medium.com/mit-6-s089-intro-to-quantum-computing/algorhythms-generating-music-with-d-waves-quantum-annealer-95697ec23ccd. Accessed 15 Dec. 2021.

Download references

Acknowledgements

ÖS and LB have been partially supported by Polish National Science Center under the grant agreement 2019/33/B/ST6/02011. The project was initiated under the QIntern program organized by QWorld, therefore we would like to thank the organizers of the program. We would like to thank Adam Glos and Jarosław Adam Miszczak for their valuable comments.

Author information

Authors and Affiliations

  1. Ira A. Fulton Schools of Engineering, Arizona State University (Online), Kanpur, India

    Ashish Arya

  2. Institute of Theoretical and Applied Informatics Polish Academy of Sciences Gliwice, Gliwice, Poland

    Ludmila Botelho & Özlem Salehi

  3. Joint Doctoral School, Silesian University of Technology, Gliwice, Poland

    Ludmila Botelho

  4. Benemérita Universidad Autónoma de Puebla, Puebla City, Mexico

    Fabiola Cañete

  5. Sarvajanik College of Engineering and Technology, Surat, India

    Dhruvi Kapadia

  6. QWorld Association, Tallinn, Estonia

    Özlem Salehi

Authors
  1. Ashish Arya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ludmila Botelho
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fabiola Cañete
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dhruvi Kapadia
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Özlem Salehi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Özlem Salehi .

Editor information

Editors and Affiliations

  1. Interdisciplinary Centre for Computer Music Research, University of Plymouth, Plymouth, UK

    Eduardo Reck Miranda

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Arya, A., Botelho, L., Cañete, F., Kapadia, D., Salehi, Ö. (2022). Applications of Quantum Annealing to Music Theory. In: Miranda, E.R. (eds) Quantum Computer Music. Springer, Cham. https://doi.org/10.1007/978-3-031-13909-3_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-13909-3_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-13908-6

  • Online ISBN: 978-3-031-13909-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation