Added QuaC compiler

Added files QuaCLexer.h, QuaCParser.h, QUaCExecutor.h, HashMap.h, Types.h and some examples

Author: AbeerVaishnav13

.DS_Store

@@ -53,3 +53,5 @@ dkms.conf
 
 .vscode
 quacc
+Aux files
+TestInput.qc

.gitignore

@@ -1,25 +1,24 @@
 # Two qubit grover search to find the number '2' or '10' in binary representation
 
-func grover_search_10 {
+func grover_search {
 	[H, H]
 	[-, S]
 	[-, H]
-	[Co, Cx]
+	[@, X]
 	[-, H]
 	[-, S]
 	[H, H]
 	[X, X]
 	[-, H]
-	[Co, Cx]
+	[@, X]
 	[-, H]
 	[X, X]
 	[H, H]
 }
 
-quReg a = init [2]
-a.name = "quReg1: "
-a.prec = 6
+quReg a = new quReg[2] => 'quReg1'
+a.setPrecision(6)
 
 a.Pa()
-a.grover_search_10()
+a.grover_search()
 a.Pa()

Examples/Grover_search.qc

@@ -1,16 +1,12 @@
 # Hadamard Fever for 28 qubits!!! (only attempt to run if your system has a minimum of 8GB RAM)
 
 func Hadamard_Fever {
-	[H, H, H, H, H, H, H, H, H, H, H, H, H, H, -, -, -, -, -, -, -, -, -, -, -, -, -, -]
-	Pnz()
-	[-, -, -, -, -, -, -, -, -, -, -, -, -, -, H, H, H, H, H, H, H, H, H, H, H, H, H, H]
-	
+	[H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H]	
 	[H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H, H]
 }
 
-quReg a = init [28]
-a.name = "quReg1: "
-a.prec = 6
+quReg a = new quReg[28] => 'quReg1'
+a.setPrecision(6)
 
 a.Pnz()
 a.Hadamard_Fever()

Examples/Hadamard_Fever.qc

@@ -6,9 +6,8 @@ func basic {
 	[H, H]
 }
 
-quReg a = init [2]
-a.name = "quReg1: "
-a.prec = 6
+quReg a = new quReg[2] => 'quReg1'
+a.setPrecision(6)
 
 a.Pa()
 a.basic()

Examples/basic.qc

@@ -0,0 +1,51 @@
+gate Uw[6] {
+    [-, -, -, X, -, -]
+    [X, @, @, @, @, @]
+    [-, -, -, X, -, -]
+}
+
+gate Us[6] {
+    [-, H, H, H, H, H]
+    [-, X, X, X, X, X]
+    [X, @, @, @, @, @]
+    [-, X, X, X, X, X]
+    [-, H, H, H, H, H]
+}
+
+func grover {
+    [X, -, -, -, -, -]
+    [H, H, H, H, H, H]
+    [Uw]
+    [Us]
+    [Uw]
+    [Us]
+    [Uw]
+    [Us]
+    [Uw]
+    [Us]
+    Pa()
+}
+
+quReg qr = new quReg[6] => 'qr1'
+qr.setPrecision(6)
+
+qr.Pnz()
+qr.grover()
+qr.Pnz()
+
+
+######################################
+# Pauli-X: X
+# Pauli-Y: Y
+# Pauli-Z: Z
+# Phase: S
+# Rotation: R
+# Hadamard: H
+# Swap: x
+# QFT: ~
+# Control: @
+# Inverse Control: o
+# Power: <gate> ^ <num>    (optional)
+# X-axis control: +
+# Y-axis control: *
+# Identity gate: -

Examples/grover.qc

@@ -0,0 +1,38 @@
+func shor {
+	[X, -, -, -, H, H, H, H]
+
+	[-, X, -, -, @, -, -, -]
+	[-, -, X, -, @, -, -, -]
+
+	[-, X, -, @, -, @, -, -]
+	[-, @, -, X, -, @, -, -]
+	[-, X, -, @, -, @, -, -]
+	[X, -, @, -, -, @, -, -]
+	[@, -, X, -, -, @, -, -]
+	[X, -, @, -, -, @, -, -]
+
+	[-, -, -, -, Q, Q, Q, Q]
+}
+
+quReg q = init [8]
+q.name = "qr1: "
+q.prec = 6
+
+q.Pnz()
+q.shor()
+q.Pnz()
+
+######################################
+# Pauli-X: X
+# Pauli-Y: Y
+# Pauli-Z: Z
+# Phase: S
+# Rotation: R
+# Hadamard: H
+# Swap: x
+# QFT: ~
+# Control: @
+# Inverse Control: o
+# Power: <gate> ^ <num>    (optional)
+# X-axis control: +
+# Y-axis control: *

Examples/shor.qc

@@ -0,0 +1,74 @@
+#ifndef HASHMAP_H
+#define HASHMAP_H
+
+#include "Types.h"
+
+typedef struct kt {
+    char *key;
+    Type type;
+}KeyTypes;
+
+typedef struct hm {
+    KeyTypes *kt;
+    int len;
+    int maxSize;
+}HashMap;
+
+HashMap* newHashMap() {
+    int MS = 2;
+    HashMap *hm = (HashMap*) malloc(sizeof(HashMap));
+    hm-> kt = (KeyTypes*) malloc(MS * sizeof(KeyTypes));
+    hm->len = 0;
+    hm->maxSize = MS;
+    return hm;
+}
+
+void insertHM(HashMap *hm, char k[], Type t) {
+    int i;
+    int len = 0;
+    for(i = 0; k[i] != '\0'; i++)
+        len++;
+
+    if(hm->len == hm->maxSize) {
+        int enlarge = hm->maxSize * 2;
+        hm->kt = (KeyTypes*) realloc(hm->kt, (enlarge+1) * sizeof(KeyTypes));
+        hm->maxSize = enlarge;
+        // printf("Enlarged to %d\n", hm->maxSize);
+    }
+
+    hm->kt[hm->len].key = (char*) malloc(len * sizeof(char));
+    strcpy(hm->kt[hm->len].key, k);
+    hm->kt[hm->len].type = t;
+    hm->len++;
+}
+
+void displayMap(HashMap hm) {
+    int i;
+    for(i = 0; i < hm.len; i++) {
+        printf("'%s' : %s\n", hm.kt[i].key, Types_str[hm.kt[i].type]);
+    }
+}
+
+Type* toArrayofTypes(HashMap hm) {
+    Type *t = (Type*) malloc(hm.len * sizeof(Type));
+    int i = 0;
+    for(i = 0; i < hm.len; i++)  {
+        t[i] = hm.kt[i].type;
+    }
+
+    return t;
+}
+
+KeyTypes* toArrayOfKeyTypes(HashMap hm) {
+    KeyTypes *kt = (KeyTypes*) malloc(hm.len * sizeof(KeyTypes));
+    int i;
+    for(i = 0; i < hm.len; i++) {
+        kt[i].key = (char*) malloc(strlen(hm.kt[i].key) * sizeof(char));
+        strcpy(kt[i].key, hm.kt[i].key);
+        kt[i].type = hm.kt[i].type;
+    }
+
+    return kt;
+}
+
+#endif