Temporal Framework for Causality-Preserving Scheduling of Measurements in Quantum Networks

• URL: http://arxiv.org/abs/2602.12459v1
• Date: Thu, 12 Feb 2026 22:36:30 GMT
• Title: Temporal Framework for Causality-Preserving Scheduling of Measurements in Quantum Networks
• Authors: Jakob Kaltoft Søndergaard, René Bødker Christensen, Petar Popovski,
• Abstract summary: quantum protocols rely on classical feedforward information to process measurement outcomes.<n> heterogeneous hardware and uncertain local timing can make causal order of measurements ambiguous.<n>We propose a time-division architecture for quantum networks in which nodes perform measurements in pre-assigned slots.
• Score: 37.29183352005633
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Distributed quantum protocols rely on classical feedforward information to process measurement outcomes, but heterogeneous hardware and uncertain local timing can make the causal order of measurements ambiguous when inferred solely from arrival times. Even in simple line networks with only Pauli measurements, end nodes cannot distinguish whether a missing outcome is caused by slow measurement or by delayed classical propagation. To resolve this ambiguity, we propose a time-division architecture for quantum networks in which nodes perform measurements in pre-assigned slots, ensuring a unique causal interpretation of outcomes. We formalize this temporal framework and derive the feedforward and adjacency constraints required to preserve measurement causality. For simple network topologies, we present an algorithm that yields optimal measurement schedules. Overall, the proposed time-division model provides a practical coordination layer that bridges the classical network timing with quantum measurement processing, enabling reliable and scalable measurement-based quantum networking.

Related papers

• Probing graph topology from local quantum measurements [0.0]
  We show that global properties of an unknown quantum network, such as the average degree, hub density, and the number of closed paths of fixed length, can be inferred from strictly local quantum measurements.<n>We demonstrate that a malicious agent with access to only a small subset of nodes can initialize quantum states locally and, through repeated short-time measurements, extract sensitive structural information about the entire network.
  arXiv  Detail & Related papers  (2025-07-31T16:06:45Z)
• Quantum Advantage in Distributed Sensing with Noisy Quantum Networks [37.23288214515363]
  It is critically important to analyze the achievability of quantum advantage under realistic imperfections.<n>We show that quantum advantage in distributed sensing can be achieved with noisy quantum networks which can only distribute noisy entangled states.
  arXiv  Detail & Related papers  (2024-09-25T16:55:07Z)
• Speed-Accuracy Trade-Off Relations in Quantum Measurements and Computations [0.0]
  We establish a fundamental speed-accuracy trade-off relation based on the energy conservation law and the locality.<n>Our trade-off works as a no-go theorem that the zero-error measurement for the operators that are non-commutative with the Hamiltonian cannot be implemented with finite time.
  arXiv  Detail & Related papers  (2024-05-24T07:24:40Z)
• Learning the tensor network model of a quantum state using a few single-qubit measurements [0.0]
  The constantly increasing dimensionality of artificial quantum systems demands highly efficient methods for their characterization and benchmarking. Here we present a constructive and numerically efficient protocol which learns a tensor network model of an unknown quantum system.
  arXiv  Detail & Related papers  (2023-09-01T11:11:52Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Uncovering the Missing Pattern: Unified Framework Towards Trajectory Imputation and Prediction [60.60223171143206]
  Trajectory prediction is a crucial undertaking in understanding entity movement or human behavior from observed sequences. Current methods often assume that the observed sequences are complete while ignoring the potential for missing values. This paper presents a unified framework, the Graph-based Conditional Variational Recurrent Neural Network (GC-VRNN), which can perform trajectory imputation and prediction simultaneously.
  arXiv  Detail & Related papers  (2023-03-28T14:27:27Z)
• Inferring Quantum Network Topology using Local Measurements [3.549868541921029]
  We propose an efficient protocol for distinguishing and inferring the topology of a quantum network. We show that the protocol can be entirely robust to noise and can be implemented via quantum variational optimization.
  arXiv  Detail & Related papers  (2022-12-15T17:36:12Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Neural network enhanced measurement efficiency for molecular groundstates [63.36515347329037]
  We adapt common neural network models to learn complex groundstate wavefunctions for several molecular qubit Hamiltonians. We find that using a neural network model provides a robust improvement over using single-copy measurement outcomes alone to reconstruct observables.
  arXiv  Detail & Related papers  (2022-06-30T17:45:05Z)
• Wireless Quantized Federated Learning: A Joint Computation and Communication Design [36.35684767732552]
  In this paper, we aim to minimize the total convergence time of FL, by quantizing the local model parameters prior to uplink transmission. We jointly optimize the computing, communication resources and number of quantization bits, in order to guarantee minimized convergence time across all global rounds.
  arXiv  Detail & Related papers  (2022-03-11T12:30:08Z)
• Semidefinite tests for quantum network topologies [0.9176056742068814]
  Quantum networks play a major role in long-distance communication, quantum cryptography, clock synchronization, and distributed quantum computing. The question of which correlations a given quantum network can give rise to, remains almost uncharted. We show that constraints on the observable covariances, previously derived for the classical case, also hold for quantum networks.
  arXiv  Detail & Related papers  (2020-02-13T22:36:46Z)

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.