codedistance 0.0.5__tar.gz → 0.0.6__tar.gz

{codedistance-0.0.5 → codedistance-0.0.6}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: codedistance
-Version: 0.0.5
+Version: 0.0.6
 Summary: Code and Circuit Distance Algorithms.
 License: GNUv3
 License-File: LICENSE

{codedistance-0.0.5 → codedistance-0.0.6}/codedistance/NHow.py

@@ -450,7 +450,12 @@ def HowPivots(A,nA=0,tB=1,nC=-1,r0=0):
 # @nb.jit
 # @nb.jit(nb.types.Tuple((nb.int8[:,:],nb.int64[:]))(nb.int8[:,:],nb.int64,nb.int64,nb.int64,nb.int64))
 
-
+def indepVecs(A):
+    """Return a linearly independent subset of rows from A, preserving priority order - uses only 2 RREF calls."""
+    H, U = getHU(A, 2)
+    K = U[np.sum(H, axis=-1) == 0, :]
+    K, LI = getH(K, 2, retPivots=True)
+    return invRange(len(A), LI)
 
 def indepL(L,pList,nA,tB,retWeights=False):
     w = np.sum(L[:,-nA:],axis=-1)

{codedistance-0.0.5 → codedistance-0.0.6}/codedistance/distance.py

@@ -13,7 +13,7 @@ import ortools
 import ortools.linear_solver
 import ortools.linear_solver.pywraplp
 import scipy
-import tesseract_decoder as ts
+# import tesseract_decoder as ts
 
 ## MW Library Files
 from .common import *
@@ -210,6 +210,36 @@ def pauli2str(S,tB=2):
     PauliStrings = "IXZY"
     return "\n".join(["".join([PauliStrings[a] for a in myrow]) for myrow in S])
 
