Related papers: Quantum Channel Testing in Average-Case Distance
Consider quantum channels with input dimension $d_1$, output dimension $d_2$ and Kraus rank at most $r$. Any such channel must satisfy the constraint $rd_2\geq d_1$, and the parameter regime $rd_2=d_1$ is called the boundary regime. In this…
Fault-tolerant quantum computation traditionally incurs substantial resource overhead, with both qubit and time overheads scaling polylogarithmically with the size of the computation. While prior work by Gottesman showed that constant qubit…
We construct a classical algorithm that designs quantum circuits for algorithmic quantum simulation of arbitrary qudit channels on fault-tolerant quantum computers within a pre-specified error tolerance with respect to diamond-norm…
Certifying high-dimensional quantum channels is essential for ensuring the reliability of quantum communication protocols. Existing certification schemes often rely on fully trusted internal devices, which is difficult to achieve in…
Degradable quantum channels are an important class of completely positive trace-preserving maps. Among other properties, they offer a single-letter formula for the quantum and the private classical capacity and are characterized by the fact…
Channel simulation algorithms can efficiently encode random samples from a prescribed target distribution $Q$ and find applications in machine learning-based lossy data compression. However, algorithms that encode exact samples usually have…
The advantage that quantum systems provide for certain quantum information processing tasks over their classical counterparts can be quantified within the general framework of resource theories. Certain distance functions between quantum…
The tight, in a sense, lower estimates of diamond-norm distance from a given quantum channel to the sets of degradable, antidegradable and entanglement-breaking channels are obtained via the tight continuity bounds for quantum mutual…
Estimating the unitarity of an unknown quantum channel $\mathcal{E}$ provides information on how much it is unitary, which is a basic and important problem in quantum device certification and benchmarking. Unitarity estimation can be…
In drug discovery research there is a clear and urgent need for non-invasive detection of cell membrane ion channel operation with wide-field capability. Existing techniques are generally invasive, require specialized nano structures, or…
The computational problem of distinguishing two quantum channels is central to quantum computing. It is a generalization of the well-known satisfiability problem from classical to quantum computation. This problem is shown to be…
This thesis aims to establish notions of symmetry for quantum states and channels as well as describe algorithms to test for these properties on quantum computers. Ideally, the work will serve as a self-contained overview of the subject. We…
The problem of discriminating between many quantum channels with certainty is analyzed under the assumption of prior knowledge of algebraic relations among possible channels. It is shown, by explicit construction of a novel family of…
Quantum Key Distribution (QKD) protocols rely on authenticated classical communication. Typical QKD security proofs are carried out in an idealized setting where authentication is assumed to behave honestly: it never aborts, and all…
Adaptiveness is a key principle in information processing including statistics and machine learning. We investigate the usefulness of adaptive methods in the framework of asymptotic binary hypothesis testing, when each hypothesis represents…
We develop a device-independent framework for testing quantum channels. That is, we falsify a hypothesis about a quantum channel based only on an observed set of input-output correlations. Formally, the problem consists of characterizing…
Stochastic channels are ubiquitous in the field of quantum information because they are simple and easy to analyze. In particular, Pauli channels and depolarizing channels are widely studied because they can be efficiently simulated in many…
We prove that a broad array of capacities of a quantum channel are continuous. That is, two channels that are close with respect to the diamond norm have correspondingly similar communication capabilities. We first show that the classical…
We consider a notion of complexity of quantum channels in relativistic continuum quantum field theory (QFT) defined by the distance to the trivial (identity) channel. Our distance measure is based on a specific divergence between quantum…
Understanding the noise affecting a quantum device is of fundamental importance for scaling quantum technologies. A particularly important class of noise models is that of Pauli channels, as randomized compiling techniques can effectively…