Search arXivSearch

arXiv · 2305.12970

Quantum state smoothing cannot be assumed classical even when the filtering and retrofiltering are classical

Abstract

State smoothing is a technique to estimate a state at a particular time, conditioned on information obtained both before (past) and after (future) that time. For a classical system, the smoothed state is a normalized product of the $\textit{filtered state}$ (a state conditioned only on the past measurement information and the initial preparation) and the $\textit{retrofiltered effect}$ (depending only on the future measurement information). For the quantum case, whilst there are well-established analogues of the filtered state ($\rho_{\rm F}$) and retrofiltered effect ($\hat E_{\rm R}$), their product does not, in general, provide a valid quantum state for smoothing. However, this procedure does seem to work when $\rho_{\rm F}$ and $\hat E_{\rm R}$ are mutually diagonalizable. This fact has been used to obtain smoothed quantum states -- more pure than the filtered states -- in a number of experiments on continuously monitored quantum systems, in cavity QED and atomic systems. In this paper we show that there is an implicit assumption underlying this technique: that if all the information were known to the observer, the true system state would be one of the diagonal basis states. This assumption does not necessarily hold, as the missing information is quantum information. It could be known to the observer only if it were turned into a classical measurement record, but then its nature depends on the choice of measurement. We show by a simple model that, depending on that measurement choice, the smoothed quantum state can: agree with that from the classical method; disagree with it but still be co-diagonal with it; or not even be co-diagonal with it. That is, just because filtering and retrofiltering appear classical does not mean classical smoothing theory is applicable in quantum experiments.

Explore related subjects

Keep this discovery

BibTeXRIS

Kiarn T. Laverick, Prahlad Warszawski, Areeya Chantasri, Howard M. Wiseman. 2023-05-22. Quantum state smoothing cannot be assumed classical even when the filtering and retrofiltering are classical. https://doi.org/10.1103/prxquantum.4.040340

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