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

IPTC Summit on AI for the Energy Industry

Quantum Computing for Refinery Feedstock Optimization and Beyond

Syed Farhan, Mohamed Habib Loukil, Aaron G. Frye, Gregory T. Byrd

Published Jan 13, 2026• 0 citations
Publisher

Abstract

Abstract The selection of crude oil feedstock is a critical, high-impact optimization problem in the petrochemical industry, directly influencing refinery profitability and environmental footprint. Traditional optimization methods face scalability challenges as the complexity and number of constraints increase. This paper presents an initial study on the application of quantum computing to solve a binary feedstock optimization model. We formulate the problem as a Quadratic Unconstrained Binary Optimization (QUBO) model and employ the Quantum Approximate Optimization Algorithm (QAOA) to find low-cost solutions. To manage the probabilistic nature of quantum results, we introduce Conditional Value at Risk (CVaR) as a post-processing technique to select robust, high-quality solutions. Our results on a representative small-scale problem demonstrate the viability of this hybrid quantum-classical approach, showing its potential to identify near-optimal solutions. We conclude with a discussion of current limitations and an open call for collaboration to further explore quantum computing applications in the energy sector.

DOI
10.2523/iptc-25262-ms

Related papers

Solve Crude Oil Scheduling Problems by Using Quantum-Classical Hybrid Algorithms

Jian Yang, Bohang Wang, Lina Wang +5 more

The optimization of front-end crude oil scheduling is a critical determinant of refinery profitability and operational stability. However, the coupling of discrete logistics events (e.g., vessel berthing) with continuous material flows (e.g., pipeline transfers) renders this problem an NP-hard Mixed-Integer Linear Programming (MILP) challenge, often intractable for classical solvers at industrial scales. This study proposes a novel hybrid quantum-classical framework to address these computational bottlenecks. We employ Benders Decomposition to decouple the monolithic model into a discrete Master Problem (MP) and a continuous Subproblem (SP). To exploit the search capabilities of quantum computing, the MP is reformulated as a Quadratic Unconstrained Binary Optimization (QUBO) model and solved via a hybrid quantum solver, while the SP enforces mass balance and quality constraints through iterative optimality and feasibility cuts. Extensive experiments on 15 multi-scale instances demonstrate that the proposed framework significantly outperforms traditional metaheuristics (e.g., Genetic Algorithms, Tabu Search), reducing total operating costs by approximately 73--80% and achieving computational speeds comparable to state-of-the-art commercial solvers (Gurobi). By effectively leveraging global optimality cuts, the method overcomes the tendency of heuristic approaches to trap in local optima, providing a robust and scalable solution for complex refinery logistics.

quant-pharXiv:2604.26459•Apr 30, 2026•0 citations

Quantum Optimization Using QAOA for Constrained Binary Problems: A Mine Planning Case Study

Bairon Rojas-Castro, Aldo Quelopana, Pablo A. Miranda-Gonzalez

This paper presents the application of a quantum optimization technique to a mining problem. A mine planning problem in an open-pit mine is reformulated as a Quadratic Unconstrained Binary Optimization (QUBO) model and solved using the Quantum Approximate Optimization Algorithm (QAOA). The problem seeks to maximize the monetary benefit while respecting precedence constraints between blocks and extraction capacity limitations. The methodology is validated through a fictitious copper deposit case study, where the quantum algorithm identifies the optimal extraction, a result validated with Gurobi solver. Although the approach demonstrates technical feasibility, the scalability limitations of current quantum simulators restrict applications to large-scale problems. This work establishes fundamental foundations for applying quantum computing to mine planning challenges and represents a step toward leveraging quantum computational advantages for NP-hard problems in the mining industry.

International Conference of the Chilean Computer Science Society (SCCC)•Oct 1, 2025•0 citations

Quantum computing applications, challenges, and prospects in financial portfolio optimization

Omoshola S. Owolabi, Prince C. Uche, Nathaniel T. Adeniken +2 more