+
+def codeDecomp(S,tB=2):
+    '''Separate stabiliser code into indecomposable parts using method of Slepian, 1960'''
+    H = getH(S,N=2,tB=2)
+    H1 = mod1(ZMatBlockSum(H,tB=tB))
+    m,n = H1.shape
+    partitions = []
+    rSet = set(range(m))
+    cSet = set(range(n))
+    while len(rSet) > 0:
+        r = min(rSet)
+        cVisited = set()
+        rVisited = {r}
+        rTodo = [r]
+        while(len(rTodo) > 0):
+            r = rTodo.pop()
+            for c in bin2Set(H1[r]):
+                if c not in cVisited:
+                    cVisited.add(c)
+                    for r in bin2Set(H1[:,c]):
+                        if r not in rVisited:
+                            rTodo.append(r)
+                            rVisited.add(r)
+        if tB == 2:
+            cVisited.update({n+c for c in cVisited})
+        partitions.append(list(cVisited))
+        rSet.difference_update(rVisited)
+        cSet.difference_update(cVisited)
+    return partitions
+
 def defaultLogicals(S,tB):
     '''Return defaul logical operators for distance-finding
     For tB=1 - classical code - return basis of complementary space
@@ -679,6 +709,12 @@ def grayCode(x):
     '''calculte Gray Code corresponding to integer x'''
     return  x ^ (x >> 1)
 
+def bin2int(x):
+    """Interpret a little-endian binary vector as an integer."""
+    ## need to reverse to make consistent with int2bin
+    xStr = "".join(map(str, reversed(x)))
+    return int(xStr, base=2)
+
 @nb.jit (nb.int8[:](nb.int64,nb.int64))
 def int2bin(x,n):
     '''convert integer to binary representation'''
@@ -1174,6 +1210,7 @@ def dist_m4ri_RW(S,L,tB=2,params={},seed=0):
 
 def dist_m4ri_CC(S,L,tB=2,params={},seed=0):
     '''Connected Cluster algorithm'''
+    addI = False
     if tB == 2:
         ## 2-block non-CSS code
         if L is None:
@@ -1637,7 +1674,8 @@ def gurobiDist(S,L=None,tB=1,params={}):
         'verbose': False,
         'maxTime': 3600 * 8,
         'nThreads': 1,
-        'GF4blockRep': 2
+        'GF4blockRep': 2,
+        'LOCheck': 0 
     }
     params = setDefaultParams(params,paramDefaults)
     if L is None:
@@ -1730,7 +1768,8 @@ def MIPDist(DEMH,DEML=None,solverType='SCIP',params={}):
     paramDefaults = {
         'verbose': False,
         'maxTime': 3600 * 8,
-        'nThreads': 1
+        'nThreads': 1,
+        'LOCheck': 0
     }
     params = setDefaultParams(params,paramDefaults)
     r,n = DEMH.shape
@@ -2125,7 +2164,8 @@ def dist_qubitserf(S,L=None,tB=1,params={}):
     defaultParams={
         'method':'qubitserfMM',
         'maxTime' : 8 * 60 * 60,
-        'nThreads' : 1
+        'nThreads' : 1,
+        'LOCheck': 0
     }
     method = 1 if params['method'] == 'qubitserfBZ' else 2
     params = setDefaultParams(params,defaultParams)

{codedistance-0.0.5 → codedistance-0.0.6}/examples/exampleCSS.py

@@ -21,11 +21,12 @@ params = {
     'iterCount': 10000,     ## number of iterations - eg QDistRnd, decoderDist
     'maxTime': 3600*8,      ## max runtime for CLI methods (eg SAT, m4ri, )
     'nThreads': 1,          ## cater for multi-threaded methods
+    'LOCheck': 0            ## check logical operators
 }
 
 ## Magma distance finding: requires Magma licence and magma executable in PATH
-# method = 'magmaMinWeight'
-method = 'magmaMinWord'
+method = 'magmaMinWeight'
+# method = 'magmaMinWord'
 # method = 'magmaWEDist'
 
 ## Serban Cercelescu C Library https://github.com/qubitserfed/Qubitserf
@@ -104,9 +105,9 @@ allMethods = ['magmaMinWeight',
               'GraphLikeErrorMW',
               'ColourCodeDistMW',
               'decoderDist',
-              'GurobiDist',
               'MIPDist',
-              'pySATDist']
+              'pySATDist',
+              'GurobiDist']
 
 ## Single Method
 methods = [method]
@@ -122,11 +123,4 @@ for method in methods:
     if (res['T'] > 1):
         print(f'Total Trials: {res['T']}')
         print(f'Trials at d={res['d']}: {res['R']}')
-    lo = res['L']
-    if (np.sum(lo)) > 0:
-        r1,V = HowRes(Hz,lo,2)
-        print(f'lo: {bin2Set(lo)}')
-        lo = ZMat2D(lo)
-        r2 = matMul(lo,Hx.T,2)
-        print(f'Logical Operator Check: commutes with stabilsers {np.sum(r2)==0}; non-trivial {np.sum(r1)!=0}')
     print("###########################################\n")

{codedistance-0.0.5 → codedistance-0.0.6}/examples/exampleCircuit.py

@@ -15,6 +15,7 @@ params = {
     'iterCount': 100,     ## number of iterations - eg QDistRnd, decoderDist
     'maxTime': 3600*8,      ## max runtime for CLI methods (eg SAT, m4ri, )
     'nThreads': 1,          ## cater for multi-threaded methods
+    'LOCheck': 0            ## check logical operators
 }
 
 ## Magma distance finding: requires Magma licence and magma executable in PATH

codedistance-0.0.6/examples/exampleCodeDecomp.py

@@ -0,0 +1,54 @@
+import numpy as np
+from codedistance import *
+
+## Illustrate Decomposition of Codes into Direct Sums - Slepian, 1960
+
+
+## Eberhardt108
+n,k,d = 108,16,6
+l,m,ALen = 6,9,3
+uVec = '0 0 0 0 2 4'
+vVec = '0 1 2 3 0 0'
+
+## Eberhardt128
+n,k,d = 128,14,12
+l,m,ALen = 8,8,4
+uVec = '2 0 0 0 0 1 3 4'
+vVec = '0 1 3 4 2 0 0 0'
+
+## Eberhardt162-4
+n,k,d = 162,4,16
+l,m,ALen = 9,9,3
+uVec = '0 1 0 3 0 0'
+vVec = '0 0 1 0 1 2'
+
+## Eberhardt162-12
+n,k,d = 162,12,8
+l,m,ALen = 9,9,3
+uVec = '0 1 0 0 2 3'
+vVec = '0 0 6 3 0 0'
+
+## Eberhardt162-24
+n,k,d = 162,24,6
+l,m,ALen = 9,9,3
+uVec = '0 0 0 0 3 6'
+vVec = '0 1 2 3 0 0'
+
+uVec = list(map(int,uVec.split(" ")))
+vVec = list(map(int,vVec.split(" ")))
+SX,SZ = BBCSSCode(l,m,uVec,vVec,ALen)
+qubitPartitions = codeDecomp(ZMatVstack([SX,SZ]))
+if len(qubitPartitions) == 1:
+    print('No partitions found')
+else:
+    print(f'{len(qubitPartitions)} partitions found')
+    for i,ix in enumerate(qubitPartitions):
+        ix = sorted(ix)
+        print(f'Subcode {i}:',ix)
+        print('SX')
+        print(ZMatPrint(RemoveZeroRows(SX[:,ix])))
+        print('SZ')
+        print(ZMatPrint(RemoveZeroRows(SZ[:,ix])))
+
+
+

{codedistance-0.0.5 → codedistance-0.0.6}/examples/exampleQECC.py

@@ -36,6 +36,7 @@ params = {
     'iterCount': 100,     ## number of iterations - eg QDistRnd, decoderDist
     'maxTime': 3600*8,      ## max runtime for CLI methods (eg SAT, m4ri, )
     'nThreads': 1,          ## cater for multi-threaded methods
+    'LOCheck': 0            ## check logical operators
 }
 
 ## Magma distance finding: requires Magma licence and magma executable in PATH

{codedistance-0.0.5 → codedistance-0.0.6}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "poetry.core.masonry.api"
 
 [tool.poetry]
 name = "codedistance"
-version = "0.0.5"
+version = "0.0.6"
 description = "Code and Circuit Distance Algorithms."
 license = "GNUv3"
 authors = ["Mark Webster <mark.acacia@gmail.com>","Abraham Jacob <abraham.jacob.17@ucl.ac.uk>","Oscar Higgott <oscarhiggott@google.com>"]