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

The Minimal Dimension of Entangled-Noise Advantage — E8 Intelligence Research

Andrew Stewart Caldin

Published Nov 11, 2026• 0 citations
Publisher

Abstract

Can entangled noise erase entanglement more efficiently than separable noise? Standard robustness restricts the added noise to separable states; generalized robustness allows any state. We prove that the two costs coincide for every two-qubit state and give an explicit full-rank qubit--qutrit state with a strict gap. Positivity under partial transpose (PPT) characterizes separability in both dimensions, so the boundary is not caused by a failure of the PPT criterion. Instead, product-vector geometry permits a rank-one bridge between the two-qubit dual optimizations and supplies a two-dimensional completely entangled subspace for the qubit--qutrit separation. Local isometric embeddings complete the finite-dimensional bipartite classification, also for any fixed multipartite cut. Combined with known three-qubit separation, the result classifies universal equality relative to full separability in all finite multipartite systems. Source: http://arxiv.org/abs/2609.28367v1 (arXiv:2609.28367 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

DOI
10.5281/zenodo.24127500

Related papers

The Minimal Dimension of Entangled-Noise Advantage

Xiao-Ke Wang, Zi-Yuan Liu, Ming-Yang Li +2 more

Can entangled noise erase entanglement more efficiently than separable noise? Standard robustness restricts the added noise to separable states; generalized robustness allows any state. We prove that the two costs coincide for every two-qubit state and give an explicit full-rank qubit--qutrit state with a strict gap. Positivity under partial transpose (PPT) characterizes separability in both dimensions, so the boundary is not caused by a failure of the PPT criterion. Instead, product-vector geometry permits a rank-one bridge between the two-qubit dual optimizations and supplies a two-dimensional completely entangled subspace for the qubit--qutrit separation. Local isometric embeddings complete the finite-dimensional bipartite classification, also for any fixed multipartite cut. Combined with known three-qubit separation, the result classifies universal equality relative to full separability in all finite multipartite systems.

quant-pharXiv:2609.28367•Sep 24, 2026•0 citations

Separability problem for multipartite states of rank at most 4

Lin Chen, Dragomir Ž. Djoković

One of the most important problems in quantum information is the separability problem, which asks whether a given quantum state is separable. We investigate multipartite states of rank at most 4 which are PPT (i.e., all their partial transposes are positive semidefinite). We show that any PPT state of rank 2 or 3 is separable and has length at most 4. For separable states of rank 4, we show that they have length at most 6. It is six only for some qubit–qutrit or multiqubit states. It turns out that any PPT entangled state of rank 4 is necessarily supported on a 3⊗3 or a 2⊗2⊗2 subsystem. We obtain a very simple criterion for the separability problem of the PPT states of rank at most 4: such a state is entangled if and only if its range contains no product vectors. This criterion can be easily applied since a four-dimensional subspace in the 3⊗3 or 2⊗2⊗2 system contains a product vector if and only if its Plücker coordinates satisfy a homogeneous polynomial equation (the Chow form of the corresponding Segre variety). We have computed an explicit determinantal expression for the Chow form in the former case, while such an expression was already known in the latter case.

arXiv:1301.2372•Journal of Physics A Mathematical and Theoretical•Jun 13, 2013•34 citations

Beyond Maximal Entanglement: Exact Resources for Multiparty Encrypted Quantum Cloning — E8 Intelligence Research

Andrew Stewart Caldin

Encrypted quantum cloning distributes an unknown $k$-qubit state among $m$ encrypted clones so that no individual clone reveals the input, yet the state can be recovered from any one clone together with a common quantum key. We ask the inverse question: for a fixed encoding architecture, which multipartite pure states can serve as exact resources for this task? For $m\ge2$, we completely characterize the pure resources compatible with a sector-wise two-Pauli encoder, with necessity holding for arbitrary completely positive trace-preserving (CPTP) recovery maps. For even $m$, exact recovery requires maximal entanglement across the signal--noise cut. For odd $m$, less entanglement can suffice, provided that the surviving signal correlations have the structure selected by the encoder. We further show, without fixing the encoder, that exact recovery from every authorized subsystem already implies perfect concealment of each individual signal and requires at least $(m-1)k$ ebits of signal-- Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 11, 2026•0 citations

