Quantum computing and distributed architecture may enter a mutually beneficial partnership in the near future. On the one side, a number of small quantum computers rather than a single large one is easier to build. On the other side, by harnessing quantum mechanical effects such as superposition and entanglement, a quantum computer can tackle classes of problems, in distributed computing, that choke conventional machines. Although, theoretically, distributed quantum algorithm looks promising and feasible, it is still unclear how to implement it, e.g. maintaining robust large-scale entangled states on a noisy and intermediate scale (aka, NISQ) architecture. In this context, it is crucial to design accurate fault-tolerant numerical schemes, to optimize circuit size and depth. Quantum Walks, Quantum Cellular Automata and their generalisation to graphs, Quantum Cellular Networks, constitute a doubly strategic topic in this respect. First, they have been used as a mathematical framework to express many quantum algorithms. Secondly, they constitute a promising architecture which naturally gives a degree of fault tolerance because of local interactions, limiting error propagation. The DisQC project intends to bring together scientific experts from the disciplines of quantum computing, distributed algorithm and complexity, to work together towards the common goal of 1) exploring and exploiting further synergies between these fields, 2) identifying fundamental strategies and methods to design fault-tolerant quantum algorithms, and 3) developing new ideas for implementing quantum algorithms on distributed architecture.