Search

Entanglement plays an indispensable role in numerous quantum information and quantum computation tasks, underscoring the need for efficiently verifying entangled states. In recent years, quantum state verification has received increasing attention, yet the challenge of addressing noise effects in implementing this approach remains unsolved. In this work, we provide a systematic assessment of the performance of quantum state verification protocols in the presence of measurement noise. Based on the analysis, a necessary and sufficient condition is provided to uniquely identify the target state under noisy measurements. Moreover, we propose a symmetric hypothesis testing verification algorithm with noisy measurements. Subsequently, using a noisy nonadaptive verification strategy of GHZ and stabilizer states, the noise effects on the verification efficiency are illustrated. From both analytical and numerical perspectives, we demonstrate that the noisy verification protocol exhibits a negative quadratic relationship between the sample complexity and the infidelity. Our method can be easily applied to real experimental settings, thereby demonstrating its promising prospects., Comment: 12 pages, 5 figures; Comments are welcome!

Topological insulators have been studied intensively over the last decades. Among these materials, three-dimensional (3D) zirconium pentatelluride (ZrTe$_5$) stands out as one of the most intriguing for both theoretical and experimental studies because of its diverse range of distinct topological phases. In this work, we employ density functional theory to study the electronic structure and quantum oscillations exhibited by various topological phases of 3D bulk ZrTe$_5$. We have discovered that by analyzing combined patterns in band structures, Fermi surfaces, and Shubnikov-de Haas (SdH) oscillations we can determine the corresponding topological phase without relying on the conventional calculation of topological invariants or boundary state contributions. This approach facilitates the identification of topological phases in ZrTe$_5$ directly from experimental quantum oscillation measurements. Using this method, we have analyzed the entire process of topological phase transition, revealing changes in the topology of the Fermi pockets and validating the shapes deduced from the experimental data for the topological phases.

Text-to-image (T2I) models can be maliciously used to generate harmful content such as sexually explicit, unfaithful, and misleading or Not-Safe-for-Work (NSFW) images. Previous attacks largely depend on the availability of the diffusion model or involve a lengthy optimization process. In this work, we investigate a more practical and universal attack that does not require the presence of a target model and demonstrate that the high-dimensional text embedding space inherently contains NSFW concepts that can be exploited to generate harmful images. We present the Jailbreaking Prompt Attack (JPA). JPA first searches for the target malicious concepts in the text embedding space using a group of antonyms generated by ChatGPT. Subsequently, a prefix prompt is optimized in the discrete vocabulary space to align malicious concepts semantically in the text embedding space. We further introduce a soft assignment with gradient masking technique that allows us to perform gradient ascent in the discrete vocabulary space. We perform extensive experiments with open-sourced T2I models, e.g. stable-diffusion-v1-4 and closed-sourced online services, e.g. DALLE2, Midjourney with black-box safety checkers. Results show that (1) JPA bypasses both text and image safety checkers (2) while preserving high semantic alignment with the target prompt. (3) JPA demonstrates a much faster speed than previous methods and can be executed in a fully automated manner. These merits render it a valuable tool for robustness evaluation in future text-to-image generation research.

Quantum entanglement is the essential resource for quantum communication and distributed information processing in a quantum network. However, the remote generation over a network suffers from inevitable transmission loss and other technical difficulties. This paper introduces the concept of entanglement buffers as a potential primitive for preparing long-distance entanglement. We investigate the filling of entanglement buffers with either one Bell state or a stream of Bell states. We illustrate their resilience to non-ideal interactions and transmission loss, making them sometimes more advantageous than other entanglement generation approaches in the quantum network scenario. Additionally, larger entanglement buffers can always enhance these benefits., Comment: 6+7 pages, 6+6 figures; comments and suggestions are welcome!

How can we analyze quantum correlations in large and noisy systems without quantum state tomography? An established method is to measure total angular momenta and employ the so-called spin-squeezing inequalities based on their expectations and variances. This allows detection of metrologically useful entanglement, but efficient strategies for estimating such nonlinear quantities have yet to be determined. In this paper we show that spin-squeezing inequalities can not only be evaluated by measurements of the total angular momentum but also by two-qubit correlations, either involving all pair correlations or randomly chosen pair correlations. Then we analyze the estimation errors of our approaches in terms of a hypothesis test. For this purpose, we discuss how error bounds can be derived for nonlinear estimators with the help of their variances, characterizing the probability of falsely detecting a separable state as entangled. We focus on the spin-squeezing inequalities in multiqubit systems. Our methods, however, can also be applied to spin-squeezing inequalities for qudits or for the statistical treatment of other nonlinear parameters of quantum states., Comment: 22 pages, 9 figures

