Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Workshop on Content-Based Multimedia Indexing (CBMI)

Modeling Musical Knowledge With Quantum Bayesian Networks

Florian Krebs, Hermann Fürntratt, Roland Unterberger, Franz Graf

Published Sep 18, 2024• 1 citation
Publisher

Abstract

Music is a multifaceted art form that requires a nuanced and comprehensive framework for analysis. This framework should encompass correlations among diverse musical attributes, including melody, harmony, rhythm, timbre, and dynamics. However, modeling the interaction between these attributes is anticipated to require substantial computational resources. In this study, we propose a Bayesian model to represent various musical attributes and explore its implementation and inference on a quantum computer. We show how to translate the Bayesian model to a quantum circuit and perform inference using the quantum rejection sampling algorithm on a quantum simulator. Through empirical evaluation utilizing a real-world dataset, we compare the performance of the quantum algorithm against classical rejection sampling. Our results reveal that the quantum method improves the acceptance rate of generated samples, thereby enhancing posterior probability estimates.

DOI
10.1109/cbmi62980.2024.10859245

Related papers

Techniques for Quantum-Computing-Aided Algorithmic Composition: Experiments in Rhythm, Timbre, Harmony, and Space

Christopher Dobrian, Omar Costa Hamido

Quantum computing can be employed in computer-aided music composition to control various attributes of the music at different structural levels. This article describes the application of quantum simulation to model compositional decision making, the simulation of quantum particle tracking to produce noise-based timbres, the use of basis state vector rotation to cause changing probabilistic behaviors in granular harmonic textures, and the exploitation of quantum measurement error to cause noisy perturbations of spatial soundpaths. We describe the concepts fundamental to these techniques, we provide algorithms and software enacting them, and we provide examples demonstrating their implementation in computer-generated music

•Jan 10, 2026•0 citations

Quantum Bayesian Neural Networks

Noah Berner, Vincent Fortuin, Jonas Landman

Quantum machine learning promises great speedups over classical algorithms, but it often requires repeated computations to achieve a desired level of accuracy for its point estimates. Bayesian learning focuses more on sampling from posterior distributions than on point estimation, thus it might be more forgiving in the face of additional quantum noise. We propose a quantum algorithm for Bayesian neural network inference, drawing on recent advances in quantum deep learning, and simulate its empirical performance on several tasks. We find that already for small numbers of qubits, our algorithm approximates the true posterior well, while it does not require any repeated computations and thus fully realizes the quantum speedups.

arXiv:2107.09599•Jul 20, 2021•5 citations

Quantum-Inspired Bayesian Networks with Adaptive Sampling

Jincheng Zhang

Quantum-inspired Bayesian Networks (QIBNs) represent a novel approach to probabilistic inference, leveraging the principles of quantum mechanics to enhance the accuracy and efficiency of Bayesian Network modeling. This paper investigates the application of adaptive sampling techniques to QIBNs, aiming to address the inherent challenges of high-dimensional data in probabilistic inference. We propose a new sampling algorithm inspired by quantum mechanics, designed to effectively explore the vast state space of the network without requiring exhaustive search. Through rigorous analysis and simulations, we demonstrate the potential of this approach to significantly improve the performance of Bayesian Networks across a range of applications. The core mechanism focuses on dynamically adjusting sampling parameters to optimize the exploration process, leading to more accurate and computationally efficient inference.

•Sep 3, 2026•0 citations

Quantum inference on Bayesian networks

Guang Hao Low, Theodore J. Yoder, Isaac L. Chuang

Performing exact inference on Bayesian networks is known to be $#P$-hard. Typically approximate inference techniques are used instead to sample from the distribution on query variables given the values $e$ of evidence variables. Classically, a single unbiased sample is obtained from a Bayesian network on $n$ variables with at most $m$ parents per node in time $O(nmP{(e)}^{\ensuremath{-}1})$, depending critically on $P(e)$, the probability that the evidence might occur in the first place. By implementing a quantum version of rejection sampling, we obtain a square-root speedup, taking $O(n{2}^{m}P{(e)}^{\ensuremath{-}\frac{1}{2}})$ time per sample. We exploit the Bayesian network's graph structure to efficiently construct a quantum state, a q-sample, representing the intended classical distribution, and also to efficiently apply amplitude amplification, the source of our speedup. Thus, our speedup is notable as it is unrelativized---we count primitive operations and require no blackbox oracle queries.

arXiv:1402.7359•Physical Review A•Jun 13, 2014•109 citations

Quantum-Based Bayesian Network Inference

Jincheng Zhang

This paper explores the potential of quantum computing to accelerate Bayesian network inference. Traditional Bayesian network inference relies on iterative calculations of probability distributions, which can be computationally expensive, especially for complex networks. We propose a novel approach that leverages quantum circuits to simulate the transition probability matrices inherent in Bayesian networks. By mapping these matrices to quantum states and utilizing quantum parallelism, we aim to achieve significant speedups in inference processes. This work outlines the core concept, detailing the mapping strategy and the proposed quantum algorithm. While a full experimental implementation is not presented, this research lays a foundational framework for future investigations into quantum-enhanced Bayesian network inference. The core claim is to utilize quantum circuits to simulate Bayesian network probability transition matrices, leading to accelerated inference. The core mechanism involves mapping transition matrices to quantum states and employing quantum lines for parallel computation. This represents a new approach combining quantum computing and Bayesian networks for powerful probabilistic inference. ---

•Aug 31, 2026•0 citations

Title: Quantum-Enhanced Bayesian Inference for Bayesian Networks

Jincheng Zhang

