Inferring Quantum Network Topologies using Genetic Optimisation of Indirect Measurements

• URL: http://arxiv.org/abs/2506.11289v2
• Date: Wed, 09 Jul 2025 10:32:00 GMT
• Title: Inferring Quantum Network Topologies using Genetic Optimisation of Indirect Measurements
• Authors: Conall J. Campbell, Matthew Mackinnon, Mauro Paternostro, Diana A. Chisholm,
• Abstract summary: We use external probes to infer the network topology in the context of continuous-time quantum walks.<n>The probes act as decay channels for the excitation, and can be interpreted as performing an indirect measurement on the network dynamics.<n>We show that increasing the number of probes significantly simplifies the reconstruction task, revealing a tradeoff between the number of probes and the required computational power.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The characterisation of quantum networks is fundamental to understanding how energy and information propagates through complex systems, with applications in control, communication, error mitigation and energy transfer. In this work, we explore the use of external probes to infer the network topology in the context of continuous-time quantum walks, where a single excitation traverses the network with a pattern strongly influenced by its topology. The probes act as decay channels for the excitation, and can be interpreted as performing an indirect measurement on the network dynamics. By making use of a Genetic Optimisation algorithm, we demonstrate that the data collected by the probes can be used to successfully reconstruct the topology of any quantum network with high success rates, where performance is limited only by computational resources for large network sizes. Moreover, we show that increasing the number of probes significantly simplifies the reconstruction task, revealing a tradeoff between the number of probes and the required computational power.

Related papers

• Identifying Sub-networks in Neural Networks via Functionally Similar Representations [41.028797971427124]
  We take a step toward automating the understanding of the network by investigating the existence of distinct sub-networks.<n>Specifically, we explore a novel automated and task-agnostic approach based on the notion of functionally similar representations within neural networks.<n>We show the proposed approach offers meaningful insights into the behavior of neural networks with minimal human and computational cost.
  arXiv  Detail & Related papers  (2024-10-21T20:19:00Z)
• Dissipation-driven quantum generative adversarial networks [11.833077116494929]
  We introduce a novel dissipation-driven quantum generative adversarial network (DQGAN) architecture specifically tailored for generating classical data. The classical data is encoded into the input qubits of the input layer via strong tailored dissipation processes. We extract both the generated data and the classification results by measuring the observables of the steady state of the output qubits.
  arXiv  Detail & Related papers  (2024-08-28T07:41:58Z)
• Identifying network topologies via quantum walk distributions [0.0]
  We use a genetic algorithm to retrieve the topology of a network from the measured probability distribution. Our result shows that the algorithm is capable of efficiently retrieving the required information even in the presence of noise.
  arXiv  Detail & Related papers  (2023-01-31T18:38:44Z)
• Adaptive, Continuous Entanglement Generation for Quantum Networks [59.600944425468676]
  Quantum networks rely on entanglement between qubits at distant nodes to transmit information. We present an adaptive scheme that uses information from previous requests to better guide the choice of randomly generated quantum links. We also explore quantum memory allocation scenarios, where a difference in latency performance implies the necessity of optimal allocation of resources for quantum networks.
  arXiv  Detail & Related papers  (2022-12-17T05:40:09Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• Quantum Compressive Sensing: Mathematical Machinery, Quantum Algorithms, and Quantum Circuitry [10.286119086329762]
  Compressive sensing is a protocol that facilitates reconstruction of large signals from relatively few measurements. Recent efforts in the literature consider instead a data-driven approach, training tensor networks to learn the structure of signals of interest. We present an alternative "quantum" protocol, in which the state of the tensor network is a quantum state over a set of entangled qubits.
  arXiv  Detail & Related papers  (2022-04-27T16:20:28Z)
• Optimizing Tensor Network Contraction Using Reinforcement Learning [86.05566365115729]
  We propose a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem. The problem is extremely challenging due to the huge search space, the heavy-tailed reward distribution, and the challenging credit assignment. We show how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges.
  arXiv  Detail & Related papers  (2022-04-18T21:45:13Z)
• SignalNet: A Low Resolution Sinusoid Decomposition and Estimation Network [79.04274563889548]
  We propose SignalNet, a neural network architecture that detects the number of sinusoids and estimates their parameters from quantized in-phase and quadrature samples. We introduce a worst-case learning threshold for comparing the results of our network relative to the underlying data distributions. In simulation, we find that our algorithm is always able to surpass the threshold for three-bit data but often cannot exceed the threshold for one-bit data.
  arXiv  Detail & Related papers  (2021-06-10T04:21:20Z)
• Quantum neural networks with multi-qubit potentials [0.0]
  We show that the presence of multi-qubit potentials in the quantum perceptrons enables more efficient information processing tasks. This simplification in the network architecture paves the way to address the connectivity challenge to scale up a quantum neural network.
  arXiv  Detail & Related papers  (2021-05-06T15:30:06Z)
• Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
  A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
  arXiv  Detail & Related papers  (2020-11-23T19:00:01Z)
• Learning Connectivity of Neural Networks from a Topological Perspective [80.35103711638548]
  We propose a topological perspective to represent a network into a complete graph for analysis. By assigning learnable parameters to the edges which reflect the magnitude of connections, the learning process can be performed in a differentiable manner. This learning process is compatible with existing networks and owns adaptability to larger search spaces and different tasks.
  arXiv  Detail & Related papers  (2020-08-19T04:53:31Z)
• Probing Criticality in Quantum Spin Chains with Neural Networks [0.0]
  We show that even neural networks with no hidden layers can be effectively trained to distinguish between magnetically ordered and disordered phases. Our results extend to a wide class of interacting quantum many-body systems and illustrate the wide applicability of neural networks to many-body quantum physics.
  arXiv  Detail & Related papers  (2020-05-05T12:34: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.