Related papers: The minimum distance of classical and quantum turb…
It is commonly recognized that the Landauer bound holds in (irreversible) quantum operations. In this study, we verified this bound by extracting a single spin from a spin-spin magnetic interaction experiment to demonstrate that the…
There are many results on the minimum distance of a cyclic code of the form that if a certain set T is a subset of the defining set of the code, then the minimum distance of the code is greater than some integer t. This includes the BCH,…
We present full generalisations of entropic security and entropic indistinguishability to the quantum world where no assumption but a limit on the knowledge of the adversary is made. This limit is quantified using the quantum conditional…
Non-stabilizerness is a fundamental resource for quantum computational advantage, differentiating classically simulable circuits from those capable of universal quantum computation. Recently, non-stabilizerness has been shown to be relevant…
Quantum convolutional coding is a technique for encoding a stream of quantum information before transmitting it over a noisy quantum channel. Two important goals in the design of quantum convolutional encoders are to minimize the memory…
This paper considers a problem of quantum communication between parties that are connected through a network of quantum channels. The model in this paper assumes that there is no prior entanglement shared among any of the parties, but that…
The most powerful technique known at present for bounding the size of quantum codes of prescribed minimum distance is the quantum linear programming bound. Unlike the classical linear programming bound, it is not immediately obvious that if…
Decoding algorithms are essential to fault-tolerant quantum-computing architectures. In this perspective we explore decoding algorithms for the surface code; a prototypical quantum low-density parity-check code that underlies many of the…
Permitting the transmission of unknown quantum states over long distances by using entanglement, quantum teleportation serves as an important building block for many quantum technologies. However, in the noisy intermediate-scale quantum…
The well-known approach of Bose, Ray-Chaudhuri and Hocquenghem and its generalization by Hartmann and Tzeng are lower bounds on the minimum distance of simple-root cyclic codes. We generalize these two bounds to the case of repeated-root…
In this paper, we consider the problem of minimizing quantum free energies under the constraint that the density of particles is fixed at each point of Rd, for any d $\ge$ 1. We are more particularly interested in the characterization of…
Classical conditions for ensuring the robust stability of a linear system in feedback with a sector-bounded nonlinearity include small gain, circle, passivity, and conicity theorems. In this work, we present a similar stability condition,…
We provide an upper bound on the quasi-relative entropy in terms of the trace distance. The bound is derived for two cases: 1) any operator monotone decreasing function and full rank mixed qubit or classical states; 2) a large class of…
The quantum Hamming bound was originally put forward as an upper bound on the parameters of nondegenerate quantum codes, but over the past few decades much work has been done to show that many degenerate quantum codes must also obey this…
The non-local interactions in several quantum device architectures allow for the realization of more compact quantum encodings while retaining the same degree of protection against noise. Anticipating that short to medium-length codes will…
We present a bouquet of continuity bounds for quantum entropies, falling broadly into two classes: First, a tight analysis of the Alicki-Fannes continuity bounds for the conditional von Neumann entropy, reaching almost the best possible…
Entanglement-assisted quantum error correcting codes (EAQECCs) can be derived from arbitrary classical linear codes. However, it is a very difficult task to determine the number of entangled states required. In this work, using the method…
Quantum information technologies require careful control for generating and preserving a desired target quantum state. The biggest practical obstacle is, of course, decoherence. Therefore, the reachability analysis, which in our scenario…
An interleaver is a critical component for the channel coding performance of turbo codes. Algebraic constructions are of particular interest because they admit analytical designs and simple, practical hardware implementation. Also, the…
The trace distance (TD) possesses several of the good properties required for a faithful distance measure in the quantum state space. Despite its importance and ubiquitous use in quantum information science, one of its questionable…