Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Applied Mathematics and Physics

Fundamental Limit for Universal Entanglement Detection

Nikolay Raychev

Published Jan 1, 2016• 3 citations
Publisher

Abstract

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.

DOI
10.4236/jamp.2016.48166

Related papers

Tomography is Necessary for Universal Entanglement Detection with Single-Copy Observables

Dawei Lu, Tao Xin, Nengkun Yu +7 more

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.

arXiv:1511.00581•Physical Review Letters•Jun 7, 2016•53 citations

Extracting classical information from quantum states : fundamental limits, adaptive and finite-length measurements

Hye Won Chung

Motivated by the increasing demand for more powerful and efficient optical communication systems, quantum mechanics of information processing has become the key element in determining the fundamental limits of physical channels, and in designing quantum communication systems that approach those fundamental limits. To achieve higher data rates over quantum optical channels, we need to efficiently extract classical information from quantum states. However, peculiar properties of quantum states, such as the no-cloning theorem and the non-reversible measurement process, provide new challenges in the measurement of quantum states; in quantum information science, there is no concept analogous to sufficient statistics in classical information science. Therefore, to extract as much information as possible from quantum states, it is important to choose the right measurement process. In this thesis, we investigate the fundamental question of how to design the measurement process to efficiently extract information from quantum states. First, we consider adaptive measurement, with which we measure each received quantum state one at a time, and then update the next measurement process based on the previous observations. We show that for binary hypothesis testing between two ideal laser light pulses, if we update the adaptive measurement to maximize the communication efficiency at each instant, based on recursively updated knowledge of the receiver, then we can achieve the theoretical lower bound of the detection error probability. Using this viewpoint, we give a natural generalization of the adaptive measurement to general Mary hypothesis testing problems. We also analyze the information capacity with adaptive measurement, and compare the result with that for direct detection receivers and the ultimate capacity of quantum channels (the Holevo limit). We also investigate finite-blocklength joint receivers. The ultimate capacity of quantum channels is calculated under the assumption that an infinite number of quantum states can be collectively measured in one shot. However, this assumption becomes the primary barrier that prevents practical implementations of capacity-achieving joint detection receivers. The maximum number of classical information bits extracted per use of the quantum channel strictly increases with the number of channel outputs jointly measured at the receiver. This phenomenon is called strict superadditivity, and it has been thought of as a unique property that can be observed only in quantum channels, but not in classical discrete memoryless channels (DMCs). In this thesis, we introduce a new aspect of understanding strict superadditivity by comparing the performance of concatenated coding over quantum channels and classical DMCs, for a fixed inner code length. We show that the strict superadditivity in information rate occurs due to a loss of information from hard-decisions at the finite blocklength. We also find a lower bound on the maximum achievable information rate as a function of the length of the quantum measurement. The analysis and new insights into the measurement process of quantum states that we develop in this thesis can be used to improve not only current quantum optical communication systems, but also classical information processing, where the data is too big to be handled with sufficient statistics. Our work would help develop new concepts of efficient statistics that provide systematic ways to choose useful information among big data while discarding the rest.

•Jan 1, 2014•0 citations

Multipartite Entanglement Certification, With or Without Tomography

Nengkun Yu

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.

arXiv:1802.02648•IEEE Transactions on Information Theory•Jun 24, 2020•5 citations

Single-copy entanglement detection

Aleksandra Dimić, Borivoje Dakić

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.

arXiv:1705.06719•npj Quantum Information•Feb 6, 2018•58 citations

Valid and efficient entanglement verification with finite copies of a quantum state

Paweł Cieśliński, Jan Dziewior, Lukas Knips +5 more

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.

arXiv:2208.01983•npj Quantum Information•Jan 24, 2024•6 citations

Tight Bounds for Purity and Product Testing from Partial Transposition

Oren Akresh, Jacob Beckey

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.

quant-pharXiv:2608.27217•Aug 28, 2026•2 citations
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.
Motivated by the increasing demand for more powerful and efficient optical communication systems, quantum mechanics of information processing has become the key element in determining the fundamental limits of physical channels, and in designing quantum communication systems that approach those fundamental limits. To achieve higher data rates over quantum optical channels, we need to efficiently extract classical information from quantum states. However, peculiar properties of quantum states, such as the no-cloning theorem and the non-reversible measurement process, provide new challenges in the measurement of quantum states; in quantum information science, there is no concept analogous to sufficient statistics in classical information science. Therefore, to extract as much information as possible from quantum states, it is important to choose the right measurement process. In this thesis, we investigate the fundamental question of how to design the measurement process to efficiently extract information from quantum states. First, we consider adaptive measurement, with which we measure each received quantum state one at a time, and then update the next measurement process based on the previous observations. We show that for binary hypothesis testing between two ideal laser light pulses, if we update the adaptive measurement to maximize the communication efficiency at each instant, based on recursively updated knowledge of the receiver, then we can achieve the theoretical lower bound of the detection error probability. Using this viewpoint, we give a natural generalization of the adaptive measurement to general Mary hypothesis testing problems. We also analyze the information capacity with adaptive measurement, and compare the result with that for direct detection receivers and the ultimate capacity of quantum channels (the Holevo limit). We also investigate finite-blocklength joint receivers. The ultimate capacity of quantum channels is calculated under the assumption that an infinite number of quantum states can be collectively measured in one shot. However, this assumption becomes the primary barrier that prevents practical implementations of capacity-achieving joint detection receivers. The maximum number of classical information bits extracted per use of the quantum channel strictly increases with the number of channel outputs jointly measured at the receiver. This phenomenon is called strict superadditivity, and it has been thought of as a unique property that can be observed only in quantum channels, but not in classical discrete memoryless channels (DMCs). In this thesis, we introduce a new aspect of understanding strict superadditivity by comparing the performance of concatenated coding over quantum channels and classical DMCs, for a fixed inner code length. We show that the strict superadditivity in information rate occurs due to a loss of information from hard-decisions at the finite blocklength. We also find a lower bound on the maximum achievable information rate as a function of the length of the quantum measurement. The analysis and new insights into the measurement process of quantum states that we develop in this thesis can be used to improve not only current quantum optical communication systems, but also classical information processing, where the data is too big to be handled with sufficient statistics. Our work would help develop new concepts of efficient statistics that provide systematic ways to choose useful information among big data while discarding the rest.
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.