Ming-Xing Luo

TL;DR: A novel hybrid threshold adaptable quantum secret sharing scheme, using an m-bonacci orbital angular momentum pump, Lagrange interpolation polynomials, and reverse Huffman-Fibonacci-tree coding, which can detect eavesdropping without joint quantum operations and permits secret sharing for an arbitrary but no less than threshold-value number of classical participants with much lower bandwidth.

TL;DR: In this article, the authors proposed a hybrid threshold adaptable quantum secret sharing scheme, using an m-bonacci orbital angular momentum (OAM) pump, Lagrange interpolation polynomials, and reverse Huffman-Fibonacci-tree coding.

TL;DR: The proposed matrix algorithm for quantum cryptography can be simplified to matrix multiplication, which is implemented and optimized in modern computers, and considerably information capacity can be improved effectively and efficiently by the recursive property of Fibonacci and Lucas matrices, thereby avoiding the restriction of physical conditions, such as the communication bandwidth.

TL;DR: By introducing a novel entanglement transformation the sender can deterministically prepare an arbitrary W-class state with complex spectra to one of two remote receivers via two four-particle GHZ states as the quantum channel.

TL;DR: The protocols for joint remote preparation of an arbitrary two-particle pure state from a spatially separated multi-sender to one receiver are presented and are shown to be generalizations of the usual standard joint remote state preparation scheme and more suitable for real experiments with requirements of only Pauli operations.