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 Conference on Software and Computer Applications (ICSCA)

Designing a Quantum Annealing-Based Method for Optimizing Backpropagation Neural Networks in Greenhouse Gas Emissions Prediction

Wahyu Hidayat, Nur Ulfa Maulidevi, Kridanto Surendro

Published Feb 20, 2025• 2 citations
Publisher

Abstract

Greenhouse gas emissions prediction, whether at a macroscopic scale or through building energy demand, commonly employs Backpropagation Neural Network (BPNN) models. These models often encounter issues like extended training durations and difficulties in configuring the optimal number of hidden layers and neurons. Achieving a balance between the complexity of the model and its ability to generalize effectively is essential for creating models that are both efficient and effective. Current approaches to optimizing BPNN structures predominantly utilize classical optimization techniques, often focusing on either the number of hidden layers or the number of neurons. In this paper, we propose a conceptual framework that leverages quantum annealing to optimize BPNN models for GHG emissions prediction. The method is structured in three stages: (1) optimizing the number of hidden layers, (2) optimizing the number of neurons in each layer, and (3) performing neuron pruning optimization. This study focuses on the theoretical design and methodology of the proposed approach, emphasizing its potential to integrate classical and quantum computing paradigms to achieve superior optimization outcomes.

DOI
10.1145/3731806.3731856

Related papers

Quantum-Driven Optimization of Parameter Space for Neural Network Architecture

Jincheng Zhang

Quantum-driven optimization of parameter space for neural network architecture seeks to enhance model performance through automated exploration of the network's structure. This paper presents a novel approach utilizing quantum annealing to efficiently search the parameter space of neural networks, identifying configurations with superior performance. The core mechanism leverages quantum annealing's ability to escape local optima and navigate complex landscapes, resulting in improved model accuracy and generalization. The research demonstrates the potential of this technique to significantly boost neural network capabilities.

•Sep 1, 2026•0 citations

Quantum-Inspired Optimization for Neural Network Weight Pruning

Jincheng Zhang

This paper investigates the application of quantum-inspired optimization techniques to the problem of neural network weight pruning. Traditional pruning methods often rely on heuristic approaches or gradient-based optimization, which can be computationally expensive and may not always achieve optimal pruning ratios. We propose a novel algorithm that utilizes principles inspired by quantum annealing to efficiently explore the vast search space of possible pruning configurations. The core idea is to simulate a quantum annealing process, leveraging superposition and potentially entanglement (though simulated) to identify connections with minimal contribution to the network's overall performance. Our approach aims to reduce the computational cost and improve the effectiveness of neural network pruning, leading to smaller, faster, and more efficient models. We demonstrate, through theoretical analysis and a conceptual algorithmic outline, the potential benefits of this quantum-inspired strategy compared to conventional pruning methods. The algorithm focuses on iteratively evaluating connection weights based on their impact on the network's loss function, mimicking the exploration of a quantum system searching for its lowest energy state. The key innovation lies in the adaptive exploration strategy, inspired by quantum annealing's ability to escape local minima, allowing the algorithm to converge towards a more optimal pruning solution.

•Sep 6, 2026•0 citations

Quantum Annealing for Combinatorial Optimization with Graph Neural Networks

Jincheng Zhang

This paper investigates the application of quantum annealing in conjunction with graph neural networks (GNNs) for solving complex combinatorial optimization problems. Traditional classical optimization algorithms often face significant challenges in identifying optimal solutions within large and intricate solution spaces. The core idea presented herein is to represent these problems as graphs and utilize the inherent quantum mechanical properties of quantum annealing to explore this space more efficiently. Specifically, GNNs are employed to generate embeddings of the graph, effectively encoding problem-specific features and relationships. This approach aims to bridge the gap between the probabilistic nature of quantum computation and the structural information captured by GNNs. We detail the theoretical framework, explore the potential benefits of this hybrid approach, and outline a methodology for integrating these techniques. The potential for improved optimization performance compared to conventional methods is discussed, highlighting the synergy between quantum annealing's ability to find low-energy states and GNNs' capacity to learn complex graph representations.

•Aug 31, 2026•0 citations

Quantum-Inspired Optimization of Large-Scale Machine Learning Algorithms

Jincheng Zhang

