Search

We introduce a hierarchy of tests satisfied by any probability distribution $P$ that represents the quantum correlations generated in prepare-and-measure (P\&M) quantum chain-shaped networks, assuming only the inner-product information of the non-orthogonal quantum states. The P\&M quantum chain-shaped networks involve multiple measurement parties, each measurement party potentially having multiple sequential receivers. Specifically, we adapt the original NPA-hierarchy by incorporating a finite number of linear and positive semi-definite constraints to characterize the quantum correlations in P\&M quantum chain-shaped networks. These constraints in each hierarchy are derived from sequential measurement operators and the inner-product matrix of the non-orthogonal quantum states. We apply the adapted NPA-hierarchy to tackle some quantum information tasks, including sequential quantum random access codes (QRACs) and randomness certification. First, we derive the optimal trade-off between the two sequential receivers in the $2 \to 1$ sequential QRACs. Furthermore, we have investigated semi-device-independent randomness certification in the double violation region of $2 \to 1$ sequential QRACs. Second, considering the presence of eavesdropper (Eve) in actual communication, we show how much global and local randomness can be certified using the optimal trade-off of $2 \to 1$ sequential QRACs. Additionally, we quantify the amount of local and global randomness that can be certified from the complete probabilities generated by the two sequential receivers. We conclude that utilizing the complete set of probabilities certifies more local and global randomness than relying solely on the optimal trade-off relationship.

Recently, text-to-3D approaches have achieved high-fidelity 3D content generation using text description. However, the generated objects are stochastic and lack fine-grained control. Sketches provide a cheap approach to introduce such fine-grained control. Nevertheless, it is challenging to achieve flexible control from these sketches due to their abstraction and ambiguity. In this paper, we present a multi-view sketch-guided text-to-3D generation framework (namely, Sketch2NeRF) to add sketch control to 3D generation. Specifically, our method leverages pretrained 2D diffusion models (e.g., Stable Diffusion and ControlNet) to supervise the optimization of a 3D scene represented by a neural radiance field (NeRF). We propose a novel synchronized generation and reconstruction method to effectively optimize the NeRF. In the experiments, we collected two kinds of multi-view sketch datasets to evaluate the proposed method. We demonstrate that our method can synthesize 3D consistent contents with fine-grained sketch control while being high-fidelity to text prompts. Extensive results show that our method achieves state-of-the-art performance in terms of sketch similarity and text alignment., Comment: 11 pages, 9 figures

In the standard Bell scenario, when making a local projective measurement on each system component, the amount of randomness generated is restricted. However, this limitation can be surpassed through the implementation of sequential measurements. Nonetheless, a rigorous definition of random numbers in the context of sequential measurements is yet to be established, except for the lower quantification in device-independent scenarios. In this paper, we define quantum intrinsic randomness in sequential measurements and quantify the randomness in the Collins-Gisin-Linden-Massar-Popescu (CGLMP) inequality sequential scenario. Initially, we investigate the quantum intrinsic randomness of the mixed states under sequential projective measurements and the intrinsic randomness of the sequential positive-operator-valued measure (POVM) under pure states. Naturally, we rigorously define quantum intrinsic randomness under sequential POVM for arbitrary quantum states. Furthermore, we apply our method to one-Alice and two-Bobs sequential measurement scenarios, and quantify the quantum intrinsic randomness of the maximally entangled state and maximally violated state by giving an extremal decomposition. Finally, using the sequential Navascues-Pironio-Acin (NPA) hierarchy in the device-independent scenario, we derive lower bounds on the quantum intrinsic randomness of the maximally entangled state and maximally violated state., Comment: 26 pages 5 figures

Self-testing, which refers to device independent characterization of the state and the measurement, enables the security of quantum information processing task certified independently of the operation performed inside the devices. Quantum states lie in the core of self-testing as key resources. However, for the different entangled states, usually different measurement settings should be taken in self-testing recipes. This may lead to the redundancy of measurement resources. In this work, we use fixed two-binary measurements and answer the question that what states can be self-tested with the same settings. By investigating the structure of generalized tilted-CHSH Bell operators with sum of squares decomposition method, we show that a family of two-qubit entangled states can be self-tested by the same measurement settings. The robustness analysis indicates that our scheme is feasible for practical experiment instrument. Moreover, our results can be applied to various quantum information processing tasks.

Entangled two-qubit states are the core building blocks for constructing quantum communication networks. Their accurate verification is crucial to the functioning of the networks, especially for untrusted networks. In this work we study the self-testing of two-qubit entangled states via steering inequalities, with robustness analysis against noise. More precisely, steering inequalities are constructed from the tilted Clauser-Horne-Shimony-Holt inequality and its general form, to verify the general two-qubit entangled states. The study provides a good robustness bound, using both local extraction map and numerical semidefinite-programming methods. In particular, optimal local extraction maps are constructed in the analytical method, which yields the theoretical optimal robustness bound. To further improve the robustness of one-sided self-testing, we propose a family of three measurement settings steering inequalities. The result shows that three-setting steering inequality demonstrates an advantage over two-setting steering inequality on robust self-testing with noise. Moreover, to construct a practical verification protocol, we clarify the sample efficiency of our protocols in the one-sided device-independent scenario., Comment: 17pages, 6figures

