Foundational Patterns for Efficient Quantum Computing
Abstract
We present a number of quantum computing patterns that build on top of fundamental algorithms, that can be applied to solving concrete, NP-hard problems. In particular, we introduce the concept of a quantum dictionary as a summation of multiple patterns and algorithms, and show how it can be applied in the context of Quadratic Unconstrained Binary Optimization (QUBO) problems. We start by presenting a visual approach to quantum computing, which avoids a heavy-reliance on quantum mechanics, linear algebra, or complex mathematical notation, and favors geometrical intuition and computing paradigms. We also provide insights on the fundamental quantum computing algorithms (Fourier Transforms, Phase Estimation, Grover, Quantum Counting, and Amplitude Estimation).
Cite
@article{arxiv.1907.11513,
title = {Foundational Patterns for Efficient Quantum Computing},
author = {Austin Gilliam and Charlene Venci and Sreraman Muralidharan and Vitaliy Dorum and Eric May and Rajesh Narasimhan and Constantin Gonciulea},
journal= {arXiv preprint arXiv:1907.11513},
year = {2021}
}
Comments
37 pages, 79 figures