The general stable quantum memory unit is a hybrid consisting of a classical digit with a quantum digit (qudit) assigned to each classical state. The shape of the memory is the vector of sizes of these qudits, which may differ. We determine when N copies of a quantum memory A embed in N(1+o(1)) copies of another quantum memory B. This relationship captures the notion that B is as at least as useful as A for all purposes in the bulk limit. We show that the embeddings exist if and only if for all p >= 1, the p-norm of the shape of A does not exceed the p-norm of the shape of B. The log of the p-norm of the shape of A can be interpreted as the maximum of S(ρ) + H(ρ)/p (quantum entropy plus discounted classical entropy) taken over all mixed states ρon A. We also establish a noiseless coding theorem that justifies these entropies. The noiseless coding theorem and the bulk embedding theorem together say that either A blindly bulk-encodes into B with perfect fidelity, or A admits a state that does not visibly bulk-encode into B with high fidelity. In conclusion, the utility of a hybrid quantum memory is determined by its simultaneous capacity for classical and quantum entropy, which is not a finite list of numbers, but rather a convex region in the classical-quantum entropy plane.
The general stable quantum memory unit is a hybrid consisting of a classical digit with a quantum digit (qudit) assigned to each classical state. The shape of the memory is the vector of sizes of these qudits, which may differ. We determine when N copies of a quantum memory A embed in N(1+o(1)) copies of another quantum memory B. This relationship captures the notion that B is as at least as useful as A for all purposes in the bulk limit. We show that the embeddings exist if and only if for all p >= 1, the p-norm of the shape of A does not exceed the p-norm of the shape of B. The log of the p-norm of the shape of A can be interpreted as the maximum of S(ρ) + H(ρ)/p (quantum entropy plus discounted classical entropy) taken over all mixed states ρon A. We also establish a noiseless coding theorem that justifies these entropies. The noiseless coding theorem and the bulk embedding theorem together say that either A blindly bulk-encodes into B with perfect fidelity, or A admits a state that does not visibly bulk-encode into B with high fidelity. In conclusion, the utility of a hybrid quantum memory is determined by its simultaneous capacity for classical and quantum entropy, which is not a finite list of numbers, but rather a convex region in the classical-quantum entropy plane.
The general stable quantum memory unit is a hybrid consisting of a classical digit with a quantum digit (qudit) assigned to each classical state. The shape of the memory is the vector of sizes of these qudits, which may differ. We determine when N copies of a quantum memory /spl Ascr/ embed in N(1+/spl ogr/(1)) copies of another quantum memory /spl Bscr/. This relationship captures the notion that/spl Bscr/ is as at least as useful as /spl Ascr/ for all purposes in the bulk limit. We show that the embeddings exist if and only if for all p/spl ges/1, the p-norm of the shape of /spl Ascr/ does not exceed the p-norm of the shape of /spl Bscr/. The log of the p-norm of the shape of /spl Ascr/ can be interpreted as the maximum of S(/spl rho/)+H(/spl rho/)/p (quantum entropy plus discounted classical entropy) taken over all mixed states /spl rho/ on /spl Ascr/. We also establish a noiseless coding theorem that justifies these entropies. The noiseless coding theorem and the bulk embedding theorem together say that either /spl Ascr/ blindly bulk-encodes into /spl Bscr/ with perfect fidelity, or A admits a state that does not visibly bulk-encode into/spl Bscr/with high fidelity. In conclusion, the utility of a hybrid quantum memory is determined by its simultaneous capacity for classical and quantum entropy, which is not a finite list of numbers, but rather a convex region in the classical-quantum entropy plane.
In this thesis we analyse the type of states and ensembles which achieve the capacity for certain quantum channels carrying classical information. We first concentrate on the product-state capacity of a particular quantum channel, that is, the capacity which is achieved by encoding the output states from a source into codewords comprised of states taken from ensembles of non-entangled states and sending them over copies of the quantum channel. Using the "single-letter" formula proved independently by Holevo and by Schumacher and Westmoreland we obtain the product-state capacity of the qubit quantum amplitude-damping channel, which is determined by a transcendental equation in a single real variable and can be solved numerically. We demonstrate that the product-state capacity of this channel can be achieved using a minimal ensemble of non-orthogonal pure states. Next we consider the classical capacity of two quantum channels with memory, namely a periodic channel with quantum depolarising channel branches and a convex combination of quantum channels. We prove that the classical capacity for each of the classical memory channels mentioned above is, in fact, equal to the respective product-state capacities. For those channels this means that the classical capacity is achieved without the use of entangled input-states. Next we introduce the channel coding theorem for memoryless quantum channels, providing a known proof by Winter for the strong converse of the theorem. We then consider the strong converse to the channel coding theorem for a periodic quantum channel.
Applications of quantum technology often require fidelities to quantify performance. These provide a fundamental yardstick for the comparison of two quantum states. While this is straightforward in the case of pure states, it is much more subtle for the more general case of mixed quantum states often found in practice. A large number of different proposals exist. In this review, we summarize the required properties of a quantum fidelity measure, and compare them, to determine which properties each of the different measures has. We show that there are large classes of measures that satisfy all the required properties of a fidelity measure, just as there are many norms of Hilbert space operators, and many measures of entropy. We compare these fidelities, with detailed proofs of their properties. We also summarize briefly the applications of these measures in teleportation, quantum memories and quantum computers, quantum communications, and quantum phase-space simulations.
Motivated by deterministic identification via classical channels, where the encoder is not allowed to use randomization, we revisit the problem of identification via quantum channels but now with the additional restriction that the message encoding must use pure quantum states, rather than general mixed states. Together with the previously considered distinction between simultaneous and general decoders, this suggests a two-dimensional spectrum of different identification capacities, whose behaviour could a priori be very different. We demonstrate two new results as our main findings: first, we show that all four combinations (pure/mixed encoder, simultaneous/general decoder) have a double-exponentially growing code size, and that indeed the corresponding identification capacities are lower bounded by the classical transmission capacity for a general quantum channel, which is given by the Holevo-Schumacher-Westmoreland Theorem. Secondly, we show that the simultaneous identification capacity of a quantum channel equals the simultaneous identification capacity with pure state encodings, thus leaving three linearly ordered identification capacities. By considering some simple examples, we finally show that these three are all different: general identification capacity can be larger than pure-state-encoded identification capacity, which in turn can be larger than pure-state-encoded simultaneous identification capacity.
Single photons are the flying qubits of choice for distributing entanglement in a quantum internet. Quantum memories embedded in quantum repeaters are crucial to overcome transmission loss and enhance the rate of quantum communication. A multimode memory can further boost the channel capacity. However, benchmarking and building a practical quantum memory that simultaneously optimizes multiple performance metrics poses two key challenges. Here, we introduce quantum interconnect rate to comprehensively quantify quantum memories, and further demonstrate a high-performance quantum memory that simultaneously integrates three essential criteria at once: large multimode capacity, high efficiency, and high fidelity. Operating on 11-dimensional spatial modes, our memory achieves a uniform efficiency exceeding 80% and qubit storage fidelities above 99%, enabling the efficient storage of high-dimensional qudits. Based on these capabilities, we estimate a distribution of 3.56 bits of quantum information over a 1000-km repeater link in one minute, highlighting a practical pathway toward scalable quantum interconnects and quantum networks.
Motivated by deterministic identification via channels, where the encoder cannot use randomisation, we revisit the problem of identification via quantum channels with the additional restriction that the message encoding must use pure quantum states, rather than general mixed states. Together with the previously considered distinction between simultaneous and general decoders, this suggests a two-dimensional spectrum of different identification capacities, whose behaviour could a priori be very different. We demonstrate two new main results: first, we show that all of the four combinations (pure/mixed encoder, simultaneous/general decoder) have a double-exponentially growing code size, and that indeed the corresponding identification capacities are lower bounded by the classical transmission capacity for a general quantum channel, which is given by the Holevo-Schumacher- Westmoreland theorem. Secondly, we show that the simultaneous identification capacity of a quantum channel equals the simultaneous identification capacity with pure state encodings, thus leaving three linearly ordered identification capacities. By considering some simple examples we finally show that these three are all different: general identification capacity can be larger than pure-state-encoded identification capacity which in turn can be larger than pure-state-encoded simultaneous identification capacity,