A quantum game of telephone

• URL: http://arxiv.org/abs/2608.03963v1
• Date: Tue, 04 Aug 2026 17:28:28 GMT
• Title: A quantum game of telephone
• Abstract summary: We introduce quantum telephone'', an iterative ancilla-assisted process tomography protocol.<n>We observe noisy intermediate channels create fundamental parameter degeneracies.<n>This approach obviates the strict full-rank requirements of standard ancilla-assisted process tomography.
• Score: 0.4310167974376404
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Characterizing multinode quantum networks without ubiquitous local entanglement sources presents significant experimental challenges. We introduce ``quantum telephone,'' an iterative ancilla-assisted process tomography protocol that leverages intermediate detection events, effectively treating previously probed links as ancillae for subsequent links. Implemented on a deployed multinode fiber network, we observe noisy intermediate channels create fundamental parameter degeneracies that compound inference errors under sequential estimation. Counterintuitively, the inclusion of downstream near-unitary channels provides boundary constraints that, when used in tandem with global inference, can resolve ambiguity in channels earlier in the sequence. By compensating for localized information loss, this approach obviates the strict full-rank requirements of standard ancilla-assisted process tomography, even when intermediate states become completely depolarized. Overall, quantum telephone offers a hardware-efficient and information-maximizing path toward characterizing complex quantum networks with limited resources.

Related papers

• Asymptotic Limits of Entanglement Distribution [43.748379918040854]
  We investigate the limits of entanglement distribution across quantum networks utilizing intermediate stations and local operations.<n>We establish a strict dichotomy: the preservation of entanglement over arbitrarily long distances is possible if the underlying quantum channel admits a correctable subspace.<n>We derive a fundamental lower bound on the physical resource requirements, proving that for channels without a correctable subspace, the number of parallel channels per link must scale at least logarithmically with the number of intermediate stations to sustain a non-zero amount of entanglement.
  arXiv  Detail & Related papers  (2026-05-22T09:56:38Z)
• Quantum Network Tomography for General Topology with SPAM Errors [19.656222951626084]
  The goal of quantum network tomography (QNT) is the characterization of internal quantum channels in a quantum network from external peripheral operations.<n>We introduce a novel network tomography method, termed Mergecast, in quantum networks.<n>We extend our investigation to a more realistic QNT scenario that incorporates state preparation and measurement (SPAM) errors.
  arXiv  Detail & Related papers  (2025-11-02T20:42:00Z)
• In situ quantum verification of polarization-stabilized optical channels [0.712813885457233]
  We introduce a novel in situ benchmarking approach that augments a classical polarization tracking system.<n>The method uses the reconstructed map both to validate the classical compensation and to expose noise sources it fails to capture.<n>Our results should unlock new opportunities for in situ channel characterization in quantum-classical coexistence networks.
  arXiv  Detail & Related papers  (2025-10-30T00:19:59Z)
• Crosstalk-Resilient Quantum MIMO for Scalable Quantum Communications [40.44880302154388]
  Crosstalk arises when physically coupled quantum modes interfere, degrading signal fidelity.<n>We propose a mitigation strategy based on encoding discrete-variable quantum information into continuous-variable modes.<n>We prove the existence of a gauge-fixing decoder enabling recovery of the logical information.
  arXiv  Detail & Related papers  (2025-06-26T18:40:26Z)
• Optimizing entanglement distribution via noisy quantum channels [44.99833362998488]
  Entanglement distribution is a crucial problem in quantum information science.<n>We investigate strategies for distributing quantum entanglement between two distant parties through noisy quantum channels.
  arXiv  Detail & Related papers  (2025-06-06T13:48:20Z)
• Learning Orthogonal Random Unitary Channels with Contracted Quantum Approaches and Simplex Optimization [41.94295877935867]
  We present a procedure for learning a class of random unitary channels on a quantum computer.<n>Our approach involves a multi-objective, Pauli- and unitary-based minimization, and allows for learning locally equivalent channels.
  arXiv  Detail & Related papers  (2025-01-28T19:02:52Z)
• Correcting for finite statistics effects in a quantum steering experiment [33.013102271622614]
  We introduce a one-sided device-independent protocol that corrects for apparent signaling effects in experimental probability distributions.<n>Our results show a significantly higher probability of violation than existing state-of-the-art inequalities.<n>This work demonstrates the power of semidefinite programming for entanglement verification and brings quantum networks closer to practical applications.
  arXiv  Detail & Related papers  (2023-05-23T14:39:08Z)
• Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
  This paper studies the study of fault-tolerant channel coding for quantum channels. We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
  arXiv  Detail & Related papers  (2022-10-06T14:09:16Z)
• Quantum Network Tomography with Multi-party State Distribution [10.52717496410392]
  characterization of quantum channels in a quantum network is of paramount importance. We introduce the problem of Quantum Network Tomography. We study this problem in detail for the case of arbitrary star quantum networks with quantum channels described by a single Pauli operator.
  arXiv  Detail & Related papers  (2022-06-06T21:47:09Z)
• Quantum-enabled communication without a phase reference [1.14219428942199]
  A phase reference has been a standard requirement in continuous-variable quantum sensing and communication protocols. We show that quantum communication and entanglement-assisted communication without a phase reference are possible, when a short-time memory effect is present.
  arXiv  Detail & Related papers  (2020-10-22T18:19:00Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.