Universal Nested Quantum Switch

• URL: http://arxiv.org/abs/2603.00236v1
• Date: Fri, 27 Feb 2026 19:00:10 GMT
• Title: Universal Nested Quantum Switch
• Abstract summary: We show that the same functionality can be achieved with a different geometry that does not rely on a powerful and large central unit.<n>We provide a nested construction with logarithmically many qubits per node and a total of $O(nlog n)$ Bell pairs.<n>We also present a graph state variant with just one qubit per node, which allows one to generate $O(n/log2 n)$ Bell pairs.
• Score: 0.15293427903448023
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The quantum switch is a basic network primitive that allows one to connect multiple nodes in a quantum network via a central node. We show that the same functionality can be achieved with a different geometry that does not rely on a powerful and large central unit, but instead utilizes evenly distributed resources. This approach is resilient against node failures. We provide a nested construction with logarithmically many qubits per node and a total of $O(n\log n)$ Bell pairs, in contrast to other distributed approaches based on pre-shared entanglement that scale as $O(n^2)$. The construction achieves fully flexible pairwise connectivity, where the shared resource state can be locally transformed into $n/2$ arbitrarily distributed Bell states. We also present a graph state variant with just one qubit per node, which allows one to generate $O(n/\log^2 n)$ Bell pairs.

Related papers

• Distributed Quantum Property Testing with Quantum Carrier Pigeons [2.764897610820182]
  We introduce a framework for distributed quantum inference under communication constraints.<n>We focus on the fundamental problem of quantum state certification.<n>We show that the copy complexity of distributed state certification is $(fracd22n_q 2n_c/22)$.
  arXiv  Detail & Related papers  (2026-09-08T15:09:45Z)
• Multicast quantum network coding as optimal symmetric universal cloning over a quantum network [1.019561860229868]
  We study the problem of multicasting symmetric universal clones of unknown quantum states over quantum networks with free classical communication.<n>We show that perfect multicast of the corresponding symmetric universal clone is achievable using a small amount of entanglement shared among the target nodes.
  arXiv  Detail & Related papers  (2026-08-19T02:57:22Z)
• Extending the Bloch sphere model to an N-qubit system [63.01002236320087]
  We propose a novel geometric model extending the Bloch sphere representation to arbitrary $N$-qubit systems.<n>We demonstrate that any pure 2-qubit state is uniquely described by three spheres: two for individual qubits and a third encapsulating bipartite entanglement.
  arXiv  Detail & Related papers  (2026-07-06T12:14:04Z)
• Simultaneously Minimizing Storage and Bandwidth Under Exact Repair With Quantum Entanglement [46.17112353277822]
  We study exact-regenerating codes for entanglement-assisted distributed storage systems.<n>Consider an $(n,k,d,,_mathsfq,B)$ distributed system that stores a file of $B$ classical symbols across $n$ nodes.
  arXiv  Detail & Related papers  (2026-05-12T17:44:37Z)
• 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)
• The Quantum Message Complexity of Distributed Wake-Up with Advice [0.2578242050187029]
  We present the first upper and lower bounds on the message complexity for wake-up in the quantum routing model.<n>We show that wake-up has a quantum message complexity of $( n3/2 )$ without advice, which holds independently of how much time we allow.
  arXiv  Detail & Related papers  (2026-02-05T15:55:42Z)
• A resource- and computationally-efficient protocol for multipartite entanglement distribution in Bell-pair networks [0.6827423171182154]
  Greenberger--Horne--Zeilinger (GHZ) and other graph states are important resources in multiparty quantum network protocols and measurement-based quantum computing.<n>We consider the problem of generating such states from networks of bipartite entangled (Bell) pairs.<n>We present a protocol for producing GHZ states in arbitrary Bell-pair networks that is efficient with respect to all of these figures of merit.
  arXiv  Detail & Related papers  (2024-12-05T15:33:03Z)
