Update app.py
Browse files
app.py
CHANGED
|
@@ -2,6 +2,8 @@
|
|
| 2 |
DeepSuite: The Quantum Auditor
|
| 3 |
A tool to determine if your data requires quantum computing or if classical methods suffice.
|
| 4 |
Implements the "Tang Test" (Dequantization Audit) from the DeepSuite Research Proposal.
|
|
|
|
|
|
|
| 5 |
"""
|
| 6 |
|
| 7 |
import gradio as gr
|
|
@@ -461,7 +463,7 @@ def rag_consultant(ansatz_type, problem_domain):
|
|
| 461 |
"entanglement": "Unstructured (no geometric prior)",
|
| 462 |
"best_for": ["Hardware benchmarking", "Small proof-of-concept demos"],
|
| 463 |
"warnings": [
|
| 464 |
-
"π¨
|
| 465 |
"No inductive bias β poor generalization",
|
| 466 |
"Expressibility β Trainability"
|
| 467 |
],
|
|
@@ -492,6 +494,7 @@ def rag_consultant(ansatz_type, problem_domain):
|
|
| 492 |
return f"""## {r['icon']} {ansatz_type}
|
| 493 |
|
| 494 |
### Architecture Overview
|
|
|
|
| 495 |
| Property | Value |
|
| 496 |
|----------|-------|
|
| 497 |
| **Structure** | {r['structure']} |
|
|
@@ -520,7 +523,7 @@ theory_content = """
|
|
| 520 |
|
| 521 |
### Why This Matters
|
| 522 |
|
| 523 |
-
In 2018, **Ewin Tang** (then an 18-year-old undergraduate) shocked the quantum computing community by showing that many celebrated "quantum speedups" could be matched by classical algorithms
|
| 524 |
|
| 525 |
This tool implements a practical version of Tang's theoretical framework to help you determine **before** you spend QPU hours whether your problem actually needs a quantum computer.
|
| 526 |
|
|
@@ -569,7 +572,7 @@ When you run MNIST through this tool, you'll see it's **dequantizable**. Despite
|
|
| 569 |
2. PCA with 50 components captures >95% of variance
|
| 570 |
3. Quantum kernel methods offer **no advantage** over classical kernels
|
| 571 |
|
| 572 |
-
This doesn't mean quantum ML is useless
|
| 573 |
|
| 574 |
---
|
| 575 |
|
|
@@ -626,7 +629,7 @@ with gr.Blocks(
|
|
| 626 |
# βοΈ DeepSuite: The Quantum Auditor
|
| 627 |
### Stop guessing. Start verifying.
|
| 628 |
|
| 629 |
-
Determine if your data requires quantum computing
|
| 630 |
|
| 631 |
</div>
|
| 632 |
""")
|
|
@@ -638,7 +641,7 @@ with gr.Blocks(
|
|
| 638 |
with gr.Tab("π¬ Tang Test (Dequantization Audit)"):
|
| 639 |
|
| 640 |
gr.Markdown("""
|
| 641 |
-
Upload your data or select a preset to run the **Tang Test**
|
| 642 |
that determines if quantum methods offer genuine advantage over classical approximations.
|
| 643 |
""")
|
| 644 |
|
|
@@ -812,7 +815,7 @@ with gr.Blocks(
|
|
| 812 |
---
|
| 813 |
<center>
|
| 814 |
|
| 815 |
-
**DeepSuite Quantum Auditor** | Built
|
| 816 |
*"Don't guess. Verify."*
|
| 817 |
|
| 818 |
</center>
|
|
|
|
| 2 |
DeepSuite: The Quantum Auditor
|
| 3 |
A tool to determine if your data requires quantum computing or if classical methods suffice.
|
| 4 |
Implements the "Tang Test" (Dequantization Audit) from the DeepSuite Research Proposal.
|
| 5 |
+
|
| 6 |
+
Authors: Eric Raymond & Myalou
|
| 7 |
"""
|
| 8 |
|
| 9 |
import gradio as gr
|
|
|
|
| 463 |
"entanglement": "Unstructured (no geometric prior)",
|
| 464 |
"best_for": ["Hardware benchmarking", "Small proof-of-concept demos"],
|
| 465 |
"warnings": [
|
| 466 |
+
"π¨ BARREN PLATEAU RISK: Gradients vanish exponentially with depth",
|
| 467 |
"No inductive bias β poor generalization",
|
| 468 |
"Expressibility β Trainability"
|
| 469 |
],
|
|
|
|
| 494 |
return f"""## {r['icon']} {ansatz_type}
|
| 495 |
|
| 496 |
### Architecture Overview
|
| 497 |
+
|
| 498 |
| Property | Value |
|
| 499 |
|----------|-------|
|
| 500 |
| **Structure** | {r['structure']} |
|
|
|
|
| 523 |
|
| 524 |
### Why This Matters
|
| 525 |
|
| 526 |
+
In 2018, **Ewin Tang** (then an 18-year-old undergraduate) shocked the quantum computing community by showing that many celebrated "quantum speedups" could be matched by classical algorithms, if the data has low rank.
|
| 527 |
|
| 528 |
This tool implements a practical version of Tang's theoretical framework to help you determine **before** you spend QPU hours whether your problem actually needs a quantum computer.
|
| 529 |
|
|
|
|
| 572 |
2. PCA with 50 components captures >95% of variance
|
| 573 |
3. Quantum kernel methods offer **no advantage** over classical kernels
|
| 574 |
|
| 575 |
+
This doesn't mean quantum ML is useless, it means we need to find the *right* problems.
|
| 576 |
|
| 577 |
---
|
| 578 |
|
|
|
|
| 629 |
# βοΈ DeepSuite: The Quantum Auditor
|
| 630 |
### Stop guessing. Start verifying.
|
| 631 |
|
| 632 |
+
Determine if your data requires quantum computing, or if classical methods suffice.
|
| 633 |
|
| 634 |
</div>
|
| 635 |
""")
|
|
|
|
| 641 |
with gr.Tab("π¬ Tang Test (Dequantization Audit)"):
|
| 642 |
|
| 643 |
gr.Markdown("""
|
| 644 |
+
Upload your data or select a preset to run the **Tang Test**, a mathematical audit
|
| 645 |
that determines if quantum methods offer genuine advantage over classical approximations.
|
| 646 |
""")
|
| 647 |
|
|
|
|
| 815 |
---
|
| 816 |
<center>
|
| 817 |
|
| 818 |
+
**DeepSuite Quantum Auditor** | Built by: Eric Raymond & Myalou | Purdue AI/Robotics Engineering
|
| 819 |
*"Don't guess. Verify."*
|
| 820 |
|
| 821 |
</center>
|