Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1901.09889

Numerical and Exact Analyses of Bures and Hilbert-Schmidt Separability and PPT-Probabilities

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

Abstract

We employ a quasirandom methodology, recently developed by Martin Roberts, to estimate the separability probabilities, with respect to the Bures (minimal monotone/statistical distinguishability) measure, of generic two-qubit and two-rebit states. This procedure, based on generalized properties of the golden ratio, yielded, in the course of almost seventeen billion iterations (recorded at intervals of five million), two-qubit estimates repeatedly close to nine decimal places to $\frac{25}{341} =\frac{5^2}{11 \cdot 31} \approx 0.073313783$. Howeer, despite the use of over twenty-three billion iterations, we do not presently perceive an exact value (rational or otherwise) for an estimate of 0.15709623 for the Bures two-rebit separability probability. The Bures qubit-qutrit case--for which Khvedelidze and Rogojin gave an estimate of 0.0014--is analyzed too. The value of $\frac{1}{715}=\frac{1}{5 \cdot 11 \cdot 13} \approx 0.00139860$ is a well-fitting value to an estimate of 0.00139884. Interesting values ($\frac{16}{12375} =\frac{4^2}{3^2 \cdot 5^3 \cdot 11}$ and $\frac{625}{109531136}=\frac{5^4}{2^{12} \cdot 11^2 \cdot 13 \cdot 17}$) are conjectured for the Hilbert-Schmidt (HS) and Bures qubit-qudit ($2 \times 4$) positive-partial-transpose (PPT)-probabilities. We re-examine, strongly supporting, conjectures that the HS qubit-{\it qutrit} and rebit-{\it retrit} separability probabilities are $\frac{27}{1000}=\frac{3^3}{2^3 \cdot 5^3}$ and $\frac{860}{6561}= \frac{2^2 \cdot 5 \cdot 43}{3^8}$, respectively. Prior studies have demonstrated that the HS two-rebit separability probability is $\frac{29}{64}$ and strongly pointed to the HS two-qubit counterpart being $\frac{8}{33}$, and a certain operator monotone one (other than the Bures) being $1 -\frac{256}{27 π^2}$.

Explore related subjects

quant-phmath-phmath.MPmath.PRphysics.comp-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paul B. Slater. 2019-07-31. Numerical and Exact Analyses of Bures and Hilbert-Schmidt Separability and PPT-Probabilities. https://doi.org/10.1007/s11128-019-2431-2

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↗