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:2610.13579

Correlation-Based Measurement of Entanglement in Rank-2 Mixed States

M. I. Samar, V. M. Tkachuk

quant-phSubmitted Oct 9, 2026• Announced Oct 12, 2026• 0 citations
arXivHTMLPDF

Abstract

We study correlation-based entanglement evaluation in rank-2 mixed states of two- and multi-qubit systems. The relevant two-dimensional subspace is treated as a logical qubit embedded in the physical Hilbert space, and factorizable realizations of its logical Pauli operators are classified. For two qubits, this yields nontrivial canonical encodings related by local Clifford transformations. The relation between logical and physical Bloch vectors admits a geometric interpretation as a transversely deformed Bloch sphere, leading to closed-form expressions for two-qubit concurrence and generalized concurrence across $N$-qubit bipartitions. The entanglement scaling factor is obtained directly from complementary-subsystem correlations, without prior calibration of state-preparation parameters. Noisy simulations using the IBM Quantum FakeKingston backend model, with readout-error mitigation and zero-noise extrapolation, confirm the analytical results up to $N=10$ qubits. The protocol therefore enables entanglement estimation from only a small number of measurement settings for this class of rank-2 logical states.

AI Summary

The paper asks when entanglement in a known two-dimensional logical subspace can be quantified from a few physical correlations rather than full tomography. It restricts attention to logical Pauli operators represented by single tensor products of local observables and satisfying the Pauli algebra on the full two-qubit Hilbert space. Within this class, the nontrivial triples contain one local operator and two two-qubit operators; three canonical choices are equivalent under local Clifford transformations and logical-axis relabeling. For the resulting two-qubit state families, tracing out one qubit scales the transverse logical Bloch components by $\cos\theta$. A triangle-inequality bound and an explicit saturating two-state decomposition establish the convex-roof concurrence $C(\rho)=\sin\theta\sqrt{(R^x)^2+(R^y)^2}$ in the canonical encoding with local logical $Z$. The scale factor is inferred from a complementary-qubit marginal, so only two local Pauli measurement settings are needed, without calibration of $\theta$. For a specified $N$-qubit construction and bipartition $A|B$, the same argument gives $C(\rho)=\sqrt{1-\eta^2}\sqrt{(R^x)^2+(R^y)^2}$, where $\eta=\prod_{j\in B}\cos\theta_j$ is measurable from the same settings. This family also satisfies $C^2=2(\mathrm{Tr}\rho^2-\mathrm{Tr}\rho_A^2)$. FakeKingston noisy simulations test two-, five-, and ten-qubit examples using readout mitigation and, at ten qubits, zero-noise extrapolation. The exact formulas require the specified logical-subspace structure, not merely rank two; the purity identity is likewise family-specific. The simulations use full assignment-matrix readout calibration as a benchmark, explicitly not a scalable mitigation scheme.

Little sign of AI-generated textIncrementalStrong assumptions

Error found: The noisy simulations benchmark recovery of ideal target-state concurrence, not the concurrence of the noisy outputs, whose support is not shown to remain within the logical subspace required by the exact formulas.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Geometric Measure of Entanglement of Rank-2 Mixed Multiqubit States and its Estimation on a Quantum Processor

N. A. Susulovska, Kh. P. Gnatenko

The geometric measure of entanglement of mixed states is investigated based on its relation to spin correlations. We derive an analytical expression for the entanglement of rank-2 mixed states composed of arbitrary multiqubit pure states within a two-dimensional Hilbert subspace. The dependence of the entanglement of rank-2 mixed multiqubit states on the parameters characterizing arbitrary pure states in the mixture is studied both analytically and using quantum computing. For a particular class of mixed states, namely, equal-probability mixtures of an arbitrary multiqubit state and the Schrödinger cat state, we construct quantum protocols for detecting the geometric measure of entanglement based on its relation to spin correlations. We quantify the entanglement using both the AerSimulator and the ibm_marrakesh quantum computer. The effects of quantum-computing errors are also analyzed. The simulation results reproduce the analytical dependencies, while measurements on the quantum device demonstrate good agreement with theoretical predictions within estimated error bounds.

quant-pharXiv:2610.06127•Oct 6, 2026•0 citations

