SearcharxivSearch

arXiv · 1605.06459

Two-Qubit Separability Probabilities as Joint Functions of the Bloch Radii of the Qubit Subsystems

Abstract

We detect a certain pattern of behavior of separability probabilities $p(r_A,r_B)$ for two-qubit systems endowed with Hilbert-Schmidt, and more generally, random induced measures, where $r_A$ and $r_B$ are the Bloch radii ($0 \leq r_A,r_B \leq 1$) of the qubit reduced states ($A,B$). We observe a relative repulsion of radii effect, that is $p(r_A,r_A) < p(r_A,1-r_A)$, except for rather narrow "crossover" intervals $[\tilde{r}_A,\frac{1}{2}]$. Among the seven specific cases we study are, firstly, the "toy" seven-dimensional $X$-states model and, then, the fifteen-dimensional two-qubit states obtained by tracing over the pure states in $4 \times K$-dimensions, for $K=3, 4, 5$, with $K=4$ corresponding to Hilbert-Schmidt (flat/Euclidean) measure. We also examine the real (two-rebit) $K=4$, the $X$-states $K=5$, and Bures (minimal monotone)--for which no nontrivial crossover behavior is observed--instances. In the two $X$-states cases, we derive analytical results, for $K=3, 4$, we propose formulas that well-fit our numerical results, and for the other scenarios, rely presently upon large numerical analyses. The separability probability crossover regions found expand in length (lower $\tilde{r}_A$) as $K$ increases. This report continues our efforts (arXiv:1506.08739) to extend the recent work of Milz and Strunz (J. Phys. A: 48 [2015] 035306) from a univariate ($r_A$) framework---in which they found separability probabilities to hold constant with $r_A$---to a bivariate ($r_A,r_B$) one. We also analyze the two-qutrit and qubit-qutrit counterparts reported in arXiv:1512.07210 in this context, and study two-qubit separability probabilities of the form $p(r_A,\frac{1}{2})$.

Explore related subjects

Keep this discovery

BibTeXRIS

Paul B. Slater. 2016-05-20. Two-Qubit Separability Probabilities as Joint Functions of the Bloch Radii of the Qubit Subsystems. https://doi.org/10.1142/s0219749916500428

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

KEEP EXPLORING

Related papers

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

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

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