Performance Models for Split-execution Computing Systems

Abstract

Split-execution computing leverages the capabilities of multiple computational models to solve problems, but splitting program execution across different computational models incurs costs associated with the translation between domains. We analyze the performance of a split-execution computing system developed from conventional and quantum processing units (QPUs) by using behavioral models that track resource usage. We focus on asymmetric processing models built using conventional CPUs and a family of special-purpose QPUs that employ quantum computing principles. Our performance models account for the translation of a classical optimization problem into the physical representation required by the quantum processor while also accounting for hardware limitations and conventional processor speed and memory. We conclude that the bottleneck in this split-execution computing system lies at the quantum-classical interface and that the primary time cost is independent of quantum processor behavior.

Presented at 18th Workshop on Advances in Parallel and Distributed Computational Models [APDCM2016] on 23 May 2016; 10 pages

References in corpus (18)

• Quantum Computing
• Ising formulations of many NP problems
• Quantum Annealing in the Transverse Ising Model
• Experimental Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor
• Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
• A case study in programming a quantum annealer for hard operational planning problems
• Entanglement in a quantum annealing processor
• Realizable Hamiltonians for Universal Adiabatic Quantum Computers
• A scalable control system for a superconducting adiabatic quantum optimization processor
• On the construction of model Hamiltonians for adiabatic quantum computation and its application to finding low energy conformations of lattice protein models
• Quantum adiabatic machine learning
• Experimental determination of Ramsey numbers
• Ramsey numbers and adiabatic quantum computing
• Experimental quantum annealing: case study involving the graph isomorphism problem
• Graph isomorphism and adiabatic quantum computing
• Solving the Graph Isomorphism Problem with a Quantum Annealer
• An Integrated Programming and Development Environment for Adiabatic Quantum Optimization
• Hearing the Shape of the Ising Model with a Programmable Superconducting-Flux Annealer