Abstract
The QSS codes associated with a MSP code are based on finding an invertible matrix V, solving the system \(\mathbf {v}_{A}^{T}M_{B} \left (\begin {array}{c} \mathbf {s}\\ \mathbf {a} \end {array}\right )=\mathbf {s}\). We propose a quantum Gauss-Jordan Elimination Procedure to produce such a pivotal matrix V by using the Grover search code. The complexity of solving is of square-root order of the cardinal number of the unauthorized set \(\sqrt {2^{|B|}}\).
Similar content being viewed by others
References
Diep, D.N., Giang, D.H., Minh, N.V.: Quantum Gauss-Jordan Elimination and simulation of accounting principles on quantum computers. Int. J. Theor. Phys. 56(6), 1948–1960 (2017)
Smith, A.: Quantum Secret Sharing for General Access Structures. arXiv:quant-ph/0001087 (2000)
Rietjens, K.P.T.: An information theoretical approach to Quantum Secret Sharing Schemes, Master’s Thesis
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Diep, D.N., Giang, D.H. & Phu, P.H. Application of Quantum Gauss-Jordan Elimination Code to Quantum Secret Sharing Code. Int J Theor Phys 57, 841–847 (2018). https://doi.org/10.1007/s10773-017-3617-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10773-017-3617-y