SearcharxivSearch

arXiv · 1701.01973

Master Lovas-Andai and Equivalent Formulas Verifying the $\frac{8}{33}$ Two-Qubit Hilbert-Schmidt Separability Probability and Companion Rational-Valued Conjectures

Abstract

We begin by investigating relationships between two forms of Hilbert-Schmidt two-re[al]bit and two-qubit "separability functions"--those recently advanced by Lovas and Andai (J. Phys. A 50 [2017] 295303), and those earlier presented by Slater (J. Phys. A 40 [2007] 14279). In the Lovas-Andai framework, the independent variable $\varepsilon \in [0,1]$ is the ratio $σ(V)$ of the singular values of the $2 \times 2$ matrix $V=D_2^{1/2} D_1^{-1/2}$ formed from the two $2 \times 2$ diagonal blocks ($D_1, D_2$) of a $4 \times 4$ density matrix $D$. In the Slater setting, the independent variable $μ$ is the diagonal-entry ratio $\sqrt{\frac{ρ_{11} ρ_{44}}{ρ_{22} ρ_{33}}}$--with, of central importance, $μ=\varepsilon$ or $μ=\frac{1}{\varepsilon}$ when both $D_1$ and $D_2$ are themselves diagonal. Lovas and Andai established that their two-rebit "separability function" $\tildeχ_1 (\varepsilon )$ ($\approx \varepsilon$) yields the previously conjectured Hilbert-Schmidt separability probability of $\frac{29}{64}$. We are able, in the Slater framework (using cylindrical algebraic decompositions [CAD] to enforce positivity constraints), to reproduce this result. Further, we newly find its two-qubit (yielding $\frac{8}{33}$), two-quater[nionic]-bit (yielding $\frac{26}{323}$) and "two-octo[nionic]-bit" (yielding $\frac{44482}{4091349}$) counterparts. Then, we find a Lovas-Andai "master formula", $\tilde{χ_d}(\varepsilon)= \frac{\varepsilon ^d Γ(d+1)^3 \,_3\tilde{F}_2\left(-\frac{d}{2},\frac{d}{2},d;\frac{d}{2}+1,\frac{3d}{2}+1;\varepsilon ^2\right)}{Γ\left(\frac{d}{2}+1\right)^2}$ encompassing both even and odd values of $d$. C. Koutschan, then, using his HolonomicFunctions program, develops an order-4 recurrence satisfied by the predictions of the several formulas, establishing their equivalence.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paul B. Slater. 2017-11-02. Master Lovas-Andai and Equivalent Formulas Verifying the $\frac{8}{33}$ Two-Qubit Hilbert-Schmidt Separability Probability and Companion Rational-Valued Conjectures. https://doi.org/10.1007/s11128-018-1854-5

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