Assembling increasingly larger-scale defect-free optical-tweezer-trapped atom arrays is essential for quantum computation and quantum simulations based on atoms. Here, we propose an AI-enabled, rapid, constant-time-overhead rearrangement protocol, and we experimentally assemble defect-free 2D and 3D atom arrays with up to 2024 atoms with a constant-time cost of 60 ms. The AI model calculates the holograms for real-time atom rearrangement. With precise controls over both position and phase, a high-speed spatial light modulator moves all the atoms simultaneously. This protocol can be readily used to generate defect-free arrays of tens of thousands of atoms with current technologies and become a useful toolbox for quantum error correction.

Nonlocality and entanglement are not only the fundamental characteristics of quantum mechanics but also important resources for quantum information and computation applications. Exploiting the quantitative relationship between the two different resources is of both theoretical and practical significance. The common choice for quantifying the nonlocality of a two-qubit state is the maximal violation of the Clauser-Horne-Shimony-Holt inequality. That for entanglement is entanglement of formation, which is a function of the concurrence. In this paper, we systematically investigate the quantitative relationship between the entanglement and nonlocality of a general two-qubit system. We rederive a known upper bound on the nonlocality of a general two-qubit state, which depends on the state's entanglement. We investigate the condition that the nonlocality of two different two-qubit states can be optimally stimulated by the same nonlocality test setting and find the class of two-qubit state pairs that have this property. Finally, we obtain the necessary and sufficient condition that the upper bound can be reached.

Quantum entanglement is an indispensable resource for many significant quantum information processing tasks. However, in practice, it is difficult to distribute quantum entanglement over a long distance, due to the absorption and noise in quantum channels. A solution to this challenge is a quantum repeater, which can extend the distance of entanglement distribution. In this scheme, the time consumption of classical communication and local operations takes an important place with respect to time efficiency. Motivated by this observation, we consider a basic quantum repeater scheme that focuses on not only the optimal rate of entanglement concentration but also the complexity of local operations and classical communication. First, we consider the case where two different two-qubit pure states are initially distributed in the scenario. We construct a protocol with the optimal entanglement-concentration rate and less consumption of local operations and classical communication. We also find a criterion for the projective measurements to achieve the optimal probability of creating a maximally entangled state between the two ends. Second, we consider the case in which two general pure states are prepared and general measurements are allowed. We get an upper bound on the probability for a successful measurement operation to produce a maximally entangled state without any further local operations.

Quantum information processing protocols have great advantages over their classical counterparts, especially on cryptography. Secure multi-party computation is one of the most important issues and has been extensively studied in cryptography. It is of both theoretical and practical significance to develop the quantum information processing protocols for secure multi-party computation. In this paper, we consider the secure multi-party computation for n -variable polynomial functions over the finite field GF( d ). We propose two protocols using quantum resources to compute the function within a one-time execution. One is based on d -level mutually unbiased (orthonormal) bases with cyclic property and the other takes advantage of quantum Fourier transform. Analytical results show that the proposed protocols are secure against a passive adversary with unlimited computing power, including colluding attack mounted by n − 2 parties. We also implement the second protocol of the special case d = 2 on the IBM Q Experience. In principle, our proposals can be experimentally realized in the arbitrary d dimension with the advances in realizations and controls of high-dimensional quantum computation.