Federated learning allows multiple participants to conduct joint modeling without disclosing their local data. Vertical federated learning (VFL) handles the situation where participants share the same ID space and different feature spaces. In most VFL frameworks, to protect the security and privacy of the participants' local data, a third party is needed to generate homomorphic encryption key pairs and perform decryption operations. In this way, the third party is granted the right to decrypt information related to model parameters. However, it isn't easy to find such a credible entity in the real world. Existing methods for solving this problem are either communication-intensive or unsuitable for multi-party scenarios. By combining secret sharing and homomorphic encryption, we propose a novel VFL framework without a third party called EFMVFL, which supports flexible expansion to multiple participants with low communication overhead and is applicable to generalized linear models. We give instantiations of our framework under logistic regression and Poisson regression. Theoretical analysis and experiments show that our framework is secure, more efficient, and easy to be extended to multiple participants., Comment: 9pages,2 figures

Bipartite and multipartite entangled states are basic ingredients for constructing quantum networks and their accurate verification is crucial to the functioning of the networks, especially for untrusted networks. Here we propose a simple approach for verifying the Bell state in an untrusted quantum network in which one party is not honest. Only local projective measurements are required for the honest party. It turns out each verification protocol is tied to a probability distribution on the Bloch sphere and its performance has an intuitive geometric meaning. This geometric picture enables us to construct the optimal and simplest verification protocols, which are also very useful to detecting entanglement in the untrusted network. Moreover, we show that our verification protocols can achieve almost the same sample efficiencies as protocols tailored to standard quantum state verification. Furthermore, we establish an intimate connection between the verification of Greenberger-Horne-Zeilinger states and the verification of the Bell state. By virtue of this connection we construct the optimal protocol for verifying Greenberger-Horne-Zeilinger states and for detecting genuine multipartite entanglement., Comment: 8+21 pages, 4+2 figures, and 1 table; published in npj Quantum Information

The robustness of deep neural networks (DNNs) against adversarial example attacks has raised wide attention. For smoothed classifiers, we propose the worst-case adversarial loss over input distributions as a robustness certificate. Compared with previous certificates, our certificate better describes the empirical performance of the smoothed classifiers. By exploiting duality and the smoothness property, we provide an easy-to-compute upper bound as a surrogate for the certificate. We adopt a noisy adversarial learning procedure to minimize the surrogate loss to improve model robustness. We show that our training method provides a theoretically tighter bound over the distributional robust base classifiers. Experiments on a variety of datasets further demonstrate superior robustness performance of our method over the state-of-the-art certified or heuristic methods.

Self-testing refers to a device-independent way to uniquely identify the state and the measurement for uncharacterized quantum devices. The only information required comprises the number of measurements, the number of outputs of each measurement, and the statistics of each measurement. Earlier results on self-testing of multipartite state were restricted either to Dicke states or graph states. In this paper, we propose self-testing schemes for a large family of symmetric three-qubit states, namely the superposition of W state and GHZ state. We first propose and analytically prove a self-testing criterion for the special symmetric state with equal coefficients of the canonical basis, by designing subsystem self-testing of partially and maximally entangled state simultaneously. Then we demonstrate for the general case, the states can be self-tested numerically by the swap method combining semi-definite programming (SDP) in high precision., Comment: 9 pages,3 figures

Quantum key distribution (QKD) based on coherent states is well known for its implementation simplicity, but it suffers from loss-dependent attacks based on optimal unambiguous state discrimination. Crucially, previous research has suggested that coherent-state QKD is limited to short distances, typically below 100 km assuming standard optical fiber loss and system parameters. In this work, we propose a six-coherent-state phase-encoding QKD protocol that is able to tolerate the total loss of up to 38 dB assuming realistic system parameters, and up to 56 dB loss assuming zero noise. The security of the protocol is calculated using a recently developed security proof technique based on semi-definite programming, which assumes only the inner-product information of the encoded coherent states, the expected statistics, and that the measurement is basis-independent. Our results thus suggest that coherent-state QKD could be a promising candidate for high-speed provably-secure QKD., Comment: 8 pages; 6 figures

Prepare-and-measure (P&M) quantum networks are the basic building blocks of quantum communication and cryptography. These networks crucially rely on non-orthogonal quantum encodings to distribute quantum correlations, thus enabling superior communication rates and information-theoretic security. Here, we present a computational toolbox that is able to efficiently characterise the set of input-output probability distributions for any discrete-variable P&M quantum network, assuming only the inner-product information of the quantum encodings. Our toolbox is thus highly versatile and can be used to analyse a wide range of quantum network protocols, including those that employ infinite-dimensional quantum code states. To demonstrate the feasibility and efficacy of our toolbox, we use it to reveal new results in multipartite quantum distributed computing and quantum cryptography. Taken together, these findings suggest that our method may have implications for quantum network information theory and the development of new quantum technologies., Comment: This version includes a new security analysis of coherent-one way quantum key distribution; Title and introduction have also been revised; Added new co-author (Emilien Lavie)

Self-testing refers to the possibility of characterizing uniquely (up to local isometries) the state and measurements contained in quantum devices, based only on the observed input-output statistics. Already in the basic case of the two-qubit singlet, self-testing is not unique: the two known criteria (the maximal violation of the CHSH inequality and the Mayers-Yao correlations) are not equivalent. It is unknown how many criteria there are. In this paper, we find the whole set of criteria for the ideal self-testing of singlet with two measurements and two outcomes on each side: it coincides with all the extremal points of the quantum set that can be obtained by measuring the singlet., Comment: 14 pages, 5 figures, 24 references