Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1904.01904

Optimized entanglement for quantum parameter estimation from noisy qubits

Francois Chapeau-Blondeau
View original source ↗Read source document ↗Export metadata ↓

Abstract

For parameter estimation from an $N$-component composite quantum system, it is known that a separable preparation leads to a mean-squared estimation error scaling as $1/N$ while an entangled preparation can in some conditions afford a smaller error with $1/N^2$ scaling. This quantum superefficiency is however very fragile to noise or decoherence, and typically disappears with any small amount of random noise asymptotically at large $N$. To complement this asymptotic characterization, we characterize how the estimation efficiency evolves as a function of the size $N$ of the entangled system and its degree of entanglement. We address a generic situation of qubit phase estimation, also meaningful for frequency estimation. Decoherence is represented by the broad class of noises commuting with the phase rotation, which includes depolarizing, phase-flip, and thermal quantum noises. In these general conditions, explicit expressions are derived for the quantum Fisher information quantifying the ultimate achievable efficiency for estimation. We confront at any size $N$ the efficiency of the optimal separable preparation to that of an entangled preparation with arbitrary degree of entanglement. We exhibit the $1/N^2$ superefficiency with no noise, and prove its asymptotic disappearance at large $N$ for any non-vanishing noise configuration. For maximizing the estimation efficiency, we characterize the existence of an optimum $N_{\rm opt}$ of the size of the entangled system along with an optimal degree of entanglement. For nonunital noises, maximum efficiency is usually obtained at partial entanglement. Grouping the $N$ qubits into independent blocks formed of $N_{\rm opt}$ entangled qubits restores at large $N$ a nonvanishing efficiency that can improve over that of $N$ independent qubits optimally prepared. One inactive qubit in the entangled probe sometimes is most efficient for estimation.

Explore related subjects

quant-ph

Keep this discovery

BibTeXRIS

Francois Chapeau-Blondeau. 2019-04-03. Optimized entanglement for quantum parameter estimation from noisy qubits. https://doi.org/10.1142/s0219749918500569

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↗