SearcharxivSearch

arXiv subjects

Matthew J. Craven

Publications and source records attributed to Matthew J. Craven.

3 recordsLinked to original sources

Investigating Techniques to Optimise the Layout of Turbines in a Windfarm using a Quantum Computer

This paper investigates Windfarm Layout Optimization (WFLO), where we formulate turbine placement considering wake effects as a Quadratic Unconstrained Binary Optimization (QUBO) problem. Wind energy plays a critical role in the transition toward sustainable power systems, but the optimal placement of turbines remains a challenging combinatorial problem due to complex wake interactions. With recent advances in quantum computing, there is growing interest in exploring whether hybrid quantum-classical methods can provide advantages for such computationally intensive tasks. We investigate solving the resulting QUBO problem using the Variational Quantum Eigensolver (VQE) implemented on Qiskit's quantum computer simulator, employing a quantum noise-free, gate-based circuit model. Three classical optimizers are discussed, with a detailed analysis of the two most effective approaches: Constrained Optimization BY Linear Approximation (COBYLA) and Bayesian Optimization (BO). We compare these simulated quantum results with two established classical optimization methods: Simulated Annealing (SA) and the Gurobi solver. The study focuses on 4$\times$4 grid configurations (requiring 16 qubits), providing insights into near-term quantum algorithm applicability for renewable energy optimization.

quant-ph

Quantum Phase Transition of Non-Hermitian Systems using Variational Quantum Techniques

The motivation for studying non-Hermitian systems and the role of $\mathcal{PT}$-symmetry is discussed. We investigate the use of a quantum algorithm to find the eigenvalues and eigenvectors of non-Hermitian Hamiltonians, with applications to quantum phase transitions. We use a recently proposed variational algorithm. The systems studied are the transverse Ising model with both a purely real and a purely complex transverse field.

quant-ph

Evolution of Group-Theoretic Cryptology Attacks using Hyper-heuristics

In previous work, we developed a single Evolutionary Algorithm (EA) to solve random instances of the Anshel-Anshel-Goldfeld (AAG) key exchange protocol over polycyclic groups. The EA consisted of six simple heuristics which manipulated strings. The present work extends this by exploring the use of hyper-heuristics in group-theoretic cryptology for the first time. Hyper-heuristics are a way to generate new algorithms from existing algorithm components (in this case the simple heuristics), with the EAs being one example of the type of algorithm which can be generated by our hyper-heuristic framework. We take as a starting point the above EA and allow hyper-heuristics to build on it by making small tweaks to it. This adaptation is through a process of taking the EA and injecting chains of heuristics built from the simple heuristics. We demonstrate we can create novel heuristic chains, which when placed in the EA create algorithms which out-perform the existing EA. The new algorithms solve a markedly greater number of random AAG instances than the EA for harder instances. This suggests the approach could be applied to many of the same kinds of problems, providing a framework for the solution of cryptology problems over groups. The contribution of this paper is thus a framework to automatically build algorithms to attack cryptology problems.

math.GR