Phase Transitions and Noise Robustness of Quantum Graph States

• URL: http://arxiv.org/abs/2510.00548v1
• Date: Wed, 01 Oct 2025 06:08:47 GMT
• Title: Phase Transitions and Noise Robustness of Quantum Graph States
• Authors: Tatsuya Numajiri, Shion Yamashika, Tomonori Tanizawa, Ryosuke Yoshii, Yuki Takeuchi, Shunji Tsuchiya,
• Abstract summary: We show that the fidelity between any ideal graph state and its noisy counterpart under IID Pauli noise can be mapped to the partition function of a classical spin system.<n>We uncover the emergence of phase transitions in fidelity between the pure-state regime and the noise-dominated regime governed by both the connectivity (degree) and spatial dimensionality of the graph state.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Graph states are entangled states that are essential for quantum information processing, including measurement-based quantum computation. As experimental advances enable the realization of large-scale graph states, efficient fidelity estimation methods are crucial for assessing their robustness against noise. However, calculations of exact fidelity become intractable for large systems due to the exponential growth in the number of stabilizers. In this work, we show that the fidelity between any ideal graph state and its noisy counterpart under IID Pauli noise can be mapped to the partition function of a classical spin system, enabling efficient computation via statistical mechanical techniques, including transfer matrix methods and Monte Carlo simulations. Using this approach, we analyze the fidelity for regular graph states under depolarizing noise and uncover the emergence of phase transitions in fidelity between the pure-state regime and the noise-dominated regime governed by both the connectivity (degree) and spatial dimensionality of the graph state. Specifically, in 2D, phase transitions occur only when the degree satisfies $d\ge 6$, while in 3D they already appear at $d\ge 5$. However, for graph states with excessively high degree, such as fully connected graphs, the phase transition disappears, suggesting that extreme connectivity suppresses critical behavior. These findings reveal that robustness of graph states against noise is determined by their connectivity and spatial dimensionality. Graph states with lower degree and/or dimensionality, which exhibit a smooth crossover rather than a sharp transition, demonstrate greater robustness, while highly connected or higher-dimensional graph states are more fragile. Extreme connectivity, as the fully connected graph state possesses, restores robustness.

Related papers

• Learning Time-Varying Graphs from Incomplete Graph Signals [1.7430416823420511]
  We develop an efficient Alternating Direction Multiplier algorithm for solving the problem of imputing missing data from a graph.<n>We prove that the proposed ADMM scheme converges to and we derive a stationary point.
  arXiv  Detail & Related papers  (2025-10-19T11:12:13Z)
• Spectral Graph Clustering under Differential Privacy: Balancing Privacy, Accuracy, and Efficiency [53.98433419539793]
  We study the problem of spectral graph clustering under edge differential privacy (DP)<n>Specifically, we develop three mechanisms: (i) graph perturbation via randomized edge flipping combined with adjacency matrix shuffling, which enforces edge privacy; (ii) private graph projection with additive Gaussian noise in a lower-dimensional space to reduce dimensionality and computational complexity; and (iii) a noisy power iteration method that distributes Gaussian noise across iterations to ensure edge DP while maintaining convergence.
  arXiv  Detail & Related papers  (2025-10-08T15:30:27Z)
• Mitigating Over-Squashing in Graph Neural Networks by Spectrum-Preserving Sparsification [81.06278257153835]
  We propose a graph rewiring method that balances structural bottleneck reduction and graph property preservation.<n>Our method generates graphs with enhanced connectivity while maintaining sparsity and largely preserving the original graph spectrum.
  arXiv  Detail & Related papers  (2025-06-19T08:01:00Z)
• Point Cloud Denoising With Fine-Granularity Dynamic Graph Convolutional Networks [58.050130177241186]
  Noise perturbations often corrupt 3-D point clouds, hindering downstream tasks such as surface reconstruction, rendering, and further processing. This paper introduces finegranularity dynamic graph convolutional networks called GDGCN, a novel approach to denoising in 3-D point clouds.
  arXiv  Detail & Related papers  (2024-11-21T14:19:32Z)
• Useful entanglement can be extracted from noisy graph states [0.0]
  Cluster states and graph states in general offer a useful model of the stabilizer formalism.<n>We leverage both properties to design feasible families of states that can be used as robust building blocks of quantum computation.<n>We show that robust entanglement can be extracted by proper design of the linear graph with only a minimal overhead of the physical qubits.
  arXiv  Detail & Related papers  (2024-02-01T19:00:05Z)
• Through the Dual-Prism: A Spectral Perspective on Graph Data Augmentation for Graph Classification [67.35058947477631]
  We introduce Dual-Prism (DP) augmentation methods, including DP-Noise and DP-Mask, which retain essential graph properties while diversifying augmented graphs.<n> Extensive experiments validate the efficiency of our approach, providing a new and promising direction for graph data augmentation.
  arXiv  Detail & Related papers  (2024-01-18T12:58:53Z)
• Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form Solution [112.3443939502313]
  We propose a unified graph signal sampling framework which enjoys the benefits of graph signal analysis and processing. The key idea is to transform each user's ratings on the items to a function (signal) on the vertices of an item-item graph. For the online setting, we develop a Bayesian extension, i.e., BGS-IMC which considers continuous random Gaussian noise in the graph Fourier domain.
  arXiv  Detail & Related papers  (2023-02-08T08:17:43Z)
• Localizing genuine multiparty entanglement in noisy stabilizer states [0.0]
  We calculate lower bounds of genuine multiparty entanglement localized over a chosen multiparty subsystem of multi-qubit stabilizer states. We show the existence of a critical noise strength beyond which all of the post measured states are biseparable. The calculation is also useful for arbitrary large stabilizer states under noise due to the local unitary connection between stabilizer states and graph states.
  arXiv  Detail & Related papers  (2022-11-02T11:59:24Z)
• Efficient Quantum State Tracking in Noisy Environments [10.762101459838052]
  We present an experimental implementation of matrix-exponentiated gradient tomography on a qutrit system encoded in the transverse spatial mode of photons. We investigate the performance of our method on stationary and evolving states, as well as significant environmental noise, and find fidelities of around 95% in all cases.
  arXiv  Detail & Related papers  (2022-05-12T22:32:14Z)
• Gaussian Process States: A data-driven representation of quantum many-body physics [59.7232780552418]
  We present a novel, non-parametric form for compactly representing entangled many-body quantum states. The state is found to be highly compact, systematically improvable and efficient to sample. It is also proven to be a universal approximator' for quantum states, able to capture any entangled many-body state with increasing data set size.
  arXiv  Detail & Related papers  (2020-02-27T15:54:44Z)
• Generation and Robustness of Quantum Entanglement in Spin Graphs [0.0]
  Entanglement is a crucial resource for quantum information processing. We show how a graph structure can be used to generate high fidelity entangled states. We also investigate how fabrication errors affect the entanglement generation protocol.
  arXiv  Detail & Related papers  (2020-02-18T16:11:57Z)

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.