This paper introduces MIq (Multi-Agent Interactive qgMuse), which builds on the single agent quantum system qgMuse using teleportation. MIq is the first attempt at a real-time interactive quantum computer music algorithm that utilises the quantum advantage. Previous interactive or real-time quantum music algorithms running on quantum computers have been mappings of classical computing algorithms, with no quantum advantage obtained. MIq provides a quadratic speed-up over classical methods. It is a Quantum Hybrid Multi-agent System architecture implemented on 5 and 14 qubit quantum hardware. Classical agents and quantum agents connect via a classical/quantum hybrid agent that enables communication using quantum teleportation.
This paper introduces MIq (Multi-Agent Interactive qgMuse), which builds on the single agent quantum system qgMuse using teleportation. MIq is the first attempt at a real-time interactive quantum computer music algorithm that utilises the quantum advantage. Previous interactive or real-time quantum music algorithms running on quantum computers have been mappings of classical computing algorithms, with no quantum advantage obtained. MIq provides a quadratic speed-up over classical methods. It is a Quantum Hybrid Multi-agent System architecture implemented on 5 and 14 qubit quantum hardware. Classical agents and quantum agents connect via a classical/quantum hybrid agent that enables communication using quantum teleportation.
This paper introduces an interactive music system with quantum musical agents that communicate by teleporting quantum states to one another. Human performers interact in real time with agents whose melodic and rhythmic behaviours are encoded as quantum states using Single Qubit Probability Amplitude Modulation (SQPAM) and structured through Quantum Phase Estimation (QPE). Up to three agents are combined within a single quantum circuit, with directed communication via quantum teleportation. We are interested in supporting ambiguous, transformative interactions reminiscent of free Jazz improvisation. Therefore, rather than treating noise and decoherence as limitations, the system embraces NISQ-era constraints as creative affordances, framing agent communication as quantum whispers, that is, deliberate, musically expressive imperfections in state transfer. We provide demonstrations and analyses based on melodic correlation, pitch-set distance, and state fidelity, where a continuum between imitation and divergence can be observed. We developed a tunable interpretation method to assess how agents reinterpret teleported states. This work positions teleportation as a promising interaction mechanism for agent-based quantum computer music and outlines future directions toward distributed ensembles connected via the Quantum Internet.
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.
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.
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 establishes a completely new method for performing calculations, which relies on three fundamental principles called superposition, entanglement, and probabilistic measurement. The application of artificial intelligence (AI) with quantum computing provides the ability to develop quantum AI (QAI) agents, which function as intelligent systems using quantum-based methods for representation, optimization, and probabilistic modeling. The research study analyzed the mathematical foundations of quantum computing, together with its key quantum algorithms used in AI and the architectural designs of hybrid quantum–classical agents, alongside quantum learning models and the complete implementation framework, which includes hardware systems, programming methods, and scalability challenges. The study examined different essential obstacles, which included decoherence, data encoding bottlenecks, gradient instability, benchmarking methods, and the comparison between theoretical and practical quantum advantage. Current quantum computing hardware exists within the noisy intermediate-scale quantum computing stage, which offers scientists various ways to investigate hybrid models and variational methods. Scalable and fault-tolerant quantum computing development will enable businesses to achieve groundbreaking results across various fields, including optimization, probabilistic reasoning, and intricate decision-making. The field of AI needs hardware engineering, algorithm advancement, error correction, and assessment methodology development before it can achieve practical quantum advantage. QAI represents an emerging interdisciplinary research frontier that integrates physics, computer science, mathematics, and ethics into a coherent research agenda.
Agentic Quantum Architecture (AQA) is a layered, formally specified architecture in which an autonomous agent decides, per operation and under explicit uncertainty, whether a computation should run on classical hardware, on a classical simulation of a quantum circuit, or on a physical quantum processor, and accepts no result that has not passed an independent check. AQA treats the quantum processor as a scarce, noisy, probabilistic co-processor reached through compilation, queueing, and sampling, not as a substrate for agent reasoning. The architecture comprises eight layers across four planes: agentic intelligence, planning and decision, classical computation, quantum computation, quantum-classical coordination, memory and state, verification and reliability, and security and governance. We formalize a unified agent state, a belief-space action-selection rule grounded in rational metareasoning, a 10-field typed Quantum Workload Specification (QWS), an end-to-end cost and latency model for routing, a statistical measurement-to-evidence pipeline, and formal acceptance conditions for computational results. The core mechanism is a conservative lower-confidence-bound (LCB) routing rule: an operation is delegated to quantum hardware only when a lower confidence bound on its net utility advantage—accounting for encoding, compilation, queueing, shot overhead, error mitigation, post-processing, verification, and expected failure—is strictly positive. Under present NISQ constraints, classical execution will prevail for most workloads, which the architecture treats as sound decision-making rather than a defect. A five-phase implementation roadmap and ten falsifiable research questions are provided.