Of all novel computing methods, quantum computation (QC) is currently the most likely to move from the realm of the unconventional into the conventional. As a result some initial work has been done on applications of QC outside of science: for example music. The small amount of arts research done in hardware or with actual physical systems has not utilized any of the advantages of quantum computation (QC): the main advantage being the potential speed increase of quantum algorithms. This paper introduces a way of utilizing Grover's algorithm - which has been shown to provide a quadratic speed-up over its classical equivalent - in algorithmic rule-based music composition. The system introduced - qgMuse - is simple but scalable. Example melodies are composed using qgMuse using the ibmqx4 quantum hardware. The paper concludes with discussion on how such an approach can grow with the improvement of quantum computer hardware and software.
Of all novel computing methods, quantum computation (QC) is currently the most likely to move from the realm of the unconventional into the conventional. As a result some initial work has been done on applications of QC outside of science: for example music. The small amount of arts research done in hardware or with actual physical systems has not utilized any of the advantages of quantum computation (QC): the main advantage being the potential speed increase of quantum algorithms. This paper introduces a way of utilizing Grover's algorithm - which has been shown to provide a quadratic speed-up over its classical equivalent - in algorithmic rule-based music composition. The system introduced - qgMuse - is simple but scalable. Example melodies are composed using qgMuse using the ibmqx4 quantum hardware. The paper concludes with discussion on how such an approach can grow with the improvement of quantum computer hardware and software.
Previous research on quantum computing/mechanics and the arts has usually been in simulation. The small amount of work done in hardware or with actual physical systems has not utilized any of the advantages of quantum computation: the main advantage being the potential speed increase of quantum algorithms. This paper introduces a way of utilizing Grover's algorithm - which has been shown to provide a quadratic speed-up over its classical equivalent - in algorithmic rule-based music composition. The system introduced - qgMuse - is simple but scalable. It lays some groundwork for new ways of addressing a significant problem in computer music research: unstructured random search for desired music features. Example melodies are composed using qgMuse using the ibmqx4 quantum hardware, and the paper concludes with discussion on how such an approach can grow with the improvement of quantum computer hardware and software.
There have been significant attempts previously to use the equations of quantum mechanics for generating sound, and to sonify simulated quantum processes. For new forms of computation to be utilized in computer music, eventually hardware must be utilized. This has rarely happened with quantum computer music. One reason for this is that it is currently not easy to get access to such hardware. A second is that the hardware available requires some understanding of quantum computing theory. This paper moves forward the process by utilizing two hardware quantum computation systems: IBMQASM v1.1 and a D-Wave 2X. It also introduces the ideas behind the gate-based IBM system, in a way hopefully more accessible to computerliterate readers. This is a presentation of the first hybrid quantum computer algorithm, involving two hardware machines. Although neither of these algorithms explicitly utilize the promised quantum speed-ups, they are a vital first step in introducing QC to the musical field. The article also introduces some key quantum computer algorithms and discusses their possible future contribution to computer music.
Quantum computing and artificial intelligence, two prominent topics in science and technology, are rapidly advancing and extending their influence into numerous fields, including music. Quantum computer music, which merges the strengths of quantum computing and deep learning, heralds a new era in the integration of music creation with cutting-edge technology. The interactive quantum music composition “Spinnings—Q1 Synth Trio”, created by Brazilian composer Miranda during the QuTune project at the Interdisciplinary Centre for Computer Music Research (ICCMR), in collaboration with the University of Oxford, stands as a notable example of quantum computer music. This study adopts a case study approach to thoroughly investigate the technical creative process behind this work, covering elements such as quantum computing, quantum properties, qubits, quantum gates, and quantum circuits, gradually unveiling the mathematical logic behind quantum algorithmic composition. The results of this study indicate that quantum algorithmic composition, as an emerging approach to music creation, not only generates unique music through the characteristics of quantum computing but also offers new possibilities for the integration of music, art, and technology. By applying quantum bits, quantum gates, and quantum circuits, this research demonstrates how quantum computing can provide new theoretical foundations and practical methods for music composition. Furthermore, the study discusses how to optimize the interactive creative experience in quantum music works and how to enhance the understanding and appreciation of quantum music among a broader audience of musicians and listeners. With the continuous advancement of quantum computing technology, quantum music is poised to contribute a distinctive dimension to the global flourishing of musical culture. This research offers fresh perspectives and ideas for the development of this field.
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 of 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 quantum annealers are among the first examples of their kind and presented within the scope of the chapter. The text is an unedited pre-publication version of a chapter which will appear in the book "Quantum Computer Music", Miranda, E. R. (Editor).
Quantum computing is emerging as an alternative computing technology, which is built on the principles of subatomic physics. In spite of continuing progress in developing increasingly more sophisticated hardware and software, access to quantum computing still requires specialist expertise that is largely confined to research laboratories. Moreover, the target applications for these developments remain primarily scientific. This chapter introduces research aimed at improving this scenario. Our research is aimed at extending the range of applications of quantum computing towards the arts and creative applications, music being our point of departure. This chapter reports on initial outcomes, whereby quantum information processing controls an inverse Fast Fourier Transform (FFT) sound synthesizer and an adaptive musical sequencer. A composition called Zeno is presented to illustrate a practical real-world application.
Quantum computing introduces an efficient way for unfolding complex problems on computing systems. It uses concept of superposition and entanglement, & hence supports intrinsic parallelism for obtaining the speedup in context of time over classical computing. Quantum algorithms can be efficiently implemented over quantum computing system. Most popular quantum algorithms like Grover's and Shor's provide a great foundation to specifically design the algorithms. These algorithms work on improving the lower runtime bounds of classical algorithms. Grover's algorithm exhibits a quadratic polynomial speedup while searching an element among `N' elements unstructured database. The algorithmic strategy can be applied over various computer science related applications and some important are being considered in this article i.e. pattern matching, data mining and machine learning. This article explores quantum fundamentals; history based evolution followed by Grover's search algorithm in detail with cascading advantages, limitations & applications and also finally concludes with the significance of quantum computing & quantum algorithmic domains.