SearcharxivSearch

arXiv · 2212.13225

Single energy measurement Integral Fluctuation theorem and non-projective measurements

Abstract

We study a Jarzysnki type equality for work in systems that are monitored using non-projective unsharp measurements. The information acquired by the observer from the outcome $f$ of an energy measurement, and the subsequent conditioned normalized state $\hat \rho(t,f)$ evolved up to a final time $t$ are used to define work, as the difference between the final expectation value of the energy and the result $f$ of the measurement. The Jarzynski equality obtained depends on the coherences that the state develops during the process, the characteristics of the meter used to measure the energy, and the noise it induces into the system. We analyze those contributions in some detail to unveil their role. We show that in very particular cases, but not in general, the effect of such noise gives a factor multiplying the result that would be obtained if projective measurements were used instead of non-projective ones. The unsharp character of the measurements used to monitor the energy of the system, which defines the resolution of the meter, leads to different scenarios of interest. In particular, if the distance between neighboring elements in the energy spectrum is much larger than the resolution of the meter, then a similar result to the projective measurement case is obtained, up to a multiplicative factor that depends on the meter. A more subtle situation arises in the opposite case in which measurements may be non-informative, i.e. they may not contribute to update the information about the system. In this case, a correction to the relation obtained in the non-overlapping case appears. We analyze the conditions in which such a correction becomes negligible. We also study the coherences, in terms of the relative entropy of coherence developed by the evolved post-measurement state. We illustrate the results by analyzing a two-level system monitored by a simple meter.

Explore related subjects

Keep this discovery

BibTeXRIS

Daniel Alonso, Antonia Ruiz García. 2022-12-26. Single energy measurement Integral Fluctuation theorem and non-projective measurements. https://doi.org/10.1103/physreve.108.024126

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