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

arXiv:2107.11345

A quantum computational approach to the open-pit mining problem

Yousef Hindy, Jessica Pointing, Meltem Tolunay, Sreeram Venkatarao, Mário Motta, Joseph A. Latone

Published Jul 23, 2021• 4 citations
arXivHTMLPDF

Abstract

The determination of optimal open-pit profiles is a well-studied combinatorial optimization problem, with profound technical and conceptual relevance in computational mining. The ongoing evolution of quantum computing hardware and the recent advances of heuristic quantum algorithms make it worthwhile to explore the solution of the open-pit mining problem on quantum computers. In this work, we cast the open-pit mining problem as a Hamiltonian ground-state search problem, which in turn we solve with a dedicated implementation of the variational quantum eigensolver algorithm, and we propose a domain decomposition approach to extend the reach of today's small scale quantum hardware. The procedure is demonstrated on IBMQ devices using four qubits. This is the first example, to the best of our knowledge, of open-pit profile calculations being performed on quantum hardware.

DOI
10.48550/arxiv.2107.11345

Related papers

Application of the Variational Quantum Eigensolver to the Ultimate Pit Problem

Yousef Hindy, Jessica Pointing, Meltem Tolunay +3 more

Determining the ultimate pit profile that maximizes the profit while minimizing the cost of mine extraction is a fundamental problem in open-pit mining. The development of quantum computing hardware and advances in heuristic quantum algorithms make it possible to explore quantum computing as a solution for the ultimate pit problem. Here, we cast the ultimate pit problem as a Hamiltonian ground-state search problem, which we approximately solve using the variational quantum eigensolver algorithm. Moreover, we use a domain decomposition approach to extend the reach of today's small-scale quantum hardware. We demonstrate the procedure on IBMQ devices using four qubits. To the best of our knowledge, this is the first attempt to use heuristic quantum algorithms to map small-scale instances of the ultimate pit problem on quantum hardware.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•2 citations

Quantum-Assisted Open-Pit Optimization

Georgii Vitalievich Paradezhenko, Anastasiia A. Pervishko, D. Yudin

With the recent advances in experimental realization of multi-qubit systems the idea of delegating certain real-life optimization tasks to a quantum computer becomes viable. In particular, we herein examine a variational quantum algorithm applied to a three-dimensional problem of open-pit mining, where the core of the classical optimization loop is provided by the probabilistic tensor sampling method. The developed technique is challenged against conventional optimization routines subjected to the essential optimization issues in variational quantum algorithms such as barren plateaus and multiple local minima. We demonstrate that the probabilistic tensor train-based approach allows one to steadily identify the ground state of a given system.

Journal of Experimental and Theoretical Physics Letters•Mar 1, 2024•2 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

A Quantum-Inspired Tensor Network Algorithm for Constrained Combinatorial Optimization Problems

Tianyi Hao, Xu-Xin Huang, Chunjing Jia +1 more

Combinatorial optimization is of general interest for both theoretical study and real-world applications. Fast-developing quantum algorithms provide a different perspective on solving combinatorial optimization problems. In this paper, we propose a quantum-inspired tensor-network-based algorithm for general locally constrained combinatorial optimization problems. Our algorithm constructs a Hamiltonian for the problem of interest, effectively mapping it to a quantum problem, then encodes the constraints directly into a tensor network state and solves the optimal solution by evolving the system to the ground state of the Hamiltonian. We demonstrate our algorithm with the open-pit mining problem, which results in a quadratic asymptotic time complexity. Our numerical results show the effectiveness of this construction and potential applications in further studies for general combinatorial optimization problems.

arXiv:2203.15246•Frontiers in Physics•Jul 8, 2022•35 citations

Exploring Quantum Computing Algorithms for Optimization Problems

Ananya Krishnan, Edward Tanaka

Optimization problems are pervasive across various domains, including logistics, finance, machine learning, and operations research. Quantum computing has emerged as a promising frontier to address these challenges, offering potential speedups for certain classes of optimization tasks. This paper explores the development and application of quantum algorithms, such as the Quantum Approximate Optimization Algorithm (QAOA), Variational Quantum Eigensolver (VQE), and Grover’s search algorithm, tailored for optimization. Recent advancements in hardware, hybrid quantum-classical approaches, and variational techniques have enabled practical implementations on Noisy Intermediate-Scale Quantum (NISQ) devices. Challenges such as noise, scalability, and performance limitations are also discussed. Through theoretical analysis and case studies, this work demonstrates how quantum computing can complement classical methods, paving the way for breakthroughs in solving complex optimization problems.

International Journal on Advanced Computer Theory and Engineering•Apr 15, 2025•1 citation

A case study of variational quantum algorithms for a job shop scheduling problem

David Amaro, Matthias Rosenkranz, Nathan Fitzpatrick +2 more

