Related papers: On the power of quantum, one round, two prover int…
We analyse the problem of transmitting a number of unknown quantum states or one composite system in one go. We derive a lower bound on the performance of such process, measured in the entanglement fidelity. The obtained bound is…
The maximum-likelihood principle unifies inference of quantum states and processes from experimental noisy data. Particularly, a generic quantum process may be estimated simultaneously with unknown quantum probe states provided that…
In distributed interactive proofs, the nodes of a graph G interact with a powerful but untrustable prover who tries to convince them, in a small number of rounds and through short messages, that G satisfies some property. This series of…
We establish the entangling power of a unitary operator on a general finite-dimensional bipartite quantum system with and without ancillas, and give relations between the entangling power based on the von Neumann entropy and the entangling…
We describe two quantum channels that individually cannot send any information, even classical, without some chance of decoding error. But together a single use of each channel can send quantum information perfectly reliably. This proves…
This paper considers three variants of quantum interactive proof systems in which short (meaning logarithmic-length) messages are exchanged between the prover and verifier. The first variant is one in which the verifier sends a short…
A new interpretation of entanglement entropy is proposed: entanglement entropy of a pure state with respect to a division of a Hilbert space into two subspaces 1 and 2 is an amount of information, which can be transmitted through 1 and 2…
This is the full version of a paper submitted to the Computability in Europe (CiE 2023) conference, with all proofs omitted there. In 2012 P. D. Azar and S. Micali introduced a new model of interactive proofs, called "Rational Interactive…
Suppose an experimentalist wishes to verify that his apparatus produces entangled quantum states. A finite amount of data cannot conclusively demonstrate entanglement, so drawing conclusions from real-world data requires statistical…
Quantum information theory determines the maximum rates at which information can be transmitted through physical systems described by quantum mechanics. Here we consider the communication protocol known as quantum reading. Quantum reading…
Consider the question: what statistical ensemble corresponds to minimal prior knowledge about a quantum system ? For the case where the system is in fact known to be in a pure state there is an obvious answer, corresponding to the unique…
We propose entropic measures for the strength of single-particle and two-particle interference in interferometric experiments where each particle of a pair traverses a multi-path interferometer. Optimal single-particle interference excludes…
Using the measurement-based quantum computation model, we construct interactive proofs with non-communicating quantum provers and a classical verifier. Our construction gives interactive proofs for all languages in BQP with a polynomial…
The task of testing whether quantum theory applies to all physical systems and all scales requires considering situations where a quantum probe interacts with another system that need not obey quantum theory in full. Important examples…
We study the problem of communication over a compound quantum channel in the presence of entanglement. Classically such channels are modeled as a collection of conditional probability distributions wherein neither the sender nor the…
Inverse Participation Ratios (IPRs) and the related Participation Entropies quantify the spread of a quantum state over a selected basis of the Hilbert space, offering insights into the equilibrium and non-equilibrium properties of the…
We study a networked system of innovation processes, where each process is modeled as an urn with infinitely many colors-a classical framework for capturing the emergence of novelties. Extending this paradigm, we analyze a model of…
The round complexity of interactive proof systems is a key question of practical and theoretical relevance in complexity theory and cryptography. Moreover, results such as QIP = QIP(3) (STOC'00) show that quantum resources significantly…
We characterize a pair of Cooper-pair boxes coupled with a fixed capacitor using spectroscopy and measurements of the ground-state quantum capacitance. We use the extracted parameters to estimate the concurrence, or degree of entanglement…
We present here an overview of our work concerning entanglement properties of composite quantum systems. The characterization of entanglement, i.e. the possibility to assert if a given quantum state is entangled with others and how much…