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.
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.
We simulate quantum spin systems and measure entanglement using circuits tailored for near-term quantum computers. Traditional tools like entanglement entropy are limited to pure states and require full state tomography, making them impractical on current hardware. Instead, we employ the novel approach, Positive Partial Transpose (PPT) criterion to efficiently detect pairwise entanglement from two-spin reduced density matrices, applicable to both pure and mixed states. This method enables scalable entanglement detection, providing a practical route to study quantum correlations, phase transitions, and benchmark quantum devices.
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.
Chapter 13 delves into the complex terrain of mixed-state entanglement, extending the discourse from pure-state entanglement to encompass the broader and more practical scenarios encountered in quantum systems. The chapter systematically explores the detection of entanglement in mixed states, introducing criteria and methods such as the Positive Partial Transpose (PPT) criterion and entanglement witnesses, which serve as diagnostic tools for identifying entanglement in a mixed quantum state. Furthermore, it addresses the quantification of entanglement in mixed states, discussing various measures like entanglement cost and distillable entanglement. These concepts highlight the operational aspects of entanglement, including its creation and extraction, within mixed-state frameworks. The chapter also introduces the notion of entanglement conversion distances, providing a quantitative approach to understanding the transformations between different entangled states.
The efficient detection of quantum entanglement is a central problem in quantum information processing. This paper systematically proposes a quantum circuit implementation scheme based on the Positive Partial Transpose (PPT) and the Computable Cross-Norm Realignment (CCNR) criteria, providing a complete quantum algorithmic pathway for efficient and computable entanglement detection. By encoding quantum states into specific forms and utilizing SWAP operations, complex matrix operations such as partial transpose and realignment are transformed into executable quantum circuits. Furthermore, by integrating an improved variational quantum singular value decomposition subroutine, the scheme enables the efficient estimation of the trace norm, thereby determining the existence of entanglement. Designed to operate within a hybrid quantum-classical framework, this scheme exhibits excellent scalability and practicality, offering a theoretical tool and methodological support for analyzing the entanglement structure of complex quantum systems on future intermediate-scale quantum devices.
Variational quantum algorithms have emerged as a powerful tool for harnessing the potential of near-term quantum devices to address complex challenges across quantum science and technology. Yet, the robust and scalable quantification of entanglement in many-body quantum systems remains a significant challenge, crucial for both advancing theoretical understanding and enabling practical applications. In this work, we propose a variational quantum algorithm to evaluate the M-partite geometric entanglement across arbitrary partitions of an N-qubit system into M parties. By constructing tailored variational ansatz circuits for both single- and multi-qubit parties, we optimize the overlap between a target quantum state and an M-partite variational separable state. This method provides a flexible and scalable approach for characterizing arbitrary M-partite entanglement in complex quantum systems of a given dimension. The accuracy of the proposed method is assessed by reproducing known analytical results. We further demonstrate its capability to evaluate entanglement among M parties for any given conventional or unconventional partitions of one- and two-dimensional spin systems, both near and at a quantum critical point. Our results establish the versatility of the variational approach in capturing different types of entanglement in various quantum systems, surpassing the capabilities of existing methods. Our approach offers a powerful methodology for advancing research in quantum information science, condensed matter physics, and quantum field theory. Additionally, we discuss its advantages, highlighting its adaptability to diverse system architectures in the context of near-term quantum devices.
One aspect of complexity for quantum many-body systems resides in their ability to exhibit entanglement, uniquely quantum correlations central to quantum computation. To quantitatively explore the diminishing effect that quantum noise has on entanglement resources, we focus on the negativity witness, an entanglement measure based on local time reversal transformations that provides a perfect witness in simple physical contexts. Beyond calculation of the negativity, we analyze the associated eigenvalue spectra of partially transposed density matrices for qudit-qudit bipartitions, finding that higher negativity rank provides greater(reduced) robustness to targeted(depolarizing) noise. In particular, we extend the maximum number of separable states that can be arbitrarily mixed into an entangled pure ensemble while retaining negativity to be exactly equal to the original negativity rank. Furthermore, we report how understanding the role of the negativity rank with respect to the completely depolarizing channel allows direct calculation of (1) certain noise boundaries for the Absolutely Positive Partial Transpose (APPT) subspace beyond which no unitary operator is capable of generating negativity and (2) the maximum qutrit-qutrit APPT purity. Beyond proving tight bounds and contributing to the ongoing search for APPT entanglement, these results expand our understanding of the nuanced relationship between computation with entanglement and practical environments for operating quantum devices.