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

Quantum-Enhanced Causal Inference for High-Dimensional Astronomical Data - Extended Abstract

Gianini G., M. Banfi, Mio C., Alberto Leporati, Mario Pasquato

Published Jan 1, 2025• 0 citations
OpenAlex

Abstract

We propose an approach based on the Fixed-Point Grover search in combinatorial spaces to efficiently identify acyclic causal structures compatible with the PC and FCI causal discovery algorithm’s output, paving the way for scalable statistical studies of causal structures in large astrophysical datasets.

Related papers

Title: Quantum-Enhanced Statistical Inference – Leveraging Quantum Algorithms for Data Analysis

Jincheng Zhang

Quantum-enhanced statistical inference represents a significant advancement in data analysis, leveraging the unique properties of quantum mechanics to surpass the limitations of classical approaches. This paper investigates the design and implementation of a novel statistical inference algorithm, incorporating a quantum algorithm, designed to enhance accuracy and efficiency, particularly when dealing with large datasets. We explore the potential of quantum computation to accelerate computationally intensive tasks critical to statistical analysis, focusing on the application of a modified Grover's algorithm to estimate expected values. The core mechanism centers around exploiting quantum phenomena to reduce computational complexity and improve the reliability of statistical results. This work presents a comprehensive theoretical analysis and practical implementation demonstrating a substantial improvement over existing classical methods, particularly for large datasets, and lays the groundwork for a new paradigm in statistical data processing. The research culminates in a detailed discussion of the algorithm's performance characteristics and potential applications across diverse statistical domains.

•Sep 4, 2026•0 citations

Title: Quantum-Enhanced Bayesian Network Inference

Jincheng Zhang

Quantum-enhanced Bayesian Network Inference addresses the computational challenges associated with large, complex Bayesian networks through the integration of quantum algorithms. This paper introduces a novel technique leveraging Grover's search to accelerate conditional probability computations, ultimately enhancing inference efficiency. The core mechanism centers around quantum-enhanced probability updates, offering a potential paradigm shift in the processing of large network data. We explore the theoretical implications and preliminary experimental results demonstrating the efficacy of this approach, highlighting its potential to overcome limitations of traditional methods. The paper concludes with a discussion of future research directions, focusing on scalability and practical application.

•Aug 29, 2026•0 citations

Title: Quantum-Accelerated Bayesian Inference - Novel Algorithm for Uncertainty Quantification

Jincheng Zhang

This paper presents a novel algorithm for Bayesian inference, leveraging quantum computation to significantly accelerate the process of uncertainty quantification. Traditional Bayesian methods often struggle with computationally intensive tasks, particularly when dealing with complex models and large datasets. We introduce a quantum-enhanced inference framework that employs Grover's search to efficiently identify optimal parameter configurations, thereby improving the accuracy and speed of uncertainty quantification. The algorithm's core mechanism involves quantum-assisted search, offering a substantial improvement over existing techniques in this domain. We detail the algorithm's architecture, discuss its performance characteristics, and provide a comprehensive analysis of its potential impact on uncertainty quantification workflows. The paper concludes with a discussion of future research directions and the implications of this quantum-accelerated approach.

•Aug 31, 2026•0 citations

Title: Quantum-Enhanced Bayesian Inference for Machine Learning

Jincheng Zhang

Quantum-enhanced Bayesian inference offers a paradigm shift in the field of machine learning, addressing the fundamental limitations of classical Bayesian methods – namely, computational complexity and scalability – when dealing with high-dimensional data. This paper presents a novel quantum-enhanced Bayesian inference algorithm designed to drastically reduce these challenges. We explore the use of quantum annealing and quantum approximate optimization algorithms to efficiently navigate the complex search space of model parameters, leading to significantly improved accuracy and reduced computational costs. This work demonstrates the potential of quantum computing to revolutionize machine learning, particularly within domains characterized by high data complexity and demanding performance requirements. The core mechanism focuses on leveraging quantum phenomena – superposition and entanglement – to accelerate the exploration of parameter space and improve the convergence of inference algorithms. The investigation includes a detailed analysis of the algorithm's performance compared to classical methods, highlighting the benefits of quantum acceleration in specific machine learning tasks.

•Aug 31, 2026•0 citations

Quantum Entropic Causal Inference

Mohammad Ali Javidian, Vaneet Aggarwal, Fanglin Bao +1 more

Inferring causality from observational data alone is one of the most important and challenging problems in statistical inference. We propose a greedy algorithm for quantum entropic causal inference that unifies classical and quantum causal inference.

arXiv:2102.11764•Quantum Information and Measurement (QIM)•Jan 1, 2021•4 citations

Quantum PC Algorithm: Data-Efficient and Nonlinear Causal Discovery

