Related papers: Certifying quantumness with the classical fidelity…
Quantum states are very delicate, so it is likely some sort of quantum error correction will be necessary to build reliable quantum computers. The theory of quantum error-correcting codes has some close ties to and some striking differences…
For a given pure state of a composite quantum system we analyze the product of its projections onto a set of locally orthogonal separable pure states. We derive a bound for this product analogous to the entropic uncertainty relations. For…
We study commitment scheme for classical-quantum channels. To accomplish this we define various notions of commitment capacity for these channels and prove matching upper and lower bound on it in terms of the conditional entropy. Our…
Entanglement depth quantifies how many qubits share genuine multipartite entanglement, but certification typically relies on tailored witnesses or full tomography, both of which scale poorly with system size. We recast entanglement-depth…
The low-energy subspace of a conformal field theory (CFT) can serve as a quantum error correcting code, with important consequences in holography and quantum gravity. We consider generic 1+1D CFT codes under extensive local dephasing…
This Letter verifies the potential of several classes of entangled coherent state in well known quantum metrology which includes detection of classical external force, and shows that there is a class of entangled coherent state for the…
In this work we aim at quantifying quantum channel output similarity. In order to achieve this, we introduce the notion of quantum channel superfidelity, which gives us an upper bound on the quantum channel fidelity. This quantity is…
In this paper, we study quantum dense coding between two arbitrarily fixed particles in a (N+2)-particle maximally-entangled states through introducing an auxiliary qubit and carrying out local measurements. It is shown that the transmitted…
We introduce the concept of quasi-inverse of quantum and classical channels, prove general properties of these inverses and determine them for a large class of channels acting in an arbitrary finite dimension. Therefore we extend the…
Quantum computing hardware has grown sufficiently complex that it often can no longer be simulated by classical computers, but its computational power remains limited by errors. These errors corrupt the results of quantum algorithms, and it…
The quantum relative entropy is a fundamental quantity in quantum information science, characterizing the distinguishability between two quantum states. However, this quantity is not additive in general for correlated quantum states,…
The stochastic evolution of quantum systems during measurement is arguably the most enigmatic feature of quantum mechanics. Measuring a quantum system typically steers it towards a classical state, destroying any initial quantum…
The coding theorem for the entanglement-assisted communication via infinite-dimensional quantum channel with linear constraint is extended to a natural degree of generality. Relations between the entanglement-assisted classical capacity and…
Demonstrating quantum advantage requires experimental implementation of a computational task that is hard to achieve using state-of-the-art classical systems. One approach is to perform sampling from a probability distribution associated…
This paper addresses some general questions of quantum information theory arising from the transmission of quantum entanglement through (possibly noisy) quantum channels. A pure entangled state is prepared of a pair of systems $R$ and $Q$,…
A strong converse bound for the classical identification capacity of a quantum channel is an upper bound on the asymptotic identification rate of classical messages sent through the channel, such that, above this rate, the probability of an…
Quantum fidelity is a central tool in quantum information, quantifying how much two quantum states are similar. Here we propose a limit formula for the quantum fidelity between a mixed state and a pure state. As an example of an…
In an entanglement distribution network, the function of a quantum switch is to generate elementary entanglement with its clients followed by entanglement swapping to distribute end-to-end entanglement of sufficiently high fidelity between…
Fidelity is one of the most widely used quantities in quantum information that measure the distance of quantum states through a noisy channel. In this paper, we introduce a quantum analogy of computation tree logic (CTL) called QCTL, which…
Arrays of optically trapped neutral atoms are a promising architecture for the realization of quantum computers. In order to run increasingly complex algorithms, it is advantageous to demonstrate high-fidelity and flexible gates between…