Entanglement distillation, a fundamental building block of quantum networks, enables the purification of noisy entangled states shared among distant nodes by local operations and classical communication. Its practical realization presents several technical challenges, including the storage of quantum states in quantum memory and the execution of coherent quantum operations on multiple copies of states within the quantum memory. In this work, we present an entanglement purification protocol via quantum communication, namely a carrier-assisted entanglement purification protocol, which utilizes two elements only: i) quantum memory for a single-copy entangled state shared by parties and ii) single qubits travelling between parties. We show that the protocol, when single-qubit transmission is noiseless, can purify a noisy entangled state shared by parties. When single-qubit transmission is noisy, the purification relies on types of noisy qubit channels; we characterize Pauli channels such that the protocol works for the purification. We address this limitation by using multiple carrier qubits, and show that for any non-entanglement-breaking Pauli channel, the protocol's fixed-point fidelity approaches unity as the number of carriers increases. Our results significantly reduce the experimental overhead required for distilling entanglement: the practical advantage is demonstrated through parameters directly related to the capability of entanglement purification, such as noise in quantum memory, local measurements, channel use, and entanglement fidelity. We envisage that the protocol would make long-distance pure entanglement closer to a practical realization.
A few simply stated rules govern the entanglement patterns that can occur in mutually unbiased basis sets (MUBs) and constrain the combinations of such patterns that can coexist in full complements of MUBs. We consider Hilbert spaces of prime power dimensions (
D=pN), as realized by systems of
N prime-state particles, where full complements of
D+1 MUBs are known to exist, and we assume only that MUBs are eigenbases of generalized Pauli operators, without using any particular construction. The general rules include the following: (1) In any MUB, a given particle appears either in a pure state or totally entangled and (2) in any full MUB complement, each particle is pure in (
p+1) bases (not necessarily the same ones) and totally entangled in the remaining (${p}^{N}\ensuremath{-}p$). It follows that the maximum number of product bases is
p+1 and, when this number is realized, all remaining (${p}^{N}\ensuremath{-}p$) bases in the complement are characterized by the total entanglement of every particle. This ``standard distribution'' is inescapable for two-particle systems (of any
p), where only product and generalized Bell bases are admissible MUB types. This and the following results generalize previous results for qubits [Phys. Rev. A 65. 032320 (2002); Phys. Rev. A 72, 062310 (2005)] and qutrits [Phys. Rev. A 70, 012302 (2004)], drawing particularly upon [Phys. Rev. A 72, 062310 (2005)]. With three particles there are three MUB types, and these may be combined in (
p+2) different ways to form full complements. With
N=4, there are 6 MUB types for
p=2, but new MUB types become possible with larger
p, and these are essential to realizing full complements. With this example, we argue that new MUB types that show new entanglement patterns should enter with every step in
N and, also, when
N is a prime plus 1, at a critical
p value, $p=N\ensuremath{-}1$. Such MUBs should play critical roles in filling complements.
A set of mutually unbiased bases (MUBs) is said to be unextendible if there does not exist another basis that is unbiased with respect to the given set. Here, we prove the existence of smaller sets of MUBs in prime-squared dimensions (
d=p2) that cannot be extended to a complete set using the generalized Pauli operators. We further observe an interesting connection between the existence of unextendible sets and the tightness of entropic uncertainty relations (EURs) in these dimensions. In particular, we show that our construction of unextendible sets of MUBs naturally leads to sets of
p+1 MUBs that saturate both a Shannon (
H1) and a collision (
H2) entropic lower bound. Such an identification of smaller sets of MUBs satisfying tight EURs is crucial for cryptographic applications as well as constructing optimal entanglement witnesses for higher dimensional systems.
Mutually unbiased bases (MUBs) play a crucial role in numerous applications within quantum information science, such as quantum state tomography, error correction, entanglement detection, and quantum cryptography. Utilizing
2n+1 MUB circuits provides a minimal and optimal measurement strategy for reconstructing all
n-qubit unknown states. It significantly reduces the number of measurements compared to the traditional
4n Pauli observables, also enhancing the robustness of quantum key distribution (QKD) protocols. Previous circuit designs that rely on a single generator can result in exponential gate costs for some MUB circuits. In this work, we present an efficient algorithm to generate each of the
2n+1 quantum MUB circuits on
n-qubit systems within
O(n3) time. The algorithm features a three-stage structure, and we have calculated the average number of different gates for random sampling. Additionally, we have identified two linear properties: the entanglement part can be directly defined into
2n−3 fixed sub-parts, and the knowledge of
n special MUB circuits is sufficient to construct all
2n+1 MUB circuits. This new efficient and simple circuit construction paves the way for the implementation of a complete set of MUBs in diverse quantum information processing tasks on high-dimensional quantum systems.
Entanglement routing establishes entangled pairs between distant nodes of a quantum network by purifying and swapping pairs generated on elementary links. Existing methods typically restrict the decision space along two axes: the operation order, often fixed to purify-then-swap (PtS), and the purification schedule of each link, often restricted to pumping. Focusing on linear repeater chains with finite link capacities, we relax both restrictions and study the maximization of the expected end-to-end throughput subject to a fidelity threshold under two quantum-noise models. We develop a unified capacity-aware optimization framework comprising an exact mixed-integer linear program (MILP) under PtS, instantiated with either pumping or general tree purification schedules, and an exact dynamic program (DP) over arbitrary operation orders. Under symmetric Pauli noise, we prove that pumping converges to a fidelity strictly below unity, imposing a capacity-independent feasibility bound and a maximum chain length on every pumping-based PtS method, whereas general tree schedules yield a capacity-dependent bound. We further prove that post-swap purification never increases the throughput, so a free operation order can only increase feasibility. Numerical evaluations confirm the bounds: tree schedules serve over 90\% of the requests that pumping cannot at moderate fidelity thresholds; within the pumping class, a free operation order recovers much of this advantage; but once links use tree schedules, the tree-based MILP and the order-exact DP serve identical request sets throughout. Operation order and purification schedule are thus substitutes, with the purification schedule the dominant factor governing feasibility under symmetric Pauli noise.
Certifying entanglement is an important step in the development of many quantum technologies, especially for higher-dimensional systems, where entanglement promises increased capabilities for quantum communication and computation. A key feature distinguishing entanglement from classical correlations is the occurrence of correlations for complementary measurement bases. In particular, mutually unbiased bases (MUBs) are a paradigmatic example that is well-understood and routinely employed for entanglement certification. However, implementing unbiased measurements exactly is challenging and not generically possible for all physical platforms. Here, we extend the entanglement-certification toolbox from correlations in MUBs to arbitrary bases. This practically significant simplification paves the way for efficient characterizations of high-dimensional entanglement in a wide range of physical systems. Furthermore, we introduce a simple three-MUBs construction for all dimensions without using the Wootters-Fields construction, potentially simplifying experimental requirements when measurements in more than two MUBs are needed, especially in high-dimensional settings.