Quantum computing has the potential to improve financial portfolio optimization by addressing scalability and computational complexity issues. This article explores the application of quantum algorithms to portfolio optimization. It begins by discussing the limitations of classical optimization methods and introduces the basics of quantum computing. Two key quantum algorithms, quantum annealing and the Quantum Approximate Optimization Algorithm (QAOA), are presented in detail. These algorithms are applied to solve the Quadratic Unconstrained Binary Optimization (QUBO) formulation of the portfolio optimization problem. The article provides a high-level quantum algorithm, along with its pseudo-code Python implementation. The potential computational speedup of quantum algorithms is analyzed, highlighting the theoretical quadratic speedup over classical methods. However, the article also acknowledges the challenges and limitations currently facing quantum computing. It also concludes by emphasizing the promising future of quantum computing in finance and encourages further research to unlock the full potential of quantum technologies in portfolio optimization and other complex financial problems.

World Journal of Advanced Research and Reviews•Jun 6, 2024•8 citations

A Two-Step Quantum Approximate Optimization Algorithm for Portfolio Optimization and Risk Assessment

Boxuan Wu, Lei Wang

Quantum finance represents a pivotal and cutting-edge application domain within the burgeoning field of quantum computing. In this work, we propose a two-step quantum approximate optimization algorithm (two-step QAOA) for portfolio optimization and risk assessment. The algorithm initiates by formulating the stock selection problem as a quadratic unconstrained binary optimization (QUBO) problem and employs a classical-quantum hybrid method to find the ground state of the Hamiltonian. We then introduce an energy-based characteristic indicator U∈[0,1), which quantitatively evaluates portfolio performance under customizable investment preferences, effectively capturing the trade-off between expected return and risk. The number of qubits required scales with the number of stocks N in the pool, and the number of Hamiltonian terms is O(N2). Numerical simulations show that the algorithm provides consistent and reasonable assessment results on both training and test datasets under different investment preferences (aggressive or conservative), validating the capability of the characteristic indicator to extract intrinsic information from the portfolios. Additionally, by incorporating warm-starting and digitized counterdiabatic techniques, the algorithm achieves improved scalability and faster convergence. Our work presents a flexible and practical algorithmic framework for applying quantum computing in the financial domain.

Quantum Reports•May 7, 2026•0 citations

Exploring Quantum Computing Applications in Portfolio Optimization: Indian Perspective

Sangam Jadhav, Vanishri Hundekar, Prasad Kulkarni +1 more

Portfolio optimization under realistic constraints represents a computationally intensive problem for classical financial models, particularly in volatile and high-dimensional markets such as India.Conventional mean-variance approaches become NP-hard when integer, cardinality, and regulatory constraints are incorporated.This paper investigates the applicability of quantum computing techniques for constrained portfolio optimization in the Indian financial context.The study analyzes quantum annealing and gate-based variational algorithms, including the Quantum Approximate Optimization Algorithm (QAOA) and Variational Quantum Eigensolver (VQE), with emphasis on Quadratic Unconstrained Binary Optimization (QUBO) formulations.In addition, quantum amplitude estimation methods are examined for accelerating financial risk metrics such as Value-at-Risk and Conditional Value-at-Risk.Empirical results derived from thematic and regression analyses indicate that perceived computational advantage and organizational readiness significantly influence adoption intent, while quantum-related security risks act as a moderating factor.The findings suggest that hybrid classical-quantum architectures provide a practical pathway during the Noisy Intermediate-Scale Quantum era.The paper concludes that early-stage quantum adoption, combined with post-quantum cryptographic preparedness, can enhance portfolio efficiency and risk governance for Indian institutional investors

•Feb 24, 2026•0 citations

Toward Quantum Combinatorial Optimization

Yunpyo Hong, Jaejoon Gill, Daeyeun Kim +3 more

