updated WPPM numbers for CQC

NEWPROPOSAL/FULLPROP.tex

@@ -1181,7 +1181,7 @@ collaboration is a strong point of this project.
 
 \begin{WP}{A quantum compiler stack}{1M}{36M}{wp:frontend}
 \WPleaderLOR
-\WPeffort{12}{20}{32}{12}{12}{3}
+\WPeffort{12}{20}{32}{4}{12}{3}
 \begin{WPaim}
   This WP develops elements of \zx as an abstract intermediate
   compiler language.  We provide interface between \zx and known
@@ -1298,7 +1298,7 @@ Devise test-suite of concrete instances of circuits and
 %%%
 \begin{WP}{Representation, reasoning, and resources in \zx}{1M}{36M}{wp:backends}
 \WPleaderPOL
-\WPeffort{{2}}{{12}}{{14}}{{4}}{{42}}{{6}}
+\WPeffort{{2}}{{12}}{{14}}{{0}}{{42}}{{6}}
 \begin{WPaim}
 %We build the theoretical foundations for \zx as an intermediate representation. This includes extending the capabilities of \zx to represent mixed states, qudit states, and control flows. We use \zx axiomatisations and automated theorem provers to extract out post-classical computing resources, which will be used both for further optimisation work, and for characterisation of quantum algorithmic speed-up.
 We build the theoretical foundations for \zx as an intermediate representation. This includes extending the capabilities of \zx to represent qudit states with a fixed $d$, arbitrary finite-dimensional quantum states, and control flows. We explore the structure of W-type tensors with interaction with \zx generators of GHZ-type. We use \zx axiomatisations and automated theorem provers to extract out post-classical computing resources, which will be used both for further optimisation work, and for characterisation of quantum algorithmic speed-up.
@@ -1347,7 +1347,7 @@ We will use the existing graph re-writing and automated theorem proving tools of
 %%%
 \begin{WP}{Machine-independent optimisation}{M1}{M36}{wp:theory}
   \WPleaderOXF
-  \WPeffort{{12}}{{9}}{{30}}{{12}}{{12}}{{12}}
+  \WPeffort{{12}}{{9}}{{30}}{{6}}{{12}}{{12}}
   \begin{WPaim}
 We develop practical logical and algorithmic techniques for transforming  ``abstract'' \zx terms produced from a high-level program in ways
     which will be required by any practical compiler, and reasoning about their properties. Examples include:
@@ -1436,7 +1436,7 @@ Perdrix, Valiron, Carette.}
 %%%
 \begin{WP}{Machine-dependent optimisation}{13M}{36M}{wp:usefulstuff}
   \WPleaderGREN
-  \WPeffort{20}{9}{12}{6}{6}{0}
+  \WPeffort{20}{9}{12}{2}{6}{0}
   \begin{WPaim}
 We import machine-dependent specifications to \zx terms, and use this to optimise algorithms further for specific hardware constraints. We focus on the silicon spin qubits developing in Grenoble, the ion traps developed in Oxford, and the superconducting devices accessible through CQC and partnership with IBM. This is the culmination of all previous work packages, and feeds back into them. The final result will be \ldots.
 Also machine-dependent error correction?
@@ -1498,7 +1498,7 @@ Staton, Carette.}
 
 \begin{WP}{Administation and Communications}{M1}{M36}{wp:admin} 
   \WPleaderGREN
-  \WPeffort{3}{3}{2}{1}{4}{0}
+  \WPeffort{3}{3}{2}{0}{4}{0}
   \begin{WPaim}
     This work package collects general administrative activities and
     the organisation of the project meetings.  All meetings will be
@@ -1556,10 +1556,10 @@ Staton, Carette.}
 1. Grenoble   &  12 & 2 & 12 & 20 & 3  & 49 \\\hline
 2. LORIA      & 20 & 12 & 9  & 9  & 3  & 53 \\\hline
 3. Oxford     & 32 & 14 & 30 & 12 & 2  & 90 \\\hline
-4. CQC        &  12 & 4  & 12 &  6 & 1  & 35 \\\hline
+4. CQC        &  4 & 0  & 6 &  2 & 0  & 12 \\\hline
 5. Gdansk     &  12& 42 & 12 & 6 & 4  & 76 \\\hline
 6. Nijmegen   &  3 & 6  & 12 & 0 & 0  & 21 \\\hline
-\textbf{TOTAL}& 91 & 80 & 87 & 53 & 13 & 324   \\\hline 
+\textbf{TOTAL}& 83 & 76 & 81 & 49 & 12 & 301   \\\hline 
   \end{tabular}
 \end{center}}