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.
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.
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.
Optimization problems are fundamental across various scientific and industrial domains, from logistics and finance to machine learning and drug discovery. Classical optimization algorithms, such as gradient-based methods and heuristic approaches, often struggle with issues like slow convergence, getting trapped in local minima, and inefficiency in handling high-dimensional or combinatorial problems. Applying the concepts of quantum optimization with quantum mechanics algorithms presents viable substitutes with the potential for speedups and better solution quality. Among the significant quantum optimization techniques investigated in this paper are Grover's Search Algorithm, Variational Quantum Eigensolver (VQE), Quantum Annealing, and the Quantum Approximate Optimization Algorithm (QAOA). QAOA is designed for combinatorial optimization problems, blending quantum and classical techniques to approximate optimal solutions. VQE, widely used in quantum chemistry, employs a hybrid quantum-classical approach to determine ground-state energies efficiently. Grover's algorithm fastens up searching databases, indirectly aiding optimization tasks. Quantum annealing, implemented by systems like D-Wave, solves optimization problems by exploiting quantum tunneling to escape local minima. Despite their advantages, these quantum approaches face challenges, including hardware limitations, noise in quantum systems, and scalability concerns. However, these algorithms are expected to be essential in solving complicated optimization problems that are currently intractable by classical approaches when quantum technology develops.
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.
In this thesis, I explore the domain of hybrid quantum-classical computation, the foremost approach for utilizing Noisy Intermediate-Scale Quantum (NISQ) devices. The opening chapter presents an overview of Variational Quantum Algorithms (VQAs), highlighting the primary algorithmic challenges. It offers an in-depth review of the Quantum Approximate Optimization Algorithm (QAOA), discussing its variants for ground state preparation. In the second chapter, we apply QAOA for the supervised learning of a simple Binary Neural Network. This model represents an idealized yet prototypical example of classical combinatorial optimization problems involving multi-spin interactions. In the following chapters, the discussion shifts toward quantum many-body ground state preparation, focusing on the one-dimensional Heisenberg XYZ model and the longitudinal-transverse-field Ising model (LTFIM). We have developed a novel technique that, at any point in the phase diagram, leverages the transferability of a specific class of optimal schedules from systems with small to those with larger numbers of qubits. This approach mitigates trainability issues, specifically vanishing gradients (Barren Plateaus). Next, we tailor a QAOA scheme to characterize a topological quantum phase transition within a lattice gauge theory model. This investigation is particularly significant due to its implications for high-energy physics and relevance to quantum error correction and surface codes. In the concluding chapter, I propose new stimulating research directions and help to identify core challenges and unresolved questions in variational quantum computing that transcend any particular application domain.
Abstract Optimization drives advances in quantum science and machine learning, yet most generative models aim to mimic data rather than to discover optimal answers to challenging problems. Here we present a variational generative optimization network that learns to map simple random inputs into high quality solutions across a variety of quantum tasks. We demonstrate that the network rapidly identifies entangled states exhibiting an optimal advantage in entanglement detection when allowing classical communication, attains the ground state energy of an eighteen spin model without encountering the barren plateau phenomenon that hampers standard hybrid algorithms, and—after a single training run—outputs multiple orthogonal ground states of degenerate quantum models. Because the method is model agnostic, parallelizable and runs on current classical hardware, it can accelerate future variational optimization problems in quantum information, quantum computing and beyond.