Searcharxiv⌕ Search

arXiv subjects

Ugnė Liaubaitė

Publications and source records attributed to Ugnė Liaubaitė.

2 recordsLinked to original sources

CSS codes for Quantum Metrology with Discrete-time Error Correction

The goal of quantum metrology is to estimate an unknown parameter with better-than-classical precision and, ideally, to attain Heisenberg scaling. In realistic settings, however, noise can substantially reduce this advantage and, in many cases, restore standard-quantum-limit-like performance. Preserving the quantum enhancement therefore requires noise-robust strategies, which can be implemented using quantum error correction. In this work, we develop and analyze a quantum-metrology protocol based on Calderbank-Shor-Steane (CSS) codes. The main result is that, for noise perpendicular to the sensing Hamiltonian, discrete-time error correction preserves Heisenberg-like temporal scaling over a finite interrogation-time window whose duration depends on the correction frequency. It is further shown that recovery applied only after the sensing evolution provides no metrological advantage over the corresponding uncorrected noisy protocol in the setup considered here. An analytical framework is developed for arbitrary CSS codes and applied to the Steane and Shor codes, for which the discrete-time corrected dynamics, the Heisenberg-like-to-SQL-like crossover, and the optimal interrogation time are determined and numerically analysed.

quant-ph↗

Prospects of Quantum Error Mitigation for Quantum Signal Processing

Quantum error mitigation (QEM) protocols have provably exponential bounds on the cost scaling; however, exploring which regimes QEM can recover usable results is still of sizable interest. The expected absence of complete error correction for near-term and intermediate-term quantum devices means that QEM protocols will remain relevant for devices with low enough error rates to attempt small examples of fault-tolerant algorithms. Herein, we are interested in the performance of QEM with a template for quantum algorithms, quantum signal processing (QSP). QSP-based algorithms are designed with an especially simple relation between the circuit depths and the algorithm's parameters, including the required precision. Hence, they may be a useful playground for exploring QEM's practical performance and costs for a range of controlled parameters. As a preliminary step in this direction, this work explores the performance of zero-noise-extrapolation (ZNE) on a Hamiltonian simulation algorithm designed within QSP under local depolarizing noise. We design a QSP-based Hamiltonian simulation of a modified Ising model under depolarizing noise for low precision and varying simulation times. We quantify for which noise and depth regimes our ZNE protocol can recover an approximation of the noiseless expectation value. We discuss existing bounds on the sample budget, eventually using a fixed number of shots. While this does not guarantee the success of QEM, it gives us usable results in relevant cases. Finally, we briefly discuss and present a numerical study on the region where ZNE is unusable, even given an unlimited sample budget.

quant-ph↗