Skip to main content
Log in

Application of Quantum Gauss-Jordan Elimination Code to Quantum Secret Sharing Code

  • Published:
International Journal of Theoretical Physics Aims and scope Submit manuscript

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|}}\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. 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)

    Article  MathSciNet  MATH  Google Scholar 

  2. Smith, A.: Quantum Secret Sharing for General Access Structures. arXiv:quant-ph/0001087 (2000)

  3. Rietjens, K.P.T.: An information theoretical approach to Quantum Secret Sharing Schemes, Master’s Thesis

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Do Ngoc Diep.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10773-017-3617-y

Keywords

Navigation