Related papers: Quantum MacWilliams Identities
Relational verification of quantum programs has many potential applications in quantum and post-quantum security and other domains. We propose a relational program logic for quantum programs. The interpretation of our logic is based on a…
We introduce the (logarithmic) bipartite fidelity of a quantum system $A\cup B$ as the (logarithm of the) overlap between its ground-state wave function and the ground-state one would obtain if the interactions between two complementary…
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…
An important part of the information theory folklore had been about the output statistics of codes that achieve the capacity and how the empirical distributions compare to the output distributions induced by the optimal input in the channel…
Neuroscientists face challenges in analyzing high-dimensional neural recording data of dense functional networks. Without ground-truth reference data, finding the best algorithm for recovering neurologically relevant networks remains an…
Quantum programs exhibit inherent non-deterministic behavior, which poses more significant challenges for error discovery compared to classical programs. While several testing methods have been proposed for quantum programs, they often…
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…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
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…
We consider, within the algebraic formalism, the time dependence of fidelity for qubits encoded into an open physical system. We relate the decay of fidelity to the evolution of correlation functions and, in the particular case of a…
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…
We present Quantum Cloning Machines (QCM) that transform N identical qubits into $M>N$ identical copies and we prove that the fidelity (quality) of these copies is optimal. The connection between cloning and measurement is discussed in…
Quantum communications using continuous variables are quite mature experimental techniques and the relevant theories have been extensively investigated with various methods. In this paper, we study the continuous variable quantum channels…
If a sender and a receiver lack precise knowledge about the communication line that connects them, designing a scheme to reliably transmit information becomes more challenging. This has been studied in classical and quantum information…
We study the identification capacity of classical-quantum channels ("cq-channels"), under channel uncertainty and privacy constraints. To be precise, we consider first compound memoryless cq-channels and determine their identification…
Quantum entanglement is a unique criterion of the quantum realm and an essential tool to secure quantum communication. Ensuring high-fidelity entanglement has always been a challenging task owing to interaction with the hostile channel…
Kernel methods have a wide spectrum of applications in machine learning. Recently, a link between quantum computing and kernel theory has been formally established, opening up opportunities for quantum techniques to enhance various existing…
The present work continues investigation of the capacities of measurement (quantum-classical) channels in the most general setting, initiated in~\cite{HCT}. The proof of coding theorems is given for the classical capacity and…
This work develops analytic methods to quantitatively demarcate quantum reality from its subset of classical phenomenon, as well as from the superset of general probabilistic theories. Regarding quantum nonlocality, we discuss how to…
Generalizing the quantifiers used to classify correlations in bipartite systems, we define genuine total, quantum, and classical correlations in multipartite systems. The measure we give is based on the use of relative entropy to quantify…