Draft: Integrate PSGS for Pauli Polynomial synthesis #34

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open

keefehuang wants to merge 29 commits into main from psgs

src/ir/clifford_tableau/helper.rs

Large diffs are not rendered by default.

src/ir/clifford_tableau/permrowcol.rs

-Original file line number
+Diff line change
@@ -0,0 +1,150 @@
+    use std::fmt::Debug;
+    use crate::{
+        architecture::connectivity::Connectivity,
+        data_structures::{CliffordTableau, PauliLetter},
+        ir::{
+            clifford_tableau::helper::{clean_pivot, clean_prc, pick_column, pick_row},
+            AdjointSynthesizer, CliffordGates,
+        },
+    };
+    use super::helper::clean_signs;
+    // #[derive(Default)]
+    pub struct PermRowColCliffordSynthesizer {
+        connectivity: Connectivity,
+        permutation: Vec<usize>,
+        row_strategy: fn(&CliffordTableau, &Connectivity, &[usize]) -> usize,
+        column_strategy: fn(&CliffordTableau, &Connectivity) -> usize,
+    }
+    impl Default for PermRowColCliffordSynthesizer {
+        fn default() -> Self {
+            PermRowColCliffordSynthesizer {
+                connectivity: Connectivity::default(),
+                permutation: Vec::<usize>::default(),
+                row_strategy: pick_row,
+                column_strategy: pick_column,
+            }
+        }
+    }
+    impl PermRowColCliffordSynthesizer {
+        pub fn new(connectivity: Connectivity) -> Self {
+            let size = connectivity.node_count();
+            Self {
+                connectivity,
+                permutation: (0..size).collect(),
+                row_strategy: pick_row,
+                column_strategy: pick_column,
+            }
+        }
+        pub fn permutation(&self) -> &[usize] {
+            &self.permutation
+        }
+        pub fn set_row_strategy(
+            &mut self,
+            row_strategy: fn(&CliffordTableau, &Connectivity, &[usize]) -> usize,
+        ) {
+            (self.row_strategy) = row_strategy;
+        }
+        pub fn set_column_strategy(
+            &mut self,
+            column_strategy: fn(&CliffordTableau, &Connectivity) -> usize,
+        ) {
+            (self.column_strategy) = column_strategy;
+        }
+    }
+    impl<G> AdjointSynthesizer<CliffordTableau, G> for PermRowColCliffordSynthesizer
+    where
+        G: CliffordGates,
+    {
+        fn synthesize_adjoint(&mut self, mut clifford_tableau: CliffordTableau, repr: &mut G) {
+            let num_qubits = clifford_tableau.size();
+            let machine_size = self.connectivity.node_count();
+            assert!(
+                num_qubits <= machine_size,
+                "Number of qubits {} exceeds machine size {}",
+                num_qubits,
+                machine_size
+            );
+            // Mapping between logical qubit to physical qubit
+            let mut permutation = (0..num_qubits).collect::<Vec<_>>();
+            // logical qubit remaining to be disconnected
+            let mut remaining_columns = (0..num_qubits).collect::<Vec<_>>();
+            // stabilizers / destabilizers that are not yet identity rows
+            let mut remaining_rows = (0..num_qubits).collect::<Vec<_>>();
+            while !remaining_columns.is_empty() {
+                let pivot_row =
+                    (self.row_strategy)(&clifford_tableau, &self.connectivity, &remaining_rows);
+                let pivot_column = (self.column_strategy)(&clifford_tableau, &self.connectivity);
+                let column = clifford_tableau.column(pivot_column);
+                let x_weight = column.x_weight();
+                let z_weight = column.z_weight();
+                let (first_letter, second_letter) = if z_weight > x_weight {
+                    (PauliLetter::Z, PauliLetter::X)
+                } else {
+                    (PauliLetter::X, PauliLetter::Z)
+                };
+                remaining_columns.retain(|&x| x != pivot_column);
+                remaining_rows.retain(|&x| x != pivot_row);
+                {
+                    clean_pivot(
+                        repr,
+                        &mut clifford_tableau,
+                        pivot_column,
+                        pivot_row,
+                        first_letter,
+                    );
+                    // Use the pivot to remove all other terms in the X observable.
+                    clean_prc(
+                        repr,
+                        &mut clifford_tableau,
+                        &self.connectivity,
+                        &remaining_columns,
+                        pivot_column,
+                        pivot_row,
+                        first_letter,
+                    );
+                    clean_pivot(
+                        repr,
+                        &mut clifford_tableau,
+                        pivot_column,
+                        pivot_row,
+                        second_letter,
+                    );
+                    // Use the pivot to remove all other terms in the Z observable.
+                    clean_prc(
+                        repr,
+                        &mut clifford_tableau,
+                        &self.connectivity,
+                        &remaining_columns,
+                        pivot_column,
+                        pivot_row,
+                        second_letter,
+                    );
+                }
+                // If the pivot row is now an identity row, we can remove it from the tableau.
+                permutation[pivot_row] = pivot_column;
+                self.connectivity.remove_node(pivot_column);
+            }
+            clean_signs(repr, &mut clifford_tableau, &permutation);
+            self.permutation = permutation;
+        }
+    }

