Quantifying mixed-state entanglement via partial transpose and realignment moments

• URL: http://arxiv.org/abs/2507.13840v1
• Date: Fri, 18 Jul 2025 11:53:39 GMT
• Title: Quantifying mixed-state entanglement via partial transpose and realignment moments
• Authors: Poetri Sonya Tarabunga, Tobias Haug,
• Abstract summary: Entanglement plays a crucial role in quantum information science and many-body physics.<n>We introduce families of quantitative entanglement witnesses, constructed from partial realignment and transpose moments.<n>Our witnesses can be efficiently measured using SWAP tests or variants of Bell measurements.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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. 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 to test the operator Schmidt rank using four-copy measurements. Further, our witnesses enable robust certification of quantum circuit depth even in the presence of noise, a task which so far has been limited to noiseless circuits only. 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.

Related papers

• Detecting quantum non-Gaussianity with a single quadrature [0.5242869847419834]
  We show that the statistics of a single quadrature measurement can witness arbitrary degrees of non-Gaussianity as quantified by stellar rank.<n>We provide an analysis of sample complexity, noise robustness, and experimental prospects.
  arXiv  Detail & Related papers  (2025-07-30T18:09:46Z)
• Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
  Storing quantum information requires battling quantum decoherence, which results in a loss of information over time. To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another. We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
  arXiv  Detail & Related papers  (2024-07-08T12:46:08Z)
• Quantum Discord Witness With Uncharacterized Devices [22.915199593638874]
  We propose a new approach using uncharacterized measurements to witness quantum discord of an unknown bipartite state within arbitrary dimension system.<n>Our method exhibits high robustness against device imperfections, such as error tolerance, indicating its experimental feasibility.
  arXiv  Detail & Related papers  (2023-03-20T14:51:53Z)
• Measurement-induced entanglement and teleportation on a noisy quantum processor [105.44548669906976]
  We investigate measurement-induced quantum information phases on up to 70 superconducting qubits. We use a duality mapping, to avoid mid-circuit measurement and access different manifestations of the underlying phases. Our work demonstrates an approach to realize measurement-induced physics at scales that are at the limits of current NISQ processors.
  arXiv  Detail & Related papers  (2023-03-08T18:41:53Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Detecting and Eliminating Quantum Noise of Quantum Measurements [3.871198861387443]
  We first detect and then eliminate quantum noise so that the classical noise assumption is satisfied. We demonstrate the feasibility of the two-stage procedure numerically on Baidu Quantum Platform. Remarkably, the results show that quantum noise in measurement devices is significantly suppressed, and the quantum accuracy is substantially improved.
  arXiv  Detail & Related papers  (2022-06-28T03:58:10Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Certification of quantum states with hidden structure of their bitstrings [0.0]
  We propose a numerically cheap procedure to describe and distinguish quantum states. We show that it is enough to characterize quantum states with different structure of entanglement. Our approach can be employed to detect phase transitions of different nature in many-body quantum magnetic systems.
  arXiv  Detail & Related papers  (2021-07-21T06:22:35Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.