quantrs2-ml 0.1.3

Quantum Machine Learning module for QuantRS2
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
//! Quantum Convolutional Neural Networks (QCNN)
//!
//! This module implements quantum convolutional neural networks for
//! quantum data processing and feature extraction.

use crate::error::MLError;
use quantrs2_circuit::prelude::*;
use scirs2_core::Complex64 as Complex;
use std::f64::consts::PI;

// Simple matrix types for QCNN
type DMatrix = Vec<Vec<f64>>;
type DVector<T> = Vec<T>;

/// Quantum convolutional filter
#[derive(Debug, Clone)]
pub struct QuantumConvFilter {
    /// Number of qubits in the filter
    pub num_qubits: usize,
    /// Stride of the convolution
    pub stride: usize,
    /// Variational parameters
    pub params: Vec<f64>,
}

impl QuantumConvFilter {
    /// Create a new quantum convolutional filter
    pub fn new(num_qubits: usize, stride: usize) -> Self {
        // Parameters for rotation gates
        let num_params = num_qubits * 3; // RX, RY, RZ per qubit
        let params = vec![0.1; num_params];

        Self {
            num_qubits,
            stride,
            params,
        }
    }

    /// Apply the filter to a subset of qubits
    pub fn apply_filter<const N: usize>(
        &self,
        circuit: &mut Circuit<N>,
        start_qubit: usize,
    ) -> Result<(), MLError> {
        let end_qubit = (start_qubit + self.num_qubits).min(N);

        // Apply parameterized rotations
        let mut param_idx = 0;
        for i in start_qubit..end_qubit {
            if param_idx < self.params.len() {
                circuit.rx(i, self.params[param_idx])?;
                param_idx += 1;
            }
            if param_idx < self.params.len() {
                circuit.ry(i, self.params[param_idx])?;
                param_idx += 1;
            }
            if param_idx < self.params.len() {
                circuit.rz(i, self.params[param_idx])?;
                param_idx += 1;
            }
        }

        // Apply entangling gates
        for i in start_qubit..(end_qubit - 1) {
            circuit.cnot(i, i + 1)?;
        }

        Ok(())
    }
}

/// Quantum pooling layer
#[derive(Debug, Clone)]
pub struct QuantumPooling {
    /// Pooling size (number of qubits to pool)
    pub pool_size: usize,
    /// Pooling type
    pub pool_type: PoolingType,
}

#[derive(Debug, Clone, Copy)]
pub enum PoolingType {
    /// Trace out qubits (dimensionality reduction)
    TraceOut,
    /// Measure and reset qubits
    MeasureReset,
    /// Quantum pooling
    Quantum,
}

impl QuantumPooling {
    /// Create a new quantum pooling layer
    pub fn new(pool_size: usize, pool_type: PoolingType) -> Self {
        Self {
            pool_size,
            pool_type,
        }
    }

    /// Apply pooling to reduce the number of active qubits
    pub fn apply_pooling<const N: usize>(
        &self,
        circuit: &mut Circuit<N>,
        active_qubits: &mut Vec<usize>,
    ) -> Result<(), MLError> {
        match self.pool_type {
            PoolingType::TraceOut => {
                // Simply remove qubits from active set
                let new_size = active_qubits.len() / self.pool_size;
                active_qubits.truncate(new_size);
            }
            PoolingType::MeasureReset => {
                // Measure and reset every nth qubit
                let mut new_active = Vec::new();
                for (i, &qubit) in active_qubits.iter().enumerate() {
                    if i % self.pool_size == 0 {
                        new_active.push(qubit);
                    } else {
                        // In a real implementation, we'd measure and reset
                        // For now, we just exclude from active set
                    }
                }
                *active_qubits = new_active;
            }
            PoolingType::Quantum => {
                // Quantum pooling using unitary operations
                let pool_size = self.pool_size;
                let new_size = active_qubits.len() / pool_size;

                // Apply quantum pooling gates (simplified)
                for i in 0..new_size {
                    let start_idx = i * pool_size;
                    let end_idx = (start_idx + pool_size).min(active_qubits.len());

                    if end_idx > start_idx + 1 {
                        // Apply entangling gates between qubits in pool
                        for j in start_idx..end_idx - 1 {
                            circuit.cnot(active_qubits[j], active_qubits[j + 1]);
                        }
                    }
                }

                // Keep only the first qubit from each pool
                active_qubits.truncate(new_size);
            }
        }
        Ok(())
    }
}

