Quantum multi-secret sharing via trap codes and discrete quantum walks

Quantum Secret Reconstruction

“…Our protocol is simpler and more practical than the existing QMSS protocol, such as Ref. [28]. By comparison, we can find that the experimental implementation of Ref.…”

“…By comparison, we can find that the experimental implementation of Ref. [28] is relatively challenging, as it requires the use of trap codes and discrete quantum walk, which are more complicated technologies than cluster states. Specifically, cluster states can be constructed by simply performing controlled‐Z operations CZ among $$|+\rangle$$ states.…”

“…In contrast, quantum walk requires a variety of complex quantum circuit techniques such as Quantum Coin Flip gates, Conditional Shift gates, Arc‐Reversal gates and the Fourier coin gates or Grover coin gates that are mentioned in Ref. [28]. At present, these quantum gates cannot be simply simulated at the quantum circuit due to their complexity.…”

“…At present, these quantum gates cannot be simply simulated at the quantum circuit due to their complexity. In addition, the QMSS scheme [ 28 ] requires trap codes, while the proposed protocol does not require a coding scheme. Overall, although the authors [ 28 ] provide mathematical descriptions and security analysis of the protocol, there is a lack of actual experimental data to prove its feasibility.…”

“…In addition, the QMSS scheme [ 28 ] requires trap codes, while the proposed protocol does not require a coding scheme. Overall, although the authors [ 28 ] provide mathematical descriptions and security analysis of the protocol, there is a lack of actual experimental data to prove its feasibility. Our protocol based on cluster states obviously has more feasibility and already been experimentally demonstrated.…”