Papers for

quantum communication system developers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Encoding choices affect quantum node design and error rates

Encodings and Node Architecture: Lessons from the Fault-Tolerant Distributed Transversal Fanout

Abstract: An encoding choice specifies the quantum error-correcting code used to encode logical qubits at a given node. Different encoding choices may differ in the number of physical qubits, the number of encoded logical qubits, the code distance, and the available fault-tolerant operations. We study different encodings for a distributed transversal fanout operation and look at its implications on node architecture. Our experiments suggest that an encoding with higher distance, even if requiring more ebits, can yield a lower logical error rate for distributed operations, and that ``upgrading'' an encoding prior to distributed operations and having a cache, as part of node architecture, for qubits can be useful for distributed operations.

Fri 16 OctDistributed, Parallel, and Cluster Computing
The gist
Quantum computers use special codes to protect information from mistakes. This paper looks at how choosing different codes changes the chances of errors when performing a specific task across connected quantum computers. The authors found that codes that protect better can reduce mistakes, even if they need more resources. They also suggest upgrading codes before the task and keeping backup qubits ready can help improve performance in quantum networks.
Open → 2610.22966v1

Pauli error composition controls key rate in multiparty quantum networks

Pauli Error Composition Determines the Multipartite Advantage in Conference Key Agreement

Abstract: GHZ-based conference key agreement distributes a shared key to $N$ parties in one network use, whereas pairwise BB84 needs $N-1$. The survival of that advantage has been studied against party number, loss, and topology, but almost always with the channel fixed at depolarizing. Simulating both protocols exactly for $N = 3, 4, 5$ under dephasing, amplitude damping, and depolarizing noise, we find the crossover is set by the channel's Pauli error composition, not its identity: normalized to average infidelity, amplitude damping and depolarizing agree to within about 1\% at each group size, while dephasing can tolerate roughly $2.4\times$ more at $N = 3$. We derive a closed-form rate for arbitrary per-party Pauli noise and use it to prove that concentrating a fixed noise budget on one arm is strictly worse than spreading it, and that giving the dealer role to the cleanest arm improves the rate by roughly 18\%. One structural fact drives every result: the phase-error term is a product over all $N$ arms, while the bit-error term stays local to a pair.

Mon 5 OctCryptography and SecurityNetworking and Internet Architecture
The gist
When multiple people want to share a secret key securely using quantum methods, a special quantum state called a GHZ state can let them do it all at once, unlike older methods that require many rounds. The authors studied how different kinds of noise in the communication channels affect this advantage. They found that it’s not just the type of noise, but how the noise is composed of certain basic errors (called Pauli errors) that determines performance. They also discovered that spreading noise evenly across all parties and choosing the cleanest connection to manage the key boosts the method's efficiency.
Open → 2610.07251v1

Efficient entanglement generation method achieves quantum limits in bosonic channels

Efficient capacity-achieving entanglement generation with application to pure-loss Bosonic channels

Abstract: While the ultimate limits on the rate of quantum communication over noisy channels are well-established, very few efficient coding schemes achieving these limits are known. This contrasts sharply with transmitting classical data over classical channels, where polar codes and low-density parity-check codes both efficiently achieve the classical capacity of any noisy channel. In this work we construct an efficient entanglement generation scheme which achieves the coherent information for a broad class of channels. For degradable channels in the class, which includes truncated versions of the pure loss Bosonic channel, the resulting scheme achieves the quantum capacity. The construction makes use of polar codes for two kinds of classical-input, quantum-output (CQ) channels: those with commuting outputs and those whose outputs are heralded mixtures of pure states. The former case is amenable to decoding by classical polar decoding algorithms, the latter by the belief propagation with quantum messages (BPQM) algorithm. To our knowledge, this construction is the first explicit and efficiently decodable protocol that achieves the energy-constrained quantum capacity of the pure-loss Bosonic channel.

Fri 2 OctInformation Theory
The gist
Communicating quantum information perfectly over noisy channels is very challenging, and only a few efficient methods to do so are known. The authors develop a new scheme that efficiently creates entanglement—a key resource for quantum communication—that achieves the best possible transmission rate for a wide range of quantum channels. Their method uses special error-correcting codes called polar codes for certain quantum channels, allowing for practical decoding strategies. This is the first explicit and efficiently decodable protocol to reach the optimal quantum communication capacity in common models of optical communication.
Open → 2610.03674v1