Related papers: Realization of a collective decoding of codeword s…
We introduce a quantum analogue of a classical synchronizing automaton. In classical case the state of a system evolves according to a set of rules forming an alphabet, and sequences of these rules, called words, govern its evolution.…
In this paper we present the novel qualities of entanglement of formation for general (so also infinite dimensional) quantum systems and we introduce the notion of coefficient of quantum correlations. Our presentation stems from rigorous…
Quantum information brings together theories of physics and computer science. This synthesis challenges the basic intuitions of both fields. In this thesis, we show that adopting a unified and general language for process theories advances…
We describe a successive-cancellation \emph{list} decoder for polar codes, which is a generalization of the classic successive-cancellation decoder of Ar{\i}kan. In the proposed list decoder, up to $L$ decoding paths are considered…
We introduce a new information-theoretic measure of multipartite quantum/classical correlations $\Delta_P$, by generalizing the entanglement of purification to multipartite states. We provide proofs of its various properties, focusing on…
A fundamental problem in quantum information is to describe efficiently multipartite quantum states. An efficient representation in terms of graphs exists for several families of quantum states (graph, cluster, stabilizer states),…
The analysis of multiparticle quantum states is a central problem in quantum information processing. This task poses several challenges for experimenters and theoreticians. We give an overview over current problems and possible solutions…
The strengthened data processing inequality have been proved. The general theory have been illustrated on the simple example.
I assess the potential of quantum computation. Broad and important applications must be found to justify construction of a quantum computer; I review some of the known quantum algorithms and consider the prospects for finding new ones.…
Polar codes provably achieve the capacity of a wide array of channels under successive decoding. This assumes infinite precision arithmetic. Given the successive nature of the decoding algorithm, one might worry about the sensitivity of the…
We outline the principal results of a recent examination of the quantization of systems with first- and second-class constraints from the point of view of coherent-state phase-space path integration. Two examples serve to illustrate the…
In classical computing, error-correcting codes are well established and are ubiquitous both in theory and practical applications. For quantum computing, error-correction is essential as well, but harder to realize, coming along with…
We construct a class of topological quantum codes to perform quantum entanglement distillation. These codes implement the whole Clifford group of unitary operations in a fully topological manner and without selective addressing of qubits.…
Quantum technologies have the potential to solve certain computationally hard problems with polynomial or super-polynomial speedups when compared to classical methods. Unfortunately, the unstable nature of quantum information makes it prone…
We introduce a generalization of entanglement based on the idea that entanglement is relative to a distinguished subspace of observables rather than a distinguished subsystem decomposition. A pure quantum state is entangled relative to such…
Optical coherent states are classical light fields with high purity, and are essential carriers of information in optical networks. If these states could be controlled in the quantum regime, allowing for their quantum superposition…
A series of successive quantizations is considered, starting with the quantization of a non relativistic or relativistic point particle: 1) quantization of a particle's position, 2) quantization of wave function, 3) quantization of wave…
An m-uniform quantum state on n qubits is an entangled state in which every m-qubit subsystem is maximally mixed. Starting with an m-uniform state realized as the graph state associated with an m-regular graph, and a classical [n,k,d \ge…
We survey various recent results that rigorously study the complexity of learning quantum states. These include progress on quantum tomography, learning physical quantum states, alternate learning models to tomography and learning classical…
The main contribution of this paper is the introduction of a dynamic logic formalism for reasoning about information flow in composite quantum systems. This builds on our previous work on a complete quantum dynamic logic for single systems.…