← Back to Dashboard

02. Catalysis Simulation

Stage B - QPE (upgraded from VQE)

QPE for H₂ molecular ground state (STO-3G). 132k physical qubits, 18 logical. Exponential speedup for quantum chemistry.

Algorithm
QPE for H₂ ground state (STO-3G)
Logical Qubits
5
Framework
Modern QDK (qsharp 1.27+)

Resource Estimation (Azure Quantum RE)

Physical Qubits
131.9k
Logical Qubits
18
T-Gates
6
Rotations
45
Runtime
3.3ms

Resource Breakdown

Calibration Evidence (20-Run Ensemble)

Mean Value
-1.190
95% CI
± 0.022
Runs
20
Std Dev
0.051

Noise Resilience (Depolarizing Simulation)

Ideal outcome: [One, Zero] (65% probability)

p = 0.001
99.3%
p = 0.01
98.1%
p = 0.05
96.0%

Cross-Platform Emulator Results (100 shots)

Quantinuum H2-1E
[1, 0]
69% of shots
Rigetti QVM
[1, 0]
70% of shots
✓ Cross-platform agreement: both simulators find the same dominant outcome
H2-1E Distribution
Rigetti QVM Distribution

Troyer Utility-Scale Classification

Quantum Simulation (Native Advantage Potential)
Quantum Speedup
Exponential for quantum chemistry
Classical Competitor
Full configuration interaction (FCI) / coupled cluster
Honest Assessment (Troyer Framework)

Upgraded to QPE for molecular Hamiltonians. Troyer identifies quantum chemistry as the #1 application for quantum computing. QPE provides exponential speedup for molecules with >50 orbitals where FCI is intractable. Current H₂ instance is pedagogical.

Multi-Model Resource Comparison

Physical qubit requirements across 6 qubit technologies × 2 QEC schemes (inspired by Troyer Architecture Series, Part 3).

■ Gate-based + Surface (blue)■ Majorana + Surface (green)■ Majorana + Floquet (light green)
Qubit ModelQECPhysical QubitsLogical Qubits
Trapped Ion (μs, 1e-4)surface_code70012
Trapped Ion (μs, 1e-3)surface_code3,38812
Majorana (ns, 1e-6)surface_code7,41612
Superconducting (ns, 1e-4)surface_code18,60012
Majorana (ns, 1e-6) (Floquet)floquet_code24,54412
Superconducting (ns, 1e-3)surface_code177,14412
Majorana (ns, 1e-4)surface_code547,94412
Majorana (ns, 1e-4) (Floquet)floquet_code700,46412

Problem Documentation

02. Quantum Catalysis Challenge

This problem explores quantum simulation of catalytic reaction mechanisms, comparing classical and quantum approaches for estimating reaction rates and energy barriers. The goal is to establish analytical baselines and prepare for quantum algorithm implementation.

Roadmap

  • [x] Scaffold directory structure
  • [x] Implement classical analytical baseline (Arrhenius model)
  • [x] Implement Q# analytical baseline (matching classical results)
  • [x] Generate parameter instances (small/medium/large)
  • [x] Validate outputs and plots
  • [ ] Update documentation and website status

Quickstart


cd problems/02_catalysis
make classical      # Run classical baseline analysis
make analyze        # Generate plots
make build          # Build Q# project (uses modern QDK  qsharp Python package)
make run            # Run quantum simulation

Outputs

  • `estimates/classical_baseline.json`: Structured Arrhenius rates for each instance
  • `plots/rate_vs_temperature.png`: Visualization of reaction rates vs. temperature
  • `qsharp/src/Main.qs`: Q# baseline source, compiled on-the-fly by the modern QDK (no DLL artifact)

Current Results

Running python python/classical_baseline.py produces the following reaction rates:

| Instance | Catalyst | Temperature (K) | Rate (s^-1) |

|----------|----------|-----------------|-------------|

| small | Pt | 300 | 0.8727 |

| medium | Fe | 500 | 5.94×10^2 |

| large | Cu | 700 | 2.92×10^5 |

The Q# entry point RunAnalyticalCatalysisBaseline reports the same values, confirming parity between classical and quantum-friendly baselines.

References

  • Quantum simulation of chemical catalysis
  • Analytical models for reaction rates
  • Q# quantum chemistry libraries

Objective Maturity Gate

  • **Current gate**: **Stage B complete** (classical baseline and Q# scaffold/build path are in place).
  • **Next gate target**: **Stage C** (hardware-aware validation with uncertainty-bounded comparisons).

Stage C exit criteria for this problem:

  • Execute at least one non-placeholder quantum workflow path tied to the problem objective.
  • Report uncertainty-bounded comparisons between classical and quantum outputs on `small` and `medium` instances.
  • Document transpilation/connectivity and backend assumptions used for reported quantum runs.
  • Add calibration/noise-sensitivity evidence for the reported quantum metrics.

DiVincenzo Readiness (Stage C/D Overlay)

| Criterion | Status | Evidence / Notes |

|---|---|---|

| Scalable qubit system | partial | Current results validate analytical parity; scalable chemistry-kernel resource projections are pending Stage C implementation. |

| Initialization | partial | Reaction-parameter initialization is defined for analytical baselines; quantum state-loading fidelity work remains open. |

| Coherence vs gate time | not-yet | Backend-specific coherence and depth/runtime evidence has not yet been produced. |

| Universal gate set | partial | Q# baseline build path is validated, but gate-basis decomposition for a chemistry kernel is not finalized yet. |

| Qubit-specific measurement | partial | Output observables are defined for baseline workflows; hardware readout assumptions and uncertainty bands are pending. |

Advantage Claim Contract

  • **Claim category (current)**: `theoretical`.
  • **Problem class and regime**: Problem-specific challenge instances defined in this directory.
  • **Fair baseline**: Problem-local classical baseline in `python/` outputs.
  • **Quantum resource scaling claim**: Expected asymptotic advantage depends on algorithm family and implementation assumptions; no hardware-demonstrated speedup claim yet.
  • **Data-loading and I/O assumptions**: Must be documented alongside future advantage claims.
  • **Noise/error model assumptions**: Backend-specific model and calibration assumptions to be added at Stage C.
  • **Confidence/uncertainty method**: To be reported using shot-based confidence intervals or equivalent statistical bounds.
  • **Residual risks**: Oracle/state-preparation/transpilation overhead may dominate for near-term instance sizes.

Reproduce It

cd problems/02_catalysis make classical # Run classical baseline make analyze # Generate plots make build # Validate Q# compilation make run # Run Q# entry point

Key Files

  • qsharp/src/Main.qs Quantum algorithm implementation
  • qsharp/HardwareKernel.qs Azure-submittable QIR kernel
  • python/classical_baseline.py Classical reference implementation
  • estimates/classical_baseline.json Baseline metrics
View on GitHub →