SearcharxivSearch

arXiv subjects

Dmitrii Khitrin

Publications and source records attributed to Dmitrii Khitrin.

2 recordsLinked to original sources

Autonomous Hamiltonian certification and changepoint detection

Modern quantum devices require high-precision Hamiltonian dynamics, but environmental noise can cause calibrated Hamiltonian parameters to drift over time, necessitating expensive recalibration. Detecting when recalibration is needed is challenging, especially since the very gates required for sophisticated verification protocols may themselves be miscalibrated. While cloud quantum computing services implement heuristic routines for triggering recalibration, the fundamental limits of optimal recalibration are not yet known. We develop efficient Hamiltonian certification and changepoint detection protocols in the autonomous setting, where we cannot rely on an external noiseless device and use only single-qubit gates and measurements, making the protocols robust to the calibration issues for multi-qubit operations they aim to detect. For unknown $n$-qubit Hamiltonians $H$ and $H_0$ with operator norm bounded by $M$, our certification protocol distinguishes whether $\|H-H_0\|_F\geq\epsilon$ or $\|H-H_0\|_F\leq O(\epsilon/\sqrt{n})$ with sample complexity $O(nM^2\ln(1/\delta)/\epsilon^2)$ and total evolution time $O(nM\ln(1/\delta)/\epsilon^2)$. We achieve this by evolving random stabilizer product states and performing adaptive single-qubit measurements based on a classically simulable hypothesis state. Extending this to continuous monitoring, we develop an online changepoint detection algorithm using the CUSUM procedure that achieves a detection delay time bound of $O(nM\ln(M\mathbb{E}_\infty[T])/\epsilon^2)$, matching the known asymptotically optimal scaling with respect to false alarm run time $\mathbb{E}_\infty[T]$. Our approach enables quantum devices to autonomously monitor their own calibration status without requiring ancillary systems, entangling operations, or a trusted reference device, offering a practical solution for robust quantum computing with contemporary noisy devices.

quant-ph

Unbiased observable estimation with approximate channels in fault-tolerant quantum computation

Unitary errors, such as those arising from fault-tolerant compilation of quantum algorithms, systematically bias observable estimates. Correcting this bias typically requires additional resources, such as an increased number of non-Clifford gates. In this work, we present an alternative method for correcting bias in the expectation values of observables. The method leverages a decomposition of the ideal quantum channel into a probabilistic mixture of noisy quantum channels. Using this decomposition, we construct unbiased estimators as weighted sums of expectation values obtained from the noisy channels. We provide a detailed analysis of the method, identify the conditions under which it is effective, and validate its performance through numerical simulations. In particular, we demonstrate unbiased observable estimation in the presence of unitary errors by simulating the time dynamics of the Ising Hamiltonian. Our strategy offers a resource-efficient way to reduce the impact of unitary errors, improving methods for estimating observables in noisy near-term quantum devices and fault-tolerant implementation of quantum algorithms.

quant-ph