The entanglement, one of the central mysteries of the quantum mechanics, plays a significant role in a variety of applications of the quantum information theory. A natural question in theoretical and experimental importance is whether it is possible to detect a universal entanglement without full diagnostics. The diagnostics relies on a set of quantum trajectories and their records from measurements. This model reflects the probability that each of the measurements may be damaged from interference and decoherence, and may also be associated with recording of continuous signals for an end-time period. The goal is then to retrieve the quantum state such as it had been in the beginning of this measurement process. The proposed solution relies on explicit expression of the probability function through effective matrices contained in the quantum approximation and solutions of ad-joint quantum filters. In this article, we prove а no-go theorem, which outlines this possibility for non-adaptive schemes, which use only single-copy measurements. We also examine in detail а previously conducted experiment, for which it is claimed that detects the entanglement of two-qubit states through adaptive single-copy measurements without full diagnostics. With the conduct of the experiment and the analysis of the data, we demonstrate that the information collected is really sufficient to reconstruct the state. These results reveal a fundamental limit of the single-copy measurements upon the entanglement detection, and provide a common framework for learning the detection of other interesting properties of the quantum states, such as the positivity of partial transposition and the k-symmetric-extendibility.
The entanglement, one of the central mysteries of the quantum mechanics, plays a significant role in a variety of applications of the quantum information theory. A natural question in theoretical and experimental importance is whether it is possible to detect a universal entanglement without full diagnostics. The diagnostics relies on a set of quantum trajectories and their records from measurements. This model reflects the probability that each of the measurements may be damaged from interference and decoherence, and may also be associated with recording of continuous signals for an end-time period. The goal is then to retrieve the quantum state such as it had been in the beginning of this measurement process. The proposed solution relies on explicit expression of the probability function through effective matrices contained in the quantum approximation and solutions of ad-joint quantum filters. In this article, we prove а no-go theorem, which outlines this possibility for non-adaptive schemes, which use only single-copy measurements. We also examine in detail а previously conducted experiment, for which it is claimed that detects the entanglement of two-qubit states through adaptive single-copy measurements without full diagnostics. With the conduct of the experiment and the analysis of the data, we demonstrate that the information collected is really sufficient to reconstruct the state. These results reveal a fundamental limit of the single-copy measurements upon the entanglement detection, and provide a common framework for learning the detection of other interesting properties of the quantum states, such as the positivity of partial transposition and the k-symmetric-extendibility.
Entanglement, one of the central mysteries of quantum mechanics, plays an essential role in numerous tasks of quantum information science. A natural question of both theoretical and experimental importance is whether universal entanglement detection can be accomplished without full state tomography. In this Letter, we prove a no-go theorem that rules out this possibility for nonadaptive schemes that employ single-copy measurements only. We also examine a previously implemented experiment [H. Park et al., Phys. Rev. Lett. 105, 230404 (2010)], which claimed to detect entanglement of two-qubit states via adaptive single-copy measurements without full state tomography. In contrast, our simulation and experiment both support the opposite conclusion that the protocol, indeed, leads to full state tomography, which supplements our no-go theorem. These results reveal a fundamental limit of single-copy measurements in entanglement detection and provide a general framework of the detection of other interesting properties of quantum states, such as the positivity of partial transpose and the k-symmetric extendibility.
Certifying multipartite entanglement is a fundamental task. Since n-qubit state is parameterized by 4n- 1 real numbers, it is interesting to design a measurement setup that detects multipartite entanglement with as little effort as possible, and at a minimum without fully revealing the whole information of the state, the so-called “tomography”. In this paper, we study the relationship between multipartite entanglement certification and tomography, with the constraint that only single-copy measurements are allowed. We show that by using nonadaptive single-copy measurements, universal entanglement detection, among all states, can not be accomplished without full state tomography. Moreover, we show that almost all multipartite correlations, including the genuine entanglement and the entanglement depth, require full state tomography to detect in this measurement setting. We also observe that universal entanglement detection, among pure states, can be accomplished using much fewer measurements than full state tomography even using only local measurements.
Abstract One of the main challenges of quantum information is the reliable verification of quantum entanglement. The conventional detection schemes require repeated measurement on a large number of identically prepared systems. This is hard to achieve in practice when dealing with large-scale entangled quantum systems. In this letter we formulate verification as a decision procedure, i.e., entanglement is seen as the ability of quantum system to answer certain “yes-no questions”. We show that for a variety of large quantum states even a single copy suffices to detect entanglement with a high probability by using local measurements. For example, a single copy of a 16-qubit k-producible state or one copy of 24-qubit linear cluster state suffices to verify entanglement with more than 95% confidence. Our method is applicable to many important classes of states, such as cluster states or ground states of local Hamiltonians in general.
Abstract Detecting entanglement in multipartite quantum states is an inherently probabilistic process, typically with a few measured samples. The level of confidence in entanglement detection quantifies the scheme’s validity via the probability that the signal comes from a separable state, offering a meaningful figure of merit for big datasets. Yet, with limited samples, avoiding experimental data misinterpretations requires considering not only the probabilities concerning separable states but also the probability that the signal came from an entangled state, i.e. the detection scheme’s efficiency. We demonstrate this explicitly and apply a general method to optimize both the validity and the efficiency in small data sets providing examples using at most 20 state copies. The method is based on an analytical model of finite statistics effects on correlation functions which takes into account both a Frequentist as well as a Bayesian approach and is applicable to arbitrary entanglement witnesses.
Coherent measurements across multiple copies of an unknown quantum state can substantially reduce the number of samples required to learn its properties, but remain experimentally challenging. Current experiments typically prepare and measure one copy at a time, potentially adapting later measurements to earlier outcomes. A central challenge is adaptivity, which makes the space of possible measurement strategies difficult to characterize. The positive-partial-transpose (PPT) relaxation bypasses this complexity by considering a larger, mathematically tractable class of measurements, at the risk of weakening the resulting bounds. Here we show, surprisingly, that the relaxation loses nothing at the level of asymptotic sample complexity for two fundamental tasks: purity testing and product testing. In both cases, lower bounds against the full class of PPT measurements are matched by nonadaptive single-copy protocols. Moreover, our proof requires only basic symmetric subspace identities, providing a simple route to sharp lower bounds for adaptive single-copy measurements.
Abstract Quantum entanglement, resulting in correlations between subsystems that are stronger than any possible classical correlation, is one of the mysteries of quantum mechanics. Entanglement cannot be increased by any local operation, and for a sufficiently large many-body quantum system there exist infinitely many different entanglement classes, i.e., states that are not related by stochastic local operations and classical communications. On the other hand, the method of entanglement polytopes results in finitely many coarse-grained types of entanglement that can be detected by only measuring single-particle spectra. We find, however, that with high probability the local spectra lie in more than one polytope, hence providing only partial information about the entanglement type. To overcome this problem, we propose to additionally use so-called local filters, which are non-unitary local operations. We experimentally demonstrate the detection of entanglement polytopes in a four-qubit system. Using local filters we can distinguish the entanglement type of states with the same single particle spectra, but which belong to different polytopes.