Quantum communication and quantum multivariate polynomial interpolation
From MaRDI portal
Publication:1685708
DOI10.1007/S10773-017-3444-1zbMATH Open1379.81038arXiv1704.01292OpenAlexW2605390622MaRDI QIDQ1685708FDOQ1685708
Authors: Do Ngoc Diep, Dô Hoàng Giang
Publication date: 19 December 2017
Published in: International Journal of Theoretical Physics (Search for Journal in Brave)
Abstract: The paper is devoted to the problem of multivariate polynomial interpolation and its application to quantum secret sharing. We show that using quantum Fourier transform one can produce the protocol for quantum secret sharing distribution.
Full work available at URL: https://arxiv.org/abs/1704.01292
Recommendations
Cryptography (94A60) Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
Cited In (6)
- Quantum cryptography based on an algorithm for determining a function using qudit systems
- Quantum algorithm for the root-finding problem
- Creating very true quantum algorithms for quantum energy based computing
- Efficient quantum algorithms of finding the roots of a polynomial function
- Continuous-variable quantum computing and its applications to cryptography
- Some theoretically organized algorithm for quantum computers
This page was built for publication: Quantum communication and quantum multivariate polynomial interpolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1685708)