Related papers: Computational Distinguishability of Quantum Channe…
This paper presents a systematic study of adversarial hypothesis testing for both quantum-quantum (QQ) and classical-quantum (CQ) channels. Unlike conventional channel discrimination, we consider a framework where the sender, Alice, selects…
This note is intended to foster a discussion about the extent to which typical problems arising in quantum information theory are algorithmically decidable (in principle rather than in practice). Various problems in the context of…
The development of quantum algorithms and protocols calls for adequate modelling and verification techniques, which requires abstracting and focusing on the basic features of quantum concurrent systems, like CCS and CSP have done for their…
We present a method to detect properties of quantum channels, assuming that some a priori information about the form of the channel is available. The method is based on a correspondence with entanglement detection methods for multipartite…
A formula for the capacity of a quantum channel for transmitting private classical information is derived. This is shown to be equal to the capacity of the channel for generating a secret key, and neither capacity is enhanced by forward…
Quantum algorithms based on quantum kernel methods have been investigated previously [1]. A quantum advantage is derived from the fact that it is possible to construct a family of datasets for which, only quantum processing can recognise…
Adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its computational power was unknown. We describe an efficient adiabatic simulation of any given quantum algorithm, which…
I develop a theory of classicality from quantum systems. This theory stems from the study of classical and quantum stationary stochastic processes. The stochastic processes are characterized by polyhedral (classical) and semidefinite…
The study of quantum channels is the fundamental field and promises wide range of applications, because any physical process can be represented as a quantum channel transforming an initial state into a final state. Inspired by the method…
Divisibility of dynamical maps turns out to be a fundamental notion in characterising Markovianity of quantum evolution, although the decision problem for divisibility itself is computationally intractable. In this work, we propose the…
For a continuous-input-continuous-output arbitrarily distributed quantum channel carrying classical information, the channel capacity can be computed in terms of the distribution of the channel envelope, received signal strength over a…
The polynomial hierarchy plays a central role in classical complexity theory. Here, we define a quantum generalization of the polynomial hierarchy, and initiate its study. We show that not only are there natural complete problems for the…
The purpose of this paper is to explore the applications of quantum computing to energy systems optimization problems and discuss some of the challenges faced by quantum computers with techniques to overcome them. The basic concepts…
We consider a setting where a stream of qubits is processed sequentially. We derive fundamental limits on the rate at which classical information can be transmitted using qubits that decohere as they wait to be processed. Specifically, we…
We review some partial results for two strictly related problems. The first problem consists in finding the optimal joint unitary transformation on system and ancilla which is the most efficient in programming any desired channel on the…
Quantum computing has been a fascinating research field in quantum physics. Recent progresses motivate us to study in depth the universal quantum computing models (UQCM), which lie at the foundation of quantum computing and have tight…
The capacity of classical channels is convex. This is not the case for the quantum capacity of a channel: the capacity of a mixture of different quantum channels exceeds the mixture of the individual capacities and thus is non-convex. Here…
We consider compound as well as arbitrarily varying classical-quantum channel models. For classical-quantum compound channels, we give an elementary proof of the direct part of the coding theorem. A weak converse under average error…
The problem of reconstructing a quantum channel from a sample of classical data is considered. When the total fidelity can be represented as a ratio of two quadratic forms (e.g., in the case of mapping a mixed state to a pure state,…
We explore complementarity between output and environment of a quantum channel (or, more generally, CP map), making an observation that the output purity characteristics for complementary CP maps coincide. Hence, validity of the…