Application of quantum Gauss-Jordan elimination code to quantum secret sharing code

DOI10.1007/S10773-017-3617-YMaRDI QIDQ726007zbMATH OpenOpenAlexFDO

Authors Do Ngoc Diep, Do Hoang Giang, Phan Huy Phu

Publication date 2 August 2018

Published in International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10773-017-3617-y

zbMATH Keywords

monotone span programsquantum Gauss Jordan eliminationquantum secret sharing scheme

Mathematics Subject Classification ID

Cryptography (94A60) Searching and sorting (68P10) Quantum coding (general) (81P70) Quantum cryptography (quantum-theoretic aspects) (81P94) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Sharing classical secrets with Calderbank-Shor-Steane codes
• A multiparty error-correcting method for quantum secret sharing
• Quantum secret sharing based on quantum search algorithm
• Cryptanalysis of quantum secret sharing based on GHZ states
• Searching for optimal quantum secret sharing scheme based on local distinguishability

Cites work

• Quantum Gauss-Jordan elimination and simulation of accounting principles on quantum computers

Cited in

(3)

• Some theoretically organized algorithm for quantum computers
• Quantum Gauss-Jordan elimination and simulation of accounting principles on quantum computers
• Implementation of quantum secret sharing and quantum binary voting protocol in the IBM quantum computer

This page was built for publication: Application of quantum Gauss-Jordan elimination code to quantum secret sharing code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q726007)