Small-world structure of quantum computer hardware

• URL: http://arxiv.org/abs/2608.13855v1
• Date: Fri, 14 Aug 2026 01:01:16 GMT
• Title: Small-world structure of quantum computer hardware
• Abstract summary: We show that the network of quantum register states of a quantum computer (QC) exhibits small-world properties analogous to those of complex networks found in human society.<n>Using the $mathringA$berg criterion, we construct an effective ($mathringA$berg) network and show that, above a critical coupling strength, this network percolates into a giant component spanning nearly the whole quantum register space.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We show that the network of quantum register states of a quantum computer (QC), coupled through residual two-body interactions between qubits, exhibits small-world properties analogous to those of complex networks found in human society. The most probable Erdős number between any two states is about 9, comparable to the six degrees of separation reported by Milgram for social networks. Using the $\mathring{A}$berg criterion, which retains only interactions exceeding the local energy spacing, we construct an effective ($\mathring{A}$berg) network and show that, above a critical coupling strength, this network percolates into a giant component spanning nearly the whole quantum register space. This percolation transition closely matches the onset of quantum chaos and dynamical thermalization established previously via costly exact diagonalization, while our approach extends the accessible system size up to $n_q=30$ qubits.

Related papers

• Tripartite entanglement of remote atomic qubits [0.6271191255048939]
  We report the first fully-distributed Greenberger-Horne-Zeilinger (GHZ) state of qubits across a three-node quantum network of single atomic memories.<n>We measure a clear violation of Mermin's inequality while closing the detection loophole for the first time in a fully-distributed multipartite entangled state.
  arXiv  Detail & Related papers  (2026-06-15T18:09:28Z)
• 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)
• Heterogeneous entanglement between a trapped ion and a solid-state quantum memory [18.022941619093235]
  Hybrid quantum networks offer a promising architecture for scalable quantum information processing and a future quantum internet.<n>We demonstrate a hybrid quantum network that entangles a single trapped $mathrm171Yb+$ ion and achieves a quantum memory based on $rm 153Eu3+!Y_SiO5$ crystal over a 75-m separation.<n>This work establishes entanglement between a quantum processing module with a multiplexed quantum memory node, representing a key step toward a scalable, multifunctional quantum internet.
  arXiv  Detail & Related papers  (2026-03-06T02:44:40Z)
• General Concurrence Percolation on Quantum Networks [1.03590082373586]
  A quantum network is a network of entangled states and can be used to transmit quantum information.<n>We introduce a new protocol based on bond percolation to create a network of maximally entangled states.
  arXiv  Detail & Related papers  (2025-01-19T10:29:42Z)
• Asymptotic robustness of entanglement in noisy quantum networks and graph connectivity [46.44827993583994]
  We show that when the links are noisy two drastically different behaviors can occur regarding the global entanglement properties of the network. While in certain configurations the network displays genuine multipartite entanglement (GME) for any system size provided the noise level is below a certain threshold, in others GME is washed out if the system size is big enough for any fixed non-zero level of noise.
  arXiv  Detail & Related papers  (2024-11-19T15:01:50Z)
• Trapped Ions as an Architecture for Quantum Computing [110.83289076967895]
  We describe one of the most promising platforms for the construction of a universal quantum computer. We discuss from the physics involved in trapping ions in electromagnetic potentials to the Hamiltonian engineering needed to generate a universal set of logic gates.
  arXiv  Detail & Related papers  (2022-07-23T22:58:50Z)
• Conference key agreement in a quantum network [67.410870290301]
  Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state. In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit.
  arXiv  Detail & Related papers  (2022-07-04T18:00:07Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• A quantum processor based on coherent transport of entangled atom arrays [44.62475518267084]
  We show a quantum processor with dynamic, nonlocal connectivity, in which entangled qubits are coherently transported in a highly parallel manner. We use this architecture to realize programmable generation of entangled graph states such as cluster states and a 7-qubit Steane code state.
  arXiv  Detail & Related papers  (2021-12-07T19:00:00Z)
• Strong entanglement distribution of quantum networks [3.6720510088596297]
  Large-scale quantum networks have been employed to overcome practical constraints of transmissions and storage for single entangled systems. We show any connected network consisting of generalized EPR states and GHZ states satisfies strong CKW monogamy inequality in terms of bipartite entanglement measure. We classify entangled quantum networks by distinguishing network configurations under local unitary operations.
  arXiv  Detail & Related papers  (2021-09-27T08:45:18Z)
• Robust Multipartite Entanglement Without Entanglement Breaking [0.0]
  Entangled systems in experiments may be lost or offline in distributed quantum information processing. We propose a model for characterizing all entangled states that are breaking for losing particles. Results show distinctive features of both single entangled systems and entangled quantum networks.
  arXiv  Detail & Related papers  (2021-06-17T04:22:09Z)
• Entanglement Classification via Neural Network Quantum States [58.720142291102135]
  In this paper we combine machine-learning tools and the theory of quantum entanglement to perform entanglement classification for multipartite qubit systems in pure states. We use a parameterisation of quantum systems using artificial neural networks in a restricted Boltzmann machine (RBM) architecture, known as Neural Network Quantum States (NNS)
  arXiv  Detail & Related papers  (2019-12-31T07:40:23Z)

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.