Workshop Description
Quantum machine learning encompasses several algorithmic families with different maturity levels and different claims. Quantum kernel estimation (QKE) uses quantum circuits to compute similarity measures in high-dimensional feature spaces, potentially identifying patterns invisible to classical kernels. Quantum support vector machines (QSVM) apply these kernels to classification tasks. Quantum graph algorithms promise speedups for network analysis relevant to intelligence link analysis. However, dequantisation results (Tang 2019, subsequent work) have shown that many claimed quantum speedups evaporate when classical algorithms are given access to the same data structures.
This workshop gives intelligence data science teams an honest picture. Participants examine QKE, QSVM, and quantum graph algorithm implementations, understand the specific data characteristics where quantum kernels might outperform classical alternatives, and learn to identify overclaimed results in vendor presentations. The interactive demonstration compares quantum and classical kernel methods on a pattern recognition task representative of intelligence data analysis, showing both the potential and the current limitations.
What participants cover
- Quantum kernel estimation (QKE): circuit design, feature maps, and kernel matrix computation
- QSVM for classification: quantum advantage conditions and dequantisation limitations
- Quantum graph algorithms: link analysis, community detection, and network flow for intelligence graphs
- Barren plateaus and trainability: why variational quantum circuits struggle with large feature spaces
- Dequantisation: when classical algorithms match quantum speedup claims (Tang 2019 and subsequent results)
- Benchmark-specific performance comparisons on intelligence-representative datasets