/// Quantum Convolutional Neural Network
pub struct QCNN {
    /// Number of qubits
    pub num_qubits: usize,
    /// Convolutional layers
    pub conv_layers: Vec<(QuantumConvFilter, QuantumPooling)>,
    /// Final fully connected layer parameters
    pub fc_params: Vec<f64>,
}

impl QCNN {
    /// Create a new QCNN
    pub fn new(
        num_qubits: usize,
        conv_filters: Vec<(usize, usize)>, // (filter_size, stride)
        pool_sizes: Vec<usize>,
        fc_params: usize,
    ) -> Result<Self, MLError> {
        if conv_filters.len() != pool_sizes.len() {
            return Err(MLError::ModelCreationError(
                "Number of conv filters must match number of pooling layers".to_string(),
            ));
        }

        let mut conv_layers = Vec::new();
        for ((filter_size, stride), pool_size) in conv_filters.into_iter().zip(pool_sizes) {
            let filter = QuantumConvFilter::new(filter_size, stride);
            let pooling = QuantumPooling::new(pool_size, PoolingType::TraceOut);
            conv_layers.push((filter, pooling));
        }

        let fc_params = vec![0.1; fc_params];

        Ok(Self {
            num_qubits,
            conv_layers,
            fc_params,
        })
    }

    /// Forward pass through the QCNN
    pub fn forward(&self, input_state: &DVector<Complex>) -> Result<DVector<Complex>, MLError> {
        // For simulation, we'll use a fixed circuit size
        const MAX_QUBITS: usize = 20;

        if self.num_qubits > MAX_QUBITS {
            return Err(MLError::InvalidParameter(format!(
                "QCNN supports up to {} qubits",
                MAX_QUBITS
            )));
        }

        let mut circuit = Circuit::<MAX_QUBITS>::new();
        let mut active_qubits: Vec<usize> = (0..self.num_qubits).collect();

        // Initialize with input state (simplified)
        // In practice, we'd use amplitude encoding

        // Apply convolutional and pooling layers
        for (conv_filter, pooling) in &self.conv_layers {
            // Apply convolution with sliding window
            let mut pos = 0;
            while pos + conv_filter.num_qubits <= active_qubits.len() {
                let start_qubit = active_qubits[pos];
                conv_filter.apply_filter(&mut circuit, start_qubit)?;
                pos += conv_filter.stride;
            }

            // Apply pooling
            pooling.apply_pooling(&mut circuit, &mut active_qubits)?;
        }

        // Apply fully connected layer to remaining active qubits
        for (i, &qubit) in active_qubits.iter().enumerate() {
            if i < self.fc_params.len() {
                circuit.ry(qubit, self.fc_params[i])?;
            }
        }

        // For now, return a dummy output state
        // In a real implementation, we would simulate the circuit
        let output_size = 1 << active_qubits.len();
        let mut output = vec![Complex::new(0.0, 0.0); output_size];

        // Simple normalization
        let norm = 1.0 / (output_size as f64).sqrt();
        for i in 0..output_size {
            output[i] = Complex::new(norm, 0.0);
        }

        Ok(output)
    }

    /// Get all trainable parameters
    pub fn get_parameters(&self) -> Vec<f64> {
        let mut params = Vec::new();

        for (conv_filter, _) in &self.conv_layers {
            params.extend(&conv_filter.params);
        }
        params.extend(&self.fc_params);

        params
    }

    /// Set parameters from a flat vector
    pub fn set_parameters(&mut self, params: &[f64]) -> Result<(), MLError> {
        let mut idx = 0;

        for (conv_filter, _) in &mut self.conv_layers {
            let filter_params = conv_filter.params.len();
            if idx + filter_params > params.len() {
                return Err(MLError::InvalidParameter(
                    "Not enough parameters provided".to_string(),
                ));
            }
            conv_filter
                .params
                .copy_from_slice(&params[idx..idx + filter_params]);
            idx += filter_params;
        }

        let fc_params_len = self.fc_params.len();
        if idx + fc_params_len > params.len() {
            return Err(MLError::InvalidParameter(
                "Not enough parameters for FC layer".to_string(),
            ));
        }
        self.fc_params
            .copy_from_slice(&params[idx..idx + fc_params_len]);

        Ok(())
    }