• Modular quantum processor with an all-to-all reconfigurable router [34.39074227074929]
  We propose a high-speed on-chip quantum processor that supports reconfigurable all-to-all coupling with a large on-off ratio. We demonstrate reconfigurable controlled-Z gates across all qubit pairs, with a benchmarked average fidelity of $96.00%pm0.08%$. We also generate multi-qubit entanglement, distributed across the separate modules, demonstrating GHZ-3 and GHZ-4 states with fidelities of $88.15%pm0.24%$ and $75.18%pm0.11%$, respectively.
  arXiv  Detail & Related papers  (2024-07-29T16:02:03Z)
• Continuously Distributing Entanglement in Quantum Networks with Regular Topologies [0.0]
  Small interconnected quantum processors can collaborate to tackle quantum computational problems. We analyze a protocol where entanglement is continuously distributed among nodes. We investigate how nodes can optimize the frequency of attempting entanglement swaps.
  arXiv  Detail & Related papers  (2024-02-02T16:14:50Z)
• Understanding Heterophily for Graph Neural Networks [42.640057865981156]
  We present theoretical understandings of the impacts of different heterophily patterns for Graph Neural Networks (GNNs) We show that the separability gains are determined by the normalized distance of the $l$-powered neighborhood distributions. Experiments on both synthetic and real-world data verify the effectiveness of our theory.
  arXiv  Detail & Related papers  (2024-01-17T11:01:28Z)
• Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates [40.56175933029223]
  We propose two types of constant-depth constructions for implementing Uniformly Controlled Gates. We obtain constant-depth circuits for the quantum counterparts of read-only and read-write memory devices.
  arXiv  Detail & Related papers  (2023-08-16T17:54:56Z)
• Scalable Quantum Networks: Congestion-Free Hierarchical Entanglement Routing with Error Correction [0.0]
  Quantum Tree Networks (QTN) is an architecture for hierarchical multi-flow entanglement routing. Network design is a $k$-ary tree where end nodes are situated on the leaves and routers at the internal nodes. Our network-level simulations demonstrate a size-independent threshold behavior of QTNs.
  arXiv  Detail & Related papers  (2023-06-15T15:52:08Z)
• Spacetime-Efficient Low-Depth Quantum State Preparation with Applications [93.56766264306764]
  We show that a novel deterministic method for preparing arbitrary quantum states requires fewer quantum resources than previous methods. We highlight several applications where this ability would be useful, including quantum machine learning, Hamiltonian simulation, and solving linear systems of equations.
  arXiv  Detail & Related papers  (2023-03-03T18:23:20Z)
• Distributed Saddle-Point Problems Under Similarity [173.19083235638104]
  We show that a given suboptimality $epsilon0$ is achieved master/workers networks in $Omegabig. We then propose algorithms matching the lower bounds either types of networks (up to log-overs) We assess effectiveness of the proposed algorithms on a robust logistic regression problem.
  arXiv  Detail & Related papers  (2021-07-22T14:25:16Z)
• Towards Deeper Graph Neural Networks with Differentiable Group Normalization [61.20639338417576]
  Graph neural networks (GNNs) learn the representation of a node by aggregating its neighbors. Over-smoothing is one of the key issues which limit the performance of GNNs as the number of layers increases. We introduce two over-smoothing metrics and a novel technique, i.e., differentiable group normalization (DGN)
  arXiv  Detail & Related papers  (2020-06-12T07:18:02Z)
• Entanglement generation in a quantum network at distance-independent rate [11.583635476962325]
  We develop a protocol for entanglement generation in the quantum internet. It allows a repeater node to use $n$-qubit Greenberger-Horne-Zeilinger measurements. We prove that this powerful network property is not possible to attain with any quantum networking protocol built with Bell measurements and multiplexing alone.
  arXiv  Detail & Related papers  (2020-05-14T20:26:20Z)
• Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks [0.0]
  The computation of the diameter is one of the most central problems in distributed computation. We show a $tilde O(sqrtnD)$-round quantum distributed algorithm for exact diameter computation, where $D$ denotes the diameter. This shows a separation between the computational power of quantum and classical algorithms in the CONGEST model.
  arXiv  Detail & Related papers  (2018-04-09T11:24:24Z)

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.