Large-scale machine learning (ML) models, particularly deep neural networks, often present significant challenges for traditional optimization algorithms. These algorithms, rooted in classical mechanics, frequently encounter issues such as getting trapped in local optima, high computational cost, and difficulty in handling complex, non-convex landscapes. This paper investigates the application of quantum-inspired optimization techniques to address these challenges. We explore how concepts derived from quantum phenomena – such as quantum annealing and quantum walks – can be adapted to efficiently navigate and optimize large-scale ML models. The core idea is to leverage the probabilistic and superposition properties inherent in quantum mechanics to escape local optima and accelerate the convergence process. We present a framework for designing and implementing quantum-inspired optimization strategies, focusing on the theoretical foundations and potential benefits. The proposed approach aims to provide a novel and effective solution for optimizing complex ML models, ultimately improving model performance and reducing training time. This work contributes to the growing field of quantum machine learning and offers a promising avenue for tackling the optimization problems inherent in large-scale ML.

•Sep 7, 2026•0 citations

Quantum-Inspired Optimization for Large-Scale Machine Learning

Jincheng Zhang

The rapid growth of machine learning (ML) has been accompanied by a significant challenge: the scaling of optimization algorithms to handle the immense parameter spaces of modern models, such as deep neural networks. Traditional optimization methods, including gradient descent and its variants, often encounter difficulties in efficiently exploring these spaces, leading to slow training times and potential stagnation. This paper investigates the application of quantum-inspired optimization techniques to address this scaling problem. We explore algorithms inspired by quantum annealing and other quantum phenomena, adapting their core principles to classical computation. Specifically, we propose a novel optimization framework utilizing a stochastic search strategy based on quantum superposition and measurement, designed to navigate high-dimensional parameter spaces more effectively. The efficacy of this approach is evaluated through theoretical analysis and conceptual simulations, demonstrating its potential to accelerate the training of large-scale machine learning models. We demonstrate how these methods can improve convergence speed and potentially escape local minima more effectively than conventional techniques. The core contribution lies in providing a theoretical foundation and a practical framework for applying quantum-inspired concepts to optimization within the context of machine learning.

•Sep 6, 2026•0 citations

Quantum-Assisted Optimization of Neural Network Architecture

Jincheng Zhang

Quantum-assisted optimization of neural network architecture is a burgeoning field aiming to accelerate the design and training of deep learning models. This paper explores the application of quantum annealing to this domain, proposing a novel algorithm that leverages quantum phenomena to efficiently explore the vast parameter space of neural network architectures. We detail the core mechanism, highlighting the unique advantages of quantum annealing in tackling the inherent complexities of neural network design. The paper presents a comprehensive analysis of the theoretical underpinnings, experimental validation, and potential future directions of this research. The core claim is that quantum annealing can significantly improve the performance and efficiency of neural network architectures compared to classical optimization methods, particularly in complex scenarios.

