Related papers: Community Detection in Electrical Grids Using Quan…
The use of quantum computing in graph community detection and regularity checking related to Szemeredi's Regularity Lemma (SRL) are demonstrated with D-Wave Systems' quantum annealer and simulations. We demonstrate the capability of quantum…
In the quantum optimization paradigm, variational quantum algorithms face challenges with hardware-specific and instance-dependent parameter tuning, which can lead to computational inefficiencies. The promising potential of parameter…
Despite rapid recent progress towards the development of quantum computers capable of providing computational advantages over classical computers, it seems likely that such computers will, initially at least, be required to run in a hybrid…
Quantum computing promises solutions to classically difficult and new-found problems through controlling the subtleties of quantum computing. The Quantum Approximate Optimisation Algorithm (QAOA) is a recently proposed quantum algorithm…
Quantum annealing is an emerging metaheuristic used for solving combinatorial optimisation problems. However, hardware based physical quantum annealers are primarily limited to a single vendor. As an alternative, we can discretise the…
The efficient management of energy communities relies on the solution of the "prosumer problem", i.e., the problem of scheduling the household loads on the basis of the user needs, the electricity prices, and the availability of local…
Quantum technology is maturing to the point where quantum devices, such as quantum communication systems, quantum random number generators and quantum simulators, may be built with capabilities exceeding classical computers. A quantum…
This paper presents a novel optimization approach for allocating grid operation costs in Peer-to-Peer (P2P) electricity markets using Quantum Computing (QC). We develop a Quadratic Unconstrained Binary Optimization (QUBO) model that matches…
Quantum annealers of D-Wave Systems, Inc., offer an efficient way to compute high quality solutions of NP-hard problems. This is done by mapping a problem onto the physical qubits of the quantum chip, from which a solution is obtained after…
This PhD thesis explores the potential of quantum computing to address computational challenges in high-energy physics (HEP). As the Standard Model (SM) leaves key questions unanswered and no signs of new physics have emerged since the…
Quantum computing promises to speed up some of the most challenging problems in science and engineering. Quantum algorithms have been proposed showing theoretical advantages in applications ranging from chemistry to logistics optimization.…
Practical quantum networking architectures are crucial for scaling the connection of quantum resources. Yet quantum network testbeds have thus far underutilized the full capabilities of modern lightwave communications, such as flexible-grid…
We evaluate the application of quantum annealing (QA) to a real-world combinatorial optimisation problem-room scheduling for sports camps at the Australian Institute of Sport-using both classical and quantum approaches. Due to current…
The even distribution and optimization of tasks across resources and workstations is a critical process in manufacturing aimed at maximizing efficiency, productivity, and profitability, known as Robotic Assembly Line Balancing (RALB). With…
Combinatorial optimization is anticipated to be one of the primary use cases for quantum computation in the coming years. The Quantum Approximate Optimization Algorithm (QAOA) and Quantum Annealing (QA) can potentially demonstrate…
There has been considerable progress in the design and construction of quantum annealing devices. However, a conclusive detection of quantum speedup over traditional silicon-based machines remains elusive, despite multiple careful studies.…
The transition to 100% renewable energy requires new techniques for managing energy networks, such as dividing them into sensible subsets of prosumers called micro-grids. Doing so in an optimal manner is a difficult optimization problem, as…
Electric vehicles (EVs) are finally making their way onto the roads, but the challenges concerning long charging times and impact on congestion of the power distribution grid are still not resolved. Proposed solutions depend on heavy…
Stochastic Unit Commitment (SUC) has been proposed to manage the uncertainties driven by renewable integration, but it leads to significant computational complexity. When accelerated by Benders Decomposition (BD), the master problem becomes…
Quantum annealers can be used to solve many (possibly NP-hard) combinatorial optimization problems, by formulating them as quadratic unconstrained binary optimization (QUBO) problems or, equivalently, using the Ising formulation. In this…