Geometric interpretation of the triality relation in bipartite quantum systems

Pratidhwani Swain, Ramita Sarkar, Sukanta K. Tripathy +1 more

Abstract We investigate quantum correlations and coherence in bipartite systems using the universal triality relation that connects coherence, predictability, and entanglement. The geometric structure underlying entanglement in bipartite two-qubit and two-qutrit systems is analyzed using wedge products of post-measurement vectors. For two-qubit states, concurrence emerges naturally as the area spanned by the post-measurement vectors, while in qutrit systems the generalized I-concurrence is associated with higher-dimensional geometric structures formed by multiple wedge products. We further analyze the relationship between wedge products, eigenvalues, and eigenvectors of correlated systems and discuss the universality of the triality relation in arbitrary dimensions. Our results provide a geometric interpretation of entanglement in d -dimensional cases and reveal a hierarchical structure connecting low- and high-dimensional quantum systems.

Physica Scripta•Sep 7, 2026•0 citations

Scalable Quantum Error Mitigation with Physically Informed Graph Neural Networks

Huaxin Wang, Xinge Wu, Jiajun Liu +4 more

Quantum error mitigation (QEM) provides a practical route for estimating reliable observables on noisy intermediate-scale quantum (NISQ) devices. Traditional QEM strategies, including zero-noise extrapolation (ZNE) and Clifford data regression (CDR), rely on noise scaling or global regression, and their performance is constrained by the exponential growth of the system degrees of freedom. We construct a graph-enhanced mitigation (GEM) framework, which incorporates physical information into the model representation. In this work, quantum circuits are encoded as attributed graphs. Hardware-level physical information is mapped to node and edge features: local noise parameters such as calibration parameters $T_1$, $T_2$, and readout errors are encoded at nodes, while coupling-related information such as two-qubit gate errors is encoded as edge features. Graph neural networks are used to model how errors propagate along the physical coupling structure and build up into non-local correlations. This allows the model to capture local interactions and part of the resulting non-local correlations across qubits. A dual-branch affine correction is applied to maintain consistency with physical constraints. Experiments on 10-qubit and 16-qubit random circuits executed on superconducting quantum processors show that GEM provides a level of accuracy comparable to CDR at small scales, while yielding lower mean absolute error and improved stability in zero-shot transfer to larger systems. Results of the traditional QEM strategy indicate that global regression methods remain effective in low-dimensional settings but become less reliable as system degrees of freedom grow. In contrast, GEM makes use of local physical structures to show better scalability and generalization, while preserving the overall error propagation patterns. This work provides a practical scalable approach to QEM for NISQ devices.

quant-pharXiv:2604.16815•Quantum Machine Intelligence•Apr 21, 2026•1 citation

Comparing Zero-Noise Extrapolation Models on a 6-Qubit Grover's Algorithm

Prajwal Avadhani

Quantum computers have the potential to address computational problems beyond the practical capabilities of classical systems, but Noisy Intermediate-Scale Quantum (NISQ) processors remain limited by errors that accumulate during circuit execution. Quantum Error Mitigation (QEM), particularly Zero-Noise Extrapolation (ZNE), offers a way to reduce these errors without requiring additional physical qubits. However, ZNE has been studied extensively in relatively small or shallow circuits, leaving its effectiveness in deep, non-variational algorithms less explored. This project investigates whether combining readout mitigation and ZNE can mitigate errors in a deep, six-qubit Grover's search algorithm. The circuit was compiled onto IBM's 133-qubit FakeTorino simulated backend, reaching a depth of 1,118 and containing 369 entangling gates. Under simulated noise, the unmitigated probability of measuring the target state was 3.36%, compared with a uniform random-guessing probability of 1.5625%. Digital unitary gate folding and readout error mitigation were subsequently applied across four progressively increased noise-scaling sets (S1–S4), and scale factors. Four extrapolation models (Linear, Quadratic, Poly-Exponential, and Padé) were evaluated. The Poly-Exponential model achieved the highest average target-state probability, reaching 6.91% at S4, approximately 2.06 times the unmitigated probability. These results demonstrate that combining readout mitigation with ZNE can partially recover computational signals in deep quantum circuits under simulated hardware noise, suggesting the potential combined error mitigation techniques for improving the reliability of near-term quantum algorithms without active quantum error correction.

