Related papers: The Minimum Distance Problem for Two-Way Entanglem…
Variational quantum algorithms constitute one of the most widespread methods for using current noisy quantum computers. However, it is unknown if these heuristic algorithms provide any quantum-computational speedup, although we cannot…
Quantum communication and computation heavily rely on entanglement distillation protocols. There is a plethora of distillation protocols for Pauli channels and also for some non-Pauli channels. However, an effort to relate the effectiveness…
In this contribution we will give a brief overview on the methods used to overcome decoherence in quantum communication protocols. We give an introduction to quantum error correction, entanglement purification and quantum cryptography. It…
We present an efficient entanglement purification protocol with hyperentanglement in which additional spatial entanglement is utilized to purify the two-particle polarization-entangled state. The bit-flip error and phase-flip error can be…
Entanglement-assisted concatenated quantum codes (EACQCs), constructed by concatenating two quantum codes, are proposed. These EACQCs show several advantages over the standard concatenated quantum codes (CQCs). Several families of EACQCs…
We propose schemes for entanglement concentration and purification for qubit systems encoded in flying atomic pairs. We use a cavity-quantum electrodynamics setting as the paradigmatic scenario within which our proposals can be implemented.…
We show that the minimal rate of noise needed to catalytically erase the entanglement in a bipartite quantum state is given by the regularized relative entropy of entanglement. This offers a solution to the central open question raised in…
This thesis investigates the entanglement of distinguishable and indistinguishable particles, introducing a new error model for Hardy's test, experimentally verified using superconducting qubits. We address challenges in implementing…
Reducing errors is essential for reliable quantum computation. Quantum error mitigation (QEM) and quantum error correction (QEC) are two leading approaches for this task, each with challenges: QEM suffers from high sampling costs and cannot…
We propose a new avenue towards distillation of quantum entanglement that is implemented by directly passing the entangled qubits through a mode-matched filter. This approach can be applied to a common class of entanglement impurities…
Entanglement-assisted concatenated quantum codes (EACQCs) are constructed by concatenating two entanglement-assisted quantum error-correcting codes (EAQECCs). By selecting the inner and outer component codes carefully, it is able to…
We propose and investigate a method to optimize recurrence entanglement purification protocols. The approach is based on a numerical search in the whole set of SU(4) matrices with the aid of a quasi-Newton algorithm. Our method evaluates…
Given a finite number $N$ of copies of a qubit state we compute the maximum fidelity that can be attained using joint-measurement protocols for estimating its purity. We prove that in the asymptotic $N\to\infty$ limit, separable-measurement…
Finding the minimal relative entropy of two quantum states under semidefinite constraints is a pivotal problem located at the mathematical core of various applications in quantum information theory. An efficient method for providing…
We present a method for multipartite entanglement purification of any stabilizer state shared by several parties. In our protocol each party measures the stabilizer operators of a quantum error-correcting code on his or her qubits. The…
Quantum repeaters create long-distance entanglement between quantum systems while overcoming difficulties such as the attenuation of single photons in a fiber. Recently, an implementation of a repeater protocol based on single qubits in…
Learning unknown processes affecting a quantum system reveals underlying physical mechanisms and enables suppression, mitigation, and correction of unwanted effects. Describing a general quantum process requires an exponentially large…
We prove a one-shot "minimax" converse bound for quantum channel coding assisted by positive partial transpose channels between sender and receiver. The bound is similar in spirit to the converse by Polyanskiy, Poor, and Verdu [IEEE Trans.…
Uniform continuity bounds on entropies are generally expressed in terms of a single distance measure between a pair of probability distributions or quantum states, typically, the total variation distance or trace distance. However, if an…
Quantum entanglement serves as a valuable resource for many important quantum operations. A pair of entangled qubits can be shared between two agents by first preparing a maximally entangled qubit pair at one agent, and then sending one of…