Quantifying entanglement in quantum systems is an important yet challenging task due to its NP-hard nature. In this work, we propose an efficient algorithm for evaluating distance-based entanglement measures. Our approach builds on Gilbert's algorithm for convex optimization, providing a reliable upper bound on the entanglement of a given arbitrary state. We demonstrate the effectiveness of our algorithm by applying it to various examples, such as calculating the squared Bures metric of entanglement as well as the relative entropy of entanglement for GHZ states, $W$ states, Horodecki states, and chessboard states. These results demonstrate that our algorithm is a versatile and accurate tool that can quickly provide reliable upper bounds for entanglement measures., Comment: 7 pages, 4 figures; close to the published version

Tables are prevalent in real-world databases, requiring significant time and effort for humans to analyze and manipulate. The advancements in large language models (LLMs) have made it possible to interact with tables using natural language input, bringing this capability closer to reality. In this paper, we present TableGPT, a unified fine-tuned framework that enables LLMs to understand and operate on tables using external functional commands. It introduces the capability to seamlessly interact with tables, enabling a wide range of functionalities such as question answering, data manipulation (e.g., insert, delete, query, and modify operations), data visualization, analysis report generation, and automated prediction. TableGPT aims to provide convenience and accessibility to users by empowering them to effortlessly leverage tabular data. At the core of TableGPT lies the novel concept of global tabular representations, which empowers LLMs to gain a comprehensive understanding of the entire table beyond meta-information. By jointly training LLMs on both table and text modalities, TableGPT achieves a deep understanding of tabular data and the ability to perform complex operations on tables through chain-of-command instructions. Importantly, TableGPT offers the advantage of being a self-contained system rather than relying on external API interfaces. Moreover, it supports efficient data process flow, query rejection (when appropriate) and private deployment, enabling faster domain data fine-tuning and ensuring data privacy, which enhances the framework's adaptability to specific use cases., Comment: Technical Report

Tabular data pervades the landscape of the World Wide Web, playing a foundational role in the digital architecture that underpins online information. Given the recent influence of large-scale pretrained models like ChatGPT and SAM across various domains, exploring the application of pretraining techniques for mining tabular data on the web has emerged as a highly promising research direction. Indeed, there have been some recent works around this topic where most (if not all) of them are limited in the scope of a fixed-schema/single table. Due to the scale of the dataset and the parameter size of the prior models, we believe that we have not reached the ''BERT moment'' for the ubiquitous tabular data. The development on this line significantly lags behind the counterpart research domains such as natural language processing. In this work, we first identify the crucial challenges behind tabular data pretraining, particularly overcoming the cross-table hurdle. As a pioneering endeavor, this work mainly (i)-contributes a high-quality real-world tabular dataset, (ii)-proposes an innovative, generic, and efficient cross-table pretraining framework, dubbed as CM2, where the core to it comprises a semantic-aware tabular neural network that uniformly encodes heterogeneous tables without much restriction and (iii)-introduces a novel pretraining objective -- prompt Masked Table Modeling (pMTM) -- inspired by NLP but intricately tailored to scalable pretraining on tables. Our extensive experiments demonstrate CM2's state-of-the-art performance and validate that cross-table pretraining can enhance various downstream tasks., Comment: Accepted to WWW 2024

Topological insulators have been studied intensively over the last decades. Earlier research focused on Hermitian Hamiltonians, but recently, peculiar and interesting properties were found by introducing non-Hermiticity. In this work, we apply a quantum geometric approach to various Hermitian and non-Hermitian versions of the Su-Schrieffer-Heeger (SSH) model. We find that this method allows one to correctly identify different topological phases and topological phase transitions for all SSH models, but only when using the metric tensor containing both left and right eigenvectors. Whereas the quantum geometry of Hermitian systems is Riemannian, introducing non-Hermiticity leads to pseudo-Riemannian and complex geometries, thus significantly generalizing from the quantum geometries studied thus far. One remarkable example of this is the mathematical agreement between topological phase transition curves and lightlike paths in general relativity, suggesting a possibility of simulating space-times in non-Hermitian systems. We find that the metric in non-Hermitian phases degenerates in such a way that it effectively reduces the dimensionality of the quantum geometry by one. This implies that within linear response theory, one can perturb the system by a particular change of parameters while maintaining a zero excitation rate., Comment: v2 has added a change in the acknowledgment; v3 has added minimal changes and a few new references. Remarkably, the additional "i" in Eq. (25) has been removed; v4 is the published version on Physical Review Research

