nn-quantum-state-encoding

star 2

Neural network encoding methodology for quantum state preparation: trains classical neural network to map input data directly to quantum circuit parameters, avoiding per-instance variational optimization. Achieves 0.992 fidelity on unseen data with 5000x runtime reduction. Use when designing QML data loading pipelines, quantum state preparation, neural-encoded quantum circuits, or amplitude encoding optimization.

hiyenwong By hiyenwong schedule Updated 6/3/2026

name: nn-quantum-state-encoding description: "Neural network encoding methodology for quantum state preparation: trains classical neural network to map input data directly to quantum circuit parameters, avoiding per-instance variational optimization. Achieves 0.992 fidelity on unseen data with 5000x runtime reduction. Use when designing QML data loading pipelines, quantum state preparation, neural-encoded quantum circuits, or amplitude encoding optimization." tags: ["quantum-machine-learning", "state-preparation", "neural-encoding", "data-loading"] related_skills: ["quantum-ml-data-loading", "qml-framework-agnostic-design", "quantum-neural-architecture"] arxiv_ids: ["2605.31006"]

Neural Network Encoding for Quantum State Preparation

Based on arXiv:2605.31006 "Quantum State Preparation via Neural Network Encoding in Quantum Machine Learning" (Aoun et al., May 2026).

Core Problem: State Preparation Bottleneck

Quantum machine learning faces a critical bottleneck: loading N-dimensional classical data into quantum states requires variational optimization of parameterized quantum circuits (PQCs) for each individual data instance. Amplitude encoding can represent 2^n data with n qubits in theory, but arbitrary state preparation remains exponentially expensive in practice.

Methodology: NN-to-Circuit Parameter Mapping

Key Innovation

Instead of iterative optimization per data point, train a classical neural network once to learn the mapping:

input_data → NN → [θ₁, θ₂, ..., θₖ] → fixed quantum circuit → |ψ⟩

Architecture Components

  1. Classical Encoder Network: Maps input data (e.g., images) to continuous rotation angles

    • Input: flattened classical data (e.g., 28×28 MNIST image = 784 dimensions)
    • Output: circuit parameters [θ₁, θ₂, ..., θₖ] for a fixed ansatz structure
  2. Fixed Quantum Circuit Ansatz: Same circuit topology for all data instances

    • Parameterized rotation gates (Rx, Ry, Rz) receive NN-predicted angles
    • Entangling layers (CNOT, CZ) create multi-qubit correlations
    • No variational optimization needed at inference time
  3. Training Objective: Maximize state fidelity between target |ψ_target⟩ and circuit output |ψ(θ_NN(x))⟩

    • Loss: L = 1 - |⟨ψ_target|ψ(θ_NN(x))⟩|²
    • Train on labeled (input, target_state) pairs
    • Generalizes to unseen data after training

Performance Results

  • Fidelity: up to 0.992 on unseen MNIST/Fashion-MNIST images
  • Speedup: 5000x+ reduction in per-data-instance encoding runtime
  • Generalization: Works on data not seen during training (not memorization)

Reusable Patterns

Pattern 1: Train-Once-Infer-Many Encoding

Training Phase (offline):
  For each (x, |ψ_target⟩) in dataset:
    1. Compute θ* = argmin_θ (1 - F(|ψ(θ)⟩, |ψ_target⟩))
    2. Train NN: x → θ*
  
Inference Phase (online):
  For new x:
    1. θ = NN(x)  # single forward pass
    2. Apply gates with angles θ  # O(1) circuit depth

Pattern 2: Ansatz Design Principles

  • Expressive but fixed: Choose ansatz with enough parameters to represent target state manifold
  • Hardware-efficient: Match gate set to available quantum hardware
  • Parameter continuity: Ensure smooth mapping between similar inputs and circuit parameters

Pattern 3: Fidelity-Driven Loss Design

  • Use quantum state fidelity as loss metric (not Euclidean distance on parameters)
  • Fidelity is invariant under global phase, respects quantum geometry
  • Gradient computation via parameter-shift rule on quantum simulator

Applications

  1. Quantum Image Processing: Encode images into quantum states for quantum computer vision
  2. QML Data Loading: Generic pattern for loading any classical dataset into quantum form
  3. NISQ Algorithms: Any near-term quantum algorithm requiring classical data input
  4. Quantum Feature Maps: Neural networks can learn optimal feature map parameters

Comparison with Existing Methods

Method Per-Instance Cost Generalization Fidelity
Variational (VQC) O(iterations) each N/A High
Amplitude Encoding O(N) N/A Exact
NN Encoding (this work) O(1) inference Yes (unseen data) 0.992
Taylor Series O(polylog N) N/A Approximate

Pitfalls

  1. Ansatz Expressivity: Fixed ansatz must be expressive enough to cover target state manifold; insufficient expressivity caps achievable fidelity
  2. Training Data Quality: NN quality depends on quality of training pairs; poor variational optimization during training phase propagates errors
  3. Hardware Noise: Real quantum hardware noise degrades achieved fidelity vs. simulation results
  4. Scalability: Current validation on small datasets (MNIST); high-dimensional data may require deeper NNs or more sophisticated ansätze

Activation

neural network quantum state preparation, QML data loading, quantum circuit encoding, amplitude encoding optimization, variational quantum circuit training, quantum image states, quantum machine learning bottleneck

Install via CLI
npx skills add https://github.com/hiyenwong/ai_collection --skill nn-quantum-state-encoding
Repository Details
star Stars 2
call_split Forks 0
navigation Branch main
article Path SKILL.md
Occupations
More from Creator