quantrs2-circuit 0.1.3

Quantum circuit representation and DSL for the QuantRS2 framework
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
//! Commutation analysis for quantum gate reordering.
//!
//! This module provides functionality to analyze which quantum gates commute
//! with each other, enabling optimizations like gate reordering and parallelization.

use scirs2_core::ndarray::Array2;
use scirs2_core::Complex64;
use std::collections::{HashMap, HashSet};

use quantrs2_core::gate::GateOp;
use quantrs2_core::qubit::QubitId;

/// Type of gate for commutation analysis
#[derive(Debug, Clone, PartialEq, Eq, Hash)]
pub enum GateType {
    /// Single-qubit X rotation
    Rx(String), // parameter as string for hashing
    /// Single-qubit Y rotation
    Ry(String),
    /// Single-qubit Z rotation
    Rz(String),
    /// Hadamard gate
    H,
    /// Pauli-X gate
    X,
    /// Pauli-Y gate
    Y,
    /// Pauli-Z gate
    Z,
    /// Phase gate
    S,
    /// T gate
    T,
    /// CNOT gate
    CNOT,
    /// CZ gate
    CZ,
    /// SWAP gate
    SWAP,
    /// Toffoli gate
    Toffoli,
    /// Measurement
    Measure,
    /// Custom gate
    Custom(String),
}

/// Result of commutation check
#[derive(Debug, Clone, PartialEq)]
pub enum CommutationResult {
    /// Gates commute exactly
    Commute,
    /// Gates anti-commute (commute up to a phase)
    AntiCommute(Complex64),
    /// Gates don't commute
    NonCommute,
    /// Gates commute under certain conditions
    ConditionalCommute(String),
}

/// Commutation rules database
pub struct CommutationRules {
    /// Cached commutation results
    cache: HashMap<(GateType, GateType), CommutationResult>,
    /// Custom commutation rules
    custom_rules: HashMap<(String, String), CommutationResult>,
}

impl CommutationRules {
    /// Create a new commutation rules database with standard rules
    #[must_use]
    pub fn new() -> Self {
        let mut rules = Self {
            cache: HashMap::new(),
            custom_rules: HashMap::new(),
        };
        rules.initialize_standard_rules();
        rules
    }

    /// Initialize standard commutation rules
    fn initialize_standard_rules(&mut self) {
        use CommutationResult::{Commute, ConditionalCommute, NonCommute};
        use GateType::{Measure, Rz, CNOT, CZ, H, S, T, X, Y, Z};

        // Pauli commutation rules
        self.add_rule(X, X, Commute);
        self.add_rule(Y, Y, Commute);
        self.add_rule(Z, Z, Commute);
        self.add_rule(X, Y, NonCommute);
        self.add_rule(X, Z, NonCommute);
        self.add_rule(Y, Z, NonCommute);

        // Hadamard commutation
        self.add_rule(H, H, Commute);
        self.add_rule(H, X, NonCommute);
        self.add_rule(H, Y, NonCommute);
        self.add_rule(H, Z, NonCommute);

        // Phase gates
        self.add_rule(S, S, Commute);
        self.add_rule(T, T, Commute);
        self.add_rule(S, T, Commute);
        self.add_rule(S, Z, Commute);
        self.add_rule(T, Z, Commute);

        // Z-basis rotations commute
        self.add_rule(Z, Rz("any".to_string()), Commute);
        self.add_rule(S, Rz("any".to_string()), Commute);
        self.add_rule(T, Rz("any".to_string()), Commute);
        self.add_rule(Rz("any1".to_string()), Rz("any2".to_string()), Commute);

        // CNOT commutation rules
        self.add_rule(
            CNOT,
            CNOT,
            ConditionalCommute("Same control and target".to_string()),
        );
        self.add_rule(CZ, CZ, ConditionalCommute("Same qubits".to_string()));

        // Measurements don't commute with most gates
        self.add_rule(Measure, X, NonCommute);
        self.add_rule(Measure, Y, NonCommute);
        self.add_rule(Measure, H, NonCommute);
        self.add_rule(Measure, Z, Commute); // Z-basis measurement commutes with Z
    }

    /// Add a commutation rule
    pub fn add_rule(&mut self, gate1: GateType, gate2: GateType, result: CommutationResult) {
        self.cache
            .insert((gate1.clone(), gate2.clone()), result.clone());
        // Commutation is symmetric for most cases
        if matches!(
            result,
            CommutationResult::Commute | CommutationResult::NonCommute
        ) {
            self.cache.insert((gate2, gate1), result);
        }
    }

    /// Add a custom commutation rule
    pub fn add_custom_rule(&mut self, gate1: String, gate2: String, result: CommutationResult) {
        self.custom_rules
            .insert((gate1.clone(), gate2.clone()), result.clone());
        if matches!(
            result,
            CommutationResult::Commute | CommutationResult::NonCommute
        ) {
            self.custom_rules.insert((gate2, gate1), result);
        }
    }

