Time Complexity – Computer Science

Complexity Hierarchy Logarithmic: $O(\log n)$ The “Sublinear” breakthrough. Allows processing of massive matrices by only sampling specific parts. Linear: $O(n)$ The “Old” Standard. Required reading the entire input, which is impossible for modern recommendation scales. Polynomial: $O(poly(k))$ The “Classical Analogue.” While slower than quantum, it remains fast enough to be practical. Exponential: $O(2^n)$ The “Quantum ... Read More

Machine Learning Applications – Learning Associations

References: Learning Associations Association Rule Learning is a rule-based method used to discover interesting relations or “hidden patterns” between variables in large databases. It is primarily an unsupervised learning technique because it doesn’t require pre-labeled data; it simply looks for items that frequently occur together. The most famous application is Market Basket Analysis, which retailers ... Read More

Quantum Federated Learning with Qiskit

Resources: What is Quantum Federated Learning? Quantum Federated Learning (QFL) is a decentralized machine learning framework where multiple clients collaboratively train a global quantum model without sharing their private, local data. In this framework, clients perform local training on their own datasets and then share only their updated model weights with a central server for ... Read More

Calculus – Natural Logarithms

Resources: What is Natural Logarithm? In calculus, the natural logarithm is the logarithm to the base e, where e is an irrational and transcendental constant approximately equal to 2.71828. Unlike base-10 logarithms (common logs), the natural logarithm, denoted as $ln(x)$, is preferred in calculus because it simplifies the differentiation and integration of exponential functions. 1. ... Read More
error: