Continuous-time quantum computing

Quantum computation using continuous-time evolution under a natural hardware Hamiltonian is a promising near- and mid-term direction toward powerful quantum computing hardware. Continuous-time quantum computing (CTQC) encompasses continuous-time quantum walk computing (QW), adiabatic quantum computing (AQC), and quantum annealing (QA), as well as other strategies which contain elements of these three. While much of current quantum computing research focuses on the discrete-time gate model, which has an appealing similarity to the discrete logic of classical computation, the continuous nature of quantum information suggests that continuous-time quantum information processing is worth exploring. A versatile context for CTQC is the transverse Ising model, and this thesis will explore the application of Ising model CTQC to classical optimization problems. Classical optimization problems have industrial and scientific significance, including in logistics, scheduling, medicine, cryptography, hydrology and many other areas. Along with the fact that such problems often have straightforward, natural mappings onto the interactions of readily-available Ising model hardware makes classical optimization a fruitful target for CTQC algorithms. After introducing and explaining the CTQC framework in detail, in this thesis I will, through a combination of numerical, analytical, and experimental work, examine the performance of various forms of CTQC on a number of different optimization problems, and investigate the underlying physical mechanisms by which they operate.Open Acces