← Back to Dashboard

06. High-Frequency Trading

Archived Quadratic speedup negated by I/O

Quadratic amplitude estimation, same QAE limitation. Archived per Troyer framework.

Algorithm
Amplitude Estimation for VaR
Logical Qubits
3
Framework
Modern QDK (qsharp 1.27+)

Resource Estimation (Azure Quantum RE)

Physical Qubits
60.7k
Logical Qubits
12
T-Gates
0
Rotations
1
Runtime
57.6μs

Resource Breakdown

Calibration Evidence (20-Run Ensemble)

Mean Value
0.645
95% CI
± 0.020
Runs
20
Std Dev
0.046

Noise Resilience (Depolarizing Simulation)

Ideal outcome: [One] (72% probability)

p = 0.001
99.7%
p = 0.01
99.5%
p = 0.05
98.6%

Cross-Platform Emulator Results (100 shots)

Quantinuum H2-1E
[1]
81% of shots
Rigetti QVM
[1]
80% 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
Quadratic (same as QAE)
Classical Competitor
Monte Carlo with variance reduction
Honest Assessment (Troyer Framework)

Financial QAE inherits the quadratic speedup of amplitude estimation. Utility requires portfolio sizes where the QEC overhead is justified by the quadratic speedup likely N > 10⁴ assets with complex correlation structures.

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_code65012
Trapped Ion (μs, 1e-3)surface_code2,10612
Superconducting (ns, 1e-4)surface_code3,48012
Majorana (ns, 1e-6)surface_code5,61612
Majorana (ns, 1e-6) (Floquet)floquet_code16,22412
Superconducting (ns, 1e-3)surface_code60,74412
Majorana (ns, 1e-4) (Floquet)floquet_code120,38412
Majorana (ns, 1e-4)surface_code1,705,86612

Problem Documentation

Problem 06 · Quantum-Enhanced High-Frequency Trading

Overview

High-frequency trading (HFT) strategies react to market micro-structure signals within milliseconds. Classical approaches rely on hand-crafted signals and predictive models that must balance latency, accuracy, and transaction costs. The goal of this challenge is to explore how quantum machine learning can accelerate signal discovery and execution for intraday trading.

This directory contains the first scaffold toward that objective:

  • **Classical baseline** – A synthetic limit-order-book price generator paired with a moving-average crossover strategy that trades subject to transaction costs. The baseline produces reproducible metrics (Sharpe ratio, turnover, drawdown) for each benchmark instance.
  • **Quantum plan** – A Q# project stub prepared to host amplitude-encoded feature maps and variational classifiers (e.g., quantum kernel methods or QAOA-style policy search). The current entry point simply validates project wiring while we develop the quantum pipeline.
  • **Analysis tooling** – Plot generation for price trajectories and strategy equity curves to gauge the quality of classical baselines before quantum enhancements are implemented.

Repository Layout


06_high_frequency_trading/
├── estimates/                # JSON outputs (classical & quantum once available)
├── instances/                # Synthetic market scenarios (small/medium/large)
├── plots/                    # Generated figures from analyze.py
├── python/
│   ├── classical_baseline.py # Deterministic Monte Carlo + trading metrics
│   └── analyze.py            # Visualization helpers
└── qsharp/
    ├── qsharp.json            # Modern QDK project file
    └── Program.qs                  # Placeholder quantum workflow

Getting Started


cd problems/06_high_frequency_trading

# Classical baseline (writes estimates/classical_baseline.json)
python python/classical_baseline.py

# Plot price + equity curves
python python/analyze.py

# Quantum entry point placeholder
python -c "import qsharp; qsharp.init(project_root='qsharp'); print('Build OK')"
python tooling/run_all_qsharp.py  # runs via qsharp Python package

Next Quantum Milestones

1. Data Encoding – Implement efficient amplitude/state preparation routines that embed recent order-book states into qubit registers.

2. Quantum Model – Prototype a variational classifier (e.g., quantum kernel SVM or variational quantum perceptron) that predicts short-term delta sign.

3. Execution Policy – Combine quantum predictions with classical risk management to minimize turnover and cost drag.

4. Resource Estimation – Evaluate qubit and gate requirements for realistic market depths, then benchmark against classical baselines.

Stay tuned as we iterate toward quantum-native trading signals! 🧠⚡️

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 | Problem-scoped instance baselines are in place; full hardware-scale projections are tracked as Stage C work. |

| Initialization | partial | Input/state initialization path is defined for current workflows, with backend-ready loading fidelity still to be hardened. |

| Coherence vs gate time | not-yet | Backend-calibrated coherence-vs-depth evidence is pending and required for Stage C/D promotion. |

| Universal gate set | partial | Q# scaffold/build path exists; gate-basis decomposition and transpilation evidence remain Stage C tasks. |

| Qubit-specific measurement | partial | Measurement outputs are defined for current validation flows; hardware readout characterization is 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/06_high_frequency_trading 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 →