src/ir/helper.rs

-Original file line number
+Diff line change
@@ -0,0 +1,35 @@
+    use crate::data_structures::PauliLetter;
+    #[allow(dead_code)]
+    pub(super) fn is_i(pauli_letter: PauliLetter) -> bool {
+        pauli_letter == PauliLetter::I
+    }
+    pub(super) fn is_not_i(pauli_letter: PauliLetter) -> bool {
+        pauli_letter != PauliLetter::I
+    }
+    pub(super) fn is_x(pauli_letter: PauliLetter) -> bool {
+        pauli_letter == PauliLetter::X
+    }
+    pub(super) fn is_not_x(pauli_letter: PauliLetter) -> bool {
+        pauli_letter != PauliLetter::X
+    }
+    pub(super) fn is_y(pauli_letter: PauliLetter) -> bool {
+        pauli_letter == PauliLetter::Y
+    }
+    #[allow(dead_code)]
+    pub(super) fn is_not_y(pauli_letter: PauliLetter) -> bool {
+        pauli_letter != PauliLetter::Y
+    }
+    pub(super) fn is_z(pauli_letter: PauliLetter) -> bool {
+        pauli_letter == PauliLetter::Z
+    }
+    pub(super) fn is_not_z(pauli_letter: PauliLetter) -> bool {
+        pauli_letter != PauliLetter::Z
+    }

synir/benches/clifford_tableau.rs

-Original file line number
+Diff line change
@@ Expand Up / @@ -10,8 +10,6 @@ use synir::ir::CliffordGates; @@
     use synir::ir::Synthesizer;
     use synir::IndexType;
-    mod connectivity;
     #[derive(Debug, Default)]
     pub struct MockCircuit {
         commands: Vec<MockCommand>,
@@ Expand Down @@

synir/src/architecture/connectivity.rs

-Original file line number
+Diff line change
@@ Expand Up / @@ -28,7 +28,7 @@ fn get_non_cutting_vertices( @@
             .collect()
     }
-    #[derive(Debug)]
+    #[derive(Debug, Default)]
     pub struct Connectivity {
         graph: StableUnGraph<NodeWeight, EdgeWeight, GraphIndex>,
         non_cutting: Vec<GraphIndex>,
@@ Expand Down @@

synir/src/data_structures.rs

-Original file line number
+Diff line change
@@ Expand Up / @@ -9,6 +9,8 @@ pub use clifford_tableau::CliffordTableau; @@
     pub use pauli_polynomial::PauliPolynomial;
     pub use pauli_string::PauliString;
+    pub type Angle = f64;
     pub trait HasAdjoint {
         fn adjoint(&self) -> Self;
     }
@@ Expand Down @@

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Draft: Integrate PSGS for Pauli Polynomial synthesis #34

Uh oh!

Diff view

Diff view

There are no files selected for viewing

Uh oh!

Uh oh!

Uh oh!

Draft: Integrate PSGS for Pauli Polynomial synthesis #34

Are you sure you want to change the base?

Uh oh!

Draft: Integrate PSGS for Pauli Polynomial synthesis #34

Uh oh!

Uh oh!

Diff view

Diff view

There are no files selected for viewing

Uh oh!

Uh oh!

Uh oh!