•Sep 3, 2026•0 citations
Greenhouse gas emissions prediction, whether at a macroscopic scale or through building energy demand, commonly employs Backpropagation Neural Network (BPNN) models. These models often encounter issues like extended training durations and difficulties in configuring the optimal number of hidden layers and neurons. Achieving a balance between the complexity of the model and its ability to generalize effectively is essential for creating models that are both efficient and effective. Current approaches to optimizing BPNN structures predominantly utilize classical optimization techniques, often focusing on either the number of hidden layers or the number of neurons. In this paper, we propose a conceptual framework that leverages quantum annealing to optimize BPNN models for GHG emissions prediction. The method is structured in three stages: (1) optimizing the number of hidden layers, (2) optimizing the number of neurons in each layer, and (3) performing neuron pruning optimization. This study focuses on the theoretical design and methodology of the proposed approach, emphasizing its potential to integrate classical and quantum computing paradigms to achieve superior optimization outcomes.
Quantum-driven optimization of parameter space for neural network architecture seeks to enhance model performance through automated exploration of the network's structure. This paper presents a novel approach utilizing quantum annealing to efficiently search the parameter space of neural networks, identifying configurations with superior performance. The core mechanism leverages quantum annealing's ability to escape local optima and navigate complex landscapes, resulting in improved model accuracy and generalization. The research demonstrates the potential of this technique to significantly boost neural network capabilities.
This paper investigates the application of quantum-inspired optimization techniques to the problem of neural network weight pruning. Traditional pruning methods often rely on heuristic approaches or gradient-based optimization, which can be computationally expensive and may not always achieve optimal pruning ratios. We propose a novel algorithm that utilizes principles inspired by quantum annealing to efficiently explore the vast search space of possible pruning configurations. The core idea is to simulate a quantum annealing process, leveraging superposition and potentially entanglement (though simulated) to identify connections with minimal contribution to the network's overall performance. Our approach aims to reduce the computational cost and improve the effectiveness of neural network pruning, leading to smaller, faster, and more efficient models. We demonstrate, through theoretical analysis and a conceptual algorithmic outline, the potential benefits of this quantum-inspired strategy compared to conventional pruning methods. The algorithm focuses on iteratively evaluating connection weights based on their impact on the network's loss function, mimicking the exploration of a quantum system searching for its lowest energy state. The key innovation lies in the adaptive exploration strategy, inspired by quantum annealing's ability to escape local minima, allowing the algorithm to converge towards a more optimal pruning solution.
This paper investigates the application of quantum annealing in conjunction with graph neural networks (GNNs) for solving complex combinatorial optimization problems. Traditional classical optimization algorithms often face significant challenges in identifying optimal solutions within large and intricate solution spaces. The core idea presented herein is to represent these problems as graphs and utilize the inherent quantum mechanical properties of quantum annealing to explore this space more efficiently. Specifically, GNNs are employed to generate embeddings of the graph, effectively encoding problem-specific features and relationships. This approach aims to bridge the gap between the probabilistic nature of quantum computation and the structural information captured by GNNs. We detail the theoretical framework, explore the potential benefits of this hybrid approach, and outline a methodology for integrating these techniques. The potential for improved optimization performance compared to conventional methods is discussed, highlighting the synergy between quantum annealing's ability to find low-energy states and GNNs' capacity to learn complex graph representations.
Large-scale machine learning (ML) models, particularly deep neural networks, often present significant challenges for traditional optimization algorithms. These algorithms, rooted in classical mechanics, frequently encounter issues such as getting trapped in local optima, high computational cost, and difficulty in handling complex, non-convex landscapes. This paper investigates the application of quantum-inspired optimization techniques to address these challenges. We explore how concepts derived from quantum phenomena – such as quantum annealing and quantum walks – can be adapted to efficiently navigate and optimize large-scale ML models. The core idea is to leverage the probabilistic and superposition properties inherent in quantum mechanics to escape local optima and accelerate the convergence process. We present a framework for designing and implementing quantum-inspired optimization strategies, focusing on the theoretical foundations and potential benefits. The proposed approach aims to provide a novel and effective solution for optimizing complex ML models, ultimately improving model performance and reducing training time. This work contributes to the growing field of quantum machine learning and offers a promising avenue for tackling the optimization problems inherent in large-scale ML.
The rapid growth of machine learning (ML) has been accompanied by a significant challenge: the scaling of optimization algorithms to handle the immense parameter spaces of modern models, such as deep neural networks. Traditional optimization methods, including gradient descent and its variants, often encounter difficulties in efficiently exploring these spaces, leading to slow training times and potential stagnation. This paper investigates the application of quantum-inspired optimization techniques to address this scaling problem. We explore algorithms inspired by quantum annealing and other quantum phenomena, adapting their core principles to classical computation. Specifically, we propose a novel optimization framework utilizing a stochastic search strategy based on quantum superposition and measurement, designed to navigate high-dimensional parameter spaces more effectively. The efficacy of this approach is evaluated through theoretical analysis and conceptual simulations, demonstrating its potential to accelerate the training of large-scale machine learning models. We demonstrate how these methods can improve convergence speed and potentially escape local minima more effectively than conventional techniques. The core contribution lies in providing a theoretical foundation and a practical framework for applying quantum-inspired concepts to optimization within the context of machine learning.
Quantum-assisted optimization of neural network architecture is a burgeoning field aiming to accelerate the design and training of deep learning models. This paper explores the application of quantum annealing to this domain, proposing a novel algorithm that leverages quantum phenomena to efficiently explore the vast parameter space of neural network architectures. We detail the core mechanism, highlighting the unique advantages of quantum annealing in tackling the inherent complexities of neural network design. The paper presents a comprehensive analysis of the theoretical underpinnings, experimental validation, and potential future directions of this research. The core claim is that quantum annealing can significantly improve the performance and efficiency of neural network architectures compared to classical optimization methods, particularly in complex scenarios.