Yota Maeda, Ken Arai, Yu Tanaka +3 more

Causal discovery is the task of finding causal relationships between random variables from observed data. Typically, one assumes that the causal relationships can be represented by a directed acyclic graph (DAG), and makes additional assumptions to ensure that the DAG can be recovered from the observed data. In this study, we propose the quantum Peter-Clark (qPC) algorithm for nonlinear causal discovery based on quantum kernel methods. The qPC algorithm takes advantage of the quantum kernel-based conditional independent test. Through the synthetic data experiment, we show that the qPC algorithm outperforms the classical method in the regime of a small number of samples. This suggests that the kernel-based causal discovery can significantly improve performance under such conditions. Our experiments highlight that the proposed algorithm can accurately support classical algorithms in causal discovery, paving the way for future advances with the utilization of quantum computation.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•0 citations
Quantum-enhanced statistical inference represents a significant advancement in data analysis, leveraging the unique properties of quantum mechanics to surpass the limitations of classical approaches. This paper investigates the design and implementation of a novel statistical inference algorithm, incorporating a quantum algorithm, designed to enhance accuracy and efficiency, particularly when dealing with large datasets. We explore the potential of quantum computation to accelerate computationally intensive tasks critical to statistical analysis, focusing on the application of a modified Grover's algorithm to estimate expected values. The core mechanism centers around exploiting quantum phenomena to reduce computational complexity and improve the reliability of statistical results. This work presents a comprehensive theoretical analysis and practical implementation demonstrating a substantial improvement over existing classical methods, particularly for large datasets, and lays the groundwork for a new paradigm in statistical data processing. The research culminates in a detailed discussion of the algorithm's performance characteristics and potential applications across diverse statistical domains.
Quantum-enhanced Bayesian Network Inference addresses the computational challenges associated with large, complex Bayesian networks through the integration of quantum algorithms. This paper introduces a novel technique leveraging Grover's search to accelerate conditional probability computations, ultimately enhancing inference efficiency. The core mechanism centers around quantum-enhanced probability updates, offering a potential paradigm shift in the processing of large network data. We explore the theoretical implications and preliminary experimental results demonstrating the efficacy of this approach, highlighting its potential to overcome limitations of traditional methods. The paper concludes with a discussion of future research directions, focusing on scalability and practical application.
This paper presents a novel algorithm for Bayesian inference, leveraging quantum computation to significantly accelerate the process of uncertainty quantification. Traditional Bayesian methods often struggle with computationally intensive tasks, particularly when dealing with complex models and large datasets. We introduce a quantum-enhanced inference framework that employs Grover's search to efficiently identify optimal parameter configurations, thereby improving the accuracy and speed of uncertainty quantification. The algorithm's core mechanism involves quantum-assisted search, offering a substantial improvement over existing techniques in this domain. We detail the algorithm's architecture, discuss its performance characteristics, and provide a comprehensive analysis of its potential impact on uncertainty quantification workflows. The paper concludes with a discussion of future research directions and the implications of this quantum-accelerated approach.
Quantum-enhanced Bayesian inference offers a paradigm shift in the field of machine learning, addressing the fundamental limitations of classical Bayesian methods – namely, computational complexity and scalability – when dealing with high-dimensional data. This paper presents a novel quantum-enhanced Bayesian inference algorithm designed to drastically reduce these challenges. We explore the use of quantum annealing and quantum approximate optimization algorithms to efficiently navigate the complex search space of model parameters, leading to significantly improved accuracy and reduced computational costs. This work demonstrates the potential of quantum computing to revolutionize machine learning, particularly within domains characterized by high data complexity and demanding performance requirements. The core mechanism focuses on leveraging quantum phenomena – superposition and entanglement – to accelerate the exploration of parameter space and improve the convergence of inference algorithms. The investigation includes a detailed analysis of the algorithm's performance compared to classical methods, highlighting the benefits of quantum acceleration in specific machine learning tasks.
Causal discovery is the task of finding causal relationships between random variables from observed data. Typically, one assumes that the causal relationships can be represented by a directed acyclic graph (DAG), and makes additional assumptions to ensure that the DAG can be recovered from the observed data. In this study, we propose the quantum Peter-Clark (qPC) algorithm for nonlinear causal discovery based on quantum kernel methods. The qPC algorithm takes advantage of the quantum kernel-based conditional independent test. Through the synthetic data experiment, we show that the qPC algorithm outperforms the classical method in the regime of a small number of samples. This suggests that the kernel-based causal discovery can significantly improve performance under such conditions. Our experiments highlight that the proposed algorithm can accurately support classical algorithms in causal discovery, paving the way for future advances with the utilization of quantum computation.