    /// Compute gradients using parameter shift rule
    pub fn compute_gradients(
        &mut self,
        input_state: &DVector<Complex>,
        target: &DVector<Complex>,
        loss_fn: impl Fn(&DVector<Complex>, &DVector<Complex>) -> f64,
    ) -> Result<Vec<f64>, MLError> {
        let params = self.get_parameters();
        let mut gradients = vec![0.0; params.len()];
        let shift = PI / 2.0;

        for i in 0..params.len() {
            // Positive shift
            let mut params_plus = params.clone();
            params_plus[i] += shift;
            self.set_parameters(&params_plus)?;
            let output_plus = self.forward(input_state)?;
            let loss_plus = loss_fn(&output_plus, target);

            // Negative shift
            let mut params_minus = params.clone();
            params_minus[i] -= shift;
            self.set_parameters(&params_minus)?;
            let output_minus = self.forward(input_state)?;
            let loss_minus = loss_fn(&output_minus, target);

            // Parameter shift gradient
            gradients[i] = (loss_plus - loss_minus) / (2.0 * shift);
        }

        // Restore original parameters
        self.set_parameters(&params)?;

        Ok(gradients)
    }
}

/// Quantum image encoding for QCNN
pub struct QuantumImageEncoder {
    /// Image dimensions
    pub width: usize,
    pub height: usize,
    /// Number of qubits for encoding
    pub num_qubits: usize,
}

impl QuantumImageEncoder {
    /// Create a new quantum image encoder
    pub fn new(width: usize, height: usize, num_qubits: usize) -> Self {
        Self {
            width,
            height,
            num_qubits,
        }
    }

    /// Encode a classical image into quantum state
    pub fn encode(&self, image: &DMatrix) -> Result<DVector<Complex>, MLError> {
        if image.len() != self.height || image[0].len() != self.width {
            return Err(MLError::InvalidParameter(
                "Image dimensions don't match encoder settings".to_string(),
            ));
        }

        // Flatten and normalize image
        let pixels: Vec<f64> = image.iter().flat_map(|row| row.iter()).copied().collect();
        let norm = pixels.iter().map(|x| x * x).sum::<f64>().sqrt();

        // Create quantum state with amplitude encoding
        let state_size = 1 << self.num_qubits;
        let mut state = vec![Complex::new(0.0, 0.0); state_size];

        for (i, &pixel) in pixels.iter().enumerate() {
            if i < state_size {
                state[i] = Complex::new(pixel / norm, 0.0);
            }
        }

        Ok(state)
    }

