SearcharxivSearch

arXiv · 2510.23058

POVM generated quantum trajectories without stochastic differential equations

Abstract

In this paper we examine the issue of quantum trajectories generated by QND-POVM's on {\it single} copies of unknown states. After an introduction to various aspects of quantum measurements, we discuss an earlier approach by one of us(NDH) based on Gaussian QND measurement operators that addressed the asymptotic behaviour of such trajectories showing the impossibility of determining the unknown state of a single copy from the statistics of such repeated measurements.The essence of our present work is the so called martingale and super-martingale properties of certain observables, and the consequent martingale convergence theorem. The main result is that asymptotically all trajectories approach either the non-degenerate eigenstates of the system observable, or,density matrices spanned by the degenerate eigenstates of the observable. The proofs given by us are very transparent..A unified treatment of both the degenerate and non-degenerate cases is given with the help of projectors of arbitrary dimensionalities.In the degenerate case we reproduce the L\"uders prescription. The distribution of the trajectories is shown to be given exactly by the Born rule.Similar conclusions were reached, earlier to us, by Bauer et al on the one hand, and, by Amini et al on the other. A detailed comparison of the three approaches is given. A distinctive feature of all three approaches is that no use is made of stochastic differential equations and the conclusions follow directly from quantum mechanics. Alter and Yamomoto were the first to investigate repeated QND measurements on single copies in unknown states. We make detailed comparisons with their works too. We end with a brief discussion of i) the robustness of the results against free evolutions of both the system as well as the probe and ii) the anti-Zeno aspects of the results.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rutvij Bhavsar, N. D. Hari Dass. 2025-10-27. POVM generated quantum trajectories without stochastic differential equations. https://arxiv.org/abs/2510.23058

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