Optimal Two-Qubit Gate-Cutting Cost and Measures of Nonlocality — E8 Intelligence Research

Andrew Stewart Caldin

Circuit cutting enables quantum computations to be decomposed into smaller subcircuits at the cost of additional sampling overhead. Gate-cutting provides one such approach by replacing nonlocal gates with quasiprobability decompositions of local operations. Starting from the known optimal two-qubit gate-cutting formula, we derive complete sharp lower and upper envelopes relating the quasiprobability extent $γ$ to five established descriptors: entangling power, gate typicality, operator entanglement, Schmidt strength, and maximum product-input concurrence. We recast $γ$ as a Rényi-$1/2$ functional of the operator-Schmidt spectrum and show how the physical constraints on two-qubit spectra sharpen generic entropy bounds and select a small set of recurring extremal Cartan families. None of the five descriptors generically determines $γ$ alone, but each imposes exact constraints, revealing how substantially the optimal gate-cutting cost can vary between gates with similar nonlocal character Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 13, 2026•0 citations

Entanglement Quantification via Bell Violation and Nondegeneracy — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Semi-device-independent entanglement quantification reduces to Bell-inequality violation bounds under fixed local measurements, with a "nondegeneracy" condition separating orthogonal quantum states by dimension. | MATH: Nondegeneracy property — for a Bell inequality \(B\) and fixed local measurements \(\{M_A^a, M_B^b\}\), if a state \(\rho\) of dimension \(d\) violates \(B\) (i.e., \(\langle B\rangle_\rho > \beta_{\text{local}}\)), then its orthogonal complement \(\rho^\perp\) (with \(\text{Tr}(\rho\rho^\perp)=0\)) cannot also violate \(B\) under the same measurements. This yields a dimension-witness bound: \(\text{Ent}(\rho) \geq f(\langle B\rangle_\rho, d)\) where \(f\) is monotonic in the Bell violation. | CONNECTION: The orthogonal-state separation mirrors root-system orthogonality (e.g., \(A_2\) root lattice angles at 60° and 120°), and the dimension constraint \(d\) acts like a lattice rank — violation strength maps to a radial coordinate in a convex set of quantum corre Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Oct 17, 2026•0 citations

Susceptibility of qudit-qudit entanglement to quantum noise: insights from the negativity rank

Matthew Chen, Natalie Klco

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.

