remove unnecessary imports

Author: Krastanov

src/grouptableaux.jl

@@ -1,6 +1,3 @@
-using Graphs
-using LinearAlgebra
-
 """
 Return the full stabilizer group represented by the input generating set (a [`Stabilizer`](@ref)).
 
@@ -15,8 +12,8 @@ julia> groupify(S"XZ ZX")
 ```
 """
 function groupify(s::Stabilizer)
-    # Create a `Tableau` of 2ⁿ n-qubit identity Pauli operators(where n is the size of 
-    # `Stabilizer` s), then multiply each one by a different subset of the elements in s to 
+    # Create a `Tableau` of 2ⁿ n-qubit identity Pauli operators(where n is the size of
+    # `Stabilizer` s), then multiply each one by a different subset of the elements in s to
     # create all 2ⁿ unique elements in the group generated by s, then return the `Tableau`.
     n = length(s)::Int
     group = zero(Tableau, 2^n, nqubits(s))
@@ -27,7 +24,7 @@ function groupify(s::Stabilizer)
             end
         end
     end
-    return group 
+    return group
 end
 
 
@@ -44,8 +41,8 @@ julia> minimal_generating_set(S"__ XZ ZX YY")
 ```
 """
 function minimal_generating_set(s::Stabilizer)
-    # Canonicalize `Stabilizer` s, then return a `Stabilizer` with all non-identity Pauli operators 
-    # in the result. If s consists of only identity operators, return the negative 
+    # Canonicalize `Stabilizer` s, then return a `Stabilizer` with all non-identity Pauli operators
+    # in the result. If s consists of only identity operators, return the negative
     # identity operator if one is contained in s, and the positive identity operator otherwise.
     s, _, r = canonicalize!(copy(s), ranks=true)
     if r == 0
@@ -60,7 +57,7 @@ function minimal_generating_set(s::Stabilizer)
 end
 
 """
-Return the full Pauli group of a given length. Phases are ignored by default, 
+Return the full Pauli group of a given length. Phases are ignored by default,
 but can be included by setting `phases=true`.
 
 ```jldoctest
@@ -131,8 +128,8 @@ julia> normalizer(T"X")
 ```
 """
 function normalizer(t::Tableau)
-    # For each `PauliOperator` p in the with same number of qubits as the `Stabilizer` s, iterate through s and check each 
-    # operator's commutivity with p. If they all commute, add p a vector of `PauliOperators`. Return the vector 
+    # For each `PauliOperator` p in the with same number of qubits as the `Stabilizer` s, iterate through s and check each
+    # operator's commutivity with p. If they all commute, add p a vector of `PauliOperators`. Return the vector
     # converted to `Tableau`.
     n = nqubits(t)
     pgroup = pauligroup(n, phases=false)
@@ -161,7 +158,7 @@ julia> centralizer(T"XX ZZ _Z")
 + ZZ
 ```
 """
-function centralizer(t::Tableau) 
+function centralizer(t::Tableau)
     center = typeof(t[1])[]
     for P in t
         commutes = 0
@@ -175,15 +172,15 @@ function centralizer(t::Tableau)
             push!(center, P)
         end
     end
-    if length(center) == 0 
+    if length(center) == 0
         return Tableau(zeros(Bool, 1,1))
     end
     c = Tableau(center)
     return c
 end
 
 """
-Return the subset of Paulis in a Stabilizer that have identity operators on all qubits corresponding to 
+Return the subset of Paulis in a Stabilizer that have identity operators on all qubits corresponding to
 the given subset, without the entries corresponding to subset.
 
 ```jldoctest
@@ -196,9 +193,9 @@ function contractor(s::Stabilizer, subset)
     for p in s
         contractable = true
         for i in subset
-            if p[i] != (false, false) 
-                contractable = false 
-                break 
+            if p[i] != (false, false)
+                contractable = false
+                break
             end
         end
         if contractable push!(result, p[setdiff(1:length(p), subset)]) end
@@ -208,4 +205,4 @@ function contractor(s::Stabilizer, subset)
     else
         return Tableau(zeros(Bool, 1,1))
     end
-end
+end

test/test_group_tableaux.jl

@@ -1,11 +1,10 @@
-@testitem "Classical" begin
+@testitem "group theory routines" begin
     using Test
-
     using Random
     using QuantumClifford
 
     # Including sizes that would test off-by-one errors in the bit encoding.
-    test_sizes = [1, 2, 3, 4, 5, 7, 8, 9, 15, 16, 17] 
+    test_sizes = [1, 2, 3, 4, 5, 7, 8, 9, 15, 16, 17]
     # Zero function(in groupify) slows down around 2^30(n=30),eventually breaks
     small_test_sizes = [1, 2, 3, 4, 5, 7] # Pauligroup slows around n = 8
 
@@ -45,7 +44,7 @@
             end
         end
         #Test pauligroup
-        for n in [1, small_test_sizes...] 
+        for n in [1, small_test_sizes...]
             @test length(QuantumClifford.pauligroup(n, phases=false)) == 4^n
             @test length(QuantumClifford.pauligroup(n, phases=true)) == 4^(n+1)
         end
@@ -98,7 +97,7 @@
             end
             c = contractor(s, subset)
             count = 0
-            for stabilizer in s 
+            for stabilizer in s
                 contractable = true
                 for i in subset
                     if stabilizer[i] != (false, false) contractable = false end
@@ -111,9 +110,9 @@
                     p = zero(PauliOperator, nqubits(s))
                     index = 0
                     for i in 1:nqubits(s)
-                        if !(i in subset) 
-                            index+=1 
-                            p[i] = contracted[index] 
+                        if !(i in subset)
+                            index+=1
+                            p[i] = contracted[index]
                         end
                     end
                     @test p in s || -1* p in s || 1im * p in s || -1im * p in s
@@ -123,4 +122,4 @@
             end
         end
     end
-end
+end