Skip to content
Snippets Groups Projects
Commit ccc257f6 authored by Bob Coecke's avatar Bob Coecke
Browse files

WP3 edits + numbers

parent 84095862
No related branches found
No related tags found
No related merge requests found
......@@ -1289,7 +1289,7 @@ This includes developing \zx representations of contextuality, as a possible pos
(M1--M18; Responsible: 1; Involved: 2,3,5)}{%
We will use the existing graph re-writing and automated theorem proving tools of Quantomatic and PyZX to determine parts of the re-writing process that are difficult to compute classically. This will then be used to extract candidate subroutines for sources of quantum speed-up. Along with the previous task, these will be used to develop procedures for characterising if a \zx-represented algorithm demonstrates speed-up or not.
}
\end{WPtasks}
\begin{WPdeliverables}
\WPdeliverable{M12}{Preliminary assessment of the comparative study of the axiomatizations of paradigms of quantum computation}
......@@ -1307,32 +1307,33 @@ 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{0}{0}{0}{0}{0}{0}
\WPeffort{\newt{12}}{\newt{10}}{\newt{30}}{\newt{12}}{\newt{6}}{\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:
resource optimisation, adding error-correction, and execution
layout. This lays the groundwork for machine-dependent optimisation in the next work package.
layout. This workpackage \newt{genuinely pushes the deep nature of ZX-compilation}.
%lays the groundwork for machine-dependent optimisation in the next work package.
\end{WPaim}
\begin{WPtasks}
\WPtask[\label{task:algorithms}]{Reduction strategies, algorithms,
and complexity (M1--M24; Responsible: 5; Involved: 1,2,3)}{%
and complexity (M1--M24; \newt{Responsible: 6; Involved: 2, 3, 4})}{%
Develop new strategies for simplifying \textsc{zx}-style tensor
networks and reducing to (pseudo) normal forms, with the help of
automated techniques such as Knuth-Bendix completion and
graphical theory synthesis. Implement these strategies in
software and give bounds on computational complexity.
graphical theory synthesis, \newt{or those in \cite{DKPdW-2019}}. Implement these strategies in
software \newt{(cf.~PyZX)} and give bounds on computational complexity.
}
\WPtask[\label{task:annotate1}]{Topological and causal constraints
(M1--M18; Responsible: 2; Involved: 1,3,5)}{%
(M1--M18; \newt{Responsible: 3; Involved: 4,6})}{%
Extend \dzxc language and tools to express and enforce: (1) topological
constaints, such as nearest-neighbour connectivity of qubits and
(2) causal/temporal constraints, such as sequential ordering of
measurements and classically-controlled operations.
}
\WPtask[\label{task:annotate2}]{Quantitative Properties (M13--M24;
Responsible: 2; Involved: 1,3,5)}{%
\WPtask[\label{task:annotate2}]{Quantitative Properties (M13--M24;
\newt{Responsible: 4; Involved: 3, 4, 6})}{%
Extend \dzxc language and tools to account for several kinds of
numerical annotations, e.g.~timing data related to performing
operations, gate fidelities, channel fidelities, and decoherence
......@@ -1342,7 +1343,7 @@ We develop practical logical and algorithmic techniques for transforming ``abst
quantities from local to global properties.
}
\WPtask[\label{task:basic-opt}]{Generic optimisations of ZX-terms
(M12--M24; Responsible: 3; Involved: 1,4,5)}{%
(M12--M24; \newt{Responsible: 3; Involved: 2, 4, 6})}{%
Use the results of task~\ref{task:algorithms} to develop
procedures to optimise \zx-terms, in a way which is applicable
for families of circuits (e.g.~Clifford, Clifford+T, CNOT+T,
......@@ -1354,7 +1355,7 @@ We develop practical logical and algorithmic techniques for transforming ``abst
}
%%
\WPtask[\label{task:ECC}]{Application of Error-Correction
(M1--M24; Responsible: 5; Involved: 1,2)}{%
(M1--M24; \newt{Responsible: 3; Involved: 1, 5})}{%
Develop algorithms which rewrite abstract tensor networks to
equivalent tensors in codeword space of a chosen
error-correcting code. This may be combined with additional
......@@ -1365,17 +1366,16 @@ We develop practical logical and algorithmic techniques for transforming ``abst
}
\end{WPtasks}
\begin{WPdeliverables}
\WPdeliverable{M18}{\zx language constructs for basic control
flow, repetition and recursion}
\WPdeliverable{M24}{A library of general-purpose techniques and
algorithms for simplifying \zx terms}
\WPdeliverable{M24}{Algorithms and heuristics for optimising \zx
terms, including minimisation of T gate count}
\WPdeliverable{M24}{Routines for adding error-correction to \zx
programs}
%\WPdeliverable{M18}{\zx language constructs for basic control flow, repetition and recursion}
\WPdeliverable{M18}{\newt{Generalisations of PyZX and other general-purpose techniques and
algorithms + software for simplifying \zx terms}.}
\WPdeliverable{M24}{An extended \zx language which expresses
topological and quantitative properties, with associated
reasoning techniques}
reasoning techniques.}
\WPdeliverable{M24}{\newt{Setting the state-of-the-art for all forms circuit optimization}.}
\WPdeliverable{M24}{\newt{Optimization techniques for a variety of computational models}.}
% \WPdeliverable{M24}{Routines for adding error-correction to \zx programs}
\WPdeliverable{M24}{Routines for adding error-correction to ZX programs.}
\end{WPdeliverables}
\end{WP}
......@@ -1511,13 +1511,13 @@ Staton, Carette.}
& \ref{wp:usefulstuff}
& \ref{wp:admin}
& \textbf{TOTAL} \\\hline
1. Grenoble & 0 & 11 & 19 & 15 & 3 & 48 \\\hline
2. LORIA & 14 & 12 & 9 & 9 & 3 & 47 \\\hline
3. Oxford & 32 & 12 & 20 & 18 & 2 & 84 \\\hline
4. CQC & 5 & 18 & 0 & 5 & 1 & 29 \\\hline
5. Gdansk & 3 & 12 & 13 & 21 & 2 & 51 \\\hline
6. Nijmegen & 3 & 12 & 13 & 21 & 2 & 51 \\\hline
\textbf{TOTAL} & 47 & 83 & 83 & 75 & 11 & 299 \\\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
\end{tabular}
\end{center}\e
......@@ -1746,26 +1746,23 @@ Several members have ongoing collaborations with Cambridge Quantum Computing Inc
%We now provide details on each of these.
\TODOb{Probably missing some papers here.}
Expertise on the
{\bf theoretical aspects} underpinning the project is provided by Oxford site leader Coecke and CQC research leader Duncan
who jointly invented the \zxcalculus\ \cite{Coecke:2009aa}. Backens, Perdrix, Jeandel and Wang are the key contributors to establishing universal completeness of ZX-calculus \cite{1367-2630-16-9-093021, Jeandel2017A-Complete-Axio, HFW}. Coecke pioneered general categorical and diagrammatic methods in quantum computing \cite{AbrCoe:CatSemQuant:2004}, and with Kissinger co-authored the textbook of the field \cite{Coecke2017Picturing-Quant}.
Expertise on {\bf quantum technology applications} is provided by those who pioneered these applications. Duncan, Perdrix and Horsman pioneered ZX-based translations between different computational models \cite{Duncan:2010aa, Horsman:2011lr}, Horsman and Kissinger pioneered ZX-based error-correction \cite{Chancellor2016Coherent-Parity}, and Horsman and de Beaudrap demonstrated the equivalence of ZX-rules and lattice surgery \cite{BH-2017}.
\TODOb{Add cites.}
Duncan and Kissinger pioneered {\bf automation} of diagrammatic reasoning (cf.~{\tt quantomatic} and {\tt PyZX}), which also will play a key role in this project, as they already have in setting the state-of-the-art in circuit optimization.
Duncan and Kissinger pioneered {\bf automation} of diagrammatic reasoning (cf.~{\tt quantomatic} and {\tt PyZX}), which also will play a key role in this project, as they already have in setting the state-of-the-art in circuit optimization \cite{DKPdW-2019}.
\TODOb{Add cites.}
We also include pioneers in {\bf quantum
programming languages} (Valiron), important contributors to the
theory of {\bf MBQC} (Perdrix, de Beaudrap, and Duncan) and
{\bf quantum circuits} (Jeandel). }
{\bf quantum circuits} (Jeandel). }
The consortium has also been instrumental in community building, for example with the QPL conference series which now attracts well over 100 participants every year and approx.~75 paper submissions on foundational and structural research in the area of quantum computing. It also has organised several schools e.g.~the QiCS School\footnote{www.cs.ox.ac.uk/people/bob.coecke/QICS$\underline{\ }$School.html} and the CAP Spring School,\footnote{www.cs.ox.ac.uk/ss2014/} and a substantial talks archive is maintained.\footnote{www.youtube.com/user/OxfordQuantumVideo} \newt{More recently, the several members are
involved in the Compositionality community, which has diagrammatic/categorical reasoning as its core focus, with a new journal, a new conference series, and a new workshop series.}
\TODOb{Keeping any of this? Introducing anything else?}
\bR Of utter importance is the alignment with Networked Quantum Information Technologies Hub (NQIT) at the Oxford site, which means that several members of the consortium have already direct expertise with interacting with quantum hardware (de Beaudrap, Horsman). The NQIT is the largest of the four Hubs in the UK National Quantum Technology Programme, a 270 GBP million investment by the UK government to establish a quantum technology industry in the UK. %We are working towards building a quantum computer demonstrator, the Q20:20 engine, which demonstrates a networked, hybrid light-matter approach to quantum information processing.
Concretely, the most important aspect is the fact that the modular architecture motivated using lattice surgery on surface codes for the logical operations, and that these are in effect \zx-operations \cite{{BH-2017}}. This will certainly make the ambition here much more achievable. \e
......@@ -2262,7 +2259,7 @@ WP meetings, and also to present our work at conferences.
\begin{itemize}
\item We request 25\% of the cost of new server blades to upgrade our
dedicated HPC facility. This facility will be available to the
entire project via VPN, and will be used across several tasks, most
entire project via VPN, and will be used across several tasks, most
crucially for \ref{task:HPC-sim-model}.
\item We also request laptop computers for each of the postdocs, and
replacement laptops for some staff at LORIA. These are necessary
......@@ -2280,7 +2277,7 @@ WP meetings, and also to present our work at conferences.
No ethical issues foreseeable.
\newpage\TODOb{MAX 30 REFS!}
\newpage\TODOb{MAX 30 REFS! Are the ones here all relevant?}
\REM{max 30 references - OK AT THE MOMENT SINCE KEVIN-ROSS ONLY IN COMMENTS}
\bibliographystyle{plain}
\bibliography{quantera}
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment