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

arXiv:2605.14515

Spin chirality across quantum state copies detects hidden entanglement

Patrycja Tulewicz, Karol Bartkiewicz, Franco Nori

quant-phSubmitted May 14, 2026• Announced May 15, 2026• 0 citations
arXivHTMLPDF

Abstract

Entanglement can hide in two fundamentally different ways. First, multi-copy correlations can carry information that no single-copy measurement on an unknown state is able to access. Second, bound entangled states possess a positive partial transpose, which makes them invisible to the Peres-Horodecki criterion and all moment inequalities that depend on it. Here we show that the moment difference between the partial transpose and purity decomposes exactly as a chirality-chirality correlator, where the relevant operator is the scalar spin chirality -- the same quantity that governs chiral spin liquids and the topological Hall effect. This decomposition identifies the specific physical structure that multi-copy entanglement detection probes. Using the same controlled-SWAP circuits, we develop a multi-channel spectral classifier for bound entanglement. The classifier combines realignment spectral features with chirality corrections and achieves 99.9% recall at zero false positives across all three known 3x3 bound entangled families, compared with ~40% for the CCNR criterion alone. We also introduce a marginal-noise construction that produces CCNR-invisible bound entangled states, which the classifier detects but which remain invisible to all single-parameter criteria. We validate our approach experimentally on three IBM Quantum processors and demonstrate negativity reconstruction with mean errors of 0.002-0.027, chirality detection for pure and mixed entangled states, and bound entanglement detection across two structurally distinct families (Horodecki and chessboard) on a single gate-based superconducting processor.

Comments
Main text: 16 pages, 3 figures. Supplementary Information: 46 pages, 12 figures, 18 tables

Related papers

Quantum correlations and exceptional points in superconducting processors: collective measurements, generative learning, and dynamical control

Patrycja Tulewicz

Quantum systems are inherently linear at the level of their evolution equations, yet the properties that make them useful for computation, communication, and sensing are profoundly nonlinear.Entanglement cannot be captured by any single linear observable; generating a state with prescribed quantum correlations requires navigating a highly non-convex optimization landscape; and the dynamics of open quantum systems can develop singularities in parameter space that have no counterpart in ordinary Hermitian physics.This dissertation addresses all three aspects of this nonlinearity on current superconducting quantum hardware: how to measure it efficiently, how to generate it deliberately, and how to exploit it as a resource rather than treat it as an obstacle.The characterization problem is addressed in Chapter 2 through a family of multicopy measurement protocols that operate on pairs or small sets of identically prepared state copies rather than on a single copy at a time.This approach reduces the number of measurement settings required to estimate entanglement from the exponential cost of full quantum state tomography, reducing the exponent base from 4 n to 2 n in the number of qubits, with a verified 67% reduction in overhead for two-qubit systems on IBM Quantum hardware.A central result of this chapter is the identification of partial-transpose moments as chirality-chirality correlators: the difference between partial-transpose and purity moments encodes the scalar spin chirality, a quantity familiar from condensed-matter physics as the order parameter of chiral spin liquids.This connection provides a physical interpretation for an otherwise abstract algebraic operation, and it extends naturally to bound entanglement detection through the realignment non-Hermiticity gap.Using the same controlled-SWAP circuit infrastructure, a multi-channel spectral classifier detects bound entanglement across all three known families of 3 × 3 positive-partial-transpose entangled states, including states invisible to any single realignment criterion, achieving 99.6% cross-validated recall at zero false positives in simulation and 94% recall on ibm_fez hardware.This is the first family-agnostic demonstration of bound entanglement detection on a gate-based superconducting processor.Gröbner basis decision trees provide an additional route to negativity estimation, converting spectral moments into entanglement values adaptively and achieving a five-to sevenfold reduction in measurement settings relative to full tomography.

•Jan 1, 2026•0 citations

Symmetry-resolved entanglement detection using partial transpose moments

Antoine Neven, José A. Carrasco, Vittorio Vitale +8 more

Abstract We propose an ordered set of experimentally accessible conditions for detecting entanglement in mixed states. The k -th condition involves comparing moments of the partially transposed density operator up to order k . Remarkably, the union of all moment inequalities reproduces the Peres-Horodecki criterion for detecting entanglement. Our empirical studies highlight that the first four conditions already detect mixed state entanglement reliably in a variety of quantum architectures. Exploiting symmetries can help to further improve their detection capabilities. We also show how to estimate moment inequalities based on local random measurements of single state copies (classical shadows) and derive statistically sound confidence intervals as a function of the number of performed measurements. Our analysis includes the experimentally relevant situation of drifting sources, i.e. non-identical, but independent, state copies.

arXiv:2103.07443•npj Quantum Information•Oct 20, 2021•212 citations

Further results on entanglement detection and quantification from the correlation matrix criterion

Julio I de Vicente

The correlation matrix (CM) criterion is a recently derived powerful sufficient condition for the presence of entanglement in bipartite quantum states of arbitrary dimensions. It has been shown that it can be stronger than the positive partial transpose (PPT) criterion, as well as the computable cross norm or realignment (CCNR) criterion in different situations. However, it remained as an open question whether there existed sets of states for which the CM criterion could be stronger than both criteria simultaneously. Here, we give an affirmative answer to this question by providing examples of entangled states that scape detection by both the PPT and CCNR criteria whose entanglement is revealed by the CM condition. We also show that the CM can be used to measure the entanglement of pure states and obtain lower bounds for the entanglement measure known as tangle for general (mixed) states.

arXiv:0705.2583•Journal of Physics A Mathematical and Theoretical•Jan 29, 2008•79 citations

Quantifying mixed-state entanglement via partial transpose and realignment moments

Poetri Sonya Tarabunga, Tobias Haug

Entanglement plays a crucial role in quantum information science and many-body physics, yet quantifying it in mixed quantum many-body systems has remained a notoriously difficult problem. Here, we introduce families of quantitative entanglement witnesses, constructed from partial transpose and realignment moments, which provide rigorous bounds on entanglement monotones as well as entanglement dimensionality. Our witnesses can be efficiently measured using SWAP tests or variants of Bell measurements, thus making them directly implementable on current hardware. Leveraging our witnesses, we present several novel results on entanglement properties of mixed states, both in quantum information and many-body physics. We develop efficient algorithms to test whether mixed states with bounded entropy have low or high entanglement, which previously was only possible for pure states. We also provide an efficient algorithm to test the Schmidt rank using only two-copy measurements, and the operator Schmidt rank using four-copy measurements. Further, our witnesses robustly certify the quantum circuit depth in the presence of noise, as well as the Schmidt rank of mixed states. Finally, we show that the entanglement phase diagram of Haar random states, quantified by the partial transpose negativity, can be fully established solely by computing our witness, a result that also applies to any state 4 -design. Our witnesses can also be efficiently computed for matrix product states, thus enabling the characterization of entanglement in extensive many-body systems. Finally, we make progress on the entanglement required for quantum cryptography, establishing rigorous limits on pseudoentanglement and pseudorandom density matrices with bounded entropy. Our work opens new avenues for quantifying entanglement in large and noisy quantum systems.

arXiv:2507.13840•Quantum•Aug 19, 2026•14 citations

Probing two-spin entanglement at quantum criticality on a quantum processor

Anshumitra Baul, Xiao Xiao, Phillip C. Lotshaw

Quantum phase transitions in many-body systems give rise to highly entangled states, and understanding their quantum correlations is crucial for characterizing quantum materials. However, traditional entanglement measures such as entanglement entropy are difficult to interpret for noisy or mixed states and require complex circuits to evaluate. Therefore, we explore the Positive Partial Transpose (PPT) criterion, coupled with overlapping state tomography, as an efficient and scalable spin-spin entanglement witness. It detects pairwise entanglement from reduced density matrices, distinguishes quantum from classical correlations, and applies to both pure and mixed states. It is ideal for studying condensed matter systems prepared on noisy quantum devices as well as future extensions to finite temperatures. We demonstrate the approach on quantum hardware, using variational circuits to prepare quantum critical states with up to 20 qubits and completely map their two-spin entanglement across various quantum phase transitions.

quant-pharXiv:2607.08967•Jul 13, 2026•1 citation

Quantum Entanglement and Its Quantification

M. S. Ramkarthik, Payal D. Solanki

A complete chapter on quantum entanglement measures and detection of entanglement is given because there are a wide variety of entanglement measures for pure and mixed states which are used very often. The interesting feature of these routines is the fact that, these operations can be done between any random set of qubits not necessarily contiguous qubits. Key recipes to perform operations like partial tracing and partial transpose are disscussed in detail. After that, it was decided to devote several routines to calculate the entanglement measures like concurrence and its variants, von Neumann entropy, block entropy, Renyi entropy, Q measure, negativity and log negativity, entanglement spectrum and residual entanglement (three tangle). Last but not least, certain entanglement detection procedures like Positive Partial Transpose (the Peres-Horodecki criteria) and the reduction criteria are also explained via examples.

CRC Press eBooks•Jun 29, 2021•0 citations
Entanglement can hide in two fundamentally different ways. First, multi-copy correlations can carry information that no single-copy measurement on an unknown state is able to access. Second, bound entangled states possess a positive partial transpose, which makes them invisible to the Peres-Horodecki criterion and all moment inequalities that depend on it. Here we show that the moment difference between the partial transpose and purity decomposes exactly as a chirality-chirality correlator, where the relevant operator is the scalar spin chirality -- the same quantity that governs chiral spin liquids and the topological Hall effect. This decomposition identifies the specific physical structure that multi-copy entanglement detection probes. Using the same controlled-SWAP circuits, we develop a multi-channel spectral classifier for bound entanglement. The classifier combines realignment spectral features with chirality corrections and achieves 99.9% recall at zero false positives across all three known 3x3 bound entangled families, compared with ~40% for the CCNR criterion alone. We also introduce a marginal-noise construction that produces CCNR-invisible bound entangled states, which the classifier detects but which remain invisible to all single-parameter criteria. We validate our approach experimentally on three IBM Quantum processors and demonstrate negativity reconstruction with mean errors of 0.002-0.027, chirality detection for pure and mixed entangled states, and bound entanglement detection across two structurally distinct families (Horodecki and chessboard) on a single gate-based superconducting processor.
Quantum systems are inherently linear at the level of their evolution equations, yet the properties that make them useful for computation, communication, and sensing are profoundly nonlinear.Entanglement cannot be captured by any single linear observable; generating a state with prescribed quantum correlations requires navigating a highly non-convex optimization landscape; and the dynamics of open quantum systems can develop singularities in parameter space that have no counterpart in ordinary Hermitian physics.This dissertation addresses all three aspects of this nonlinearity on current superconducting quantum hardware: how to measure it efficiently, how to generate it deliberately, and how to exploit it as a resource rather than treat it as an obstacle.The characterization problem is addressed in Chapter 2 through a family of multicopy measurement protocols that operate on pairs or small sets of identically prepared state copies rather than on a single copy at a time.This approach reduces the number of measurement settings required to estimate entanglement from the exponential cost of full quantum state tomography, reducing the exponent base from 4 n to 2 n in the number of qubits, with a verified 67% reduction in overhead for two-qubit systems on IBM Quantum hardware.A central result of this chapter is the identification of partial-transpose moments as chirality-chirality correlators: the difference between partial-transpose and purity moments encodes the scalar spin chirality, a quantity familiar from condensed-matter physics as the order parameter of chiral spin liquids.This connection provides a physical interpretation for an otherwise abstract algebraic operation, and it extends naturally to bound entanglement detection through the realignment non-Hermiticity gap.Using the same controlled-SWAP circuit infrastructure, a multi-channel spectral classifier detects bound entanglement across all three known families of 3 × 3 positive-partial-transpose entangled states, including states invisible to any single realignment criterion, achieving 99.6% cross-validated recall at zero false positives in simulation and 94% recall on ibm_fez hardware.This is the first family-agnostic demonstration of bound entanglement detection on a gate-based superconducting processor.Gröbner basis decision trees provide an additional route to negativity estimation, converting spectral moments into entanglement values adaptively and achieving a five-to sevenfold reduction in measurement settings relative to full tomography.
Abstract We propose an ordered set of experimentally accessible conditions for detecting entanglement in mixed states. The k -th condition involves comparing moments of the partially transposed density operator up to order k . Remarkably, the union of all moment inequalities reproduces the Peres-Horodecki criterion for detecting entanglement. Our empirical studies highlight that the first four conditions already detect mixed state entanglement reliably in a variety of quantum architectures. Exploiting symmetries can help to further improve their detection capabilities. We also show how to estimate moment inequalities based on local random measurements of single state copies (classical shadows) and derive statistically sound confidence intervals as a function of the number of performed measurements. Our analysis includes the experimentally relevant situation of drifting sources, i.e. non-identical, but independent, state copies.
The correlation matrix (CM) criterion is a recently derived powerful sufficient condition for the presence of entanglement in bipartite quantum states of arbitrary dimensions. It has been shown that it can be stronger than the positive partial transpose (PPT) criterion, as well as the computable cross norm or realignment (CCNR) criterion in different situations. However, it remained as an open question whether there existed sets of states for which the CM criterion could be stronger than both criteria simultaneously. Here, we give an affirmative answer to this question by providing examples of entangled states that scape detection by both the PPT and CCNR criteria whose entanglement is revealed by the CM condition. We also show that the CM can be used to measure the entanglement of pure states and obtain lower bounds for the entanglement measure known as tangle for general (mixed) states.
Entanglement plays a crucial role in quantum information science and many-body physics, yet quantifying it in mixed quantum many-body systems has remained a notoriously difficult problem. Here, we introduce families of quantitative entanglement witnesses, constructed from partial transpose and realignment moments, which provide rigorous bounds on entanglement monotones as well as entanglement dimensionality. Our witnesses can be efficiently measured using SWAP tests or variants of Bell measurements, thus making them directly implementable on current hardware. Leveraging our witnesses, we present several novel results on entanglement properties of mixed states, both in quantum information and many-body physics. We develop efficient algorithms to test whether mixed states with bounded entropy have low or high entanglement, which previously was only possible for pure states. We also provide an efficient algorithm to test the Schmidt rank using only two-copy measurements, and the operator Schmidt rank using four-copy measurements. Further, our witnesses robustly certify the quantum circuit depth in the presence of noise, as well as the Schmidt rank of mixed states. Finally, we show that the entanglement phase diagram of Haar random states, quantified by the partial transpose negativity, can be fully established solely by computing our witness, a result that also applies to any state 4 -design. Our witnesses can also be efficiently computed for matrix product states, thus enabling the characterization of entanglement in extensive many-body systems. Finally, we make progress on the entanglement required for quantum cryptography, establishing rigorous limits on pseudoentanglement and pseudorandom density matrices with bounded entropy. Our work opens new avenues for quantifying entanglement in large and noisy quantum systems.
Quantum phase transitions in many-body systems give rise to highly entangled states, and understanding their quantum correlations is crucial for characterizing quantum materials. However, traditional entanglement measures such as entanglement entropy are difficult to interpret for noisy or mixed states and require complex circuits to evaluate. Therefore, we explore the Positive Partial Transpose (PPT) criterion, coupled with overlapping state tomography, as an efficient and scalable spin-spin entanglement witness. It detects pairwise entanglement from reduced density matrices, distinguishes quantum from classical correlations, and applies to both pure and mixed states. It is ideal for studying condensed matter systems prepared on noisy quantum devices as well as future extensions to finite temperatures. We demonstrate the approach on quantum hardware, using variational circuits to prepare quantum critical states with up to 20 qubits and completely map their two-spin entanglement across various quantum phase transitions.
A complete chapter on quantum entanglement measures and detection of entanglement is given because there are a wide variety of entanglement measures for pure and mixed states which are used very often. The interesting feature of these routines is the fact that, these operations can be done between any random set of qubits not necessarily contiguous qubits. Key recipes to perform operations like partial tracing and partial transpose are disscussed in detail. After that, it was decided to devote several routines to calculate the entanglement measures like concurrence and its variants, von Neumann entropy, block entropy, Renyi entropy, Q measure, negativity and log negativity, entanglement spectrum and residual entanglement (three tangle). Last but not least, certain entanglement detection procedures like Positive Partial Transpose (the Peres-Horodecki criteria) and the reduction criteria are also explained via examples.