    /// Check if two gate types commute
    #[must_use]
    pub fn check_commutation(&self, gate1: &GateType, gate2: &GateType) -> CommutationResult {
        // Check cache first
        if let Some(result) = self.cache.get(&(gate1.clone(), gate2.clone())) {
            return result.clone();
        }

        // Check custom rules
        if let (GateType::Custom(name1), GateType::Custom(name2)) = (gate1, gate2) {
            if let Some(result) = self.custom_rules.get(&(name1.clone(), name2.clone())) {
                return result.clone();
            }
        }

        // Default: assume non-commuting
        CommutationResult::NonCommute
    }
}

impl Default for CommutationRules {
    fn default() -> Self {
        Self::new()
    }
}

/// Analyzer for gate commutation in circuits
pub struct CommutationAnalyzer {
    rules: CommutationRules,
}

impl CommutationAnalyzer {
    /// Create a new commutation analyzer
    #[must_use]
    pub fn new() -> Self {
        Self {
            rules: CommutationRules::new(),
        }
    }

    /// Create with custom rules
    #[must_use]
    pub const fn with_rules(rules: CommutationRules) -> Self {
        Self { rules }
    }

    /// Convert a gate operation to a gate type
    pub fn gate_to_type(gate: &dyn GateOp) -> GateType {
        match gate.name() {
            "H" => GateType::H,
            "X" => GateType::X,
            "Y" => GateType::Y,
            "Z" => GateType::Z,
            "S" => GateType::S,
            "T" => GateType::T,
            "RX" => GateType::Rx("generic".to_string()),
            "RY" => GateType::Ry("generic".to_string()),
            "RZ" => GateType::Rz("generic".to_string()),
            "CNOT" => GateType::CNOT,
            "CZ" => GateType::CZ,
            "SWAP" => GateType::SWAP,
            "Toffoli" => GateType::Toffoli,
            "Measure" => GateType::Measure,
            name => GateType::Custom(name.to_string()),
        }
    }

    /// Check if two gates commute considering their qubit assignments
    pub fn gates_commute(&self, gate1: &dyn GateOp, gate2: &dyn GateOp) -> bool {
        let qubits1: HashSet<_> = gate1
            .qubits()
            .iter()
            .map(quantrs2_core::QubitId::id)
            .collect();
        let qubits2: HashSet<_> = gate2
            .qubits()
            .iter()
            .map(quantrs2_core::QubitId::id)
            .collect();

        // Gates on disjoint qubits always commute
        if qubits1.is_disjoint(&qubits2) {
            return true;
        }

        // Check gate types
        let type1 = Self::gate_to_type(gate1);
        let type2 = Self::gate_to_type(gate2);

        match self.rules.check_commutation(&type1, &type2) {
            CommutationResult::Commute | CommutationResult::AntiCommute(_) => true, // Commute (with or without phase)
            CommutationResult::NonCommute => false,
            CommutationResult::ConditionalCommute(condition) => {
                // Check specific conditions
                self.check_conditional_commutation(gate1, gate2, &condition)
            }
        }
    }

    /// Check conditional commutation
    fn check_conditional_commutation(
        &self,
        gate1: &dyn GateOp,
        gate2: &dyn GateOp,
        condition: &str,
    ) -> bool {
        match condition {
            "Same control and target" => {
                // For CNOT gates
                if gate1.name() == "CNOT" && gate2.name() == "CNOT" {
                    let qubits1 = gate1.qubits();
                    let qubits2 = gate2.qubits();
                    return qubits1[0] == qubits2[0] && qubits1[1] == qubits2[1];
                }
                false
            }
            "Same qubits" => {
                // Check if gates operate on exactly the same qubits
                let qubits1: HashSet<_> = gate1
                    .qubits()
                    .iter()
                    .map(quantrs2_core::QubitId::id)
                    .collect();
                let qubits2: HashSet<_> = gate2
                    .qubits()
                    .iter()
                    .map(quantrs2_core::QubitId::id)
                    .collect();
                qubits1 == qubits2
            }
            _ => false,
        }
    }

    /// Find all gates that commute with a given gate in a list
    pub fn find_commuting_gates(
        &self,
        target_gate: &dyn GateOp,
        gates: &[Box<dyn GateOp>],
    ) -> Vec<usize> {
        gates
            .iter()
            .enumerate()
            .filter(|(_, gate)| self.gates_commute(target_gate, gate.as_ref()))
            .map(|(idx, _)| idx)
            .collect()
    }

    /// Build a commutation matrix for a list of gates
    #[must_use]
    pub fn build_commutation_matrix(&self, gates: &[Box<dyn GateOp>]) -> Array2<bool> {
        let n = gates.len();
        let mut matrix = Array2::from_elem((n, n), false);

        for i in 0..n {
            for j in 0..n {
                if i == j {
                    matrix[[i, j]] = true; // Gate commutes with itself
                } else {
                    matrix[[i, j]] = self.gates_commute(gates[i].as_ref(), gates[j].as_ref());
                }
            }
        }

        matrix
    }

