Create GUIDE.md
Browse files
GUIDE.md
ADDED
|
@@ -0,0 +1,52 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
# π QSBench: Circuit Family Classifier Guide
|
| 2 |
+
|
| 3 |
+
Welcome to the **QSBench Classification Hub**. This project demonstrates how Machine Learning can identify the "functional signature" of a quantum circuit based solely on its structural topology and complexity metrics.
|
| 4 |
+
|
| 5 |
+
---
|
| 6 |
+
|
| 7 |
+
## β οΈ Important: Demo Dataset Notice
|
| 8 |
+
The datasets used in this interface are **v1.0.0-demo** shards.
|
| 9 |
+
* **Constraint:** These are reduced versions of the full QSBench library.
|
| 10 |
+
* **Performance:** Because the training samples are limited, you may observe "confusion" between similar variational families (like HEA and EfficientSU2).
|
| 11 |
+
* **Goal:** This tool is a prototype for benchmarking how structural features (like gate entropy) serve as unique identifiers for quantum algorithms.
|
| 12 |
+
|
| 13 |
+
---
|
| 14 |
+
|
| 15 |
+
## π 1. The 5 Target Families
|
| 16 |
+
The classifier is trained to distinguish between five major classes of quantum circuits:
|
| 17 |
+
|
| 18 |
+
1. **`QFT` (Quantum Fourier Transform):** Highly structured, deterministic circuits used in Shorβs algorithm and phase estimation.
|
| 19 |
+
2. **`HEA` (Hardware Efficient Ansatz):** Variational circuits designed to match specific hardware topologies, often used in VQE.
|
| 20 |
+
3. **`RANDOM`:** Circuits with randomly placed gates, used for benchmarking cross-entropy benchmarking (XEB).
|
| 21 |
+
4. **`EFFICIENT` (EfficientSU2):** A hardware-efficient heuristic ansatz with specific entanglement patterns.
|
| 22 |
+
5. **`REAL_AMPLITUDES`:** A common ansatz for hybrid quantum-classical algorithms that uses only real-valued amplitudes.
|
| 23 |
+
|
| 24 |
+
---
|
| 25 |
+
|
| 26 |
+
## π 2. Feature Signatures: How the AI "Sees" Circuits
|
| 27 |
+
The model doesn't "read" the QASM code like a compiler. Instead, it looks at **structural signatures**:
|
| 28 |
+
|
| 29 |
+
* **`meyer_wallach`:** Helps distinguish between high-entanglement algorithms (like QFT) and low-entanglement shallow circuits.
|
| 30 |
+
* **`gate_entropy`:** Captures the randomness or regularity of gate distribution. QFT has very low entropy (highly structured), while RANDOM circuits have high entropy.
|
| 31 |
+
* **`adjacency`:** Shows how many qubits interact. This is a key discriminator for "Transpilation" datasets.
|
| 32 |
+
* **`depth` & `cx_count`:** Provide the "vertical and horizontal" scale of the circuit.
|
| 33 |
+
|
| 34 |
+
---
|
| 35 |
+
|
| 36 |
+
## π€ 3. Analyzing the Results
|
| 37 |
+
Once you click **"Run Classification"**, the system provides two main insights:
|
| 38 |
+
|
| 39 |
+
### A. The Confusion Matrix
|
| 40 |
+
This heatmap shows where the model is confident and where it is confused.
|
| 41 |
+
* **Diagonal:** Correct predictions.
|
| 42 |
+
* **Off-diagonal:** If you see a high number of `HEA` circuits being predicted as `REAL_AMPLITUDES`, it suggests these two families share very similar structural "DNA" in small-scale demos.
|
| 43 |
+
|
| 44 |
+
### B. Feature Importance
|
| 45 |
+
This bar chart reveals which metric was the "smoking gun" for the classification. For example, you might find that `meyer_wallach` is the best way to spot a `QFT` circuit.
|
| 46 |
+
|
| 47 |
+
---
|
| 48 |
+
|
| 49 |
+
## π 4. Project Resources
|
| 50 |
+
* π€ [**Hugging Face Datasets**](https://huggingface.co/QSBench)
|
| 51 |
+
* π» [**GitHub Repository**](https://github.com/QSBench)
|
| 52 |
+
* π [**Official Website**](https://qsbench.github.io)
|