Cover Image

A Quantum Computing Approach for the Unit Commitment Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Halffmann, Pascal, Holzer, Patrick, Plociennik, Kai, Trebing, Michael
Format:	Preprint
Published:	2022
Subjects:	Quantum Physics Optimization and Control 68Q12, 90C27
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Harnessing Inferior Solutions For Superior Outcomes: Obtaining Robust Solutions From Quantum Algorithms
by: Halffmann, Pascal, et al.
Published: (2024)

Accuracy and Performance Evaluation of Quantum, Classical and Hybrid Solvers for the Max-Cut Problem
by: Vodeb, Jaka, et al.
Published: (2024)

Quantum Computing in Logistics and Supply Chain Management an Overview
by: Phillipson, Frank
Published: (2024)

An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers
by: Mohammadisiahroudi, Mohammadhossein, et al.
Published: (2023)

Investigating Techniques to Optimise the Layout of Turbines in a Windfarm using a Quantum Computer
by: Hancock, James, et al.
Published: (2023)

Optimal phase change for a generalized Grover's algorithm
by: Cardullo, Christopher, et al.
Published: (2025)

The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty
by: Goerigk, Marc, et al.
Published: (2026)

On the Hardness of the $L_1-L_2$ Regularization Problem
by: Ouyang, Yuyuan, et al.
Published: (2024)

Solving the semidefinite relaxation of QUBOs in matrix multiplication time, and faster with a quantum computer
by: Augustino, Brandon, et al.
Published: (2023)

Investigating methods to solve large windfarm optimization problems with a minimum number of qubits using circuit-based quantum computers
by: Hancock, James, et al.
Published: (2025)

Convergence and efficiency proof of quantum imaginary time evolution for bounded order systems
by: Hartung, Tobias, et al.
Published: (2025)

Fast Expectation Value Calculation Speedup of Quantum Approximate Optimization Algorithm: HoLCUs QAOA
by: Ali, Alejandro Mata
Published: (2025)

Quantum Annealing and Tensor Networks: a Powerful Combination to Solve Optimization Problems
by: Binimelis, Miquel Albertí
Published: (2024)

Scalability Challenges in Variational Quantum Optimization under Stochastic Noise
by: Bärligea, Adelina, et al.
Published: (2025)

Quantum Algorithms for Drone Mission Planning
by: Davies, Ethan, et al.
Published: (2024)

Heart Disease Detection using Quantum Computing and Partitioned Random Forest Methods
by: Heidari, Hanif, et al.
Published: (2022)

Improved approximation ratios for the Quantum Max-Cut problem on general, triangle-free and bipartite graphs
by: Gribling, Sander, et al.
Published: (2025)

Topological structure and a polynomial-time solution of linear programming over the real numbers
by: Wei, Jing-Yuan
Published: (2018)

A non-iterative polynomial algorithm for linear programming
by: Jing-Yuan, Wei
Published: (2013)

Quantum and Simulated Annealing-Based Iterative Algorithms for QUBO Relaxations of the Sparsest $k$-Subgraph Problem
by: Bihani, Omkar, et al.
Published: (2025)

Beyond Discreteness: Sample Complexity Analysis of Straight-Through Estimator for 1-bit Quantization
by: Jeong, Halyun, et al.
Published: (2025)

Performance enhancing of hybrid quantum-classical Benders approach for MILP optimization
by: López-Baños, Sergio, et al.
Published: (2026)

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
by: Hua, Zheng, et al.
Published: (2021)

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
by: Nesterov, Yurii
Published: (2025)

Kurdyka-Łojasiewicz exponent via Hadamard parametrization
by: Ouyang, Wenqing, et al.
Published: (2024)

Kurdyka-Łojasiewicz exponent via square transformation
by: Ouyang, Wenqing
Published: (2025)

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
by: Zhang, Liwei, et al.
Published: (2025)

Uncomputability of Global Optima for Nonconvex Functions in the Oracle Model
by: Lakshmanan, K
Published: (2023)

Knapsack and Shortest Path Problems Generalizations From A Quantum-Inspired Tensor Network Perspective
by: Subiñas, Sergio Muñiz, et al.
Published: (2025)

RFOX (Rotated-Field Oscillatory eXchange) quantum algorithm: Towards Parameter-Free Quantum Optimizers
by: Sarmina, Brian García, et al.
Published: (2026)

Quantum computing and the stable set problem
by: Krpan, Aljaž, et al.
Published: (2024)

Quadratic Programming over Linearly Ordered Fields: Decidability and Attainment of Optimal Solutions
by: Plutenko, Dmytro O.
Published: (2026)

Phase Matching for a Generalized Grover's Algorithm
by: Cardullo, Chris, et al.
Published: (2026)

Computational Phase Transitions in Binary Compressed Sensing: Quantum Annealing Inside the Relaxation Gap
by: Hahn, William, et al.
Published: (2026)

Accelerating preconditioned ADMM via degenerate proximal point mappings
by: Sun, Defeng, et al.
Published: (2024)

Tensor-Network Formulation of the Traveling Salesman Problem and Variants
by: Ali, Alejandro Mata, et al.
Published: (2023)

Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems
by: Bousselmi, Nizar, et al.
Published: (2023)

Supplementary Materials to Graph Convolutional Branch and Bound
by: Sciandra, Lorenzo, et al.
Published: (2024)

Improved Regret Guarantees for Online Mirror Descent using a Portfolio of Mirror Maps
by: Gupta, Swati, et al.
Published: (2026)

SDP Approach to Quadratic Vertex-Disjoint Paths Problem
by: Xu, Mingming, et al.
Published: (2026)