Optimal Scheduling in a Quantum Switch

• URL: http://arxiv.org/abs/2501.05380v1
• Date: Thu, 09 Jan 2025 17:08:01 GMT
• Title: Optimal Scheduling in a Quantum Switch
• Abstract summary: A quantum switch establishes, distributes, and maintains entanglements across a network.<n>In contrast to a classical switching fabric, a quantum switch is a two sided queueing network.<n>Our proof techniques analyse a two time scale separation phenomenon at the fluid scale for a general switch topology.
• Score: 1.8024397171920883
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: With a growing number of quantum networks in operation, there is a pressing need for performance analysis of quantum switching technologies. A quantum switch establishes, distributes, and maintains entanglements across a network. In contrast to a classical switching fabric, a quantum switch is a two sided queueing network. The switch generates Link Level Entanglements (LLEs), which are then fused to process the networks entanglement requests. Our proof techniques analyse a two time scale separation phenomenon at the fluid scale for a general switch topology. This allows us to demonstrate that the optimal fluid dynamics are given by a scheduling algorithm that solves a certain average reward Markov Decision Process.

Related papers

• Entanglement is Half the Story: Post-Selection vs. Partial Traces [0.34998703934432673]
  We use a method of inference of classical tensor networks on a quantum computer to define a hybrid architecture.<n>This hybrid tensor network is a practical unified framework for it's classical and quantum tensor network edge cases.
  arXiv  Detail & Related papers  (2026-05-04T09:26:52Z)
• A Scalable Distributed Quantum Optimization Framework via Factor Graph Paradigm [46.08923284345648]
  We introduce a structure-aware framework for distributed quantum optimization.<n>We find that for a search space of size $N$, our framework achieves $O(sqrtN)$ query complexity up to processors and separator dependent factors.<n>We show that structure-aware decomposition delivers a practical path to scalable distributed quantum optimization on quantum networks.
  arXiv  Detail & Related papers  (2026-03-08T15:15:52Z)
• Benchmarking a Tunable Quantum Neural Network on Trapped-Ion and Superconducting Hardware [0.0]
  We implement a quantum generalization of a network on trapped-ion and IBM superconducting quantum computers.<n>The network feedforward involves qubit rotations whose angles depend on the results of measurements in the previous layer.<n>We benchmark physical noise by inserting additional single-qubit and two-qubit gate pairs into the neural network circuits.
  arXiv  Detail & Related papers  (2025-07-28T18:00:03Z)
• Quantum neural networks facilitating quantum state classification [1.3187011661009458]
  This work establishes a foundation for the classification of multi-qubit quantum states. It offers the potential for generalisation to multi-qubit pure quantum states.
  arXiv  Detail & Related papers  (2025-04-09T06:42:32Z)
• Scalable MHz-Rate Entanglement Distribution in Low-Latency Quantum Networks Interconnecting Heterogeneous Quantum Processors [2.512722206691504]
  We propose a quantum network architecture by introducing the concept of a reconfigurable quantum interface. In our protocol, through tuning the frequency and temporal mode of the photonic qubits to dense wavelength division multiplexing (DWDM) channels, a 4.5 MHz Bell pair distribution rate is achieved. A nanosecond reconfiguration latency can be demonstrated with low-loss, low-infidelity and high-dimensional switches.
  arXiv  Detail & Related papers  (2025-04-07T23:47:49Z)
• 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)
• Resilient Entanglement Distribution in a Multihop Quantum Network [0.605746798865181]
  We introduce multihop quantum networks to improve network reach and resilience. We present multihop two-qubit polarization-entanglement distribution within a quantum network at the Oak Ridge National Laboratory campus.
  arXiv  Detail & Related papers  (2024-07-29T22:42:08Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Oblivious Quantum Computation and Delegated Multiparty Quantum Computation [61.12008553173672]
  We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required. Exploiting quantum teleportation, we propose a two-server protocol for this task. Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
  arXiv  Detail & Related papers  (2022-11-02T09:01:33Z)
• Quantum-inspired optimization for wavelength assignment [51.55491037321065]
  We propose and develop a quantum-inspired algorithm for solving the wavelength assignment problem. Our results pave the way to the use of quantum-inspired algorithms for practical problems in telecommunications.
  arXiv  Detail & Related papers  (2022-11-01T07:52:47Z)
• Quantum reservoir neural network implementation on coherently coupled quantum oscillators [1.7086737326992172]
  We propose an implementation for quantum reservoir that obtains a large number of densely connected neurons. We analyse a specific hardware implementation based on superconducting circuits. We obtain state-of-the-art accuracy of 99 % on benchmark tasks.
  arXiv  Detail & Related papers  (2022-09-07T15:24:51Z)
• Computing with two quantum reservoirs connected via optimized two-qubit nonselective measurements [0.0]
  Quantum reservoir computing is a promising technique for hybrid, quantum-classical machine learning. However, its applications are limited due to practical restrictions on the size of quantum systems and the influence of noise. Here we propose a novel approach to connect two quantum reservoirs in a network to overcome these issues and enhance their computing performance.
  arXiv  Detail & Related papers  (2022-01-18T19:52:10Z)
• Switch networks for photonic fusion-based quantum computing [0.0]
  Fusion-based quantum computing (FBQC) offers a powerful approach to building a fault-tolerant universal quantum computer. FBQC uses single-photon sources, linear-optical circuits, single-photon detectors, and optical switching with feedforward control. New techniques and schemes enable major improvements in terms of muxing efficiency and reductions in hardware requirements.
  arXiv  Detail & Related papers  (2021-09-28T14:31:30Z)
• Cluster-Promoting Quantization with Bit-Drop for Minimizing Network Quantization Loss [61.26793005355441]
  Cluster-Promoting Quantization (CPQ) finds the optimal quantization grids for neural networks. DropBits is a new bit-drop technique that revises the standard dropout regularization to randomly drop bits instead of neurons. We experimentally validate our method on various benchmark datasets and network architectures.
  arXiv  Detail & Related papers  (2021-09-05T15:15:07Z)
• Quantum Annealing Formulation for Binary Neural Networks [40.99969857118534]
  In this work, we explore binary neural networks, which are lightweight yet powerful models typically intended for resource constrained devices. We devise a quadratic unconstrained binary optimization formulation for the training problem. While the problem is intractable, i.e., the cost to estimate the binary weights scales exponentially with network size, we show how the problem can be optimized directly on a quantum annealer.
  arXiv  Detail & Related papers  (2021-07-05T03:20:54Z)
• 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)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)

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.