Related papers: Predicting quantum channels over general product d…
The rapid advancement of quantum computing has led to an extensive demand for effective techniques to extract classical information from quantum systems, particularly in fields like quantum machine learning and quantum chemistry. However,…
We consider an $n$ agents distributed optimization problem with imperfect information characterized in a parametric sense, where the unknown parameter can be solved by a distinct distributed parameter learning problem. Though each agent…
We study quantum state testing where the goal is to test whether $\rho=\rho_0\in\mathbb{C}^{d\times d}$ or $\|\rho-\rho_0\|_1>\varepsilon$, given $n$ copies of $\rho$ and a known state description $\rho_0$. In practice, not all measurements…
We establish the necessary and sufficient conditions for unbiased estimation in multi-parameter estimation tasks. More specifically, we first consider quantum state estimation, where multiple parameters are encoded in a quantum state, and…
Quantum noise is a central challenge in quantum computing across many applications. Extensive work has examined how qubits couple to their environment, leading to decoherence and relaxation, which is irreversible. Current studies focus on…
In this work, we prove a one-shot random coding bound for classical-quantum channel coding, a problem conjectured by Burnashev and Holevo in 1998. By choosing the optimal input distribution, the bound implies the optimal error exponent…
In this paper, I design a new statistical abstract model for studying quantum error propagation. For each circuit, I give the algorithm to construct the Error propagation space-time graph(\textbf{EPSTG}) graph as well as the bipartite…
Accurately estimating observables on noisy quantum devices remains a central challenge for near-term quantum algorithms. While quantum error mitigation techniques can reduce noise-induced bias, they often rely on unverifiable assumptions…
Reducing errors is essential for reliable quantum computation. Quantum error mitigation (QEM) and quantum error correction (QEC) are two leading approaches for this task, each with challenges: QEM suffers from high sampling costs and cannot…
We introduce a novel software-oriented model of quantum computation motivated by the practical constraints of near-term quantum hardware. In this model, gates are specified by constraints expressed in terms of Pauli observables, with each…
We show that covert secret key expansion is possible using a public authenticated classical channel and a quantum channel largely under control of an adversary, which we precisely define. We also prove a converse result showing that, under…
The quantum switch has been widely studied as a prototypical example of indefinite causal order in quantum information processing. However, the potential advantages of utilising more general forms of indefinite causal orders remain largely…
We introduce a new quantum noise deconvolution technique that does not rely on the complete knowledge of noise and does not require partial noise tomography. In this new method, we construct a set of observables with completely correctable…
We introduce an approach for estimating the expectation values of arbitrary $n$-qubit matrices $M \in \mathbb{C}^{2^n\times 2^n}$ on a quantum computer. In contrast to conventional methods like the Pauli decomposition that utilize $4^n$…
We consider the problem of correctly identifying a malfunctioning quantum device that forms part of a network of $N$ such devices, which can be considered as the quantum analogue of classical anomaly detection. In the case where the devices…
Quantum masking is a special type of secret sharing in which some information gets reversibly distributed into a multipartite system, leaving the original information inaccessible to each subsystem. This paper proposes a dynamical extension…
The Gottesman-Knill theorem allows for the efficient simulation of stabilizer-based quantum error-correction circuits. Errors in these circuits are commonly modeled as depolarizing channels by using Monte Carlo methods to insert Pauli gates…
We introduce and explicitly construct a quantum code we coin a "Pauli Manipulation Detection" code (or PMD), which detects every Pauli error with high probability. We apply them to construct the first near-optimal codes for two tasks in…
In classical information theory, the Doeblin coefficient of a classical channel provides an efficiently computable upper bound on the total-variation contraction coefficient of the channel, leading to what is known as a strong…
Designing encoding and decoding circuits to reliably send messages over many uses of a noisy channel is a central problem in communication theory. When studying the optimal transmission rates achievable with asymptotically vanishing error…