Quantum Information and network theory: algorithms and performance limits – QUANTINT

Our aim is to address the problem of quantum information theory beyond the issue of the physical implementation. Efficient protocols and algorithms can leverage the unique quantum behaviour of sub-systems, also referred to as qubits or quantum states,
to yield unparalleled advantages in diverse disciplines of information processing including computing, communication, cryptography and control. All of these protocols and algorithms rely on employing quantum states as information carriers. One targeted example is the data compression algorithms, where the quantum aspect will take advantage of state superposition to enable qubits, Pauli gates and redundancy, it will also take advantage of non-locality with Bell states or equivalent, for example with the superdense coding. The aim of this project regarding data compression would be to find the compression ratio limits in the framework of a quantum information theory. These limits will be crucial for the design of future quantum networking and should embrace the extrapolations on the evolution of quantum technologies.
A key problem across all applications is the optimal encoding of qubit information in coordination of the design of efficient algorithm, adapted to the envisioned application.
Regarding data compression, we will explore algorithms for compressing information emitted or carried by quantum sources and develop distributed algorithms that minimize the computing complexity of quantum information manipulation in these networks. Additionally, we will investigate distributed data compression techniques to achieve optimal qubit encoding tailored to various distributed applications in quantum networks.
We will consider optimal redundancy and optimal quantum distributed algorithms minimizing the need for manipulating quantum information, e.g. for byzantine agreement.