Parameter estimation is a pivotal task, where quantum technologies can enhance precision greatly. We investigate the time-dependent parameter estimation based on deep reinforcement learning, where the noise-free and noisy bounds of parameter estimation are derived from a geometrical perspective. We propose a physical-inspired linear time-correlated control ansatz and a general well-defined reward function integrated with the derived bounds to accelerate the network training for fast generating quantum control signals. In the light of the proposed scheme, we validate the performance of time-dependent and time-independent parameter estimation under noise-free and noisy dynamics. In particular, we evaluate the transferability of the scheme when the parameter has a shift from the true parameter. The simulation showcases the robustness and sample efficiency of the scheme and achieves the state-of-the-art performance. Our work highlights the universality and global optimality of deep reinforcement learning over conventional methods in practical parameter estimation of quantum sensing.

Making use of the general physical model of the Mach-Zehnder interferometer with photon loss which is a fundamental physical issue, we investigate the continuous-variable quantum phase estimation based on machine learning approach, and an efficient recursive Bayesian estimation algorithm for Gaussian states phase estimation has been proposed. With the proposed algorithm, the performance of the phase estimation may be improved distinguishably. For example, the physical limits (i.e., the standard quantum limit and Heisenberg limit) for the phase estimation precision may be reached in more efficient ways especially in the situation of the prior information being employed, the range for the estimated phase parameter can be extended from [0, π /2] to [0, 2 π ] compared with the conventional approach, and influences of the photon losses on the output parameter estimation precision may be suppressed dramatically in terms of saturating the lossy bound. In addition, the proposed algorithm can be extended to the time-variable or multi-parameter estimation framework.

No abstract

Continuous-variable (CV) measurement-device-independent (MDI) quantum key distribution (QKD) is immune to imperfect detection devices, which can eliminate all kinds of attacks on practical detectors. Here we first propose a CV-MDI QKD scheme using unidimensional modulation (UD) in general phase-sensitive channels. The UD CV-MDI QKD protocol is implemented with the Gaussian modulation of a single quadrature of the coherent states prepared by two legitimate senders, aiming to simplify the implementation compared with the standard, symmetrically Gaussian-modulated CV-MDI QKD protocol. Our scheme reduces the complexity of the system since it ignores the requirement in one of the quadrature modulations as well as the corresponding parameter estimations. The security of our proposed scheme is analyzed against collective attacks, and the finite-size analysis under realistic conditions is taken into account. UD CV-MDI QKD shows a comparable performance to that of its symmetrical counterpart, which will facilitate the simplification and practical implementation of the CV-MDI QKD protocols.

In an Ad hoc sensor network, nodes have characteristics of limited battery energy, self-organization and low mobility. Due to the mobility and heterogeneity of the energy consumption in the hierarchical network, the cluster head and topology are changed dynamically. Therefore, topology control and energy consumption are growing to be critical in enhancing the stability and prolonging the lifetime of the network. In order to improve the survivability of Ad hoc network effectively, this paper proposes a new algorithm named the robust, energy-efficient weighted clustering algorithm (RE2WCA). For the homogeneous of the energy consumption; the proposed clustering algorithm takes the residual energy and group mobility into consideration by restricting minimum iteration times. In addition, a distributed fault detection algorithm and cluster head backup mechanism are presented to achieve the periodic and real-time topology maintenance to enhance the robustness of the network. The network is analyzed and the simulations are performed to compare the performance of this new clustering algorithm with the similar algorithms in terms of cluster characteristics, lifetime, throughput and energy consumption of the network. The result shows that the proposed algorithm provides better performance than others.