quant-pharXiv:2610.10820•Oct 9, 2026•1 citation
Can entangled noise erase entanglement more efficiently than separable noise? Standard robustness restricts the added noise to separable states; generalized robustness allows any state. We prove that the two costs coincide for every two-qubit state and give an explicit full-rank qubit--qutrit state with a strict gap. Positivity under partial transpose (PPT) characterizes separability in both dimensions, so the boundary is not caused by a failure of the PPT criterion. Instead, product-vector geometry permits a rank-one bridge between the two-qubit dual optimizations and supplies a two-dimensional completely entangled subspace for the qubit--qutrit separation. Local isometric embeddings complete the finite-dimensional bipartite classification, also for any fixed multipartite cut. Combined with known three-qubit separation, the result classifies universal equality relative to full separability in all finite multipartite systems. Source: http://arxiv.org/abs/2609.28367v1 (arXiv:2609.28367 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Can entangled noise erase entanglement more efficiently than separable noise? Standard robustness restricts the added noise to separable states; generalized robustness allows any state. We prove that the two costs coincide for every two-qubit state and give an explicit full-rank qubit--qutrit state with a strict gap. Positivity under partial transpose (PPT) characterizes separability in both dimensions, so the boundary is not caused by a failure of the PPT criterion. Instead, product-vector geometry permits a rank-one bridge between the two-qubit dual optimizations and supplies a two-dimensional completely entangled subspace for the qubit--qutrit separation. Local isometric embeddings complete the finite-dimensional bipartite classification, also for any fixed multipartite cut. Combined with known three-qubit separation, the result classifies universal equality relative to full separability in all finite multipartite systems.
One of the most important problems in quantum information is the separability problem, which asks whether a given quantum state is separable. We investigate multipartite states of rank at most 4 which are PPT (i.e., all their partial transposes are positive semidefinite). We show that any PPT state of rank 2 or 3 is separable and has length at most 4. For separable states of rank 4, we show that they have length at most 6. It is six only for some qubit–qutrit or multiqubit states. It turns out that any PPT entangled state of rank 4 is necessarily supported on a 3⊗3 or a 2⊗2⊗2 subsystem. We obtain a very simple criterion for the separability problem of the PPT states of rank at most 4: such a state is entangled if and only if its range contains no product vectors. This criterion can be easily applied since a four-dimensional subspace in the 3⊗3 or 2⊗2⊗2 system contains a product vector if and only if its Plücker coordinates satisfy a homogeneous polynomial equation (the Chow form of the corresponding Segre variety). We have computed an explicit determinantal expression for the Chow form in the former case, while such an expression was already known in the latter case.
Encrypted quantum cloning distributes an unknown kkk-qubit state among mmm encrypted clones so that no individual clone reveals the input, yet the state can be recovered from any one clone together with a common quantum key. We ask the inverse question: for a fixed encoding architecture, which multipartite pure states can serve as exact resources for this task? For m≥2m\ge2m≥2, we completely characterize the pure resources compatible with a sector-wise two-Pauli encoder, with necessity holding for arbitrary completely positive trace-preserving (CPTP) recovery maps. For even mmm, exact recovery requires maximal entanglement across the signal--noise cut. For odd mmm, less entanglement can suffice, provided that the surviving signal correlations have the structure selected by the encoder. We further show, without fixing the encoder, that exact recovery from every authorized subsystem already implies perfect concealment of each individual signal and requires at least (m−1)k(m-1)k(m−1)k ebits of signal-- Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Circuit cutting enables quantum computations to be decomposed into smaller subcircuits at the cost of additional sampling overhead. Gate-cutting provides one such approach by replacing nonlocal gates with quasiprobability decompositions of local operations. Starting from the known optimal two-qubit gate-cutting formula, we derive complete sharp lower and upper envelopes relating the quasiprobability extent γγγ to five established descriptors: entangling power, gate typicality, operator entanglement, Schmidt strength, and maximum product-input concurrence. We recast γγγ as a Rényi-1/21/21/2 functional of the operator-Schmidt spectrum and show how the physical constraints on two-qubit spectra sharpen generic entropy bounds and select a small set of recurring extremal Cartan families. None of the five descriptors generically determines γγγ alone, but each imposes exact constraints, revealing how substantially the optimal gate-cutting cost can vary between gates with similar nonlocal character Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: Semi-device-independent entanglement quantification reduces to Bell-inequality violation bounds under fixed local measurements, with a "nondegeneracy" condition separating orthogonal quantum states by dimension. | MATH: Nondegeneracy property — for a Bell inequality BBB and fixed local measurements {MAa,MBb}\{M_A^a, M_B^b\}{MAa​,MBb​}, if a state ρ\rhoρ of dimension ddd violates BBB (i.e., ⟨B⟩ρ>βlocal\langle B\rangle_\rho > \beta_{\text{local}}⟨B⟩ρ​>βlocal​), then its orthogonal complement ρ⊥\rho^\perpρ⊥ (with Tr(ρρ⊥)=0\text{Tr}(\rho\rho^\perp)=0Tr(ρρ⊥)=0) cannot also violate BBB under the same measurements. This yields a dimension-witness bound: Ent(ρ)≥f(⟨B⟩ρ,d)\text{Ent}(\rho) \geq f(\langle B\rangle_\rho, d)Ent(ρ)≥f(⟨B⟩ρ​,d) where fff is monotonic in the Bell violation. | CONNECTION: The orthogonal-state separation mirrors root-system orthogonality (e.g., A2A_2A2​ root lattice angles at 60° and 120°), and the dimension constraint ddd acts like a lattice rank — violation strength maps to a radial coordinate in a convex set of quantum corre Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
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.