    /// Decode quantum state back to classical image representation
    pub fn decode(&self, state: &DVector<Complex>) -> DMatrix {
        let mut image = vec![vec![0.0; self.width]; self.height];
        let mut idx = 0;

        for i in 0..self.height {
            for j in 0..self.width {
                if idx < state.len() {
                    image[i][j] = state[idx].norm();
                    idx += 1;
                }
            }
        }

        image
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_qcnn_creation() {
        let qcnn = QCNN::new(
            8,                    // 8 qubits
            vec![(4, 2), (2, 1)], // Two conv layers
            vec![2, 2],           // Two pooling layers
            4,                    // FC layer params
        )
        .expect("Failed to create QCNN with valid configuration");

        assert_eq!(qcnn.num_qubits, 8);
        assert_eq!(qcnn.conv_layers.len(), 2);
    }

    #[test]
    fn test_quantum_filter() {
        let filter = QuantumConvFilter::new(3, 1);
        assert_eq!(filter.num_qubits, 3);
        assert_eq!(filter.params.len(), 9); // 3 qubits * 3 gates
    }

    #[test]
    fn test_filter_application() {
        let filter = QuantumConvFilter::new(3, 1);
        let mut circuit = Circuit::<8>::new();

        // Apply filter starting at qubit 0
        filter
            .apply_filter(&mut circuit, 0)
            .expect("Failed to apply quantum filter to circuit");

        // Should have applied gates
        assert!(circuit.num_gates() > 0);
    }

    #[test]
    fn test_pooling_trace_out() {
        let pooling = QuantumPooling::new(2, PoolingType::TraceOut);
        let mut circuit = Circuit::<8>::new();
        let mut active_qubits = vec![0, 1, 2, 3, 4, 5, 6, 7];

        pooling
            .apply_pooling(&mut circuit, &mut active_qubits)
            .expect("Failed to apply trace-out pooling");

        // Should reduce active qubits by pool_size
        assert_eq!(active_qubits.len(), 4);
    }

    #[test]
    fn test_pooling_measure_reset() {
        let pooling = QuantumPooling::new(2, PoolingType::MeasureReset);
        let mut circuit = Circuit::<8>::new();
        let mut active_qubits = vec![0, 1, 2, 3, 4, 5, 6, 7];

        pooling
            .apply_pooling(&mut circuit, &mut active_qubits)
            .expect("Failed to apply measure-reset pooling");

        // Should keep every 2nd qubit
        assert_eq!(active_qubits.len(), 4);
        assert_eq!(active_qubits, vec![0, 2, 4, 6]);
    }

    #[test]
    fn test_image_encoding() {
        let encoder = QuantumImageEncoder::new(2, 2, 2);
        let image = vec![vec![0.5, 0.5], vec![0.5, 0.5]];

        let encoded = encoder.encode(&image).expect("Failed to encode image");
        assert_eq!(encoded.len(), 4); // 2^2 = 4

        // Check normalization
        let norm: f64 = encoded.iter().map(|c| c.norm_sqr()).sum();
        assert!((norm - 1.0).abs() < 1e-10);
    }

    #[test]
    fn test_image_decode() {
        let encoder = QuantumImageEncoder::new(2, 2, 2);
        let state = vec![
            Complex::new(0.5, 0.0),
            Complex::new(0.5, 0.0),
            Complex::new(0.5, 0.0),
            Complex::new(0.5, 0.0),
        ];

        let decoded = encoder.decode(&state);
        assert_eq!(decoded.len(), 2);
        assert_eq!(decoded[0].len(), 2);
    }

    #[test]
    fn test_qcnn_forward() {
        let qcnn = QCNN::new(
            4,            // 4 qubits
            vec![(2, 1)], // One conv layer
            vec![2],      // One pooling layer
            2,            // FC layer params
        )
        .expect("Failed to create QCNN");

        let input_state = vec![Complex::new(1.0, 0.0); 16]; // 2^4 = 16
        let output = qcnn.forward(&input_state).expect("Failed to forward pass");

        // Output should be for reduced qubits after pooling
        assert!(!output.is_empty());
    }

    #[test]
    fn test_parameter_management() {
        let mut qcnn = QCNN::new(
            4,            // 4 qubits
            vec![(2, 1)], // One conv layer
            vec![2],      // One pooling layer
            2,            // FC layer params
        )
        .expect("Failed to create QCNN");

        let params = qcnn.get_parameters();
        let num_params = params.len();

        // Modify parameters
        let new_params: Vec<f64> = (0..num_params).map(|i| i as f64 * 0.1).collect();
        qcnn.set_parameters(&new_params)
            .expect("Failed to set parameters");

        let retrieved_params = qcnn.get_parameters();
        assert_eq!(retrieved_params, new_params);
    }

    #[test]
    fn test_gradient_computation() {
        let mut qcnn = QCNN::new(
            4,            // 4 qubits
            vec![(2, 1)], // One conv layer
            vec![2],      // One pooling layer
            2,            // FC layer params
        )
        .expect("Failed to create QCNN");

        let input_state = vec![Complex::new(0.5, 0.0); 16];
        let target_state = vec![Complex::new(0.707, 0.0); 2];

        // Simple MSE loss
        let loss_fn = |output: &DVector<Complex>, target: &DVector<Complex>| -> f64 {
            output
                .iter()
                .zip(target.iter())
                .map(|(o, t)| (o - t).norm_sqr())
                .sum::<f64>()
        };

        let gradients = qcnn
            .compute_gradients(&input_state, &target_state, loss_fn)
            .expect("Failed to compute gradients");

        // Should have gradients for all parameters
        assert_eq!(gradients.len(), qcnn.get_parameters().len());
    }

    #[test]
    fn test_invalid_layer_configuration() {
        // Mismatched conv and pool layers
        let result = QCNN::new(
            8,
            vec![(4, 2), (2, 1)], // Two conv layers
            vec![2],              // Only one pooling layer
            4,
        );

        assert!(result.is_err());
    }

    #[test]
    fn test_stride_behavior() {
        let filter = QuantumConvFilter::new(2, 2); // Filter size 2, stride 2
        assert_eq!(filter.stride, 2);

        let mut circuit = Circuit::<8>::new();

        // Apply with stride - should skip positions
        filter
            .apply_filter(&mut circuit, 0)
            .expect("Failed to apply filter at position 0");
        filter
            .apply_filter(&mut circuit, 2)
            .expect("Failed to apply filter at position 2"); // Next position based on stride
    }

    #[test]
    fn test_large_image_encoding() {
        let encoder = QuantumImageEncoder::new(4, 4, 4); // 4x4 image, 4 qubits
        let image = vec![vec![0.25; 4]; 4];

        let encoded = encoder.encode(&image).expect("Failed to encode 4x4 image");
        assert_eq!(encoded.len(), 16); // 2^4 = 16

        // Verify partial encoding (16 pixels into 16 amplitudes)
        let decoded = encoder.decode(&encoded);
        assert_eq!(decoded.len(), 4);
        assert_eq!(decoded[0].len(), 4);
    }
}