Quantum-enhanced Bayesian inference offers the potential to significantly accelerate probabilistic predictions compared to classical Bayesian methods, particularly in complex Bayesian networks. This paper explores the implementation of a novel quantum-enhanced Bayesian inference algorithm, utilizing quantum computation to optimize Bayesian updates and inference. We present a framework for leveraging quantum hardware to enhance the accuracy and efficiency of probabilistic predictions within Bayesian network modeling. The core mechanism focuses on quantum-assisted Bayesian updates, designed to overcome computational bottlenecks inherent in traditional Bayesian inference. The proposed algorithm demonstrates improved accuracy and scalability through a rigorous analysis of its performance on a representative set of Bayesian network scenarios. The investigation delves into the potential advantages and challenges of integrating quantum computing into the Bayesian inference process.

•Sep 6, 2026•0 citations
Music is a multifaceted art form that requires a nuanced and comprehensive framework for analysis. This framework should encompass correlations among diverse musical attributes, including melody, harmony, rhythm, timbre, and dynamics. However, modeling the interaction between these attributes is anticipated to require substantial computational resources. In this study, we propose a Bayesian model to represent various musical attributes and explore its implementation and inference on a quantum computer. We show how to translate the Bayesian model to a quantum circuit and perform inference using the quantum rejection sampling algorithm on a quantum simulator. Through empirical evaluation utilizing a real-world dataset, we compare the performance of the quantum algorithm against classical rejection sampling. Our results reveal that the quantum method improves the acceptance rate of generated samples, thereby enhancing posterior probability estimates.
Quantum computing can be employed in computer-aided music composition to control various attributes of the music at different structural levels. This article describes the application of quantum simulation to model compositional decision making, the simulation of quantum particle tracking to produce noise-based timbres, the use of basis state vector rotation to cause changing probabilistic behaviors in granular harmonic textures, and the exploitation of quantum measurement error to cause noisy perturbations of spatial soundpaths. We describe the concepts fundamental to these techniques, we provide algorithms and software enacting them, and we provide examples demonstrating their implementation in computer-generated music
Quantum machine learning promises great speedups over classical algorithms, but it often requires repeated computations to achieve a desired level of accuracy for its point estimates. Bayesian learning focuses more on sampling from posterior distributions than on point estimation, thus it might be more forgiving in the face of additional quantum noise. We propose a quantum algorithm for Bayesian neural network inference, drawing on recent advances in quantum deep learning, and simulate its empirical performance on several tasks. We find that already for small numbers of qubits, our algorithm approximates the true posterior well, while it does not require any repeated computations and thus fully realizes the quantum speedups.
Quantum-inspired Bayesian Networks (QIBNs) represent a novel approach to probabilistic inference, leveraging the principles of quantum mechanics to enhance the accuracy and efficiency of Bayesian Network modeling. This paper investigates the application of adaptive sampling techniques to QIBNs, aiming to address the inherent challenges of high-dimensional data in probabilistic inference. We propose a new sampling algorithm inspired by quantum mechanics, designed to effectively explore the vast state space of the network without requiring exhaustive search. Through rigorous analysis and simulations, we demonstrate the potential of this approach to significantly improve the performance of Bayesian Networks across a range of applications. The core mechanism focuses on dynamically adjusting sampling parameters to optimize the exploration process, leading to more accurate and computationally efficient inference.
Performing exact inference on Bayesian networks is known to be $#P$-hard. Typically approximate inference techniques are used instead to sample from the distribution on query variables given the values eee of evidence variables. Classically, a single unbiased sample is obtained from a Bayesian network on nnn variables with at most mmm parents per node in time $O(nmP{(e)}^{\ensuremath{-}1})$, depending critically on P(e)P(e)P(e), the probability that the evidence might occur in the first place. By implementing a quantum version of rejection sampling, we obtain a square-root speedup, taking $O(n{2}^{m}P{(e)}^{\ensuremath{-}\frac{1}{2}})$ time per sample. We exploit the Bayesian network's graph structure to efficiently construct a quantum state, a q-sample, representing the intended classical distribution, and also to efficiently apply amplitude amplification, the source of our speedup. Thus, our speedup is notable as it is unrelativized---we count primitive operations and require no blackbox oracle queries.
This paper explores the potential of quantum computing to accelerate Bayesian network inference. Traditional Bayesian network inference relies on iterative calculations of probability distributions, which can be computationally expensive, especially for complex networks. We propose a novel approach that leverages quantum circuits to simulate the transition probability matrices inherent in Bayesian networks. By mapping these matrices to quantum states and utilizing quantum parallelism, we aim to achieve significant speedups in inference processes. This work outlines the core concept, detailing the mapping strategy and the proposed quantum algorithm. While a full experimental implementation is not presented, this research lays a foundational framework for future investigations into quantum-enhanced Bayesian network inference. The core claim is to utilize quantum circuits to simulate Bayesian network probability transition matrices, leading to accelerated inference. The core mechanism involves mapping transition matrices to quantum states and employing quantum lines for parallel computation. This represents a new approach combining quantum computing and Bayesian networks for powerful probabilistic inference. ---
Quantum-enhanced Bayesian inference offers the potential to significantly accelerate probabilistic predictions compared to classical Bayesian methods, particularly in complex Bayesian networks. This paper explores the implementation of a novel quantum-enhanced Bayesian inference algorithm, utilizing quantum computation to optimize Bayesian updates and inference. We present a framework for leveraging quantum hardware to enhance the accuracy and efficiency of probabilistic predictions within Bayesian network modeling. The core mechanism focuses on quantum-assisted Bayesian updates, designed to overcome computational bottlenecks inherent in traditional Bayesian inference. The proposed algorithm demonstrates improved accuracy and scalability through a rigorous analysis of its performance on a representative set of Bayesian network scenarios. The investigation delves into the potential advantages and challenges of integrating quantum computing into the Bayesian inference process.