Quantum Secret Sharing with error correction
This work addresses noise resilience in quantum secret sharing, which is incremental as it builds on known error correction codes for specific graph states.
The paper tackles the problem of quantum secret sharing over noisy channels by applying quantum error correction to graph states of five, seven, and nine qubits, finding that error recovery is always possible with one disturbed qubit but depends on the code for two or more disturbances.
We investigate in this work a quantum error correction on a five-qubits graph state used for secret sharing through five noisy channels. We describe the procedure for the five, seven and nine qubits codes. It is known that the three codes always allow error recovery if only one among the sents qubits is disturbed in the transmitting channel. However, if two qubits and more are disturbed, then the correction will depend on the used code.