FSharp.Azure.Quantum

Quantum-First F# Library - Solve combinatorial optimization problems using quantum algorithms (QAOA - Quantum Approximate Optimization Algorithm) with automatic cloud/local backend selection.

flowchart TD

    %% Top layer
    A[.NET API High-level algorithms familiar to normal developers]

    %% Quantum algorithms
    B[Quantum Algorithms, 
       Ph.D stuff]

    %% Backend interfaces
    C[Backend Interfaces: IQuantumBackend / ITopologicalBackend]

    %% Quantum Gate Backends
    D[Quantum Gate Backends: 
        LocalSimulator: Ph.D stuff, 
        Azure Quantum as a service]


    %% Topological Backends
    E[Topological Backend simulator, 
       more Ph.D stuff]

    %% Flow
    A --> B --> C
    C --> D
    C --> E

Status
Quick Start
Problem Builders
Advanced Quantum Builders
Quantum Machine Learning (QML)
- Variational Quantum Classifier (VQC)
- Quantum Kernel SVM
Business Problem Builders
HybridSolver
Architecture
OpenQASM 2.0 Support
Error Mitigation
QAOA Algorithm Internals
Documentation
Problem Size Guidelines
Design Philosophy
Quantum Algorithms
Topological Quantum Computing
Contributing
License
Support

Status

Architecture: Quantum-First Hybrid Library - Quantum algorithms as primary solvers, with intelligent classical fallback for small problems

Current Version: Latest (D-Wave Support + Quantum Machine Learning + Business Builders)

Current Features:

Multiple Backends: LocalBackend (simulation), Azure Quantum (IonQ, Rigetti, Atom Computing, Quantinuum), D-Wave quantum annealers (2000+ qubits)
Topological Quantum Computing: Anyon braiding simulator (Ising & Fibonacci anyons) - Microsoft Majorana architecture
Quantum Machine Learning: VQC, Quantum Kernel SVM, Feature Maps, Variational Forms, AutoML
Business Problem Builders: Social Network Analysis, Constraint Scheduling, AutoML, Anomaly Detection, Binary Classification, Predictive Modeling, Similarity Search
OpenQASM 2.0: Import/export compatibility with IBM Qiskit, Amazon Braket, Google Cirq
QAOA Implementation: Quantum Approximate Optimization Algorithm with advanced parameter optimization
7 Quantum Optimization Builders: Graph Coloring, MaxCut, Knapsack, TSP, Portfolio, Network Flow, Task Scheduling
6 Advanced QFT-Based Builders: Quantum Arithmetic, Cryptographic Analysis (Shor's), Phase Estimation, Tree Search, Constraint Solver, Pattern Matcher
VQE Implementation: Variational Quantum Eigensolver for molecular ground state energies (quantum chemistry)
Error Mitigation: ZNE (30-50% error reduction), PEC (2-3x accuracy), REM (50-90% readout correction)
F# Computation Expressions: Idiomatic, type-safe problem specification with builders
C# Interop: Fluent API extensions for C# developers
Circuit Building: Low-level quantum circuit construction and optimization possible

Quick Start

Installation

dotnet add package FSharp.Azure.Quantum

F# Computation Expressions

open FSharp.Azure.Quantum

// Graph Coloring: Register Allocation
let problem = graphColoring {
    node "R1" ["R2"; "R3"]
    node "R2" ["R1"; "R4"]
    node "R3" ["R1"; "R4"]
    node "R4" ["R2"; "R3"]
    colors ["EAX"; "EBX"; "ECX"; "EDX"]
}

// Solve using quantum optimization (QAOA)
match GraphColoring.solve problem 4 None with
| Ok solution ->
    printfn "Colors used: %d" solution.ColorsUsed
    solution.Assignments 
    |> Map.iter (fun node color -> printfn "%s → %s" node color)
| Error msg -> 
    printfn "Error: %s" msg

C# Fluent API

using FSharp.Azure.Quantum;
using static FSharp.Azure.Quantum.CSharpBuilders;

// MaxCut: Circuit Partitioning
var vertices = new[] { "A", "B", "C", "D" };
var edges = new[] {
    (source: "A", target: "B", weight: 1.0),
    (source: "B", target: "C", weight: 2.0),
    (source: "C", target: "D", weight: 1.0),
    (source: "D", target: "A", weight: 1.0)
};

var problem = MaxCutProblem(vertices, edges);
var result = MaxCut.solve(problem, null);

if (result.IsOk) {
    var solution = result.ResultValue;
    Console.WriteLine($"Cut Value: {solution.CutValue}");
    Console.WriteLine($"Partition S: {string.Join(", ", solution.PartitionS)}");
    Console.WriteLine($"Partition T: {string.Join(", ", solution.PartitionT)}");
}

What happens:

Computation expression builds graph coloring problem
GraphColoring.solve calls QuantumGraphColoringSolver internally
QAOA quantum algorithm encodes problem as QUBO (Quadratic Unconstrained Binary Optimization)
LocalBackend simulates quantum circuit (≤20 qubits)
Returns color assignments with validation

Problem Builders

Optimization Builders using QAOA:

Graph Coloring

Use Case: Register allocation, frequency assignment, exam scheduling

open FSharp.Azure.Quantum

let problem = graphColoring {
    node "Task1" ["Task2"; "Task3"]
    node "Task2" ["Task1"; "Task4"]
    node "Task3" ["Task1"; "Task4"]
    node "Task4" ["Task2"; "Task3"]
    colors ["Slot A"; "Slot B"; "Slot C"]
    objective MinimizeColors
}

match GraphColoring.solve problem 3 None with
| Ok solution ->
    printfn "Valid coloring: %b" solution.IsValid
    printfn "Colors used: %d/%d" solution.ColorsUsed 3
    printfn "Conflicts: %d" solution.ConflictCount
| Error msg -> printfn "Error: %s" msg

MaxCut

Use Case: Circuit design, community detection, load balancing

let vertices = ["A"; "B"; "C"; "D"]
let edges = [
    ("A", "B", 1.0)
    ("B", "C", 2.0)
    ("C", "D", 1.0)
    ("D", "A", 1.0)
]

let problem = MaxCut.createProblem vertices edges

match MaxCut.solve problem None with
| Ok solution ->
    printfn "Partition S: %A" solution.PartitionS
    printfn "Partition T: %A" solution.PartitionT
    printfn "Cut value: %.2f" solution.CutValue
| Error msg -> printfn "Error: %s" msg

Knapsack (0/1)

Use Case: Resource allocation, portfolio selection, cargo loading

let items = [
    ("laptop", 3.0, 1000.0)   // (id, weight, value)
    ("phone", 0.5, 500.0)
    ("tablet", 1.5, 700.0)
    ("monitor", 2.0, 600.0)
]

let problem = Knapsack.createProblem items 5.0  // capacity = 5.0

match Knapsack.solve problem None with
| Ok solution ->
    printfn "Total value: $%.2f" solution.TotalValue
    printfn "Total weight: %.2f/%.2f" solution.TotalWeight problem.Capacity
    printfn "Items: %A" (solution.SelectedItems |> List.map (fun i -> i.Id))
| Error msg -> printfn "Error: %s" msg

Traveling Salesperson Problem (TSP)

Use Case: Route optimization, delivery planning, logistics

let cities = [
    ("Seattle", 0.0, 0.0)
    ("Portland", 1.0, 0.5)
    ("San Francisco", 2.0, 1.5)
    ("Los Angeles", 3.0, 3.0)
]

let problem = TSP.createProblem cities

match TSP.solve problem None with
| Ok tour ->
    printfn "Optimal route: %s" (String.concat " → " tour.Cities)
    printfn "Total distance: %.2f" tour.TotalDistance
| Error msg -> printfn "Error: %s" msg

Portfolio Optimization

Use Case: Investment allocation, asset selection, risk management

let assets = [
    ("AAPL", 0.12, 0.15, 150.0)  // (symbol, return, risk, price)
    ("GOOGL", 0.10, 0.12, 2800.0)
    ("MSFT", 0.11, 0.14, 350.0)
]

let problem = Portfolio.createProblem assets 10000.0  // budget

match Portfolio.solve problem None with
| Ok allocation ->
    printfn "Portfolio value: $%.2f" allocation.TotalValue
    printfn "Expected return: %.2f%%" (allocation.ExpectedReturn * 100.0)
    printfn "Risk: %.2f" allocation.Risk
    
    allocation.Allocations 
    |> List.iter (fun (symbol, shares, value) ->
        printfn "  %s: %.2f shares ($%.2f)" symbol shares value)
| Error msg -> printfn "Error: %s" msg

Network Flow

Use Case: Supply chain optimization, logistics, distribution planning

let nodes = [
    NetworkFlow.SourceNode("Factory", 100)
    NetworkFlow.IntermediateNode("Warehouse", 80)
    NetworkFlow.SinkNode("Store1", 40)
    NetworkFlow.SinkNode("Store2", 60)
]

let routes = [
    NetworkFlow.Route("Factory", "Warehouse", 5.0)
    NetworkFlow.Route("Warehouse", "Store1", 3.0)
    NetworkFlow.Route("Warehouse", "Store2", 4.0)
]

let problem = { NetworkFlow.Nodes = nodes; Routes = routes }

match NetworkFlow.solve problem None with
| Ok flow ->
    printfn "Total cost: $%.2f" flow.TotalCost
    printfn "Fill rate: %.1f%%" (flow.FillRate * 100.0)
| Error msg -> printfn "Error: %s" msg

Task Scheduling

Use Case: Manufacturing workflows, project management, resource allocation with dependencies

open FSharp.Azure.Quantum

// Define tasks with dependencies
let taskA = scheduledTask {
    taskId "TaskA"
    duration (hours 2.0)
    priority 10.0
}

let taskB = scheduledTask {
    taskId "TaskB"
    duration (hours 1.5)
    after "TaskA"  // Dependency
    requires "Worker" 2.0
    deadline 180.0
}

let taskC = scheduledTask {
    taskId "TaskC"
    duration (minutes 30.0)
    after "TaskA"
    requires "Machine" 1.0
}

// Define resources
let worker = resource {
    resourceId "Worker"
    capacity 3.0
}

let machine = resource {
    resourceId "Machine"
    capacity 2.0
}

// Build scheduling problem
let problem = scheduling {
    tasks [taskA; taskB; taskC]
    resources [worker; machine]
    objective MinimizeMakespan
    timeHorizon 500.0
}

// Solve with quantum backend for resource constraints
let backend = BackendAbstraction.createLocalBackend()
match solveQuantum backend problem with
| Ok solution ->
    printfn "Makespan: %.2f hours" solution.Makespan
    solution.Schedule 
    |> List.iter (fun assignment ->
        printfn "%s: starts %.2f, ends %.2f" 
            assignment.TaskId assignment.StartTime assignment.EndTime)
| Error msg -> printfn "Error: %s" msg

Features:

Dependency Management - Precedence constraints (task A before task B)
Resource Constraints - Limited workers, machines, budget
Quantum Optimization - QAOA for resource-constrained scheduling
Classical Fallback - Topological sort for dependency-only problems
Gantt Chart Export - Visualize schedules
Business ROI - Validated $25,000/hour savings in powerplant optimization

API Documentation: TaskScheduling-API.md

Examples:

JobScheduling - Manufacturing workflow scheduling
ProjectManagement - Team task allocation (if exists)

Advanced Quantum Builders

High-level builders for specialized quantum algorithms using computation expression syntax.

Beyond the optimization and QFT-based builders, the library provides five advanced builders for specialized quantum computing tasks:

Quantum Tree Search Builder

Use Case: Graph traversal, decision trees, game tree exploration

open FSharp.Azure.Quantum.QuantumTreeSearchBuilder

// Search decision tree with quantum parallelism
let searchProblem = QuantumTreeSearch.quantumTreeSearch {
    depth 5                    // Tree depth
    branchingFactor 3          // Children per node
    target 42                  // Target node value
    qubits 10
}

match search searchProblem with
| Ok result ->
    printfn "Found path: %A" result.Path
    printfn "Depth explored: %d" result.DepthReached
    printfn "Success probability: %.2f%%" (result.Probability * 100.0)
| Error msg ->
    printfn "Error: %s" msg

Features:

Quantum parallelism for tree exploration
Amplitude amplification for target finding
F# computation expression: QuantumTreeSearch.quantumTreeSearch { }
Applications: Game AI, route planning, decision analysis

Quantum Constraint Solver Builder

Use Case: SAT solving, constraint satisfaction problems, logic puzzles

open FSharp.Azure.Quantum.QuantumConstraintSolverBuilder

// Solve boolean satisfiability (SAT) problem
let satProblem = QuantumConstraintSolver.constraintSolver {
    variables ["x"; "y"; "z"]
    clause ["x"; "!y"]         // x OR NOT y
    clause ["!x"; "z"]         // NOT x OR z
    clause ["y"; "!z"]         // y OR NOT z
    qubits 8
}

match solve satProblem with
| Ok solution ->
    printfn "Satisfying assignment:"
    solution.Assignment 
    |> Map.iter (fun var value -> printfn "  %s = %b" var value)
    printfn "Clauses satisfied: %d/%d" solution.SatisfiedClauses solution.TotalClauses
| Error msg ->
    printfn "Error: %s" msg

Features:

Grover-based SAT solving
CNF (Conjunctive Normal Form) constraint encoding
F# computation expression: QuantumConstraintSolver.constraintSolver { }
Applications: Circuit verification, scheduling, logic puzzles

Quantum Pattern Matcher Builder

Use Case: String matching, DNA sequence alignment, anomaly detection

open FSharp.Azure.Quantum.QuantumPatternMatcherBuilder

// Find pattern in data stream with quantum speedup
let matchProblem = QuantumPatternMatcher.patternMatcher {
    haystack [1; 2; 3; 4; 5; 6; 7; 8]
    needle [3; 4; 5]
    tolerance 0                 // Exact match
    qubits 12
}

match find matchProblem with
| Ok result ->
    printfn "Pattern found at positions: %A" result.Positions
    printfn "Total matches: %d" result.MatchCount
    printfn "Search probability: %.2f%%" (result.Probability * 100.0)
| Error msg ->
    printfn "Error: %s" msg

Features:

Quantum search for pattern matching
Approximate matching with tolerance
F# computation expression: QuantumPatternMatcher.patternMatcher { }
Applications: Bioinformatics, data mining, signal processing

Quantum Arithmetic Builder

Use Case: Cryptographic operations, RSA encryption, modular arithmetic

open FSharp.Azure.Quantum.QuantumArithmeticBuilder

// Quantum integer addition
let addProblem = QuantumArithmeticOps.quantumArithmetic {
    operands 15 27              // 15 + 27
    operation Add
    qubits 10
}

match compute addProblem with
| Ok result ->
    printfn "Result: %d" result.Value
    printfn "Carry: %b" result.Carry
    printfn "Gates used: %d" result.GateCount
    printfn "Circuit depth: %d" result.CircuitDepth
| Error msg ->
    printfn "Error: %s" msg

// Modular exponentiation for RSA
let rsaProblem = QuantumArithmeticOps.quantumArithmetic {
    operands 5 3                // base=5, exponent=3
    operation ModularExponentiate
    modulus 33                  // RSA modulus
    qubits 12
}

Features:

Quantum arithmetic operations (Add, Subtract, Multiply, ModularExponentiate)
QFT-based carry propagation
F# computation expression: QuantumArithmeticOps.quantumArithmetic { }
Applications: Cryptography, financial calculations, scientific computing

Quantum Period Finder Builder

Use Case: Shor's algorithm, cryptanalysis, order finding

open FSharp.Azure.Quantum.QuantumPeriodFinderBuilder

// Find period of modular function (Shor's algorithm)
let shorsProblem = QuantumPeriodFinder.periodFinder {
    number 15                   // Composite to factor
    base_ 7                     // Coprime base
    precision 12                // QPE precision bits
    maxAttempts 10              // Probabilistic retries
}

match findPeriod shorsProblem with
| Ok result ->
    printfn "Period found: %d" result.Period
    match result.Factors with
    | Some (p, q) ->
        printfn "Factors: %d × %d = %d" p q (p * q)
        printfn "⚠️  RSA modulus factored!"
    | None ->
        printfn "Retry with different base (probabilistic)"
| Error msg ->
    printfn "Error: %s" msg

Features:

Quantum Period Finding (QPF) for Shor's algorithm
Quantum Phase Estimation (QPE) integration
F# computation expression: QuantumPeriodFinder.periodFinder { }
Applications: Cryptanalysis, number theory, discrete logarithm

Quantum Phase Estimator Builder

Use Case: Eigenvalue estimation, quantum chemistry, VQE enhancement

open FSharp.Azure.Quantum.QuantumPhaseEstimatorBuilder
open FSharp.Azure.Quantum.Algorithms.QuantumPhaseEstimation

// Estimate eigenphase of unitary operator
let qpeProblem = QuantumPhaseEstimator.phaseEstimator {
    unitary (RotationZ (Math.PI / 4.0))  // Operator U
    eigenstate 0                         // |ψ⟩ = |0⟩
    precision 16                         // 16-bit phase precision
    qubits 20
}

match estimate qpeProblem with
| Ok result ->
    printfn "Estimated phase: %.6f" result.Phase
    printfn "Eigenvalue: e^(2πi × %.6f)" result.Phase
    printfn "Confidence: %.2f%%" (result.Confidence * 100.0)
    printfn "Application: Molecular energy = %.4f Hartree" (result.Phase * 2.0 * Math.PI)
| Error msg ->
    printfn "Error: %s" msg

Features:

Quantum Phase Estimation (QPE) with arbitrary precision
Inverse QFT for phase readout
F# computation expression: QuantumPhaseEstimator.phaseEstimator { }
Applications: Quantum chemistry (VQE), linear systems, machine learning

Advanced Builder Features

Common Capabilities:

Computation Expression Syntax - Idiomatic F# DSL for all builders
Backend Switching - LocalBackend (simulation) or Cloud (IonQ, Rigetti)
Type Safety - F# type system prevents invalid quantum circuits
C# Interop - Fluent API extensions for all builders
Circuit Export - Export to OpenQASM 2.0 for cross-platform execution
Error Handling - Comprehensive validation and error messages

Current Status:

Educational/Research Focus - Suitable for algorithm learning and prototyping
NISQ Limitations - Toy problems only (< 20 qubits) on current hardware
Production-Quality Code - Well-tested, documented, and production-quality implementation
Hardware Bottleneck - Waiting for fault-tolerant quantum computers for real-world scale

Use Cases by Builder:

Builder	Primary Application	Quantum Advantage	Hardware Readiness
Tree Search	Game AI, Route Planning	O(√N) speedup	2028+ (requires 50+ qubits)
Constraint Solver	SAT, Logic Puzzles	O(√2^n) speedup	2030+ (requires 100+ qubits)
Pattern Matcher	DNA Alignment, Data Mining	O(√N) speedup	2027+ (requires 30+ qubits)
Arithmetic	Cryptography, RSA	Polynomial vs exponential	2026+ (requires 4096+ qubits for RSA-2048)
Period Finder	Shor's Algorithm, Cryptanalysis	Exponential speedup	2029+ (requires 4096+ qubits)
Phase Estimator	Quantum Chemistry, VQE	Polynomial speedup	2025+ (10-20 qubits sufficient for small molecules)

Recommendation:

Use for learning quantum algorithms and understanding quantum advantage
Use for prototyping future quantum applications
Use Phase Estimator for small molecules on current NISQ hardware
For production optimization, use the 6 QAOA-based builders instead

C# API for Advanced Builders

All advanced builders have C#-friendly fluent APIs:

using FSharp.Azure.Quantum;
using static FSharp.Azure.Quantum.CSharpBuilders;

// Tree Search
var treeSearch = TreeSearch(depth: 5, branchingFactor: 3, target: 42);
var searchResult = ExecuteTreeSearch(treeSearch);

// Constraint Solver
var satProblem = ConstraintProblem(
    variables: new[] { "x", "y", "z" },
    clauses: new[] { 
        new[] { "x", "!y" },
        new[] { "!x", "z" }
    }
);
var satResult = SolveConstraints(satProblem);

// Pattern Matcher
var pattern = PatternMatch(
    haystack: new[] { 1, 2, 3, 4, 5, 6, 7, 8 },
    needle: new[] { 3, 4, 5 },
    tolerance: 0
);
var matchResult = FindPattern(pattern);

// Arithmetic
var add = ArithmeticAdd(15, 27);
var addResult = ComputeArithmetic(add);

var rsa = ModularExponentiate(baseValue: 5, exponent: 3, modulus: 33);
var rsaResult = ComputeArithmetic(rsa);

// Period Finder (Shor's)
var shors = FactorInteger(15, precision: 12);
var factorResult = FindPeriod(shors);

// Phase Estimator
var qpe = EstimateRotationZ(Math.PI / 4.0, precision: 16);
var phaseResult = EstimatePhase(qpe);

Current Status: Educational/research focus - Demonstrates quantum algorithms but hardware insufficient for real-world applications (as of 2025)

Library Scope & Focus

Primary Focus: QAOA-Based Combinatorial Optimization

This library is designed for NISQ-era practical quantum advantage in optimization:

✅ 6 optimization problem builders (Graph Coloring, MaxCut, TSP, Knapsack, Portfolio, Network Flow)
✅ QAOA implementation with automatic parameter tuning
✅ Error mitigation for noisy hardware (ZNE, PEC, REM)
✅ Production-ready solvers with cloud backend integration

Secondary Focus: Quantum Algorithm Education & Research

The Algorithms/ directory contains foundational quantum algorithms for learning:

✅ Grover's Search (quantum search, O(√N) speedup)
✅ Amplitude Amplification (generalization of Grover)
✅ Quantum Fourier Transform (O(n²) vs O(n·2^n) classical FFT)

Why F# for Quantum?

Type-safe quantum circuit construction
Functional programming matches quantum mathematics
Interop with .NET ecosystem (C#, Azure, ML.NET)
Higher level abstraction than Python (Qiskit) and Q#

Quantum Machine Learning (QML)

Apply quantum computing to machine learning problems with variational quantum circuits and quantum kernels.

Variational Quantum Classifier (VQC)

Train quantum neural networks for classification tasks:

open FSharp.Azure.Quantum
open FSharp.Azure.Quantum.MachineLearning

// Setup backend and architecture
let backend = LocalBackend() :> IQuantumBackend
let featureMap = AngleEncoding
let variationalForm = RealAmplitudes 2  // 2 layers

// Prepare training data (features and labels as separate arrays)
let trainFeatures = [|
    [| 0.1; 0.2 |]
    [| 0.9; 0.8 |]
    [| 0.3; 0.1 |]
    [| 0.8; 0.9 |]
|]
let trainLabels = [| 0; 1; 0; 1 |]

// Configure training
let config = {
    LearningRate = 0.1
    MaxEpochs = 100
    ConvergenceThreshold = 0.001
    Shots = 1000
    Verbose = false
    Optimizer = VQC.SGD
}

// Initialize parameters
let numQubits = trainFeatures.[0].Length
let numParams = VariationalForms.parameterCount variationalForm numQubits
let initialParams = Array.init numParams (fun _ -> Random().NextDouble() * 2.0 * Math.PI)

// Train the classifier
match VQC.train backend featureMap variationalForm initialParams trainFeatures trainLabels config with
| Ok result ->
    // Make predictions
    let testPoint = [| 0.5; 0.5 |]
    match VQC.predict backend featureMap variationalForm result.Parameters testPoint 1000 with
    | Ok prediction ->
        printfn "Prediction: %d (probability: %.2f%%)" 
            prediction.Label (prediction.Probability * 100.0)
    | Error msg -> printfn "Error: %s" msg
| Error msg -> printfn "Training failed: %s" msg

Quantum Kernel SVM

Use quantum feature spaces for support vector machines:

open FSharp.Azure.Quantum
open FSharp.Azure.Quantum.MachineLearning

// Setup backend and quantum feature map
let backend = LocalBackend() :> IQuantumBackend
let featureMap = ZZFeatureMap  // Quantum feature map with entanglement

// Training data
let trainData = [| [| 0.1; 0.2 |]; [| 0.9; 0.8 |]; [| 0.3; 0.1 |]; [| 0.8; 0.9 |] |]
let trainLabels = [| 0; 1; 0; 1 |]

// SVM configuration
let config = {
    C = 1.0
    Tolerance = 1e-3
    MaxIterations = 100
    Verbose = false
}

// Train SVM with quantum kernel
match QuantumKernelSVM.train backend featureMap trainData trainLabels config 1000 with
| Ok model ->
    // Evaluate on test data
    let testData = [| [| 0.5; 0.5 |]; [| 0.2; 0.8 |] |]
    let testLabels = [| 0; 1 |]
    
    match QuantumKernelSVM.evaluate backend model testData testLabels 1000 with
    | Ok accuracy -> printfn "Test accuracy: %.2f%%" (accuracy * 100.0)
    | Error msg -> printfn "Evaluation error: %s" msg
| Error msg -> printfn "Training error: %s" msg

QML Features:

VQC - Variational quantum circuits for supervised learning
Quantum Kernels - Leverage quantum feature spaces in SVMs
Feature Maps - ZZFeatureMap, PauliFeatureMap for encoding classical data
Variational Forms - RealAmplitudes, EfficientSU2 ansatz circuits
Adam Optimizer - Gradient-based training with momentum
Model Serialization - Save/load trained models
Data Preprocessing - Normalization, encoding, splits

Examples:

examples/QML/VQCExample.fsx - Complete VQC training pipeline
examples/QML/FeatureMapExample.fsx - Feature encoding demonstrations
examples/QML/VariationalFormExample.fsx - Ansatz circuit exploration

Business Problem Builders

High-level APIs for common business applications powered by quantum algorithms (Grover's search) and quantum machine learning.

Social Network Analyzer - Community Detection & Fraud Rings

Use Grover's algorithm to find tight-knit communities (cliques) in social networks for marketing, fraud detection, and team analysis.

open FSharp.Azure.Quantum.Business
open FSharp.Azure.Quantum.Backends.LocalBackend

// Define social network
let network = SocialNetworkAnalyzer.socialNetwork {
    // Add people
    people ["Alice"; "Bob"; "Carol"; "Dave"; "Eve"; "Frank"]
    
    // Define connections (friendships, transactions, communications)
    connections [
        ("Alice", "Bob")
        ("Bob", "Carol")
        ("Carol", "Alice")     // Triangle: potential community
        
        ("Dave", "Eve")
        ("Eve", "Frank")
        ("Frank", "Dave")      // Another triangle
        
        ("Carol", "Dave")      // Bridge between communities
    ]
    
    // Find communities of at least 3 people
    findCommunities 3
    
    // Use quantum acceleration (optional)
    backend (LocalBackend() :> IQuantumBackend)
    shots 1000
}

match network with
| Ok result ->
    printfn "Communities found: %d" result.Communities.Length
    
    for comm in result.Communities do
        printfn "Community: %A" comm.Members
        printfn "  Strength: %.0f%% connected" (comm.Strength * 100.0)
        printfn "  Internal connections: %d" comm.InternalConnections
| Error err -> printfn "Error: %A" err

Business Use Cases:

Marketing: Identify influencer groups for targeted campaigns
Fraud Detection: Detect fraud rings through circular transaction patterns
HR Analytics: Analyze team collaboration and communication networks
Healthcare: Track disease outbreak clusters and contact tracing
Security: Find coordinated bot networks or insider threat groups

Quantum Advantage:

Classical clique finding: O(2^n) exponential time complexity
Grover's algorithm: O(√(2^n)) quadratic speedup
Most beneficial for networks with 20+ people
Real-time fraud detection at scale

Features:

F# computation expression: socialNetwork { }
Quantum backend support (LocalBackend, IonQ, Rigetti)
Configurable shots for measurement accuracy
Classical fallback for small networks
Community strength metrics (connectivity percentage)

Example: examples/SocialNetworkAnalyzer_Example.fsx

Constraint Scheduler - Workforce & Resource Allocation

Use quantum optimization (Max-SAT and Weighted Graph Coloring) to solve scheduling problems with hard and soft constraints.

open FSharp.Azure.Quantum.Business
open FSharp.Azure.Quantum.Backends.LocalBackend

// Workforce scheduling with constraints
let schedule = ConstraintScheduler.constraintScheduler {
    // Define shifts to cover
    task "Morning"
    task "Afternoon"
    task "Evening"
    task "Night"
    
    // Available workers with hourly rates
    resource "Alice" 25.0   // Senior: $25/hour
    resource "Bob" 15.0     // Junior: $15/hour
    resource "Carol" 20.0   // Mid-level: $20/hour
    resource "Dave" 15.0    // Junior: $15/hour
    
    // Hard constraints (MUST be satisfied)
    conflict "Morning" "Afternoon"     // Can't work consecutive shifts
    conflict "Afternoon" "Evening"
    conflict "Evening" "Night"
    
    // Soft constraints (preferences with weights)
    prefer "Morning" "Alice" 10.0      // Alice prefers morning
    prefer "Afternoon" "Carol" 8.0     // Carol prefers afternoon
    prefer "Night" "Dave" 9.0          // Dave prefers night
    
    // Optimization goal
    optimizeFor ConstraintScheduler.MinimizeCost
    maxBudget 100.0
    
    // Use quantum optimization (optional)
    backend (LocalBackend() :> IQuantumBackend)
    shots 1500
}

match schedule with
| Ok result ->
    match result.BestSchedule with
    | Some sched ->
        printfn "Optimal Shift Assignments:"
        for assignment in sched.Assignments do
            printfn "  %s → %s ($%.2f/hour)" 
                assignment.Task 
                assignment.Resource 
                assignment.Cost
        
        printfn "\nTotal Cost: $%.2f" sched.TotalCost
        printfn "Constraints Satisfied: %d / %d hard, %d / %d soft" 
            sched.HardConstraintsSatisfied 
            sched.TotalHardConstraints
            sched.SoftConstraintsSatisfied 
            sched.TotalSoftConstraints
        printfn "Feasible: %b" sched.IsFeasible
    | None ->
        printfn "No feasible schedule found"
| Error err -> printfn "Error: %A" err

Business Use Cases:

Workforce Management: Employee shift scheduling with availability constraints
Cloud Computing: VM allocation to minimize costs while meeting SLAs
Manufacturing: Production task assignment with equipment constraints
Logistics: Delivery route optimization with time windows
Project Management: Task assignment with dependencies and deadlines

Quantum Advantage:

Classical constraint solving: NP-hard (exponential time)
Quantum optimization: Quadratic speedup with Grover search
Most beneficial for 10+ tasks with complex constraints

Optimization Goals:

MinimizeCost: Uses Weighted Graph Coloring oracle
MaximizeSatisfaction: Uses Max-SAT oracle for constraint satisfaction
Balanced: Combines both cost and satisfaction criteria

Constraint Types:

Hard Constraints (must satisfy): conflict, require, precedence
Soft Constraints (preferences): prefer with configurable weights
Budget Constraints: maxBudget for cost optimization

Features:

F# computation expression: constraintScheduler { }
Dual oracle support (Max-SAT and Weighted Graph Coloring)
Quantum backend support (LocalBackend, IonQ, Rigetti)
Configurable shots for accuracy vs. speed tradeoff
Classical fallback for small problems
Detailed constraint satisfaction metrics

Example: examples/ConstraintScheduler_Example.fsx

AutoML - Automated Machine Learning

open FSharp.Azure.Quantum.Business

// Automated hyperparameter tuning and model selection
let automl = autoML {
    dataset trainData
    target "label_column"
    features ["feature1"; "feature2"; "feature3"]
    maxTrials 20
    timeout (minutes 30.0)
}

match AutoML.run automl with
| Ok result ->
    printfn "Best model accuracy: %.2f%%" (result.BestAccuracy * 100.0)
    printfn "Best hyperparameters: %A" result.BestHyperparameters
    
    // Use best model for predictions
    let predictions = AutoML.predict result.BestModel newData
    predictions |> List.iter (printfn "Prediction: %A")
| Error msg -> printfn "Error: %s" msg

Anomaly Detection - Security & Fraud Detection

open FSharp.Azure.Quantum.Business

// Detect outliers in network traffic for security monitoring
let detector = anomalyDetection {
    data securityLogs
    features ["packet_size"; "connection_duration"; "failed_logins"]
    threshold 0.95
    sensitivity High
}

match AnomalyDetection.detect detector with
| Ok anomalies ->
    printfn "Found %d anomalies" anomalies.Length
    anomalies |> List.iter (fun a ->
        printfn "⚠️  Anomaly score: %.3f - %A" a.Score a.DataPoint)
| Error msg -> printfn "Error: %s" msg

Binary Classification - Fraud Detection

open FSharp.Azure.Quantum.Business

// Classify transactions as fraudulent or legitimate
let classifier = binaryClassification {
    trainingData transactions
    positiveClass "fraud"
    negativeClass "legitimate"
    features ["amount"; "location"; "time"; "merchant_type"]
    algorithm QuantumSVM
}

match BinaryClassification.train classifier with
| Ok model ->
    // Evaluate performance
    let metrics = BinaryClassification.evaluate model testTransactions
    printfn "Precision: %.2f%%" (metrics.Precision * 100.0)
    printfn "Recall: %.2f%%" (metrics.Recall * 100.0)
    printfn "F1 Score: %.2f" metrics.F1Score
    
    // Classify new transactions
    let newTransaction = ["amount", 1500.0; "location", "foreign"]
    match BinaryClassification.predict model newTransaction with
    | Ok prediction ->
        printfn "Classification: %s (%.2f%% confidence)" 
            prediction.Class (prediction.Probability * 100.0)
    | Error msg -> printfn "Error: %s" msg
| Error msg -> printfn "Training failed: %s" msg

Predictive Modeling - Customer Churn Prediction

open FSharp.Azure.Quantum.Business

// Predict which customers are likely to cancel service
let model = predictiveModel {
    historicalData customerData
    targetVariable "churned"
    predictors ["tenure"; "monthly_charges"; "total_charges"; "contract_type"]
    horizon (days 30.0)
}

match PredictiveModel.build model with
| Ok trained ->
    // Identify high-risk customers
    let predictions = PredictiveModel.predict trained activeCustomers
    let highRisk = predictions |> List.filter (fun p -> p.ChurnProbability > 0.7)
    
    printfn "High-risk customers: %d" highRisk.Length
    highRisk |> List.iter (fun customer ->
        printfn "Customer %s: %.1f%% churn risk" 
            customer.Id (customer.ChurnProbability * 100.0))
| Error msg -> printfn "Error: %s" msg

Similarity Search - Product Recommendations

open FSharp.Azure.Quantum.Business

// Find similar products using quantum-enhanced search
let search = similaritySearch {
    catalog productCatalog
    features ["category"; "price"; "rating"; "features"]
    similarityMetric QuantumKernel
    topK 10
}

let targetProduct = "laptop-xyz-2024"

match SimilaritySearch.findSimilar search targetProduct with
| Ok recommendations ->
    printfn "Customers who viewed %s also liked:" targetProduct
    recommendations |> List.iter (fun (product, similarity) ->
        printfn "  %s (%.1f%% similar)" product.Name (similarity * 100.0))
| Error msg -> printfn "Error: %s" msg

Business Builder Features:

Social Network Analyzer - Community detection, fraud rings, influencer identification (Grover's algorithm)
Constraint Scheduler - Workforce scheduling, resource allocation with constraints (Max-SAT & Graph Coloring)
AutoML - Automated hyperparameter tuning, model selection, ensemble methods
Anomaly Detection - Outlier detection for security, fraud, quality control
Binary Classification - Two-class problems (fraud, spam, churn)
Predictive Modeling - Time-series forecasting, demand prediction
Similarity Search - Recommendations, semantic search, clustering
Quantum-Enhanced - Leverages Grover's search, quantum kernels, and feature maps
Ready for Production - Model serialization, evaluation metrics, validation

Examples:

examples/SocialNetworkAnalyzer_Example.fsx - Community detection and fraud ring identification
examples/ConstraintScheduler_Example.fsx - Workforce and resource scheduling
examples/AutoML/QuickPrototyping.fsx - Complete AutoML pipeline
examples/AnomalyDetection/SecurityThreatDetection.fsx - Network security monitoring
examples/BinaryClassification/FraudDetection.fsx - Transaction fraud detection
examples/PredictiveModeling/CustomerChurnPrediction.fsx - Churn prediction
examples/SimilaritySearch/ProductRecommendations.fsx - E-commerce recommendations

HybridSolver - Automatic Classical/Quantum Routing

Smart solver that automatically chooses between classical and quantum execution based on problem analysis.

The HybridSolver provides a unified API that:

Analyzes problem size, structure, and complexity
Estimates quantum advantage potential
Routes to classical solver (fast, free) OR quantum backend (scalable, expensive)
Provides reasoning for solver selection
Optionally compares both methods for validation

Decision Framework:

Small problems (< 50 variables) → Classical solver (milliseconds, $0)
Large problems (> 100 variables) → Quantum solver (seconds-minutes, ~$10-100)
Automatic cost guards and recommendations

Supported Problems

The HybridSolver supports all 5 main optimization problems:

open FSharp.Azure.Quantum.Classical.HybridSolver

// TSP with automatic routing
let distances = array2D [[0.0; 10.0; 15.0]; 
                          [10.0; 0.0; 20.0]; 
                          [15.0; 20.0; 0.0]]

match solveTsp distances None None None with
| Ok solution ->
    printfn "Method used: %A" solution.Method           // Classical or Quantum
    printfn "Reasoning: %s" solution.Reasoning          // Why this method?
    printfn "Time: %.2f ms" solution.ElapsedMs
    printfn "Route: %A" solution.Result.Route
    printfn "Distance: %.2f" solution.Result.TotalDistance
| Error msg -> printfn "Error: %s" msg

// MaxCut with quantum backend config
let vertices = ["A"; "B"; "C"; "D"]
let edges = [("A", "B", 1.0); ("B", "C", 2.0); ("C", "D", 1.0)]
let problem = MaxCut.createProblem vertices edges

let quantumConfig = {
    Backend = IonQ "ionq.simulator"
    WorkspaceId = "your-workspace-id"
    Location = "eastus"
    ResourceGroup = "quantum-rg"
    SubscriptionId = "sub-id"
    MaxCostUSD = Some 50.0          // Cost guard
    EnableComparison = true         // Compare with classical
}

match solveMaxCut problem (Some quantumConfig) None None with
| Ok solution ->
    printfn "Method: %A" solution.Method
    printfn "Cut Value: %.2f" solution.Result.CutValue
    match solution.Recommendation with
    | Some recommendation -> printfn "Advisor: %s" recommendation.Reasoning
    | None -> ()
| Error msg -> printfn "Error: %s" msg

// Knapsack
match solveKnapsack knapsackProblem None None None with
| Ok solution ->
    printfn "Total Value: %.2f" solution.Result.TotalValue
    printfn "Items: %A" solution.Result.SelectedItems
| Error msg -> printfn "Error: %s" msg

// Graph Coloring
match solveGraphColoring graphProblem 3 None None None with
| Ok solution ->
    printfn "Colors Used: %d/3" solution.Result.ColorsUsed
    printfn "Valid: %b" solution.Result.IsValid
| Error msg -> printfn "Error: %s" msg

// Portfolio Optimization
match solvePortfolio portfolioProblem None None None with
| Ok solution ->
    printfn "Portfolio Value: $%.2f" solution.Result.TotalValue
    printfn "Expected Return: %.2f%%" (solution.Result.ExpectedReturn * 100.0)
| Error msg -> printfn "Error: %s" msg

Features

Unified API: Single function call for any problem size
Smart Routing: Automatic classical/quantum decision
Cost Guards: MaxCostUSD prevents runaway quantum costs
Validation Mode: EnableComparison = true runs both methods
Transparent Reasoning: Explains why each method was chosen
Quantum Advisor: Provides recommendations on quantum readiness

When to Use HybridSolver vs Direct Builders

Use HybridSolver when:

Problem size varies (sometimes small, sometimes large)
You want automatic cost optimization
You need validation/comparison between classical and quantum
You're prototyping and unsure which approach is better

Use Direct Builders when:

You always want quantum (for research/learning)
Problem size is consistently in quantum range (10-20 qubits)
You need fine-grained control over backend configuration
You're integrating with specific QAOA parameter tuning

Location: src/FSharp.Azure.Quantum/Solvers/Hybrid/HybridSolver.fs
Status: Recommended for production deployments

Architecture

3-Layer Quantum-Only Architecture

graph TB
    subgraph "Layer 1: High-Level Builders"
        GC["GraphColoring Builder<br/>graphColoring { }"]
        MC["MaxCut Builder<br/>MaxCut.createProblem"]
        KS["Knapsack Builder<br/>Knapsack.createProblem"]
        TS["TSP Builder<br/>TSP.createProblem"]
        PO["Portfolio Builder<br/>Portfolio.createProblem"]
        NF["NetworkFlow Builder<br/>NetworkFlow module"]
        SCHED["TaskScheduling Builder<br/>scheduledTask { }"]
    end
    
    subgraph "Layer 2: Quantum Solvers"
        QGC["QuantumGraphColoringSolver<br/>(QAOA)"]
        QMC["QuantumMaxCutSolver<br/>(QAOA)"]
        QKS["QuantumKnapsackSolver<br/>(QAOA)"]
        QTS["QuantumTspSolver<br/>(QAOA)"]
        QPO["QuantumPortfolioSolver<br/>(QAOA)"]
        QNF["QuantumNetworkFlowSolver<br/>(QAOA)"]
        QSCHED["QuantumSchedulingSolver<br/>(QAOA)"]
    end
    
    subgraph "Layer 3: Quantum Backends"
        LOCAL["LocalBackend<br/>(≤20 qubits)"]
        IONQ["IonQBackend<br/>(Azure Quantum)"]
        RIGETTI["RigettiBackend<br/>(Azure Quantum)"]
        ATOM["AtomComputingBackend<br/>(Azure Quantum, 100+ qubits)"]
        QUANTINUUM["QuantinuumBackend<br/>(Azure Quantum, 99.9%+ fidelity)"]
    end
    
    GC --> QGC
    MC --> QMC
    KS --> QKS
    TS --> QTS
    PO --> QPO
    NF --> QNF
    SCHED --> QSCHED
    
    QGC --> LOCAL
    QMC --> LOCAL
    QKS --> LOCAL
    QTS --> LOCAL
    QPO --> LOCAL
    QNF --> LOCAL
    QSCHED --> LOCAL
    
    QGC -.-> IONQ
    QMC -.-> IONQ
    QKS -.-> IONQ
    QTS -.-> IONQ
    QPO -.-> IONQ
    QNF -.-> IONQ
    QSCHED -.-> IONQ
    
    QGC -.-> RIGETTI
    QMC -.-> RIGETTI
    QKS -.-> RIGETTI
    QTS -.-> RIGETTI
    QPO -.-> RIGETTI
    QNF -.-> RIGETTI
    QSCHED -.-> RIGETTI
    
    QGC -.-> ATOM
    QMC -.-> ATOM
    QKS -.-> ATOM
    QTS -.-> ATOM
    QPO -.-> ATOM
    QNF -.-> ATOM
    QSCHED -.-> ATOM
    
    QGC -.-> QUANTINUUM
    QMC -.-> QUANTINUUM
    QKS -.-> QUANTINUUM
    QTS -.-> QUANTINUUM
    QPO -.-> QUANTINUUM
    QNF -.-> QUANTINUUM
    QSCHED -.-> QUANTINUUM
    
    style GC fill:#90EE90
    style MC fill:#90EE90
    style KS fill:#90EE90
    style TS fill:#90EE90
    style PO fill:#90EE90
    style NF fill:#90EE90
    style SCHED fill:#90EE90
    style QGC fill:#FFA500
    style QMC fill:#FFA500
    style QKS fill:#FFA500
    style QTS fill:#FFA500
    style QPO fill:#FFA500
    style QNF fill:#FFA500
    style QSCHED fill:#FFA500
    style LOCAL fill:#5B9BD5
    style IONQ fill:#70AD47
    style RIGETTI fill:#ED7D31
    style ATOM fill:#FFC000
    style QUANTINUUM fill:#A85CC8

Layer Responsibilities

Layer 1: High-Level Builders 🟢

Who uses it: End users (F# and C# developers)
Purpose: Business domain APIs with problem-specific validation

Features:

F# computation expressions (graphColoring { })
C# fluent APIs (CSharpBuilders.MaxCutProblem())
Type-safe problem specification
Domain-specific validation
Automatic backend creation (defaults to LocalBackend)

Example:

// F# computation expression
let problem = graphColoring {
    node "R1" ["R2"]
    colors ["Red"; "Blue"]
}

// Delegates to Layer 2
GraphColoring.solve problem 2 None

Layer 2: Quantum Solvers 🟠

Who uses it: High-level builders (internal delegation)
Purpose: QAOA implementations for specific problem types

Features:

Problem → QUBO encoding
QAOA circuit construction
Variational parameter optimization (Nelder-Mead)
Solution decoding and validation
Backend-agnostic (accepts IQuantumBackend)

Example:

// Called internally by GraphColoring.solve
QuantumGraphColoringSolver.solve 
    backend          // IQuantumBackend
    problem          // GraphColoringProblem
    quantumConfig    // QAOA parameters

Layer 3: Quantum Backends 🔵

Who uses it: Quantum solvers
Purpose: Quantum circuit execution

Backend Types:

Backend	Qubits	Speed	Cost	Use Case
LocalBackend	≤20	Fast (ms)	Free	Development, testing, small problems
IonQBackend	29+ (sim), 11 (QPU)	Moderate (seconds)	Paid	Production, large problems
RigettiBackend	40+ (sim), 80 (QPU)	Moderate (seconds)	Paid	Production, large problems
AtomComputingBackend	100+ (sim/QPU Phoenix)	Moderate (seconds)	Paid	Large-scale problems, all-to-all connectivity
QuantinuumBackend	20-32 (sim), 20-32 (QPU)	Moderate (seconds)	Paid	High-fidelity (99.9%+), trapped-ion

Example:

// Local simulation (default)
let backend = BackendAbstraction.createLocalBackend()

// Azure Quantum (cloud)
let connectionString = "InstrumentationKey=..."

// Using Azure Quantum Workspace (Recommended for cloud backends)
open FSharp.Azure.Quantum.Backends.AzureQuantumWorkspace

let workspace = createDefault "subscription-id" "resource-group" "workspace-name" "eastus"

// Using Azure Quantum Workspace (Recommended)
open FSharp.Azure.Quantum.Backends.AzureQuantumWorkspace

let workspace = createDefault "subscription-id" "resource-group" "workspace-name" "eastus"

// IonQ Backend
let backend_ionq = BackendAbstraction.createFromWorkspace workspace "ionq.simulator"

// Rigetti Backend  
let backend_rigetti = BackendAbstraction.createFromWorkspace workspace "rigetti.sim.qvm"

// Quantinuum Backend (trapped-ion, highest fidelity)
let backend_quantinuum = BackendAbstraction.createFromWorkspace workspace "quantinuum.sim.h1-1sc"

// Atom Computing Backend (neutral atoms, 100+ qubits, all-to-all connectivity)
let backend_atom = BackendAbstraction.createFromWorkspace workspace "atom-computing.sim"

// Rigetti Backend (superconducting, fast gates)
let backend_rigetti = BackendAbstraction.createRigettiBackend(
    connectionString = "YOUR_CONNECTION_STRING",
    targetId = "rigetti.sim.qvm"  // or "rigetti.qpu.*" for hardware
)

// Atom Computing Backend (neutral atoms, 100+ qubits, all-to-all connectivity)
let backend_atom = BackendAbstraction.createAtomComputingBackend(
    connectionString = "YOUR_CONNECTION_STRING",
    targetId = "atom-computing.sim"  // or "atom-computing.qpu.phoenix" for hardware
)

// Quantinuum Backend (trapped-ion, highest fidelity)
let backend_quantinuum = BackendAbstraction.createQuantinuumBackend(
    connectionString = "YOUR_CONNECTION_STRING",
    targetId = "quantinuum.sim.h1-1sc"  // See available targets below
)

// Pass to solver
match GraphColoring.solve problem 3 (Some backend_quantinuum) with
| Ok solution -> 
    printfn "Backend used: %s" solution.BackendName

Quantinuum Targets:

quantinuum.sim.h1-1sc - H1-1 System Model SC simulator (20 qubits)
quantinuum.sim.h1-1e - H1-1 System Model E simulator (20 qubits)
quantinuum.qpu.h1-1 - H1-1 hardware (20 qubits, 99.9%+ fidelity)
quantinuum.qpu.h2-1 - H2-1 hardware (32 qubits, 99.9%+ fidelity)

Quantinuum Features:

✅ All-to-all connectivity - No SWAP routing needed (trapped-ion architecture)
✅ 99.9%+ gate fidelity - Highest quality quantum gates commercially available
✅ Native gates: H, X, Y, Z, S, T, RX, RY, RZ, CZ (no transpilation for phase gates!)
✅ OpenQASM 2.0 format - Standard quantum circuit language
✅ Mid-circuit measurement - Advanced quantum features
⚠️ Premium pricing - Higher cost per shot than IonQ/Rigetti

D-Wave Quantum Annealer

open FSharp.Azure.Quantum.Backends.DWaveBackend
open FSharp.Azure.Quantum.Backends.RealDWaveBackend
open FSharp.Azure.Quantum.Backends.DWaveTypes

// Option 1: Mock D-Wave backend (testing, no credentials needed)
let mockBackend = createMockDWaveBackend Advantage_System6_1 (Some 42)

// Option 2: Real D-Wave backend (production, requires API token)
let dwaveConfig = {
    ApiToken = "YOUR_DWAVE_TOKEN"  // Get from https://cloud.dwavesys.com/leap/
    Endpoint = "https://cloud.dwavesys.com/sapi/v2/"
    Solver = "Advantage_system6.1"  // 5640 qubits, Pegasus topology
    TimeoutMs = Some 300000  // 5 minutes
}
let dwaveBackend = RealDWaveBackend.create dwaveConfig

// Option 3: From environment variables (DWAVE_API_TOKEN, DWAVE_SOLVER)
match RealDWaveBackend.createFromEnv() with
| Ok backend -> printfn "D-Wave backend ready: %s" backend.Name
| Error msg -> printfn "No D-Wave credentials: %s" msg

// Build QAOA circuit for MaxCut (automatically converted to QUBO/Ising)
let vertices = ["A"; "B"; "C"; "D"; "E"]
let edges = [
    ("A", "B", 1.0); ("B", "C", 2.0); ("C", "D", 1.0)
    ("D", "E", 1.5); ("E", "A", 1.2)
]

let problem = MaxCut.createProblem vertices edges

// Solve using D-Wave backend (implements IQuantumBackend)
// D-Wave automatically extracts QUBO from QAOA circuit and uses quantum annealing
match MaxCut.solve problem (Some dwaveBackend) with
| Ok solution ->
    printfn "Cut value: %.2f" solution.CutValue
    printfn "Partition S: %A" solution.PartitionS
    printfn "Partition T: %A" solution.PartitionT
| Error msg -> printfn "Error: %s" msg

D-Wave Features:

2000-5640 qubits - Far larger than gate-based quantum computers (Advantage series)
Implements IQuantumBackend - Seamless integration with QAOA solvers
Automatic QUBO extraction - Converts QAOA circuits to native Ising format
Quantum annealing - Different paradigm than gate-based (finds ground states via annealing)
Mock backend - Test without credentials using classical simulated annealing
Real backend - Production D-Wave Leap Cloud API integration (pure .NET, no Python)
Production hardware - Available now (Advantage_system6.1: 5640 qubits)
Specialized - Best for optimization problems (not universal quantum computing)

Available D-Wave Solvers:

Advantage_System6_1: 5640 qubits (Pegasus topology, latest)
Advantage_System4_1: 5000 qubits (Pegasus topology)
Advantage2_Prototype: 1200 qubits (Zephyr topology, next-gen)
DW_2000Q_6: 2048 qubits (Chimera topology, legacy)

Example: examples/DWaveMaxCutExample.fsx

Backend Comparison

// Small problem: Use local simulation
let smallProblem = MaxCut.createProblem ["A"; "B"; "C"] [("A","B",1.0)]
let result1 = MaxCut.solve smallProblem None  // Fast, free

// Medium problem: Use Azure Quantum
let mediumProblem = 
    MaxCut.createProblem 
        [for i in 1..20 -> sprintf "V%d" i]
        [for i in 1..19 -> (sprintf "V%d" i, sprintf "V%d" (i+1), 1.0)]

let azureBackend = BackendAbstraction.createIonQBackend(conn, "ionq.simulator")
let result2 = MaxCut.solve mediumProblem (Some azureBackend)  // 20-29 qubits

// Large problem: Use D-Wave quantum annealer
let largeProblem =
    MaxCut.createProblem
        [for i in 1..100 -> sprintf "V%d" i]  // 100 vertices!
        [for i in 1..99 -> (sprintf "V%d" i, sprintf "V%d" (i+1), 1.0)]

// Create D-Wave backend (mock for testing or real for production)
let dwaveBackend = 
    // Option 1: Mock backend (no credentials)
    DWaveBackend.createMockDWaveBackend Advantage_System6_1 None
    
    // Option 2: Real backend (requires DWAVE_API_TOKEN env var)
    // match RealDWaveBackend.createFromEnv() with
    // | Ok backend -> backend
    // | Error _ -> DWaveBackend.createDefaultMockBackend()

let result3 = MaxCut.solve largeProblem (Some dwaveBackend)  // 2000+ qubits

Backend Selection Guide:

Problem Size	Backend	Qubits	Speed	Cost	Best For
Small (≤20 variables)	LocalBackend	≤20	Milliseconds	Free	Development, testing, prototyping
Medium (20-29 variables)	IonQ/Rigetti	29-80	Seconds	~$10-50/run	Gate-based quantum algorithms (QAOA, VQE)
Medium-High Fidelity (20-32 variables)	Quantinuum	20-32	Seconds	~$50-100/run	High-precision quantum chemistry, error-sensitive algorithms
Large (30-100+ variables)	Atom Computing	100+	Seconds	~$20-80/run	Large-scale optimization, all-to-all connectivity benefits
Very Large (100+ variables)	D-Wave	2000+	Seconds	~$1-10/run	Optimization problems (MaxCut, TSP, scheduling)

When to use D-Wave:

Optimization problems with 50+ variables
QUBO/Ising problems (MaxCut, Knapsack, Graph Coloring)
Production workloads needing large problem sizes
Cost-sensitive applications (D-Wave cheaper per qubit)
NOT for: QFT-based algorithms, Grover's search, quantum chemistry (use gate-based)

Unified Backend Architecture

All quantum backends implement the IQuantumBackend interface, providing a consistent API for quantum circuit execution regardless of the underlying hardware or simulation technology.

Core Interface (src/FSharp.Azure.Quantum/Core/BackendAbstraction.fs):

type IQuantumBackend =
    /// Execute circuit and return quantum state (not just measurements)
    abstract member ExecuteToState: ICircuit -> Result<QuantumState, QuantumError>
    
    /// Apply single operation to existing state
    abstract member ApplyOperation: QuantumOperation -> QuantumState -> Result<QuantumState, QuantumError>
    
    /// Check if backend supports a specific operation
    abstract member SupportsOperation: QuantumOperation -> bool
    
    /// Initialize quantum state for n qubits
    abstract member InitializeState: int -> Result<QuantumState, QuantumError>
    
    /// Backend's native state representation
    abstract member NativeStateType: QuantumStateType
    
    /// Backend identifier
    abstract member Name: string

State Types:

StateVector - Full complex amplitude representation (LocalBackend, most gate-based)
TopologicalBraiding - Anyon braiding representation (TopologicalBackend)
Sparse - Sparse matrix representation (for large systems)
Mixed - Density matrix representation (noisy simulations)

Key Benefits:

State-Based Execution: Get quantum states for inspection and manipulation, not just shot-based measurements

let! state = backend.ExecuteToState circuit
let amplitudes = state.GetAmplitudes()  // Inspect quantum state directly

Backend-Agnostic Code: Write algorithms once, run on any backend

// Works with LocalBackend, IonQBackend, DWaveBackend, etc.
let runQFT (backend: IQuantumBackend) n =
    result {
        let circuit = CircuitBuilder.create n |> QFT.apply
        let! state = backend.ExecuteToState circuit
        return state
    }

Multi-Stage Algorithms: Chain operations across multiple backends

// QFT → QPE → Measurement on different backends
let! qftState = localBackend.ExecuteToState qftCircuit
let! qpeState = cloudBackend.ApplyOperation qpeOperation qftState
let! final = cloudBackend.ApplyOperation measurement qpeState

Capability Checking: Verify backend support before execution

if backend.SupportsOperation (Gate (Toffoli (0, 1, 2))) then
    // Use native Toffoli
else
    // Fall back to decomposed version

Example - Backend Switching:

open FSharp.Azure.Quantum
open FSharp.Azure.Quantum.Core.BackendAbstraction

// Step 1: Develop locally
let localBackend = createLocalBackend()
let circuit = CircuitBuilder.create 3
              |> addGate (H 0)
              |> addGate (CNOT (0,1))
              |> addGate (CNOT (1,2))

match localBackend.ExecuteToState circuit with
| Ok state -> 
    printfn "Local test passed: %d amplitudes" (state.GetAmplitudes().Length)
| Error e -> 
    printfn "Error: %A" e

// Step 2: Same code on cloud backend (no changes needed!)
let workspace = AzureQuantumWorkspace.createDefault "sub-id" "rg" "workspace" "eastus"
let cloudBackend = createFromWorkspace workspace "ionq.simulator"

match cloudBackend.ExecuteToState circuit with  // Identical call!
| Ok state -> 
    printfn "Cloud execution passed: Backend=%s" cloudBackend.Name
| Error e -> 
    printfn "Error: %A" e

All Backends Implement IQuantumBackend:

✅ LocalBackend - Local state-vector simulation
✅ IonQBackend - IonQ gate-based quantum computers
✅ RigettiBackend - Rigetti superconducting QPUs
✅ QuantinuumBackend - Quantinuum trapped-ion systems
✅ AtomComputingBackend - Atom Computing neutral atom QPUs
✅ DWaveBackend - D-Wave quantum annealer (converts QAOA to QUBO)
✅ TopologicalBackend - Topological quantum simulation

This unified interface enables seamless integration of the library's high-level solvers (QAOA, QFT, Grover) with any supported quantum hardware or simulator.

Azure Quantum Workspace Management

Production-ready hybrid approach: Workspace quota management + proven HTTP backends

open FSharp.Azure.Quantum.Backends.AzureQuantumWorkspace
open FSharp.Azure.Quantum.Core.BackendAbstraction
open System.Net.Http

// Step 1: Check quota with workspace
use workspace = 
    createDefault 
        "your-subscription-id"
        "your-resource-group"
        "your-workspace-name"
        "eastus"

async {
    // Check remaining quota before execution
    let! quota = workspace.GetTotalQuotaAsync()
    
    match quota.Remaining with
    | Some remaining when remaining < 10.0 ->
        printfn "⚠️  Low quota - stopping"
    | Some remaining ->
        printfn "✅ Sufficient quota: %.2f credits" remaining
        
        // Step 2: Use HTTP backend for proven execution
        use httpClient = new HttpClient()
        let backend = createIonQBackend
            httpClient
            "https://your-workspace.quantum.azure.com"
            "ionq.simulator"
        
        // Step 3: Convert circuit and execute
        let circuit = quantumCircuit { H 0; CNOT 0 1 }
        let wrapper = CircuitWrapper(circuit) :> ICircuit
        
        match convertCircuitToProviderFormat wrapper "ionq.simulator" with
        | Ok json ->
            match backend.Execute wrapper 1000 with
            | Ok result -> printfn "Success!"
            | Error msg -> printfn "Error: %s" msg
        | Error msg -> 
            printfn "Circuit conversion failed: %s" msg
    | None -> 
        printfn "✅ Unlimited quota"
} |> Async.RunSynchronously

What you get:

Workspace Features: Quota checking, provider discovery, credential management
Circuit Conversion: Automatic provider-specific format conversion (IonQ JSON, Rigetti Quil)
Proven Backends: Full HTTP-based job submission, polling, and result parsing
Resource Safety: IDisposable pattern for proper cleanup

Environment-Based Configuration:

// Set environment variables:
// export AZURE_QUANTUM_SUBSCRIPTION_ID="..."
// export AZURE_QUANTUM_RESOURCE_GROUP="..."
// export AZURE_QUANTUM_WORKSPACE_NAME="..."
// export AZURE_QUANTUM_LOCATION="eastus"

match createFromEnvironment() with
| Ok workspace -> 
    printfn "✅ Workspace loaded: %s" workspace.Config.WorkspaceName
| Error msg -> 
    printfn "⚠️  Environment not configured: %s" msg

Circuit Format Conversion:

// Convert circuits to provider-specific formats
let circuit = quantumCircuit { H 0; CNOT 0 1; RX (0, Math.PI / 4.0) }
let wrapper = CircuitWrapper(circuit) :> ICircuit

// To IonQ JSON
match convertCircuitToProviderFormat wrapper "ionq.simulator" with
| Ok ionqJson -> printfn "IonQ: %s" ionqJson
| Error msg -> printfn "Error: %s" msg

// To Rigetti Quil
match convertCircuitToProviderFormat wrapper "rigetti.sim.qvm" with
| Ok quilProgram -> printfn "Quil: %s" quilProgram
| Error msg -> printfn "Error: %s" msg

Benefits:

Workspace management without SDK complexity
Automatic gate transpilation for backend compatibility
Support for CircuitWrapper and QaoaCircuitWrapper
IonQ, Rigetti, Atom Computing, and Quantinuum providers

Example: See examples/AzureQuantumWorkspace/WorkspaceExample.fsx

SDK Backend - Full Azure Quantum Integration

Complete SDK-powered backend using Microsoft.Azure.Quantum.Client

open FSharp.Azure.Quantum.Backends.AzureQuantumWorkspace
open FSharp.Azure.Quantum.Core.BackendAbstraction

// Step 1: Create workspace
use workspace = 
    createDefault 
        "your-subscription-id"
        "your-resource-group"
        "your-workspace-name"
        "eastus"

// Step 2: Create SDK backend (NEW!)
let backend = createFromWorkspace workspace "ionq.simulator"

// Step 3: Build circuit
let circuit = quantumCircuit {
    H 0
    CNOT 0 1
    MEASURE_ALL
}

let wrapper = CircuitWrapper(circuit) :> ICircuit

// Step 4: Execute on Azure Quantum
match backend.Execute wrapper 1000 with
| Ok result ->
    printfn "✅ Job completed!"
    printfn "   Backend: %s" result.BackendName
    printfn "   Shots: %d" result.NumShots
    printfn "   Job ID: %s" (result.Metadata.["job_id"] :?> string)
    
    // Analyze measurements
    let counts = result.Measurements |> Array.countBy id
    counts |> Array.iter (fun (bitstring, count) ->
        printfn "   %A: %d times" bitstring count)
| Error msg ->
    printfn "❌ Error: %s" msg

SDK Backend Features:

Full Job Lifecycle: Submit → Poll → Retrieve results (all automated)
Automatic Circuit Conversion: IonQ JSON / Rigetti Quil format
Smart Polling: Exponential backoff (1s → 30s max delay)
Rich Metadata: job_id, provider, target, status in results
Histogram Parsing: Automatic extraction of measurement distributions
Resource Safety: IDisposable workspace for cleanup
Workspace Integration: Uses Microsoft.Azure.Quantum SDK internally

SDK Backend with Quota Check:

async {
    // Check quota before execution
    let! quota = workspace.GetTotalQuotaAsync()
    
    match quota.Remaining with
    | Some remaining when remaining < 10.0 ->
        printfn "⚠️  Low quota: %.2f credits - stopping" remaining
    | Some remaining ->
        printfn "✅ Quota available: %.2f credits" remaining
        
        // Create backend and execute
        let backend = createFromWorkspace workspace "ionq.simulator"
        match backend.Execute circuit 1000 with
        | Ok result -> printfn "Success!"
        | Error msg -> printfn "Error: %s" msg
    | None ->
        printfn "✅ Unlimited quota"
        // Execute...
} |> Async.RunSynchronously

Backend Comparison:

Feature	LocalBackend	HTTP Backend	SDK Backend
Setup	None	HttpClient + URL	Workspace object
Quota Checking	❌	❌	✅
Provider Discovery	❌	❌	✅
Job Polling	❌ (instant)	Manual	✅ Automatic
Resource Cleanup	❌	Manual	✅ IDisposable
Circuit Conversion	❌	Manual	✅ Automatic
Max Qubits	20	29 (IonQ) / 40 (Rigetti)	29 (IonQ) / 40 (Rigetti)
Cost	Free	Paid	Paid
Production Ready	✅	✅	✅
Best For	Testing	Manual control	Full integration

When to use each backend:

LocalBackend: Development, testing, small circuits (<20 qubits), free tier
HTTP Backend: Production workloads, proven stability, fine-grained control
SDK Backend: Full workspace features, quota management, easier setup, complete integration

Example: See examples/AzureQuantumWorkspace/WorkspaceExample.fsx (Examples 7-9)

OpenQASM 2.0 Support

Import and export quantum circuits to IBM Qiskit, Cirq, and other OpenQASM-compatible platforms.

Why OpenQASM?

OpenQASM (Open Quantum Assembly Language) is the industry-standard text format for quantum circuits:

IBM Qiskit - Primary format (6.7k GitHub stars)
Amazon Braket - Native support
Google Cirq - Import/export compatibility
Interoperability - Share circuits between platforms

Export Circuits to OpenQASM

F# API:

// open FSharp.Azure.Quantum
// open FSharp.Azure.Quantum.CircuitBuilder

// Build circuit using F# circuit builder
let circuit = 
    CircuitBuilder.empty 2
    |> CircuitBuilder.addGate (H 0)
    |> CircuitBuilder.addGate (CNOT (0, 1))
    |> CircuitBuilder.addGate (RZ (0, System.Math.PI / 4.0))

// Export to OpenQASM 2.0 string
let qasmCode = OpenQasm.export circuit
printfn "%s" qasmCode

// Export to .qasm file
OpenQasm.exportToFile circuit "bell_state.qasm"

Output (bell_state.qasm):

OPENQASM 2.0;
include "qelib1.inc";
qreg q[2];
h q[0];
cx q[0],q[1];
rz(0.7853981634) q[0];

Import Circuits from OpenQASM

F# API:

// open FSharp.Azure.Quantum
// open System.IO

// Parse OpenQASM string
let qasmCode = """
OPENQASM 2.0;
include "qelib1.inc";
qreg q[3];
h q[0];
cx q[0],q[1];
cx q[1],q[2];
"""

match OpenQasmImport.parse qasmCode with
| Ok circuit ->
    printfn "Loaded %d-qubit circuit with %d gates" 
        circuit.QubitCount circuit.Gates.Length
    // Use circuit with LocalBackend or export to another format
| Error msg -> 
    printfn "Parse error: %s" msg

// Import from file
match OpenQasmImport.parseFromFile "grover.qasm" with
| Ok circuit -> printfn "Loaded %d-qubit circuit" circuit.QubitCount
| Error msg -> printfn "Error: %s" msg

C# API

using FSharp.Azure.Quantum;
using FSharp.Azure.Quantum.CircuitBuilder;

// Export circuit to OpenQASM
var circuit = CircuitBuilder.empty(2)
    .AddGate(Gate.NewH(0))
    .AddGate(Gate.NewCNOT(0, 1));

var qasmCode = OpenQasm.export(circuit);
File.WriteAllText("circuit.qasm", qasmCode);

// Import from OpenQASM
var qasmInput = File.ReadAllText("qiskit_circuit.qasm");
var result = OpenQasmImport.parse(qasmInput);

if (result.IsOk) {
    var imported = result.ResultValue;
    Console.WriteLine($"Loaded {imported.QubitCount}-qubit circuit");
}

Supported Gates

All standard OpenQASM 2.0 gates supported:

Category	Gates
Pauli	X, Y, Z, H
Phase	S, S†, T, T†
Rotation	RX(θ), RY(θ), RZ(θ)
Two-qubit	CNOT (CX), CZ, SWAP
Three-qubit	CCX (Toffoli)

Workflow: Qiskit → F# → IonQ

Full interoperability workflow:

// 1. Load circuit from Qiskit
let qiskitCircuit = OpenQasmImport.parseFromFile "qiskit_algorithm.qasm"

match qiskitCircuit with
| Ok circuit ->
    // 2. Run on LocalBackend for testing
    let localBackend = BackendAbstraction.createLocalBackend()
    let testResult = LocalSimulator.QaoaSimulator.simulate circuit 1000
    
    printfn "Local test: %d samples" testResult.Shots
    
    // 3. Transpile for IonQ hardware
    let transpiled = GateTranspiler.transpileForBackend "ionq.qpu" circuit
    
    // 4. Execute on IonQ
    let ionqBackend = BackendAbstraction.createIonQBackend(
        connectionString,
        "ionq.qpu"
    )
    
    // 5. Export results back to Qiskit format
    OpenQasm.exportToFile transpiled "results_ionq.qasm"
| Error msg -> 
    printfn "Import failed: %s" msg

Round-Trip Compatibility

Circuits are preserved through export/import:

// Original circuit
let original = { QubitCount = 3; Gates = [H 0; CNOT (0, 1); RZ (1, 1.5708)] }

// Export → Import → Compare
let qasm = OpenQasm.export original
let imported = OpenQasmImport.parse qasm

match imported with
| Ok circuit ->
    assert (circuit.QubitCount = original.QubitCount)
    assert (circuit.Gates.Length = original.Gates.Length)
    printfn "✅ Round-trip successful"
| Error msg -> 
    printfn "❌ Round-trip failed: %s" msg

Use Cases

Share algorithms - Export F# quantum algorithms to IBM Qiskit community
Import research - Load published Qiskit papers/benchmarks into F# for analysis
Multi-provider - Develop in F#, run on IBM Quantum, Amazon Braket, IonQ
Education - Students learn quantum with type-safe F#, export to standard format
Validation - Cross-check results between F# LocalBackend and IBM simulators

See: tests/OpenQasmIntegrationTests.fs for comprehensive examples

Error Mitigation

Reduce quantum noise and improve result accuracy by 30-90% with production-ready error mitigation techniques.

Why Error Mitigation?

Quantum computers are noisy (NISQ era). Error mitigation improves results without requiring error-corrected qubits:

Gate errors - Imperfect quantum gates introduce noise (~0.1-1% per gate)
Decoherence - Qubits lose quantum information over time
Readout errors - Measurement outcomes have ~1-5% error rate

Error mitigation achieves near-ideal results on noisy hardware - critical for real-world quantum advantage.

Available Techniques

1️⃣ Zero-Noise Extrapolation (ZNE)

Richardson extrapolation to estimate error-free result.

How it works:

Run circuit at different noise levels (1.0x, 1.5x, 2.0x)
Fit polynomial to noise vs. result
Extrapolate to zero noise (λ=0)

Performance:

30-50% error reduction
3x cost overhead (3 noise scaling levels)
Works on any backend (IonQ, Rigetti, Local)

F# Example:

open FSharp.Azure.Quantum.ErrorMitigation

// Configure ZNE
let zneConfig = {
    NoiseScalings = [
        ZeroNoiseExtrapolation.IdentityInsertion 0.0    // baseline (1.0x)
        ZeroNoiseExtrapolation.IdentityInsertion 0.5    // 1.5x noise
        ZeroNoiseExtrapolation.IdentityInsertion 1.0    // 2.0x noise
    ]
    PolynomialDegree = 2
    MinSamples = 1000
}

// Apply ZNE to circuit expectation value
// Mock circuit and observable for demonstration
let circuit = QuantumCircuit.empty()  // Mock circuit
let observable = PauliOperator.Z(0)   // Mock observable

async {
    let! result = ZeroNoiseExtrapolation.mitigate circuit observable zneConfig backend
    
    match result with
    | Ok zneResult ->
        printfn "Zero-noise value: %f" zneResult.ZeroNoiseValue
        printfn "R² goodness of fit: %f" zneResult.GoodnessOfFit
        printfn "Measured values:"
        zneResult.MeasuredValues 
        |> List.iter (fun (noise, value) -> printfn "  λ=%.1f: %f" noise value)
    | Error msg -> 
        printfn "ZNE failed: %s" msg
}

When to use:

Medium-depth circuits (20-50 gates)
Cost-constrained (3x affordable)
Need 30-50% error reduction

2️⃣ Probabilistic Error Cancellation (PEC)

Quasi-probability decomposition with importance sampling.

How it works:

Decompose noisy gates into sum of ideal gates with quasi-probabilities (some negative!)
Sample circuits from quasi-probability distribution
Reweight samples to cancel noise

Performance:

2-3x accuracy improvement
10-100x cost overhead (Monte Carlo sampling)
Powerful for high-accuracy requirements

F# Example:

open FSharp.Azure.Quantum.ErrorMitigation

// Configure PEC with noise model
let pecConfig = {
    NoiseModel = {
        SingleQubitDepolarizing = 0.001  // 0.1% per single-qubit gate
        TwoQubitDepolarizing = 0.01      // 1% per two-qubit gate
        ReadoutError = 0.02              // 2% readout error
    }
    Samples = 1000
    Seed = Some 42
}

// Apply PEC to circuit
async {
    let! result = ProbabilisticErrorCancellation.mitigate circuit observable pecConfig backend
    
    match result with
    | Ok pecResult ->
        printfn "Corrected expectation: %f" pecResult.CorrectedExpectation
        printfn "Uncorrected (noisy): %f" pecResult.UncorrectedExpectation
        printfn "Error reduction: %.1f%%" (pecResult.ErrorReduction * 100.0)
        printfn "Overhead: %.1fx" pecResult.Overhead
    | Error msg -> 
        printfn "PEC failed: %s" msg
}

When to use:

High-accuracy requirements (research, benchmarking)
Budget available for 10-100x overhead
Need 2-3x accuracy improvement

3️⃣ Readout Error Mitigation (REM)

Confusion matrix calibration with matrix inversion.

How it works:

Calibration phase - Prepare all basis states (|00⟩, |01⟩, |10⟩, |11⟩), measure confusion matrix
Correction phase - Invert matrix, multiply by measured histogram
Result - Corrected histogram with confidence intervals

Performance:

50-90% readout error reduction
~0x runtime overhead (one-time calibration, then free!)
Works on all backends

F# Example:

open FSharp.Azure.Quantum.ErrorMitigation

// Step 1: Calibrate (one-time cost per backend)
let remConfig = 
    ReadoutErrorMitigation.defaultConfig
    |> ReadoutErrorMitigation.withCalibrationShots 10000
    |> ReadoutErrorMitigation.withConfidenceLevel 0.95

async {
    // Calibrate confusion matrix (run once, cache result)
    let! calibrationResult = ReadoutErrorMitigation.calibrate remConfig backend
    
    match calibrationResult with
    | Ok calibMatrix ->
        printfn "Calibration complete:"
        printfn "  Qubits: %d" calibMatrix.Qubits
        printfn "  Shots: %d" calibMatrix.CalibrationShots
        printfn "  Backend: %s" calibMatrix.Backend
        
        // Step 2: Correct measurement histogram (zero overhead!)
        let noisyHistogram = Map.ofList [("00", 0.9); ("01", 0.05); ("10", 0.03); ("11", 0.02)]  // Mock noisy results
        let correctedResult = ReadoutErrorMitigation.correctHistogram noisyHistogram calibMatrix remConfig
        
        match correctedResult with
        | Ok corrected ->
            printfn "\nCorrected histogram:"
            corrected.Histogram 
            |> Map.iter (fun state prob -> printfn "  |%s⟩: %.4f" state prob)
            
            printfn "\nConfidence intervals (95%%):"
            corrected.ConfidenceIntervals
            |> Map.iter (fun state (lower, upper) -> 
                printfn "  |%s⟩: [%.4f, %.4f]" state lower upper)
        | Error msg -> 
            printfn "Correction failed: %s" msg
    | Error msg -> 
        printfn "Calibration failed: %s" msg
}

When to use:

Shallow circuits (readout errors dominate)
Cost-constrained (free after calibration)
All quantum applications (always beneficial)

4️⃣ Automatic Strategy Selection

Let the library choose the best technique for your circuit.

F# Example:

open FSharp.Azure.Quantum.ErrorMitigation

// Define selection criteria
let criteria = {
    CircuitDepth = 25
    QubitCount = 6
    Backend = Types.Backend.IonQBackend
    MaxCostUSD = Some 10.0
    RequiredAccuracy = Some 0.95
}

// Get recommended strategy
let recommendation = ErrorMitigationStrategy.selectStrategy criteria

printfn "Recommended: %s" (
    match recommendation.Primary with
    | ZeroNoiseExtrapolation _ -> "Zero-Noise Extrapolation (ZNE)"
    | ProbabilisticErrorCancellation _ -> "Probabilistic Error Cancellation (PEC)"
    | ReadoutErrorMitigation _ -> "Readout Error Mitigation (REM)"
    | Combined _ -> "Combined Techniques"
)
printfn "Reasoning: %s" recommendation.Reasoning
printfn "Estimated cost multiplier: %.1fx" recommendation.EstimatedCostMultiplier
printfn "Estimated accuracy: %.1f%%" (recommendation.EstimatedAccuracy * 100.0)

// Apply recommended strategy
let noisyHistogram = Map.ofList [("00", 0.9); ("01", 0.05); ("10", 0.03); ("11", 0.02)]  // Mock noisy results
let mitigatedResult = ErrorMitigationStrategy.applyStrategy noisyHistogram recommendation.Primary

match mitigatedResult with
| Ok result ->
    printfn "\nMitigation successful:"
    printfn "  Technique: %A" result.AppliedTechnique
    printfn "  Used fallback: %b" result.UsedFallback
    printfn "  Actual cost: %.1fx" result.ActualCostMultiplier
    result.Histogram |> Map.iter (fun k v -> printfn "    %s: %f" k v)
| Error msg ->
    printfn "Mitigation failed: %s" msg

Strategy selection logic:

Shallow (depth < 20): Readout errors dominate → REM
Medium (20-50): Gate errors significant → ZNE
Deep (> 50): High gate errors → PEC or Combined (ZNE + REM)
High accuracy: PEC (if budget allows)
Cost-constrained: REM (free) or ZNE (3x)

Decision Matrix

Circuit Type	Best Technique	Error Reduction	Cost	Why
Shallow (< 20 gates)	REM	50-90%	~0x	Readout dominates
Medium (20-50 gates)	ZNE	30-50%	3x	Balanced gate/readout
Deep (> 50 gates)	PEC or ZNE+REM	40-70%	10-100x	High gate errors
Cost-constrained	REM	50-90%	~0x	Free after calibration
High accuracy	PEC	2-3x	10-100x	Research/benchmarking

Real-World Example: MaxCut with ZNE

open FSharp.Azure.Quantum
open FSharp.Azure.Quantum.ErrorMitigation

// Define MaxCut problem
let vertices = ["A"; "B"; "C"; "D"]
let edges = [
    ("A", "B", 1.0)
    ("B", "C", 2.0)
    ("C", "D", 1.0)
    ("D", "A", 1.0)
]

let problem = MaxCut.problem vertices edges

// Solve with ZNE error mitigation
let zneConfig = {
    NoiseScalings = [
        ZeroNoiseExtrapolation.IdentityInsertion 0.0
        ZeroNoiseExtrapolation.IdentityInsertion 0.5
        ZeroNoiseExtrapolation.IdentityInsertion 1.0
    ]
    PolynomialDegree = 2
    MinSamples = 1000
}

async {
    // Standard solve (noisy)
    let! noisyResult = MaxCut.solve problem None
    
    // Solve with ZNE (error-mitigated)
    let! mitigatedResult = MaxCut.solveWithErrorMitigation problem (Some zneConfig) None
    
    match noisyResult, mitigatedResult with
    | Ok noisy, Ok mitigated ->
        printfn "Noisy cut value: %.2f" noisy.CutValue
        printfn "ZNE-mitigated cut value: %.2f" mitigated.CutValue
        printfn "Improvement: %.1f%%" ((mitigated.CutValue - noisy.CutValue) / noisy.CutValue * 100.0)
    | _ -> 
        printfn "Error occurred"
}

Expected improvement: 30-50% better cut value on noisy hardware.

Testing & Validation

Error mitigation includes comprehensive testing:

1804 total test cases (1353 main + 451 topological)
- Error Mitigation: 534 tests
  - ZNE: 111 tests (Richardson extrapolation, noise scaling, goodness-of-fit)
  - PEC: 222 tests (quasi-probability, Monte Carlo, integration)
  - REM: 161 tests (calibration, matrix inversion, confidence intervals)
  - Strategy: 40 tests (selection logic, cost estimation, fallbacks)
- Topological: 451 tests (anyon systems, braiding, fusion)
- Core & Algorithms: 819 tests (circuits, gates, QAOA, QFT, Grover, etc.)

See: tests/FSharp.Azure.Quantum.Tests/*ErrorMitigation*.fs

QAOA Algorithm Internals

How Quantum Optimization Works

QAOA (Quantum Approximate Optimization Algorithm):

QUBO Encoding: Convert problem → Quadratic Unconstrained Binary Optimization

Graph Coloring → Binary variables for node-color assignments
MaxCut → Binary variables for partition membership

Circuit Construction: Build parameterized quantum circuit

|0⟩^n → H^⊗n → [Cost Layer (γ)] → [Mixer Layer (β)] → Measure

Parameter Optimization: Find optimal (γ, β) using Nelder-Mead

for iteration in 1..maxIterations do
    let cost = evaluateCost(gamma, beta)
    optimizer.Update(cost)

Solution Extraction: Decode measurement results → problem solution
```
Bitstring "0101" → [R1→Red, R2→Blue, R3→Red, R4→Blue]
```

QAOA Configuration

// Custom QAOA parameters
let quantumConfig : QuantumGraphColoringSolver.QuantumGraphColoringConfig = {
    OptimizationShots = 100        // Shots per optimization step
    FinalShots = 1000              // Shots for final measurement
    EnableOptimization = true      // Enable parameter optimization
    InitialParameters = (0.5, 0.5) // Starting (gamma, beta)
}

// Use custom config
let backend = BackendAbstraction.createLocalBackend()
match QuantumGraphColoringSolver.solve backend problem quantumConfig with
| Ok result -> printfn "Colors used: %d" result.ColorsUsed
| Error msg -> printfn "Error: %s" msg

Documentation

Quantum Computing Introduction - Comprehensive introduction to quantum computing for F# developers (no quantum background needed)
Getting Started Guide - Installation and first examples
C# Usage Guide - Complete C# interop guide
API Reference - Complete API documentation
Computation Expressions Reference - Complete CE reference table with all custom operations (when IntelliSense fails)
Architecture Overview - Deep dive into library design
Backend Switching Guide - Local vs Cloud backends
FAQ - Common questions and troubleshooting

Problem Size Guidelines

Problem Type	Small (LocalBackend)	Medium	Large (Cloud Required)
Graph Coloring	≤20 nodes	20-30 nodes	30+ nodes
MaxCut	≤20 vertices	20-30 vertices	30+ vertices
Knapsack	≤20 items	20-30 items	30+ items
TSP	≤8 cities	8-12 cities	12+ cities
Portfolio	≤20 assets	20-30 assets	30+ assets
Network Flow	≤15 nodes	15-25 nodes	25+ nodes
Task Scheduling	≤15 tasks	15-25 tasks	25+ tasks

Note: LocalBackend limited to 20 qubits. Larger problems require Azure Quantum backends.

Design Philosophy

Rule 1: Quantum-Only Library

FSharp.Azure.Quantum is a quantum-first library - NO classical algorithms.

Why?

Clear identity: Purpose-built for quantum optimization
No architectural confusion: Pure quantum algorithm library
Complements classical libraries: Use together with classical solvers when needed
Educational value: Learn quantum algorithms without classical fallbacks

What this means:

// ✅ QUANTUM: QAOA-based optimization
GraphColoring.solve problem 3 None

// ❌ NO CLASSICAL FALLBACK: If quantum fails, returns Error
// Users should use dedicated classical libraries for that use case

Clean API Layers

High-Level Builders: Business domain APIs (register allocation, portfolio optimization)
Quantum Solvers: QAOA implementations (algorithm experts)
Quantum Backends: Circuit execution (hardware abstraction)

No leaky abstractions - Each layer has clear responsibilities.

Quantum Algorithms

In addition to the optimization solvers above, the library includes foundational quantum algorithms for education and research:

Grover's Search Algorithm

Quantum search algorithm for finding elements in unsorted databases.

open FSharp.Azure.Quantum.GroverSearch

// Search for item satisfying predicate
let searchConfig = {
    MaxIterations = Some 10
    SuccessThreshold = 0.9
    OptimizeIterations = true
    Shots = 1000
    RandomSeed = Some 42
}

// Search 8-item space for items where f(x) = true
let predicate x = x = 3 || x = 5  // Looking for indices 3 or 5

match Search.searchWithPredicate 3 predicate searchConfig with
| Ok result ->
    printfn "Found solutions: %A" result.Solutions
    printfn "Success probability: %.2f%%" (result.SuccessProbability * 100.0)
    printfn "Iterations: %d" result.IterationsApplied
| Error msg -> 
    printfn "Search failed: %s" msg

Features:

Automatic optimal iteration calculation
Amplitude amplification for multiple solutions
Direct LocalSimulator integration (no IBackend)
Educational/research tool (not production optimizer)

Location: src/FSharp.Azure.Quantum/Algorithms/
Status: Experimental - Research and education purposes

Note: Grover's algorithm is a standalone quantum search primitive, separate from the QAOA-based optimization builders. It does not use the IBackend abstraction and is optimized for specific search problems rather than general combinatorial optimization.

Amplitude Amplification

Generalization of Grover's algorithm for custom initial states.

Amplitude amplification extends Grover's algorithm to work with arbitrary initial state preparations (not just uniform superposition). This enables quantum speedups for problems beyond simple database search.

Key Insight: Grover's algorithm is a special case where:

Initial state = uniform superposition H^⊗n|0⟩
Reflection operator = Grover diffusion operator

Amplitude amplification allows:

Custom initial state preparation A|0⟩
Reflection about A|0⟩ (automatically generated)

Example:

open FSharp.Azure.Quantum.GroverSearch.AmplitudeAmplificationAdapter
open FSharp.Azure.Quantum.Core.BackendAbstraction

// Execute amplitude amplification on quantum hardware backend
let backend = createIonQBackend(connectionString, "ionq.simulator")

// Define oracle (marks solution states)
let oracle = StateOracle(fun state -> state = 3 || state = 5)

// Configure amplitude amplification
let config = {
    NumQubits = 3
    StatePreparation = UniformSuperposition  // or BasisState(n), PartialSuperposition(states)
    Oracle = oracle
    Iterations = 2  // Optimal iterations for 2 solutions in 8-element space
}

match executeWithBackend config backend 1000 with
| Ok measurementCounts ->
    printfn "Amplitude amplification executed on quantum hardware"
    measurementCounts 
    |> Map.iter (fun state count -> printfn "  |%d⟩: %d counts" state count)
| Error msg ->
    printfn "Backend execution failed: %s" msg

// Convenience functions
executeUniformAmplification 3 oracle 2 backend 1000      // Uniform initial state
executeBasisStateAmplification 3 5 oracle 2 backend 1000 // Start from |5⟩

Features:

Custom state preparation (W-states, partial superpositions, arbitrary states)
Cloud backend execution (IonQ, Rigetti, LocalBackend)
Automatic reflection operator generation (circuit-based A†)
Grover equivalence verification (shows Grover as special case)
Optimal iteration calculation for arbitrary initial success probability
Measurement-based results (histogram of basis states)

Backend Limitations:

Backend execution returns measurement statistics only (not full amplitudes)
Quantum phases are lost during measurement (fundamental limitation)
Suitable for algorithms that measure amplification results
For amplitude/phase analysis, use local simulation

Use Cases:

Quantum walk algorithms with non-uniform initial distributions
Fixed-point search (where initial state biases toward solutions)
Quantum sampling with amplification
Fixed-amplitude search (building block for quantum counting)

Location: Algorithms/AmplitudeAmplificationAdapter.fs

Status: Well-tested and documented

Quantum Fourier Transform (QFT)

Quantum analog of the discrete Fourier transform - foundational building block for many quantum algorithms.

The QFT transforms computational basis states into frequency basis with exponential speedup over classical FFT:

Classical FFT: O(n·2^n) operations
Quantum QFT: O(n²) quantum gates

Mathematical Transform:

QFT: |j⟩ → (1/√N) Σₖ e^(2πijk/N) |k⟩

Example:

open FSharp.Azure.Quantum.GroverSearch.QFTBackendAdapter
open FSharp.Azure.Quantum.Core.BackendAbstraction

// Execute QFT on quantum hardware backend
let backend = createIonQBackend(connectionString, "ionq.simulator")
let config = { NumQubits = 5; ApplySwaps = true; Inverse = false }

match executeQFTWithBackend config backend 1000 None with
| Ok measurementCounts ->
    printfn "QFT executed on quantum hardware"
    measurementCounts 
    |> Map.iter (fun state count -> printfn "  |%d⟩: %d counts" state count)
| Error msg ->
    printfn "Backend execution failed: %s" msg

// Convenience functions
executeStandardQFT 5 backend 1000      // Standard QFT with swaps
executeInverseQFT 5 backend 1000       // Inverse QFT (QFT†)
executeQFTOnState 5 7 backend 1000     // QFT on specific input state |7⟩

Features:

O(n²) gate complexity (exponential speedup over classical)
Cloud backend execution (IonQ, Rigetti, LocalBackend)
Controlled phase gates (CP) with correct decomposition
Bit-reversal SWAP gates (optional for QPE)
Inverse QFT (QFT†) for result decoding
Angle validation (prevents NaN/infinity)
Measurement-based results (histogram of basis states)

Backend Limitations:

Backend execution returns measurement statistics only (not full state vector)
Amplitudes and phases are lost during measurement (fundamental quantum limitation)
Suitable for algorithms that measure QFT output (Shor's, Phase Estimation)
For amplitude/phase analysis, use local simulation

Use Cases:

Shor's Algorithm: Integer factorization (period finding step)
Quantum Phase Estimation: Eigenvalue estimation for VQE improvements
Period Finding: Hidden subgroup problems
Quantum Signal Processing: Frequency domain analysis

Performance:

3 qubits: 12 gates (3 H + 6 CPhase + 1 SWAP)
5 qubits: 27 gates (5 H + 20 CPhase + 2 SWAP)
10 qubits: 105 gates (10 H + 90 CPhase + 5 SWAP)

Location: Algorithms/QFTBackendAdapter.fs

Status: Well-tested and documented

Phase 2 Builders: QFT-Based Quantum Applications

High-level builders for cryptography, quantum chemistry, and research applications.

The library provides three advanced builders that wrap QFT-based quantum algorithms for real-world business scenarios:

Quantum Arithmetic Builder

Use Case: Cryptographic operations, RSA encryption, modular arithmetic

open FSharp.Azure.Quantum.QuantumArithmeticOps

// RSA encryption: m^e mod n
let encryptOp = quantumArithmetic {
    operands 5 3           // message=5, exponent=3
    operation ModularExponentiate
    modulus 33             // RSA modulus
    qubits 8
}

match execute encryptOp with
| Ok result -> 
    printfn "Encrypted: %d" result.Value
    printfn "Gates: %d, Depth: %d" result.GateCount result.CircuitDepth
| Error msg -> 
    printfn "Error: %s" msg

C# API:

using static FSharp.Azure.Quantum.CSharpBuilders;

var encrypt = ModularExponentiate(baseValue: 5, exponent: 3, modulus: 33);
var result = ExecuteArithmetic(encrypt);

Business Applications:

Cryptographic algorithm prototyping
Educational RSA demonstrations
Quantum arithmetic research

Example: examples/QuantumArithmetic/

Cryptographic Analysis Builder (Shor's Algorithm)

Use Case: RSA security assessment, post-quantum cryptography planning

open FSharp.Azure.Quantum.QuantumPeriodFinder

// Factor RSA modulus (security analysis)
let problem = periodFinder {
    number 15              // Composite to factor
    precision 8            // QPE precision
    maxAttempts 10         // Retries (probabilistic)
}

match solve problem with
| Ok result ->
    match result.Factors with
    | Some (p, q) -> 
        printfn "Factors: %d × %d" p q
        printfn "⚠️  RSA Security Broken!"
    | None -> 
        printfn "Try again (probabilistic)"
| Error msg -> 
    printfn "Error: %s" msg

C# API:

var problem = FactorInteger(15, precision: 8);
var result = ExecutePeriodFinder(problem);

Business Applications:

Security consulting (quantum threat assessment)
Post-quantum cryptography migration planning
Cryptanalysis research and education

Example: examples/CryptographicAnalysis/

Phase Estimation Builder (Quantum Chemistry)

Use Case: Drug discovery, molecular simulation, materials science

open FSharp.Azure.Quantum.QuantumPhaseEstimator

// Estimate molecular ground state energy
let problem = phaseEstimator {
    unitary (RotationZ (Math.PI / 3.0))  // Molecular Hamiltonian
    precision 12                          // 12-bit energy precision
}

match estimate problem with
| Ok result ->
    printfn "Phase: %.6f" result.Phase
    printfn "Energy: %.4f a.u." (result.Phase * 2.0 * Math.PI)
    printfn "Application: Drug binding affinity prediction"
| Error msg ->
    printfn "Error: %s" msg

C# API:

var problem = EstimateRotationZ(Math.PI / 3.0, precision: 12);
var result = ExecutePhaseEstimator(problem);

Business Applications:

Pharmaceutical drug discovery (binding energy)
Materials science (electronic properties)
Quantum chemistry simulations

Example: examples/PhaseEstimation/

Phase 2 Builder Features:

Business-focused APIs hiding quantum complexity
F# computation expressions + C# fluent API
Comprehensive examples with real-world scenarios
Educational value for quantum algorithm learning
NISQ limitations: Toy examples only (< 20 qubits)
Requires fault-tolerant quantum computers for production use

Current Status: Educational/research focus - Demonstrates quantum algorithms but hardware insufficient for real-world applications (as of 2025)

Feature Category	FSharp.Azure.Quantum	IBM Qiskit	Microsoft Azure Quantum SDK	Google Cirq	Amazon Braket SDK
Primary Language	F# (with C# interop)	Python	Python, C#, Q#	Python	Python
License	Unlicense (Public Domain)	Apache 2.0	MIT	Apache 2.0	Apache 2.0
Target Audience	.NET developers, optimization problems	General quantum computing	Enterprise quantum developers	Google hardware users	AWS cloud users

🎯 OPTIMIZATION SOLVERS
MaxCut	✅ Built-in (QAOA)	✅ Qiskit Optimization	❌ Manual	❌ Manual	❌ Manual
Knapsack	✅ Built-in (QAOA)	✅ Qiskit Optimization	❌ Manual	❌ Manual	❌ Manual
TSP	✅ Built-in (QAOA)	✅ Qiskit Optimization	❌ Manual	❌ Manual	❌ Manual
Portfolio Optimization	✅ Built-in (QAOA)	✅ Qiskit Finance	❌ Manual	❌ Manual	❌ Manual
Task Scheduling	✅ Built-in (QAOA)	❌ Manual	❌ Manual	❌ Manual	❌ Manual
Network Flow	✅ Built-in (QAOA)	❌ Manual	❌ Manual	❌ Manual	❌ Manual
Graph Coloring	✅ Built-in (QAOA)	❌ Manual implementation	❌ Manual	❌ Manual	❌ Manual

🤖 QUANTUM MACHINE LEARNING
VQC (Variational Classifier)	✅ Built-in	✅ Qiskit Machine Learning	❌ Manual	✅ TFQ integration	✅ Built-in
Quantum Kernel SVM	✅ Built-in	✅ Qiskit Machine Learning	❌ Manual	❌ Limited	✅ Built-in
Feature Maps	✅ ZZ, Pauli, Angle	✅ Extensive library	❌ Manual	✅ Via TFQ	✅ Built-in
Variational Forms	✅ RealAmplitudes, EfficientSU2	✅ Extensive ansatz library	❌ Manual	✅ Via Cirq	✅ Built-in
AutoML Integration	✅ Built-in	❌ External tools	❌ No	❌ No	❌ No

📊 BUSINESS PROBLEM BUILDERS
Anomaly Detection	✅ Built-in	❌ Manual	❌ No	❌ No	❌ No
Binary Classification	✅ Built-in	✅ Qiskit ML	❌ No	❌ No	❌ No
Predictive Modeling	✅ Built-in	❌ Manual	❌ No	❌ No	❌ No
Similarity Search	✅ Built-in	❌ Manual	❌ No	❌ No	❌ No

🔬 QUANTUM ALGORITHMS
QAOA	✅ Production-ready, auto-optimized	✅ Qiskit Optimization	✅ Q# samples	✅ Manual	✅ Built-in
VQE	✅ Built-in (chemistry)	✅ Qiskit Nature	✅ Q# samples	✅ Built-in	✅ Built-in
Grover's Algorithm	✅ Educational	✅ Built-in	✅ Q# samples	✅ Built-in	✅ Built-in
Shor's Algorithm	✅ Educational (period finder)	✅ Built-in	✅ Q# samples	✅ Built-in	✅ Built-in
QFT	✅ Built-in	✅ Built-in	✅ Q# built-in	✅ Built-in	✅ Built-in
HHL (Linear Systems)	✅ Built-in	✅ Qiskit Aqua	❌ Manual	❌ Manual	❌ Manual
Amplitude Amplification	✅ Built-in	✅ Built-in	✅ Q# built-in	✅ Built-in	❌ Manual

🖥️ LOCAL SIMULATION
Local Simulator	✅ Built-in (≤20 qubits)	✅ Aer (≤30 qubits)	✅ Full-state (≤30 qubits)	✅ Built-in (≤20 qubits)	✅ Local simulator
Noise Simulation	❌ Some	✅ AerSimulator noise models	✅ Open/Closed systems	✅ Built-in	✅ Built-in
GPU Acceleration	❌ No	✅ Aer GPU	✅ Yes	✅ Yes	✅ Yes
State Vector	✅ Pure F# implementation	✅ C++ backend	✅ C++ backend	✅ C++ backend	✅ C++ backend

☁️ CLOUD BACKENDS
Azure Quantum (IonQ)	✅ Native	✅ Via Qiskit Runtime	✅ Native	❌ No	❌ No
Azure Quantum (Rigetti)	✅ Native	✅ Via Qiskit Runtime	✅ Native	❌ No	❌ No
IBM Quantum	❌ Via OpenQASM export	✅ Native	❌ No	❌ No	❌ No
D-Wave Quantum Annealer	✅ Native	✅ Via Ocean SDK	✅ Native	❌ No	✅ Native
AWS Braket	❌ Via OpenQASM export	✅ Via plugin	❌ No	❌ No	✅ Native
Google Quantum	❌ Via OpenQASM export	✅ Via plugin	❌ No	✅ Native	❌ No

🔄 INTEROPERABILITY
OpenQASM 2.0 Import	✅ Full support	✅ Native	✅ Via conversion	✅ Full support	✅ Full support
OpenQASM 2.0 Export	✅ Full support	✅ Native	✅ Via conversion	✅ Full support	✅ Full support
QUIL	❌ No	❌ Via plugin	✅ Rigetti native	❌ No	✅ Rigetti support

🛡️ ERROR MITIGATION
Zero-Noise Extrapolation	✅ Built-in (30-50% reduction)	✅ Qiskit Experiments	❌ Manual	✅ Via Mitiq integration	❌ Manual
Probabilistic Error Cancellation	✅ Built-in (2-3x accuracy)	✅ Via Mitiq	❌ Manual	✅ Via Mitiq integration	❌ Manual
Readout Error Mitigation	✅ Built-in (50-90% reduction)	✅ Qiskit Experiments	❌ Manual	✅ Via Mitiq integration	❌ Manual
Automatic Strategy Selection	✅ Built-in	❌ Manual	❌ No	❌ Manual	❌ No

💻 API DESIGN
Computation Expressions	✅ F# native pattern	❌ N/A (Python)	❌ No	❌ N/A (Python)	❌ N/A (Python)
Type Safety	✅ F# compile-time checks	⚠️ Python dynamic typing	⚠️ Python/C# mixed	⚠️ Python dynamic typing	⚠️ Python dynamic typing
Fluent API (C#)	✅ Built-in	❌ N/A	✅ Native C#	❌ N/A	❌ N/A
Functional Programming	✅ F# first-class	❌ Object-oriented	⚠️ Mixed	⚠️ Mixed	❌ Object-oriented
Result Type Error Handling	✅ F# Result<T,E>	❌ Exceptions	❌ Exceptions	❌ Exceptions	❌ Exceptions

🤖 HYBRID CLASSICAL-QUANTUM
Automatic Problem Routing	✅ HybridSolver (optional)	❌ Manual	❌ Manual	❌ Manual	❌ Manual
Classical Fallback	✅ Built-in (small problems)	❌ Manual	❌ No	❌ No	❌ No
Cost Guards	✅ MaxCostUSD limits	❌ Manual	❌ Manual	❌ Manual	❌ Manual
Quantum Advantage Analysis	✅ Built-in reasoning	❌ Manual	❌ No	❌ No	❌ No

🧪 QUANTUM CHEMISTRY
VQE for Molecules	✅ Built-in (H₂, H₂O)	✅ Qiskit Nature	✅ Q# Chemistry	✅ OpenFermion integration	✅ Built-in
Hamiltonian Construction	✅ Built-in	✅ Qiskit Nature	✅ Broombridge format	✅ OpenFermion	✅ OpenFermion
UCC Ansatz	✅ Built-in	✅ Qiskit Nature	✅ Q# Chemistry	✅ OpenFermion	✅ Built-in

📚 ECOSYSTEM
Circuit Visualization	❌ Mermaid, or Export to OpenQASM → Qiskit	✅ Native (matplotlib)	✅ Q# visualizer	✅ Native (matplotlib)	✅ Native (matplotlib)
Documentation Quality	✅ Comprehensive (MD docs)	✅ Extensive (tutorials)	✅ Microsoft Docs	✅ Google Docs	✅ AWS Docs
Example Projects	✅ 30+ working examples	✅ 100+ tutorials	⚠️ Limited examples	✅ 50+ tutorials	✅ 40+ examples
Community Size	⚠️ Small (new library)	✅ Large (6.7k stars)	⚠️ Medium	✅ Medium (Google)	⚠️ Medium
GitHub Stars	⚠️ New project	✅ 6,700+	⚠️ Not standalone repo	✅ 4,000+	✅ 800+
Stack Overflow Support	⚠️ Limited (F# quantum niche)	✅ Extensive	⚠️ Medium	⚠️ Medium	⚠️ Limited

🔧 DEVELOPMENT EXPERIENCE
IDE Support	✅ Visual Studio, VS Code	✅ Jupyter, VS Code	✅ Visual Studio, VS Code	✅ Jupyter, VS Code	✅ Jupyter, VS Code
REPL/Interactive	✅ F# Interactive (FSI)	✅ Jupyter Notebooks	✅ Q# Jupyter	✅ Jupyter Notebooks	✅ Jupyter Notebooks
Package Manager	✅ NuGet	✅ pip	✅ NuGet, pip	✅ pip	✅ pip
Installation	✅ dotnet add package	✅ pip install qiskit	✅ pip install azure-quantum	✅ pip install cirq	✅ pip install amazon-braket-sdk

⚡ PERFORMANCE
Small Problems (<10 qubits)	✅ LocalBackend (ms)	✅ Aer (ms)	✅ Full-state (ms)	✅ Cirq (ms)	✅ Local (ms)
Medium Problems (10-20 qubits)	✅ LocalBackend (<1s)	✅ Aer (<1s)	✅ Full-state (<1s)	✅ Cirq (<10s)	✅ Local (<1s)
Large Problems (20+ qubits)	⚠️ Cloud required	✅ Aer GPU (30 qubits)	✅ Cloud	⚠️ Cloud required	✅ Cloud

💰 COST
Local Development	✅ Free	✅ Free	✅ Free	✅ Free	✅ Free
Cloud QPU Access	💰 Azure Quantum pricing	💰 IBM Quantum pricing	💰 Azure Quantum pricing	💰 Google Quantum pricing	💰 AWS Braket pricing
D-Wave Quantum	💰 ~-10/run	💰 Via Ocean SDK	💰 Azure marketplace	❌ N/A	💰 AWS Braket

Topological Quantum Computing

NEW: Simulate topological quantum computers using anyon braiding - the approach behind Microsoft's Majorana quantum computing program.

Unlike gate-based quantum computing (which uses qubits and gates), topological quantum computing encodes information in anyons (exotic quasiparticles) and performs operations by braiding their worldlines. This provides inherent fault-tolerance through topological protection.

Quick Example: Ising Anyons (Microsoft Majorana)

open FSharp.Azure.Quantum.Topological

// Create backend for Ising anyons (Microsoft's approach)
let backend = TopologicalBackend.createSimulator AnyonSpecies.AnyonType.Ising 10

// Create entangled state via braiding
let! result = topological backend {
    // Initialize 4 sigma anyons
    do! TopologicalBuilder.initialize AnyonSpecies.AnyonType.Ising 4
    
    // Braiding creates entanglement geometrically
    do! TopologicalBuilder.braid 0  // Braid anyons 0-1
    do! TopologicalBuilder.braid 2  // Braid anyons 2-3
    
    // Measure fusion outcome
    let! (outcome, _) = TopologicalBuilder.measure 0
    return outcome
}

match result with
| Ok particle ->
    printfn "Fusion outcome: %A" particle  // Vacuum or Psi
| Error err ->
    printfn "Error: %s" err.Message

Key Concepts

Anyons:

Ising anyons: {1 (vacuum), σ (sigma), ψ (psi)} - Microsoft's Majorana approach
Fibonacci anyons: {1, τ} - Theoretical universal braiding
Fusion rule for Ising: σ × σ = 1 + ψ (creates quantum superposition)

Operations:

Braiding: Exchange anyons (replaces quantum gates)
Fusion: Measurement (collapses superposition to classical outcome)
F-moves: Change fusion tree basis (advanced)

Advantages:

Topological protection: Error rates ~10⁻¹² (vs 10⁻³ for gate-based)
Passive error correction: Immunity to local noise
Scalability: Potentially 1:1 physical-to-logical qubit ratio

Comparison: Gate-Based vs Topological

Aspect	Gate-Based QC	Topological QC
State	Qubit amplitudes	Fusion trees
Operations	H, CNOT, RZ gates	Braid, Measure
Error Correction	Active (surface codes)	Passive (topology)
Hardware	IonQ, Rigetti, IBM	Microsoft Majorana (experimental)

Examples

See examples/TopologicalSimulator/ for complete examples:

BasicFusion.fsx - Fusion rules and statistics
BellState.fsx - Creating entanglement via braiding
BackendComparison.fsx - Ising vs Fibonacci anyons

Documentation

Library README: src/FSharp.Azure.Quantum.Topological/README.md
Examples: examples/TopologicalSimulator/README.md
Format Spec: docs/topological-format-spec.md (import/export)

Contributing

Contributions welcome!

Development principles:

Maintain quantum-only architecture (no classical algorithms)
Follow F# coding conventions
Provide C# interop for new builders
Include comprehensive tests
Document QAOA encodings for new problem types

License

Unlicense - Public domain. Use freely for any purpose.

Support

Documentation: docs/
Issues: GitHub Issues
Examples: examples/

Status: Quantum-only architecture, 6 problem builders, full QAOA implementation

Name		Name	Last commit message	Last commit date
Latest commit History 502 Commits
docs		docs
examples		examples
src		src
tests		tests
.gitignore		.gitignore
FSharp.Azure.Quantum.sln		FSharp.Azure.Quantum.sln
LICENSE		LICENSE
NEXT-STEPS-LEGACY-DELETION.md		NEXT-STEPS-LEGACY-DELETION.md
README.md		README.md
fsharplint.json		fsharplint.json
verify-readme-syntax.fsx		verify-readme-syntax.fsx

License

Thorium/FSharp.Azure.Quantum

Folders and files

Latest commit

History

Repository files navigation

FSharp.Azure.Quantum

Table of Contents

Status

Quick Start

Installation

F# Computation Expressions

C# Fluent API

Problem Builders

Graph Coloring

MaxCut

Knapsack (0/1)

Traveling Salesperson Problem (TSP)

Portfolio Optimization

Network Flow

Task Scheduling

Advanced Quantum Builders

Quantum Tree Search Builder

Quantum Constraint Solver Builder

Quantum Pattern Matcher Builder

Quantum Arithmetic Builder

Quantum Period Finder Builder

Quantum Phase Estimator Builder

Advanced Builder Features

C# API for Advanced Builders

Library Scope & Focus

Quantum Machine Learning (QML)

Variational Quantum Classifier (VQC)

Quantum Kernel SVM

Business Problem Builders

Social Network Analyzer - Community Detection & Fraud Rings

Constraint Scheduler - Workforce & Resource Allocation

AutoML - Automated Machine Learning

Anomaly Detection - Security & Fraud Detection

Binary Classification - Fraud Detection

Predictive Modeling - Customer Churn Prediction

Similarity Search - Product Recommendations

HybridSolver - Automatic Classical/Quantum Routing

Supported Problems

Features

When to Use HybridSolver vs Direct Builders

Architecture

3-Layer Quantum-Only Architecture

Layer Responsibilities

Layer 1: High-Level Builders 🟢

Layer 2: Quantum Solvers 🟠

Layer 3: Quantum Backends 🔵

D-Wave Quantum Annealer

Backend Comparison

Unified Backend Architecture

Azure Quantum Workspace Management

SDK Backend - Full Azure Quantum Integration

OpenQASM 2.0 Support

Why OpenQASM?

Export Circuits to OpenQASM

Import Circuits from OpenQASM

C# API

Supported Gates

Workflow: Qiskit → F# → IonQ

Round-Trip Compatibility

Use Cases

Error Mitigation

Why Error Mitigation?

Available Techniques

1️⃣ Zero-Noise Extrapolation (ZNE)

2️⃣ Probabilistic Error Cancellation (PEC)

3️⃣ Readout Error Mitigation (REM)

4️⃣ Automatic Strategy Selection

Decision Matrix

Real-World Example: MaxCut with ZNE

Testing & Validation

Further Reading

QAOA Algorithm Internals

How Quantum Optimization Works

QAOA Configuration

Packages