•Nov 13, 2026•0 citations

Efficient simulation of logical magic state preparation protocols

Samyak Surti, Lucas Daguerre, Isaac H. Kim

Developing space- and time-efficient logical magic state preparation protocols will likely be an essential step towards building a large-scale fault-tolerant quantum computer. Motivated by this need, we introduce a scalable method for simulating logical magic state preparation protocols under the standard circuit-level noise model. When applied to protocols based on code switching, magic state cultivation, and magic state distillation, our method yields a complexity polynomial in (i) the number of qubits and (ii) the non-stabilizerness, e.g., stabilizer rank or Pauli rank, of the target encoded magic state. The efficiency of our simulation method is rooted in a curious fact: every circuit-level Pauli error in these protocols propagates to a Clifford error at the end. This property is satisfied by a large family of protocols, including those that repeatedly measure a transversal Clifford that squares to a Pauli. We provide a proof-of-principle numerical simulation that prepares a magic state using such logical Clifford measurements. Our work enables practical simulation of logical magic state preparation protocols without resorting to approximations or resource-intensive state-vector simulations.

quant-pharXiv:2512.23799•PRX Quantum•Dec 31, 2025•13 citations

Entanglement and quantum correlation measures for quantum multipartite mixed states

Arthur Vesperini, Ghofrane Bel-Hadj-Aissa, Roberto Franzosi

Entanglement, and quantum correlation, are precious resources for quantum technologies implementation based on quantum information science, such as quantum communication, quantum computing, and quantum interferometry. Nevertheless, to our best knowledge, a directly or numerically computable measure for the entanglement of multipartite mixed states is still lacking. In this work, (i) we derive a measure of the degree of quantum correlation for mixed multipartite states. The latter possesses a closed-form expression valid in the general case unlike, to our best knowledge, all other known measures of quantum correlation. (ii) We further propose an entanglement measure, derived from this quantum correlation measure using a novel regularization procedure for the density matrix. Therefore, a comparison of the proposed measures, of quantum correlation and entanglement, allows one to distinguish between quantum correlation detached from entanglement and the one induced by entanglement and, hence, to identify separable but non-classical states. We have tested our quantum correlation and entanglement measures, on states well-known in literature: a general Bell diagonal state and the Werner states, which are easily tractable with our regularization procedure, and we have verified the accordance between our measures and the expected results for these states. Finally, we validate the two measures in two cases of multipartite states. The first is a generalization to three qubits of the Werner state, the second is a one-parameter three qubits mixed state interpolating between a bi-separable state and a genuine multipartite state, passing through a fully separable state.

