Practical security analysis of a continuous-variable source-independent quantum random number generator based on heterodyne detection.

Heterodyne-based continuous-variable source-independent quantum random number generator (CV-SI-QRNG) can produce true random numbers without any assumptions on source. However, practical implementations always contain imperfections, which will greatly influence the extractable randomness and even open loopholes for eavesdroppers to steal information about the final output. In this work, based on the theoretical model, we systematically analyzed the effects of imperfect implementations on the practical security of heterodyne-based CV-SI-QRNG.

Using Variational Quantum Algorithm to Solve the LWE Problem.

The variational quantum algorithm (VQA) is a hybrid classical-quantum algorithm. It can actually run in an intermediate-scale quantum device where the number of available qubits is too limited to perform quantum error correction, so it is one of the most promising quantum algorithms in the noisy intermediate-scale quantum era. In this paper, two ideas for solving the learning with errors problem (LWE) using VQA are proposed.

Fixed-point oblivious quantum amplitude-amplification algorithm.

The quantum amplitude amplification algorithms based on Grover's rotation operator need to perform phase flips for both the initial state and the target state. When the initial state is oblivious, the phase flips will be intractable, and we need to adopt oblivious amplitude amplification algorithm to handle. Without knowing exactly how many target items there are, oblivious amplitude amplification also suffers the "soufflé problem", in which iterating too little "undercooks" the state and too much "overcooks" the state, both resulting in a mostly non-target final state.

Quantum Circuit Optimization for Solving Discrete Logarithm of Binary Elliptic Curves Obeying the Nearest-Neighbor Constrained.

In this paper, we consider the optimization of the quantum circuit for discrete logarithm of binary elliptic curves under a constrained connectivity, focusing on the resource expenditure and the optimal design for quantum operations such as the addition, binary shift, multiplication, squaring, inversion, and division included in the point addition on binary elliptic curves. Based on the space-efficient quantum Karatsuba multiplication, the number of CNOTs in the circuits of inversion and division has been reduced with the help of the Steiner tree problem reduction. The optimized size of the CNOTs is related to the minimum degree of the connected graph.

Quantum random number generator using a cloud superconducting quantum computer based on source-independent protocol.

Quantum random number generator (QRNG) relies on the intrinsic randomness of quantum mechanics to produce true random numbers which are important in information processing tasks. Due to the presence of the superposition state, a quantum computer can be used as a true random number generator. However, in practice, the implementation of the quantum computer is subject to various noise sources, which affects the randomness of the generated random numbers.