mathematics Functions A function \(f\) from a set \(D\) to a set \(Y\) is a rule that assigns a unique value \(f(x)\) in \(Y\) to each \(x\) in \(D\). The set \(D\) of all

quantum Quantum Turing machine The quantum Turing machine (QTM) is the quantum analogon of a Turing machine (TM).

quantum SchrÃ¶dinger equation The SchrÃ¶dinger equation is the fundamental equation of physics for describing quantum mechanical behavior.

quantum Quantum computing Quantum computing is computing using quantum mechanical phenomena, such as superposition and entanglement.

quantum Quantum mechanics "Quantum mechanics" is the description of the behavior of matter and light in all its details and, in particular of the happenings on an atomic scale.

machine learning Artificial Neural Network Artificial neural networks (ANNs) are computing systems vaguely inspired by the biological neural networks.

greedy algorithm Continuous Knapsack Problem Also known as the fractional knapsack problem. Continuous knapsack problem can be solved by a greedy algorithm.

dynamic programming Subset Sum Problem A special case of 0/1 Knapsack Problem Given a finite set \(S = \{ s \in \mathbb{Z}_+\}\) and an integer \(t < 0 \), is there a subset

mathematics Quadratic Equations When \(a \ne 0\) , there are two solutions to \(ax^2 + bx + c = 0\) and they are $$x = {-b \pm \sqrt{b^2-4ac} \over 2a}.$$ Discriminant: \(D = b^2-4ac\) If \(\alpha\) and \(\beta\

dynamic programming The Coin Change Problem The coin change problem is a classic dynamic programming problem (unbounded knapsack problem) which can be solved recursively. N = Coins with different denominations D = Array of denominations S = Total amount to make C