Related papers: Universal recovery map for approximate Markov chai…
We present a simple and efficient Bayesian recursive algorithm for the data-pattern scheme for quantum state reconstruction, which is applicable to situations where measurement settings can be controllably varied efficiently. The algorithm…
Generic non-Markovian quantum processes have infinitely long memory, implying an exact description that grows exponentially in complexity with observation time. Here, we present a finite memory ansatz that approximates (or recovers) the…
Correlation function and mutual information are two powerful tools to characterize the correlations in a quantum state of a composite system, widely used in many-body physics and in quantum information science, respectively. We find that…
We probe the multipartite entanglement structure of the vacuum state of a CFT in 1+1 dimensions, using recovery operations that attempt to reconstruct the density matrix in some region from its reduced density matrices on smaller…
Quantum information scrambling refers to the loss of local recoverability of quantum information, which has found widespread attention from high energy physics to quantum computing. In the present analysis we propose a possible starting…
Quantum state tomography is both a crucial component in the field of quantum information and computation, and a formidable task that requires an incogitably large number of measurement configurations as the system dimension grows. We…
Recently, the principle of information causality has appeared as a good candidate for an information-theoretic principle that would single out quantum correlations among more general non-signalling models. Here we present results going in…
We present certain universal bounds on the capacity of quantum information storage and on the time scale of its retrieval for a generic quantum field theoretic system. The capacity, quantified by the microstate entropy, is bounded from…
We study the problem of recovering a hidden community of cardinality $K$ from an $n \times n$ symmetric data matrix $A$, where for distinct indices $i,j$, $A_{ij} \sim P$ if $i, j$ both belong to the community and $A_{ij} \sim Q$ otherwise,…
Knowing and guessing, these are two essential epistemological pillars in the theory of quantum-mechanical measurement. As formulated quantum mechanics is a statistical theory. In general, a priori unknown states can be completely determined…
Quantum information scrambling (QIS) is a characteristic feature of several quantum systems, ranging from black holes to quantum communication networks. While accurately quantifying QIS is crucial to understanding many such phenomena,…
Quantum information scrambling (QIS), from the perspective of quantum information theory, is generally understood as local non-retrievability of information evolved through some dynamical process, and is often quantified via entropic…
Complex processes often arise from sequences of simpler interactions involving a few particles at a time. These interactions, however, may not be directly accessible to experiments. Here we develop the first efficient method for unravelling…
The quantum entanglement $E$ of a bipartite quantum Ising chain is compared with the mutual information $I$ between the two parts after a local measurement of the classical spin configuration. As the model is conformally invariant, the…
In this paper, we consider the standard quantum information decoupling, in which Alice aims to decouple her system from the environment by local operations and discarding some of her systems. To achieve an $\varepsilon$-decoupling with…
Quantum networks hold the promise for revolutionary advances in information processing with quantum resources distributed over remote locations via quantum-repeater architectures. Quantum networks are composed of nodes for storing and…
Recovery of the causal structure of dynamic networks from noisy measurements has long been a problem of interest across many areas of science and engineering. Many algorithms have been proposed, but there is little work that compares the…
Consider the unstructured search of an unknown number l of items in a large unsorted database of size N. The multi-object quantum search algorithm consists of two parts. The first part of the algorithm is to generalize Grover's…
We demonstrate that there exists a universal, near-optimal recovery map---the transpose channel---for approximate quantum error-correcting codes, where optimality is defined using the worst-case fidelity. Using the transpose channel, we…
The no-masking theorem says that masking quantum information is impossible in a bipartite scenario. However, there exist schemes to mask quantum states in multipartite systems. In this work, we show that, the joint measurement in the…