The Quantum Approximate Optimization Algorithm (QAOA) has emerged as one of the most prominent hybrid quantum–classical algorithms for combinatorial optimization on noisy intermediate-scale quantum (NISQ) hardware. QAOA maps real-world problems into Ising or quadratic unconstrained binary optimization (QUBO) forms and alternates cost and mixer operators in a shallow parameterized circuit whose angles are tuned by a classical optimizer. This article introduces QAOA from fundamentals to practice, emphasizing why it aligns with industrial optimization through binary decision modeling and the presence of severe scaling challenges in classical optimization. We review research trends that improve expressivity and trainability, including ansatz engineering, parameter initialization, and hybrid training strategies, drawing parallels to developments in artificial intelligence. After that, we survey representative applications in emerging domains such as drug discovery, materials design, semiconductor design, logistics, and finance highlighting practical encodings and constraint-preserving formulations that keep quantum evolution within feasible subspaces beyond penalty-based methods. Finally, we present QAOA as a rapidly maturing framework with credible pathways toward near-term utility in real industrial workflows.

IEEE Nanotechnology Magazine•Jan 1, 2026•0 citations
Abstract The selection of crude oil feedstock is a critical, high-impact optimization problem in the petrochemical industry, directly influencing refinery profitability and environmental footprint. Traditional optimization methods face scalability challenges as the complexity and number of constraints increase. This paper presents an initial study on the application of quantum computing to solve a binary feedstock optimization model. We formulate the problem as a Quadratic Unconstrained Binary Optimization (QUBO) model and employ the Quantum Approximate Optimization Algorithm (QAOA) to find low-cost solutions. To manage the probabilistic nature of quantum results, we introduce Conditional Value at Risk (CVaR) as a post-processing technique to select robust, high-quality solutions. Our results on a representative small-scale problem demonstrate the viability of this hybrid quantum-classical approach, showing its potential to identify near-optimal solutions. We conclude with a discussion of current limitations and an open call for collaboration to further explore quantum computing applications in the energy sector.
The optimization of front-end crude oil scheduling is a critical determinant of refinery profitability and operational stability. However, the coupling of discrete logistics events (e.g., vessel berthing) with continuous material flows (e.g., pipeline transfers) renders this problem an NP-hard Mixed-Integer Linear Programming (MILP) challenge, often intractable for classical solvers at industrial scales. This study proposes a novel hybrid quantum-classical framework to address these computational bottlenecks. We employ Benders Decomposition to decouple the monolithic model into a discrete Master Problem (MP) and a continuous Subproblem (SP). To exploit the search capabilities of quantum computing, the MP is reformulated as a Quadratic Unconstrained Binary Optimization (QUBO) model and solved via a hybrid quantum solver, while the SP enforces mass balance and quality constraints through iterative optimality and feasibility cuts. Extensive experiments on 15 multi-scale instances demonstrate that the proposed framework significantly outperforms traditional metaheuristics (e.g., Genetic Algorithms, Tabu Search), reducing total operating costs by approximately 73--80% and achieving computational speeds comparable to state-of-the-art commercial solvers (Gurobi). By effectively leveraging global optimality cuts, the method overcomes the tendency of heuristic approaches to trap in local optima, providing a robust and scalable solution for complex refinery logistics.
This paper presents the application of a quantum optimization technique to a mining problem. A mine planning problem in an open-pit mine is reformulated as a Quadratic Unconstrained Binary Optimization (QUBO) model and solved using the Quantum Approximate Optimization Algorithm (QAOA). The problem seeks to maximize the monetary benefit while respecting precedence constraints between blocks and extraction capacity limitations. The methodology is validated through a fictitious copper deposit case study, where the quantum algorithm identifies the optimal extraction, a result validated with Gurobi solver. Although the approach demonstrates technical feasibility, the scalability limitations of current quantum simulators restrict applications to large-scale problems. This work establishes fundamental foundations for applying quantum computing to mine planning challenges and represents a step toward leveraging quantum computational advantages for NP-hard problems in the mining industry.
Quantum computing has the potential to improve financial portfolio optimization by addressing scalability and computational complexity issues. This article explores the application of quantum algorithms to portfolio optimization. It begins by discussing the limitations of classical optimization methods and introduces the basics of quantum computing. Two key quantum algorithms, quantum annealing and the Quantum Approximate Optimization Algorithm (QAOA), are presented in detail. These algorithms are applied to solve the Quadratic Unconstrained Binary Optimization (QUBO) formulation of the portfolio optimization problem. The article provides a high-level quantum algorithm, along with its pseudo-code Python implementation. The potential computational speedup of quantum algorithms is analyzed, highlighting the theoretical quadratic speedup over classical methods. However, the article also acknowledges the challenges and limitations currently facing quantum computing. It also concludes by emphasizing the promising future of quantum computing in finance and encourages further research to unlock the full potential of quantum technologies in portfolio optimization and other complex financial problems.
Quantum finance represents a pivotal and cutting-edge application domain within the burgeoning field of quantum computing. In this work, we propose a two-step quantum approximate optimization algorithm (two-step QAOA) for portfolio optimization and risk assessment. The algorithm initiates by formulating the stock selection problem as a quadratic unconstrained binary optimization (QUBO) problem and employs a classical-quantum hybrid method to find the ground state of the Hamiltonian. We then introduce an energy-based characteristic indicator U∈[0,1), which quantitatively evaluates portfolio performance under customizable investment preferences, effectively capturing the trade-off between expected return and risk. The number of qubits required scales with the number of stocks N in the pool, and the number of Hamiltonian terms is O(N2). Numerical simulations show that the algorithm provides consistent and reasonable assessment results on both training and test datasets under different investment preferences (aggressive or conservative), validating the capability of the characteristic indicator to extract intrinsic information from the portfolios. Additionally, by incorporating warm-starting and digitized counterdiabatic techniques, the algorithm achieves improved scalability and faster convergence. Our work presents a flexible and practical algorithmic framework for applying quantum computing in the financial domain.
Portfolio optimization under realistic constraints represents a computationally intensive problem for classical financial models, particularly in volatile and high-dimensional markets such as India.Conventional mean-variance approaches become NP-hard when integer, cardinality, and regulatory constraints are incorporated.This paper investigates the applicability of quantum computing techniques for constrained portfolio optimization in the Indian financial context.The study analyzes quantum annealing and gate-based variational algorithms, including the Quantum Approximate Optimization Algorithm (QAOA) and Variational Quantum Eigensolver (VQE), with emphasis on Quadratic Unconstrained Binary Optimization (QUBO) formulations.In addition, quantum amplitude estimation methods are examined for accelerating financial risk metrics such as Value-at-Risk and Conditional Value-at-Risk.Empirical results derived from thematic and regression analyses indicate that perceived computational advantage and organizational readiness significantly influence adoption intent, while quantum-related security risks act as a moderating factor.The findings suggest that hybrid classical-quantum architectures provide a practical pathway during the Noisy Intermediate-Scale Quantum era.The paper concludes that early-stage quantum adoption, combined with post-quantum cryptographic preparedness, can enhance portfolio efficiency and risk governance for Indian institutional investors
The Quantum Approximate Optimization Algorithm (QAOA) has emerged as one of the most prominent hybrid quantum–classical algorithms for combinatorial optimization on noisy intermediate-scale quantum (NISQ) hardware. QAOA maps real-world problems into Ising or quadratic unconstrained binary optimization (QUBO) forms and alternates cost and mixer operators in a shallow parameterized circuit whose angles are tuned by a classical optimizer. This article introduces QAOA from fundamentals to practice, emphasizing why it aligns with industrial optimization through binary decision modeling and the presence of severe scaling challenges in classical optimization. We review research trends that improve expressivity and trainability, including ansatz engineering, parameter initialization, and hybrid training strategies, drawing parallels to developments in artificial intelligence. After that, we survey representative applications in emerging domains such as drug discovery, materials design, semiconductor design, logistics, and finance highlighting practical encodings and constraint-preserving formulations that keep quantum evolution within feasible subspaces beyond penalty-based methods. Finally, we present QAOA as a rapidly maturing framework with credible pathways toward near-term utility in real industrial workflows.