Category:Few-Qubits Fault Tolerant Quantum Computing Network Stage

This stage di�ers by demanding that the local operations can be performed fault-tolerantly, which is considerably more challenging. The devices on the network are full edged quantum computers and able to carry out error cor- rection on data transfers. Fault-tolerant operations being available would allow the execution of local quantum computation of high circuit depth as well as an arbitrary extension of storage times to execute protocols with an arbitrary number of rounds of communication. Fault tolerance implies that all error parameters of a quantum memory network can be made negligible by adding more resources. The term few qubits here refers to the fact that the number of qubits avail- able is small enough so that the end nodes can be simulated e�ectively on a classical computer. Here, the main interest is the performance of the fault- tolerant scheme, This does not imply that the entire network can be simulated e�ciently or that there would exist equivalent classical protocols; the e�ects of entanglement cannot generally be replicated classically. Applications: Having access to fault-tolerant gates allows higher-accuracy clock synchro- nization (3) and protocols that require many rounds of communication and high circuit depth to be useful. This includes distributed quantum computing as well as applications for full-scale quantum computing networks, restricted to few qubits. This could be of great practical interest, especially for applica- tions in the domain of distributed systems, but as with the implementation of quantum algorithms on quantum computers, the power of having only a lim- ited number of qubits at our disposal is an important subject of investigation 5