Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1905.09228

Jagged Islands of Bound Entanglement and Witness-Parameterized Probabilities

Paul B. Slater
View original source ↗Read source document ↗Export metadata ↓

Abstract

We report several witness-parameterized families of bound-entangled probabilities. Two pertain to the $d=3$ (two-qutrit) and a third to the $d=4$ (two-ququart) subsets analyzed by Hiesmayr and L{\"o}ffler of "magic" simplices of Bell states. The Hilbert-Schmidt probabilities of positive-partial-transpose (PPT) states--within which we search for bound-entangled states--are $\frac{8 \pi }{27 \sqrt{3}} \approx 0.537422$ ($d=3$) and $\frac{1}{2}+\frac{\log \left(2-\sqrt{3}\right)}{8 \sqrt{3}} \approx 0.404957$ ($d=4$). We obtain bound-entangled probabilities of $-\frac{4}{9}+\frac{4 \pi }{27 \sqrt{3}}+\frac{\log (3)}{6} \approx 0.00736862$ and $\frac{-204+7 \log (7)+168 \sqrt{3} \cos ^{-1}\left(\frac{11}{14}\right)}{1134} \approx 0.00325613$ ($d=3$) and $\frac{8 \log (2)}{27}-\frac{59}{288} \approx 0.00051583$ and $\frac{24 \text{csch}^{-1}\left(\frac{8}{\sqrt{17}}\right)}{17 \sqrt{17}}-\frac{91}{544} \approx 0.00218722$ ($d=4$). Thus, the total entanglement probability appears to equal $(1-\frac{8 \pi }{27 \sqrt{3}})+\frac{2}{81} \left(4 \sqrt{3} \pi -21\right) = \frac{13}{27} \approx 0.481481$.) The families, encompassing these results, are parameterized using generalized Choi and Jafarizadeh-Behzadi-Akbari witnesses. The same bound-entangled probability was achieved with both--the sets ("jagged islands") detected having void intersection. The entanglement (bound and "non-bound"/"free") probability for both was $\frac{1}{6} \approx 0.16667$, while their union and intersection gave $\frac{2}{9} \approx 0.22222$ and $\frac{1}{9} \approx 0.11111$. Further, we examine generalized Horodecki states, as well as estimating PPT-probabilities of approximately 0.39339 (very well-fitted by $\frac{7 \pi}{25 \sqrt{5}} \approx 0.39338962$) and 0.115732 ( for the original (8- [two-qutrit] and 15 [two-ququart]-dimensional) magic simplices themselves.

Explore related subjects

quant-phmath-phmath.MPmath.PR

Keep this discovery

BibTeXRIS

Paul B. Slater. 2019-05-22. Jagged Islands of Bound Entanglement and Witness-Parameterized Probabilities. https://arxiv.org/abs/1905.09228

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph↗
arXiv2026

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph↗
arXiv2026

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph↗