    /// Find independent gate sets that can be executed in parallel
    #[must_use]
    pub fn find_parallel_sets(&self, gates: &[Box<dyn GateOp>]) -> Vec<Vec<usize>> {
        let n = gates.len();
        let mut remaining: HashSet<usize> = (0..n).collect();
        let mut parallel_sets = Vec::new();

        while !remaining.is_empty() {
            let mut current_set = Vec::new();
            let mut current_qubits = HashSet::new();

            let mut indices_to_check: Vec<usize> = remaining.iter().copied().collect();
            indices_to_check.sort_unstable(); // Process in order for deterministic results

            for idx in indices_to_check {
                let gate_qubits: HashSet<_> = gates[idx]
                    .qubits()
                    .iter()
                    .map(quantrs2_core::QubitId::id)
                    .collect();

                // Check if this gate can be added to current set
                let can_add = if current_set.is_empty() {
                    true
                } else if !current_qubits.is_disjoint(&gate_qubits) {
                    false
                } else {
                    // Check commutation with all gates in current set
                    current_set.iter().all(|&other_idx| {
                        let gate1: &Box<dyn GateOp> = &gates[idx];
                        let gate2: &Box<dyn GateOp> = &gates[other_idx];
                        self.gates_commute(gate1.as_ref(), gate2.as_ref())
                    })
                };

                if can_add {
                    current_set.push(idx);
                    current_qubits.extend(gate_qubits);
                    remaining.remove(&idx);
                }
            }

            if !current_set.is_empty() {
                parallel_sets.push(current_set);
            }
        }

        parallel_sets
    }
}

impl Default for CommutationAnalyzer {
    fn default() -> Self {
        Self::new()
    }
}

/// Extension methods for circuit optimization using commutation
pub trait CommutationOptimization {
    /// Reorder gates to maximize parallelism
    fn optimize_gate_order(&mut self, analyzer: &CommutationAnalyzer);

    /// Group commuting gates together
    fn group_commuting_gates(&mut self, analyzer: &CommutationAnalyzer);
}

#[cfg(test)]
mod tests {
    use super::*;
    use quantrs2_core::gate::multi::CNOT;
    use quantrs2_core::gate::single::{Hadamard, PauliX, PauliZ};

    #[test]
    fn test_basic_commutation() {
        let analyzer = CommutationAnalyzer::new();

        // Test Pauli commutation
        let x1 = PauliX { target: QubitId(0) };
        let x2 = PauliX { target: QubitId(0) };
        let z = PauliZ { target: QubitId(0) };

        assert!(analyzer.gates_commute(&x1, &x2)); // X commutes with X
        assert!(!analyzer.gates_commute(&x1, &z)); // X doesn't commute with Z
    }

    #[test]
    fn test_disjoint_qubits() {
        let analyzer = CommutationAnalyzer::new();

        // Gates on different qubits always commute
        let h0 = Hadamard { target: QubitId(0) };
        let h1 = Hadamard { target: QubitId(1) };

        assert!(analyzer.gates_commute(&h0, &h1));
    }

    #[test]
    fn test_cnot_commutation() {
        let analyzer = CommutationAnalyzer::new();

        // Same CNOT gates commute
        let cnot1 = CNOT {
            control: QubitId(0),
            target: QubitId(1),
        };
        let cnot2 = CNOT {
            control: QubitId(0),
            target: QubitId(1),
        };
        assert!(analyzer.gates_commute(&cnot1, &cnot2));

        // Different CNOT gates may not commute
        let cnot3 = CNOT {
            control: QubitId(1),
            target: QubitId(0),
        };
        assert!(!analyzer.gates_commute(&cnot1, &cnot3));
    }

    #[test]
    fn test_commutation_matrix() {
        let analyzer = CommutationAnalyzer::new();

        let gates: Vec<Box<dyn GateOp>> = vec![
            Box::new(Hadamard { target: QubitId(0) }),
            Box::new(Hadamard { target: QubitId(1) }),
            Box::new(PauliX { target: QubitId(0) }),
        ];

        let matrix = analyzer.build_commutation_matrix(&gates);

        // Check expected commutations
        assert!(matrix[[0, 0]]); // H0 with itself
        assert!(matrix[[0, 1]]); // H0 with H1 (different qubits)
        assert!(!matrix[[0, 2]]); // H0 with X0 (don't commute)
    }

    #[test]
    fn test_parallel_sets() {
        let analyzer = CommutationAnalyzer::new();

        let gates: Vec<Box<dyn GateOp>> = vec![
            Box::new(Hadamard { target: QubitId(0) }),
            Box::new(Hadamard { target: QubitId(1) }),
            Box::new(Hadamard { target: QubitId(2) }),
            Box::new(CNOT {
                control: QubitId(0),
                target: QubitId(1),
            }),
        ];

        let parallel_sets = analyzer.find_parallel_sets(&gates);

        // First three H gates can be parallel
        assert_eq!(parallel_sets.len(), 2);
        assert_eq!(parallel_sets[0].len(), 3); // All H gates
        assert_eq!(parallel_sets[1].len(), 1); // CNOT alone
    }
}