Cloning And Beyond: A Quantum Solution to Duplicate Code
summary
Maps AST subgraph isomorphism to a quadratic optimization solved on a D‑Wave Advantage quantum annealer, builds a DQM/QUBO formulation with node‑type constraints and runs the hybrid cloud solver. Evaluates 25 code fragments (total 325 pairwise comparisons) across 6,500 runs, reports normalized energy scores where lower implies higher similarity, finds a Type‑3 example (for → while) at 0.88 energy and diagonal matches near 0.0 when node types are used, and measures runtimes from ~109 ms (14‑node) to ~190 ms (68‑node) while noting qubit and hybrid‑system limitations.
AI-written summary · about
chapters (9)
- 0:00Introduction
- 1:04Quantum code clone detection
- 3:13Quantum computing basics
- 8:08Quantum annealing for optimization
- 10:20Code clone detection as QUBO
- 14:17Experiment design and hardware
- 15:42Results and analysis
- 21:03Conclusion and future work
- 22:50Q&A
related talks
41mQuantum Computing in Practice: Where We Are, What Works, and What’s Next
14mDependency-Aware Compilation for Surface Code Quantum Architectures
47mUnboxing Quantum Computing
17mExploring Quantum Algorithms for Optimal Sensor Placement in Production Environments
21mSoftware for Quantum Computing- Easing Solutions for Complex
27mA Haskell Adiabatic DSL: Solving Classical Optimization Problems on Quantum Hardware
22mQUARK: A Framework for Quantum Computing Application Benchmarking
19mAn Industry Perspective on the Path Forward in Quantum Optimization