Quantum state verification (QSV) is the task of relying on local measurements only to verify that a given quantum device does produce the desired target state. Up to now, certain types of entangled states can be verified efficiently or even optimally by QSV. However, given an arbitrary entangled state, how to design its verification protocol remains an open problem. In this work, we present a systematic strategy to tackle this problem by considering the locality of what we initiate as the choice-independent measurement protocols, whose operators can be directly achieved when they are homogeneous. Taking several typical entangled states as examples, we show the explicit procedures of the protocol design using standard Pauli projections, demonstrating the superiority of our method for attaining better QSV strategies. Moreover, our framework can be naturally extended to other tasks such as the construction of entanglement witness, and even parameter estimation., Comment: 6+10 pages, 2 figures; close to the published version

Phosphorene, a novel member of the two-dimensional nanomaterial family, has been demonstrated a great potential in biomedical applications, such as photothermal therapy, drug delivery and antibacterial. However, phosphorene is unstable and easily oxidized in an aerobic environment. In this paper, using the larger-scale molecular dynamics simulations, we investigated the disruption of phosphorene oxide (PO) to the structure of a model protein, villin headpiece subdomain (HP35). It shows that the disruption of PO nanosheets to protein structure enhances with the increase of the oxidation concentration of PO, but the oxidation mode has almost no effect on the PO-HP35 interaction. At low oxidation concentration, PO is good biocompatibility to HP35. Oxygen atoms filled into the groove region in puckered surface of phosphorene enhances the dispersion interaction between phosphorene and HP35. Thus, oxidation enhances the destructive effect of phosphorene on the structure of HP35. These findings might shed light on understanding the biological toxicity of PO nanosheets and would be helpful for the future potential biomedical applications of PO nanosheets, such as nanodrugs and antibacterial agents., Comment: 20 pages,12 figures

From an operational point of view, we propose several new entanglement detection criteria using quantum designs. These criteria are constructed by considering the correlations defined with quantum designs. Counter-intuitively, the criteria with more settings are exactly equivalent to the corresponding ones with the minimal number of settings, namely the symmetric informationally complete positive operator-valued measures (SIC POVMs). Fundamentally, this observation highlights the potentially unique role played by SIC POVMs in quantum information processing. Experimentally, this provides the minimal number of settings that one should choose for detecting entanglement. Furthermore, we find that nonlinear criteria are not always better than linear ones for the task of entanglement detection., Comment: 8 pages, 2 figures; close to the published version

Continuous-variable quantum states are of particular importance in various quantum information processing tasks including quantum communication and quantum sensing. However, a bottleneck has emerged with the fast increasing in size of the quantum systems which severely hinders their efficient characterization. In this work, we establish a systematic framework for verifying entangled continuous-variable quantum states by employing local measurements only. Our protocol is able to achieve the unconditionally high verification efficiency which is quadratically better than quantum tomography as well as other nontomographic methods. Specifically, we demonstrate the power of our protocol by showing the efficient verification of entangled two-mode and multimode coherent states with local measurements., Comment: 7+11 pages, 2 figures, close to the published version

The efficient and reliable characterization of quantum states plays a vital role in most, if not all, quantum information processing tasks. In this work, we present a universally optimal protocol for verifying entangled states by employing the so-called quantum nondemolition measurements, such that the verification efficiency is equivalent to that of the optimal global strategy. Instead of being probabilistic as the standard verification strategies, our protocol is constructed sequentially, which is thus more favorable for experimental realizations. In addition, the target states are preserved in the protocol after each measurement, so can be reused in any subsequent tasks. We demonstrate the power of our protocol for the optimal verification of Bell states, arbitrary two-qubit pure states, and stabilizer states. We also prove that our protocol is able to perform tasks including fidelity estimation and state preparation., Comment: 6+6 pages, 1 figure, close to the published version