concise. This summary will be used to select suited reviewers for
the proposal.}
We propose the development of ``deep quantum compilation'' technology, which is the concept of a compiler for quantum systems which can be used to develop large portions of the software stack, in a way which is modular in design but tightly integrated once compiled.
We propose to develop deep quantum compilation technology by leveraging the \zxcalculus, a versatile formal tool to efficiently reason about tensors, which recently demonstrated state-of-the-art capability to optimise unitary circuits. \newt{The graphical \zxcalculus has recently also be shown to be complete: all equations that hold in standard quantum theory can be derived in \zxcalculus.}
This provides us with the opportunity to develop compiler technology with a scope that would be difficult to achieve otherwise.
Recent investment in quantum technologies has brought us into the era of noisy intermediate-scale quantum (NISQ) devices.
These computers are not so much single devices, but instead patchworks of components (including classical) which vary greatly between implementations such as silicon qubits, superconducting circuits, or ion traps.
Even as the technology matures, we may expect that even fault-tolerant quantum computers will be accompanied by a myriad of control systems, and a scarcity of resources.
Programming such devices currently requires intimate knowledge of the hardware.
This is a barrier to the realisation of quantum software, as programs must be rewritten for every new device to closely match the hardware model.
Furthermore, whereas classical computers have had a roughly static concept of ``low-level instructions'' for decades, the analogous notion for quantum hardware is constantly changing and evolving to cope with the rapid progress in quantum technology. We face a situation where the ever-multiplying range of quantum computers has minimal software support.
Solving this problem requires a ``deep'' quantum compiler --- one which can transform algorithms to match the resources and capabilities of diverse hardware platforms.
To develop such a compiler, we will leverage the versatility and the power of the \zxcalculus.
Recent formal and practical advances in completeness and optimisation of the \zxcalculus demonstrate a proof-of-principle of the possibility of developing a deep quantum compiler, including provably-correct program transformations for automatically adding error correction and performing hardware-guided optimisations.
Developing such a compiler will allow for the sound development of tightly integrated software stacks for quantum computers, enabling them to perform computations better and faster.
We propose the development of ``deep quantum compilation” technology. This is the concept of a compiler for quantum systems which can be used to develop large portions of the software stack, in a way which is modular in design but tightly integrated once compiled. We propose to develop deep quantum compilation technology by leveraging the \zxcalculus, a versatile formal tool to efficiently reason about tensors, which recently demonstrated state-of-the-art capability to optimise unitary circuits. The graphical \zxcalculus has recently also be shown to be complete: all equations that hold in standard quantum theory can be derived in \zxcalculus. This provides us with the opportunity to develop compiler technology with a scope that would be difficult to achieve otherwise.
Recent investment in quantum technologies has brought us into the era of noisy intermediate-scale quantum (NISQ) devices. These computers are patchworks of components (including classical) that vary greatly between implementations such as silicon qubits, superconducting circuits, or ion traps. As the technology matures into the fault-tolerant regime, quantum computers will continue to be accompanied by a myriad of control systems, and a scarcity of resources. Programming such devices currently requires intimate knowledge of the hardware, and programs must be rewritten for every new device to closely match the hardware model. Any optimisation is purely ad-hoc. We face a situation where the ever-multiplying range of quantum computers has minimal software support.
Solving this problem requires a ``deep” quantum compiler -- one which can transform algorithms to match the resources and capabilities of diverse hardware platforms. Recent formal and practical advances in completeness and optimisation of the \zxcalculus demonstrate a proof-of-principle of the possibility of developing a deep quantum compiler, including provably-correct program transformations for automatically adding error correction and performing hardware-guided optimisations. We will target the compilation stack for three of the most promising hardware platforms, and develop the techniques and software tools to build a deep compiler. In addition, leveraging the foundational expressiveness of the calculus, we will isolate specific resources that give rise to quantum processing, providing in-compiler certification of quantum speed-up. Developing a ``deep” compiler will allow for the sound development of tightly integrated software stacks for quantum computers, becoming a standard for optimisation and benchmarking, and enabling quantum devices to perform computations demonstrably better and faster.
%The goal of this project is to develop the flexible intermediate for compilation and optimisation, which is necessary for the immediate-term practical implementation of post-classical protocols on noisy intermediate-scale quantum computers. %how many buzzwords can we get in this sentence
...
...
@@ -99,16 +88,18 @@ Developing such a compiler will allow for the sound development of tightly integ
concerned by your project, max. 1/4 page):}
The project clearly comprises ``\textit{transformative research}'' that explores ``\textit{collaborative advanced interdisciplinary science and/or cutting-edge engineering with the potential to initiate or foster new lines of quantum technologies}'', which is the key overall objective of QuantERA.
We include several ``\textit{excellent young researchers}'', including from Poland, along with well-established figures at all levels in the project, and partner with Cambridge Quantum Computing, a clearly ``\textit{ambitious high-tech SME}''.
We include several ``\textit{excellent young researchers}'', including from Poland, and partner with Cambridge Quantum Computing, a clearly ``\textit{ambitious high-tech SME}''.
In particular we address the \textit{Quantum Computation} area of the call.
The
retargettable nature of the compiler supports ``\emph{new architectures
for quantum computation}", in particular technologically heterogeneous
implementations. The optimising aspect of the compiler will allow the
``\emph{optimisation of error correction codes}", both at the
``\emph{optimisation of error correction codes}", at both
intermediate and machine level. The ability to compile multiple
high-level languages will promote the ``\emph{development of novel
quantum algorithms}". Machine-dependent optimisation work will contribute to the ``\textit{development of devices to realise multiqubit algorithms}". More generally, this project is an enabling
quantum algorithms}". Machine-dependent optimisation work will contribute to the ``\textit{development of devices to realise multiqubit algorithms}".
The ability to compile with specifically post-classical resources leads directly to ``\textit{demonstration of quantum speed-up}”.
In total, this project is an enabling
technology that multiplies the impact of all the target
