On the Analysis of a Multipartite Entanglement Distribution Switch

• URL: http://arxiv.org/abs/2212.01784v1
• Date: Sun, 4 Dec 2022 10:14:12 GMT
• Title: On the Analysis of a Multipartite Entanglement Distribution Switch
• Abstract summary: We study a quantum switch that distributes maximally entangled multipartite states to sets of users. In this work, we study a simple variant of this system, wherein the switch has infinite memory and the links that connect the users to the switch are identical.
• Score: 15.753505192876752
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study a quantum switch that distributes maximally entangled multipartite states to sets of users. The entanglement switching process requires two steps: first, each user attempts to generate bipartite entanglement between itself and the switch; and second, the switch performs local operations and a measurement to create multipartite entanglement for a set of users. In this work, we study a simple variant of this system, wherein the switch has infinite memory and the links that connect the users to the switch are identical. Further, we assume that all quantum states, if generated successfully, have perfect fidelity and that decoherence is negligible. This problem formulation is of interest to several distributed quantum applications, while the technical aspects of this work result in new contributions within queueing theory. Via extensive use of Lyapunov functions, we derive necessary and sufficient conditions for the stability of the system and closed-form expressions for the switch capacity and the expected number of qubits in memory.

Related papers

• Multi-SPIN: Multi-Access Speculative Inference for Cooperative Token Generation at the Edge [47.08741228523925]
  We introduce Speculative inference as an efficient architecture to accelerate Large Language Models (LLMs)<n>In this work, we propose its distributed deployment to enable cooperative token generation in a multiuser edge system.<n>By developing decomposition methods, we reduce complex optimizations into tractable sub-problems.<n>Our analysis shows that the optimal bandwidth allocation compensates users with weaker computation-and-communication capabilities.
  arXiv  Detail & Related papers  (2026-06-03T08:16:14Z)
• Near-Term Reduction in Nonlocal Gate Count from Distributed Logical Qubits [0.0]
  We develop techniques for qubit allocation using an exemplar color code family.<n>We show that a 10% reduction in processor-nonlocal gates is achievable in a setting where syndrome extraction occurs after every logical gate.
  arXiv  Detail & Related papers  (2026-04-23T14:25:55Z)
• Non-perturbative switching rates in bistable open quantum systems: from driven Kerr oscillators to dissipative cat qubits [72.41778531863143]
  We use path integral techniques to predict the switching rate in a single-mode bistable open quantum system.<n>Our results open new avenues for exploring switching phenomena in multistable single- and many-body open quantum systems.
  arXiv  Detail & Related papers  (2025-07-24T18:01:36Z)
• Scalable modular architecture for universal quantum computation [49.1574468325115]
  We show that it is sufficient to connect two qubit arrays that are evolution operator controllable by a single entangling two-qubit gate.<n>Our proof provides a template to build up modular QPUs from smaller building blocks with reduced numbers of local controls and couplings.
  arXiv  Detail & Related papers  (2025-07-19T16:45:47Z)
• Logarithmic Depth Decomposition of Approximate Multi-Controlled Single-Qubit Gates Without Ancilla Qubits [0.9576327614980397]
  We present improved decompositions of multi-controlled NOT gates with logarithmic depth using a single ancilla qubit.<n>We also reduce the constant factors in the circuit depth compared to previous work.<n>Our method is particularly suitable for both NISQ and fault-tolerant quantum architectures.
  arXiv  Detail & Related papers  (2025-07-01T03:30:39Z)
• Efficient compilation of quantum circuits using multi-qubit gates [0.0]
  We present a compilation scheme which implements a general-circuit decomposition to a sequence of Ising-type, long-range, multi-qubit entangling gates. We numerically test our compilation and show that, compared to conventional realizations with two-qubit gates, our compilations improves the logarithm of quantum volume by $20%$ to $25%$.
  arXiv  Detail & Related papers  (2025-01-28T19:08:13Z)
• Optimal Scheduling in a Quantum Switch [1.8024397171920883]
  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. Our proof techniques analyse a two time scale separation phenomenon at the fluid scale for a general switch topology.
  arXiv  Detail & Related papers  (2025-01-09T17:08:01Z)
• 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)
• Scalable multiparty steering based on a single pair of entangled qubits [0.6553834611557042]
  We show that multiparty loophole-free quantum steering is achievable by constructing a quantum network from a set of qubits of which only one pair is entangled. This work introduces a scalable approach to rigorously verify quantum nonlocality across multiple parties, thus providing a practical tool towards developing the future quantum internet.
  arXiv  Detail & Related papers  (2023-08-04T13:01:51Z)
• Multipartite entanglement theory with entanglement-nonincreasing operations [91.3755431537592]
  We extend the resource theory of entanglement for multipartite systems beyond the standard framework of local operations and classical communication. We demonstrate that in this adjusted framework, the transformation rates between multipartite states are fundamentally dictated by the bipartite entanglement entropies of the respective quantum states.
  arXiv  Detail & Related papers  (2023-05-30T12:53:56Z)
• One-Way Ticket to Las Vegas and the Quantum Adversary [78.33558762484924]
  We show that quantum Las Vegas query complexity is exactly equal to the quantum adversary bound. This is achieved by transforming a feasible solution to the adversary inversion problem into a quantum query algorithm.
  arXiv  Detail & Related papers  (2023-01-05T11:05:22Z)
• Experimental Realization of Two Qutrits Gate with Tunable Coupling in Superconducting Circuits [11.881366909450376]
  Gate-based quantum computation has been extensively investigated using quantum circuits based on qubits. One of the essential elements for qutrit-based quantum computation, two-qutrit quantum gate, remains a major challenge. We propose and demonstrate a highly efficient and scalable two-qutrit quantum gate in superconducting quantum circuits.
  arXiv  Detail & Related papers  (2022-06-22T16:33:58Z)
• Synthesis of and compilation with time-optimal multi-qubit gates [0.46180371154032884]
  We develop a class of entangling multi-qubit gates for a quantum computing platform with fixed Ising-type interaction with all-to-all connectivity. We numerically demonstrate that the total multi-qubit gate time scales approximately linear in the number of qubits.
  arXiv  Detail & Related papers  (2022-06-13T18:00:04Z)
• A Throughput Optimal Scheduling Policy for a Quantum Switch [16.74626042261441]
  We study a quantum switch that creates shared end-to-end entangled quantum states to multiple sets of users that are connected to it. We propose a Max-Weight scheduling policy and show that it stabilizes the switch for all arrival rates that lie in the capacity region.
  arXiv  Detail & Related papers  (2022-06-07T11:49:32Z)
• Exact rate analysis for quantum repeaters with imperfect memories and entanglement swapping as soon as possible [0.0]
  We present an exact rate analysis for a secret key that can be shared among two parties employing a linear quantum repeater chain. We consider additional tools and parameters such as memory cut-offs, multiplexing, initial state and swapping gate fidelities.
  arXiv  Detail & Related papers  (2022-03-19T12:55:56Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• 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.