Abstract Combinatorial optimization models a vast range of industrial processes aiming at improving their efficiency. In general, solving this type of problem exactly is computationally intractable. Therefore, practitioners rely on heuristic solution approaches. Variational quantum algorithms are optimization heuristics that can be demonstrated with available quantum hardware. In this case study, we apply four variational quantum heuristics running on IBM’s superconducting quantum processors to the job shop scheduling problem. Our problem optimizes a steel manufacturing process. A comparison on 5 qubits shows that the recent filtering variational quantum eigensolver (F-VQE) converges faster and samples the global optimum more frequently than the quantum approximate optimization algorithm (QAOA), the standard variational quantum eigensolver (VQE), and variational quantum imaginary time evolution (VarQITE). Furthermore, F-VQE readily solves problem sizes of up to 23 qubits on hardware without error mitigation post processing.

arXiv:2109.03745•EPJ Quantum Technology•Feb 10, 2022•98 citations
The determination of optimal open-pit profiles is a well-studied combinatorial optimization problem, with profound technical and conceptual relevance in computational mining. The ongoing evolution of quantum computing hardware and the recent advances of heuristic quantum algorithms make it worthwhile to explore the solution of the open-pit mining problem on quantum computers. In this work, we cast the open-pit mining problem as a Hamiltonian ground-state search problem, which in turn we solve with a dedicated implementation of the variational quantum eigensolver algorithm, and we propose a domain decomposition approach to extend the reach of today's small scale quantum hardware. The procedure is demonstrated on IBMQ devices using four qubits. This is the first example, to the best of our knowledge, of open-pit profile calculations being performed on quantum hardware.
Determining the ultimate pit profile that maximizes the profit while minimizing the cost of mine extraction is a fundamental problem in open-pit mining. The development of quantum computing hardware and advances in heuristic quantum algorithms make it possible to explore quantum computing as a solution for the ultimate pit problem. Here, we cast the ultimate pit problem as a Hamiltonian ground-state search problem, which we approximately solve using the variational quantum eigensolver algorithm. Moreover, we use a domain decomposition approach to extend the reach of today's small-scale quantum hardware. We demonstrate the procedure on IBMQ devices using four qubits. To the best of our knowledge, this is the first attempt to use heuristic quantum algorithms to map small-scale instances of the ultimate pit problem on quantum hardware.
With the recent advances in experimental realization of multi-qubit systems the idea of delegating certain real-life optimization tasks to a quantum computer becomes viable. In particular, we herein examine a variational quantum algorithm applied to a three-dimensional problem of open-pit mining, where the core of the classical optimization loop is provided by the probabilistic tensor sampling method. The developed technique is challenged against conventional optimization routines subjected to the essential optimization issues in variational quantum algorithms such as barren plateaus and multiple local minima. We demonstrate that the probabilistic tensor train-based approach allows one to steadily identify the ground state of a given system.
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.
Combinatorial optimization is of general interest for both theoretical study and real-world applications. Fast-developing quantum algorithms provide a different perspective on solving combinatorial optimization problems. In this paper, we propose a quantum-inspired tensor-network-based algorithm for general locally constrained combinatorial optimization problems. Our algorithm constructs a Hamiltonian for the problem of interest, effectively mapping it to a quantum problem, then encodes the constraints directly into a tensor network state and solves the optimal solution by evolving the system to the ground state of the Hamiltonian. We demonstrate our algorithm with the open-pit mining problem, which results in a quadratic asymptotic time complexity. Our numerical results show the effectiveness of this construction and potential applications in further studies for general combinatorial optimization problems.
Optimization problems are pervasive across various domains, including logistics, finance, machine learning, and operations research. Quantum computing has emerged as a promising frontier to address these challenges, offering potential speedups for certain classes of optimization tasks. This paper explores the development and application of quantum algorithms, such as the Quantum Approximate Optimization Algorithm (QAOA), Variational Quantum Eigensolver (VQE), and Grover’s search algorithm, tailored for optimization. Recent advancements in hardware, hybrid quantum-classical approaches, and variational techniques have enabled practical implementations on Noisy Intermediate-Scale Quantum (NISQ) devices. Challenges such as noise, scalability, and performance limitations are also discussed. Through theoretical analysis and case studies, this work demonstrates how quantum computing can complement classical methods, paving the way for breakthroughs in solving complex optimization problems.
Abstract Combinatorial optimization models a vast range of industrial processes aiming at improving their efficiency. In general, solving this type of problem exactly is computationally intractable. Therefore, practitioners rely on heuristic solution approaches. Variational quantum algorithms are optimization heuristics that can be demonstrated with available quantum hardware. In this case study, we apply four variational quantum heuristics running on IBM’s superconducting quantum processors to the job shop scheduling problem. Our problem optimizes a steel manufacturing process. A comparison on 5 qubits shows that the recent filtering variational quantum eigensolver (F-VQE) converges faster and samples the global optimum more frequently than the quantum approximate optimization algorithm (QAOA), the standard variational quantum eigensolver (VQE), and variational quantum imaginary time evolution (VarQITE). Furthermore, F-VQE readily solves problem sizes of up to 23 qubits on hardware without error mitigation post processing.