Differential privacy has been an exceptionally successful concept when it comes to
providing provable security guarantees for classical computations. More recently, the …

The capacities of noisy quantum channels capture the ultimate rates of information
transmission across quantum communication lines, and the quantum capacity plays a key …

In a model of fault-tolerant quantum computation with quick and noiseless polyloglog-time
auxiliary classical computation, we construct a fault tolerance protocol with constant-space …

We show that a quantum architecture with an error correction procedure limited to
geometrically local operations incurs an overhead that grows with the system size, even if …

Motivated by realistic hardware considerations of the pre-fault-tolerant era, we
comprehensively study the impact of uncorrected noise on quantum circuits. We first show …

Quantum memory systems are vital in quantum information processing for dependable
storage and retrieval of quantum states. Inspired by classical reliability theories that …

The data processing inequality is central to information theory and motivates the study of
monotonic divergences. However, it is not clear operationally we need to consider all such …

As techniques for fault-tolerant quantum computation keep improving, it is natural to ask:
what is the fundamental lower bound on space overhead? In this paper, we obtain a lower …

Existing lower bounds on redundancy in fault-tolerant quantum circuits are applicable when
both the input and the intended output are quantum states. These bounds may not …

We present a polynomial-time classical algorithm for estimating expectation values of
arbitrary observables on typical quantum circuits under any incoherent local noise, including …