From a032d304befbe5abefe4fdf4f5e43ff20053a7ba Mon Sep 17 00:00:00 2001
From: Dom Horsman <dom.horsman@gmail.com>
Date: Thu, 14 Feb 2019 23:31:43 +0100
Subject: [PATCH] updated wp2 description
---
NEWPROPOSAL/FULLPROP.tex | 24 ++++++++++++------------
1 file changed, 12 insertions(+), 12 deletions(-)
diff --git a/NEWPROPOSAL/FULLPROP.tex b/NEWPROPOSAL/FULLPROP.tex
index d6361e8..d3a43c0 100644
--- a/NEWPROPOSAL/FULLPROP.tex
+++ b/NEWPROPOSAL/FULLPROP.tex
@@ -1198,7 +1198,7 @@ collaboration is a strong point of this project.
\TODOb{Partner contributions missing in all WPs.}
\begin{WP}{A quantum compiler stack}{1M}{36M}{wp:frontend}
\WPleaderLOR
-\WPeffort{0}{0}{0}{0}{0}{0}
+\WPeffort{0}{0}{0}{0}{\newt{12}}{0}
\begin{WPaim}
This WP develops elements of \zx as an abstract intermediate
compiler language. We provide interface between \zx and known
@@ -1311,7 +1311,7 @@ Devise test-suite of concrete instances of circuits and
%%%
\begin{WP}{Representation, reasoning, and resources in \zx}{1M}{36M}{wp:backends}
\WPleaderPOL
-\WPeffort{0}{0}{0}{0}{0}{0}
+\WPeffort{\newt{12}}{\newt{4}}{\newt{14}}{\newt{4}}{\newt{42}}{\newt{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.
@@ -1357,7 +1357,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{\newt{12}}{\newt{10}}{\newt{30}}{\newt{12}}{\newt{6}}{\newt{12}}
+ \WPeffort{\newt{12}}{\newt{10}}{\newt{30}}{\newt{12}}{\newt{12}}{\newt{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:
@@ -1446,7 +1446,7 @@ Perdrix, Valiron, Carette.}
%%%
\begin{WP}{Machine-dependent optimisation}{1M}{36M}{wp:usefulstuff}
\WPleaderGREN
- \WPeffort{0}{0}{0}{0}{0}{0}
+ \WPeffort{0}{0}{0}{0}{\newt{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 quantum dot devices 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 here?
@@ -1506,7 +1506,7 @@ Staton, Carette.}
\begin{WP}{Administation and Communications}{M1}{M36}{wp:admin}
\WPleaderGREN
- \WPeffort{3}{3}{2}{1}{2}{0}
+ \WPeffort{3}{3}{2}{1}{\newt{4}}{0}
\begin{WPaim}
This work package collects general administrative activities and
the organisation of the project meetings. All meetings will be
@@ -1561,13 +1561,13 @@ Staton, Carette.}
& \ref{wp:usefulstuff}
& \ref{wp:admin}
& \textbf{TOTAL} \\\hline
-1. Grenoble & 0 & 11 & \newt{12} & 15 & 3 & 48 \\\hline
-2. LORIA & 14 & 12 & \newt{10} & 9 & 3 & 47 \\\hline
-3. Oxford & 32 & 12 & \newt{30} & 18 & 2 & 84 \\\hline
-4. CQC & 5 & 18 & \newt{12} & 5 & 1 & 29 \\\hline
-5. Gdansk & 3 & 12 & \newt{ 6} & 21 & 2 & 51 \\\hline
-6. Nijmegen & 3 & 12 & \newt{12} & 21 & 2 & 51 \\\hline
-\textbf{TOTAL}& 47 & 83 & \newt{82} & 75 & 11 & 299 \\\hline
+1. Grenoble & 0 & \newt{12} & \newt{12} & 15 & 3 & 48 \\\hline
+2. LORIA & 14 & \newt{4} & \newt{10} & 9 & 3 & 47 \\\hline
+3. Oxford & 32 & \newt{14} & \newt{30} & 18 & 2 & 84 \\\hline
+4. CQC & 5 & \newt{4} & \newt{12} & 5 & 1 & 29 \\\hline
+5. Gdansk & \newt{12} & \newt{42} & \newt{12} & \newt{6} & \newt{4} & \newt{76} \\\hline
+6. Nijmegen & 3 & \newt{6} & \newt{12} & 21 & 2 & 51 \\\hline
+\textbf{TOTAL}& 47 & \newt{82} & \newt{82} & 75 & 11 & 299 \\\hline
\end{tabular}
\end{center}\e
--
GitLab