Foundational Patterns for Efficient Quantum Computing

Understand

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).