arXiv:2205.07143•Scientific Reports•Feb 17, 2023•29 citations
We study correlation-based entanglement evaluation in rank-2 mixed states of two- and multi-qubit systems. The relevant two-dimensional subspace is treated as a logical qubit embedded in the physical Hilbert space, and factorizable realizations of its logical Pauli operators are classified. For two qubits, this yields nontrivial canonical encodings related by local Clifford transformations. The relation between logical and physical Bloch vectors admits a geometric interpretation as a transversely deformed Bloch sphere, leading to closed-form expressions for two-qubit concurrence and generalized concurrence across NNN-qubit bipartitions. The entanglement scaling factor is obtained directly from complementary-subsystem correlations, without prior calibration of state-preparation parameters. Noisy simulations using the IBM Quantum FakeKingston backend model, with readout-error mitigation and zero-noise extrapolation, confirm the analytical results up to N=10N=10N=10 qubits. The protocol therefore enables entanglement estimation from only a small number of measurement settings for this class of rank-2 logical states.
The paper asks when entanglement in a known two-dimensional logical subspace can be quantified from a few physical correlations rather than full tomography. It restricts attention to logical Pauli operators represented by single tensor products of local observables and satisfying the Pauli algebra on the full two-qubit Hilbert space. Within this class, the nontrivial triples contain one local operator and two two-qubit operators; three canonical choices are equivalent under local Clifford transformations and logical-axis relabeling.
For the resulting two-qubit state families, tracing out one qubit scales the transverse logical Bloch components by cos⁡θ\cos\thetacosθ. A triangle-inequality bound and an explicit saturating two-state decomposition establish the convex-roof concurrence C(ρ)=sin⁡θ(Rx)2+(Ry)2C(\rho)=\sin\theta\sqrt{(R^x)^2+(R^y)^2}C(ρ)=sinθ(Rx)2+(Ry)2​ in the canonical encoding with local logical ZZZ. The scale factor is inferred from a complementary-qubit marginal, so only two local Pauli measurement settings are needed, without calibration of θ\thetaθ.
For a specified NNN-qubit construction and bipartition A∣BA|BA∣B, the same argument gives C(ρ)=1−η2(Rx)2+(Ry)2C(\rho)=\sqrt{1-\eta^2}\sqrt{(R^x)^2+(R^y)^2}C(ρ)=1−η2​(Rx)2+(Ry)2​, where η=∏j∈Bcos⁡θj\eta=\prod_{j\in B}\cos\theta_jη=∏j∈B​cosθj​ is measurable from the same settings. This family also satisfies C2=2(Trρ2−TrρA2)C^2=2(\mathrm{Tr}\rho^2-\mathrm{Tr}\rho_A^2)C2=2(Trρ2−TrρA2​). FakeKingston noisy simulations test two-, five-, and ten-qubit examples using readout mitigation and, at ten qubits, zero-noise extrapolation. The exact formulas require the specified logical-subspace structure, not merely rank two; the purity identity is likewise family-specific. The simulations use full assignment-matrix readout calibration as a benchmark, explicitly not a scalable mitigation scheme.
The geometric measure of entanglement of mixed states is investigated based on its relation to spin correlations. We derive an analytical expression for the entanglement of rank-2 mixed states composed of arbitrary multiqubit pure states within a two-dimensional Hilbert subspace. The dependence of the entanglement of rank-2 mixed multiqubit states on the parameters characterizing arbitrary pure states in the mixture is studied both analytically and using quantum computing. For a particular class of mixed states, namely, equal-probability mixtures of an arbitrary multiqubit state and the Schrödinger cat state, we construct quantum protocols for detecting the geometric measure of entanglement based on its relation to spin correlations. We quantify the entanglement using both the AerSimulator and the ibm_marrakesh quantum computer. The effects of quantum-computing errors are also analyzed. The simulation results reproduce the analytical dependencies, while measurements on the quantum device demonstrate good agreement with theoretical predictions within estimated error bounds.
Abstract We investigate quantum correlations and coherence in bipartite systems using the universal triality relation that connects coherence, predictability, and entanglement. The geometric structure underlying entanglement in bipartite two-qubit and two-qutrit systems is analyzed using wedge products of post-measurement vectors. For two-qubit states, concurrence emerges naturally as the area spanned by the post-measurement vectors, while in qutrit systems the generalized I-concurrence is associated with higher-dimensional geometric structures formed by multiple wedge products. We further analyze the relationship between wedge products, eigenvalues, and eigenvectors of correlated systems and discuss the universality of the triality relation in arbitrary dimensions. Our results provide a geometric interpretation of entanglement in d -dimensional cases and reveal a hierarchical structure connecting low- and high-dimensional quantum systems.
Quantum error mitigation (QEM) provides a practical route for estimating reliable observables on noisy intermediate-scale quantum (NISQ) devices. Traditional QEM strategies, including zero-noise extrapolation (ZNE) and Clifford data regression (CDR), rely on noise scaling or global regression, and their performance is constrained by the exponential growth of the system degrees of freedom. We construct a graph-enhanced mitigation (GEM) framework, which incorporates physical information into the model representation. In this work, quantum circuits are encoded as attributed graphs. Hardware-level physical information is mapped to node and edge features: local noise parameters such as calibration parameters T1T_1T1​, T2T_2T2​, and readout errors are encoded at nodes, while coupling-related information such as two-qubit gate errors is encoded as edge features. Graph neural networks are used to model how errors propagate along the physical coupling structure and build up into non-local correlations. This allows the model to capture local interactions and part of the resulting non-local correlations across qubits. A dual-branch affine correction is applied to maintain consistency with physical constraints. Experiments on 10-qubit and 16-qubit random circuits executed on superconducting quantum processors show that GEM provides a level of accuracy comparable to CDR at small scales, while yielding lower mean absolute error and improved stability in zero-shot transfer to larger systems. Results of the traditional QEM strategy indicate that global regression methods remain effective in low-dimensional settings but become less reliable as system degrees of freedom grow. In contrast, GEM makes use of local physical structures to show better scalability and generalization, while preserving the overall error propagation patterns. This work provides a practical scalable approach to QEM for NISQ devices.
Quantum computers have the potential to address computational problems beyond the practical capabilities of classical systems, but Noisy Intermediate-Scale Quantum (NISQ) processors remain limited by errors that accumulate during circuit execution. Quantum Error Mitigation (QEM), particularly Zero-Noise Extrapolation (ZNE), offers a way to reduce these errors without requiring additional physical qubits. However, ZNE has been studied extensively in relatively small or shallow circuits, leaving its effectiveness in deep, non-variational algorithms less explored. This project investigates whether combining readout mitigation and ZNE can mitigate errors in a deep, six-qubit Grover's search algorithm. The circuit was compiled onto IBM's 133-qubit FakeTorino simulated backend, reaching a depth of 1,118 and containing 369 entangling gates. Under simulated noise, the unmitigated probability of measuring the target state was 3.36%, compared with a uniform random-guessing probability of 1.5625%. Digital unitary gate folding and readout error mitigation were subsequently applied across four progressively increased noise-scaling sets (S1–S4), and scale factors. Four extrapolation models (Linear, Quadratic, Poly-Exponential, and Padé) were evaluated. The Poly-Exponential model achieved the highest average target-state probability, reaching 6.91% at S4, approximately 2.06 times the unmitigated probability. These results demonstrate that combining readout mitigation with ZNE can partially recover computational signals in deep quantum circuits under simulated hardware noise, suggesting the potential combined error mitigation techniques for improving the reliability of near-term quantum algorithms without active quantum error correction.
Developing space- and time-efficient logical magic state preparation protocols will likely be an essential step towards building a large-scale fault-tolerant quantum computer. Motivated by this need, we introduce a scalable method for simulating logical magic state preparation protocols under the standard circuit-level noise model. When applied to protocols based on code switching, magic state cultivation, and magic state distillation, our method yields a complexity polynomial in (i) the number of qubits and (ii) the non-stabilizerness, e.g., stabilizer rank or Pauli rank, of the target encoded magic state. The efficiency of our simulation method is rooted in a curious fact: every circuit-level Pauli error in these protocols propagates to a Clifford error at the end. This property is satisfied by a large family of protocols, including those that repeatedly measure a transversal Clifford that squares to a Pauli. We provide a proof-of-principle numerical simulation that prepares a magic state using such logical Clifford measurements. Our work enables practical simulation of logical magic state preparation protocols without resorting to approximations or resource-intensive state-vector simulations.
Entanglement, and quantum correlation, are precious resources for quantum technologies implementation based on quantum information science, such as quantum communication, quantum computing, and quantum interferometry. Nevertheless, to our best knowledge, a directly or numerically computable measure for the entanglement of multipartite mixed states is still lacking. In this work, (i) we derive a measure of the degree of quantum correlation for mixed multipartite states. The latter possesses a closed-form expression valid in the general case unlike, to our best knowledge, all other known measures of quantum correlation. (ii) We further propose an entanglement measure, derived from this quantum correlation measure using a novel regularization procedure for the density matrix. Therefore, a comparison of the proposed measures, of quantum correlation and entanglement, allows one to distinguish between quantum correlation detached from entanglement and the one induced by entanglement and, hence, to identify separable but non-classical states. We have tested our quantum correlation and entanglement measures, on states well-known in literature: a general Bell diagonal state and the Werner states, which are easily tractable with our regularization procedure, and we have verified the accordance between our measures and the expected results for these states. Finally, we validate the two measures in two cases of multipartite states. The first is a generalization to three qubits of the Werner state, the second is a one-parameter three qubits mixed state interpolating between a bi-separable state and a genuine multipartite state, passing through a fully separable state.