Quantum blockchain is expected to offer an alternative to classical blockchain to resist malicious attacks laughed by future quantum computers. Although a few quantum blockchain schemes have been constructed, their efficiency is low and unable to meet application requirements due to the fact that they lack of a suitable consensus mechanism. To tackle this issue, a consensus mechanism called quantum delegated proof of stake (QDPoS) is constructed by using quantum voting to provide fast decentralization for the quantum blockchain scheme at first. Then an efficient scheme is proposed for quantum blockchain based on QDPoS, where the classical information is initialized as a part of each single quantum state and these quantum states are entangled to form the chain. Compared with previous methods, the designed quantum blockchain scheme is more complete and carried out with higher efficiency, which greatly contributes to better adapting to the challenges of the quantum era.
Semiquantum key distribution allows a quantum party to share a random key with a “classical” party who only can prepare and measure qubits in the computational basis or reorder some qubits when he has access to a quantum channel. In this work, we present a protocol where a secret key can be established between a quantum user and an almost classical user who only needs the quantum ability to access quantum channels, by securely delegating quantum computation to a quantum server. We show the proposed protocol is robust even when the delegated quantum server is a powerful adversary and is experimentally feasible with current technology. As one party of our protocol is the most quantum-resource efficient, it can be more practical and significantly widen the applicability scope of quantum key distribution.
1 November 2021 in Physica A: Statistical Mechanics and its Applications