© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

arXiv:2510.00548 · Quantum

Phase Transitions and Noise Robustness of Quantum Graph States

Tatsuya Numajiri, Shion Yamashika, Tomonori Tanizawa, Ryosuke Yoshii, Yuki Takeuchi, Shunji Tsuchiya

Published May 5, 2026• 0 citations

Abstract

Graph states are entangled states that are essential for quantum information processing. 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. 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. Specifically, in 2D, phase transitions occur only when the degree satisfies d ≥ 6 , while in 3D they already appear at d ≥ 5 . However, for graph states with excessively high degree, such as fully connected graphs, the phase transition disappears. Robustness of graph states against noise is thus determined by their connectivity and spatial dimensionality. Graph states with lower degree and/or dimensionality, which exhibit a smooth crossover, 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. Furthermore, we show that the fidelity can be rewritten in the form of the partition function of a constraint-percolation problem. Within this picture, we discuss the qualitative difference between 2D regular graph states with d = 6 and d = 5 regarding the presence or absence of a phase transition, as well as the suppressed critical behavior of fully connected graph states.

DOI: 10.22331/q-2026-05-05-2094

Related papers

Fidelity-estimation method for graph states with depolarizing noise

Tomonori Tanizawa, Yuki Takeuchi, Shion Yamashika +2 more

Graph states are entangled states that are useful for several quantum information processing tasks, such as measurement-based quantum computation and quantum metrology. As the size of graph states realized in experiments increases, it becomes more essential to devise efficient methods for estimating the fidelity between the ideal graph state and an experimentally realized actual state. Any efficient fidelity-estimation method, in general, must use multiple experimental settings, i.e., needs to switch between at least two measurements. Recently, it has been shown that a single measurement is sufficient if the noise can be modeled as the phase-flip error. Since the bit-flip error should also occur in several experiments, it is desired to extend this simplest method to noise models that include phase and bit-flip errors. However, it seems to be nontrivial because their result strongly depends on properties of the phase-flip error. In this paper, by analyzing effects of the bit-flip error on stabilizer operators of graph states, we achieve the extension to the depolarizing noise, which is a major noise model including phase and bit-flip errors. We also numerically evaluate our simplest method for noise models interpolating between the phase-flip and depolarizing noises.

Physical Review Research•Dec 19, 2023•3 citations

Simplest fidelity-estimation method for graph states with depolarizing noise

Tomonori Tanizawa, Yuki Takeuchi, Shion Yamashika +2 more

Graph states are entangled states useful for several quantum information processing tasks such as measurement-based quantum computation and quantum metrology. As the size of graph states realized in experiments increases, it becomes more essential to devise efficient methods estimating the fidelity between the ideal graph state and an experimentally-realized actual state. Any efficient fidelity-estimation method, in general, must use multiple experimental settings, i.e., needs to switch between at least two measurements. Recently, it has been shown that a single measurement is sufficient if the noise can be modeled as the phase-flip error. Since the bit-flip error should also occur in several experiments, it is desired to extend this simplest method to noise models that include phase and bit-flip errors. However, it seems to be nontrivial because their result strongly depends on properties of the phase-flip error. In this paper, by analyzing effects of the bit-flip error on stabilizer operators of graph states, we achieve the extension to the depolarizing noise, which is a major noise model including phase and bit-flip errors. We also numerically evaluate our simplest method for noise models interpolating between the phase-flip and depolarizing noises.

arXiv:2304.10952•Apr 21, 2023•0 citations

Asymptotic robustness of entanglement in noisy quantum networks and graph connectivity

Fernando Lledó, Carlos Palazuelos, Julio I. de Vicente

Quantum networks are promising venues for quantum information processing. This motivates the study of the entanglement properties of the particular multipartite quantum states that underpin these structures. In particular, it has been recently shown 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. However, this difference has only been established considering the two extreme cases of maximally and minimally connected networks (i.e. complete graphs versus trees, respectively). In this article we investigate this question much more in depth and relate this behavior to the growth of several graph theoretic parameters that measure the connectivity of the graph sequence that codifies the structure of the network as the number of parties increases. The strongest conditions are obtained when considering the degree growth. Our main results are that a sufficiently fast degree growth (i.e. Ω ( N ) , where N is the size of the network) is sufficient for asymptotic robustness of GME, while if it is sufficiently slow (i.e. o ( log ⁡ N ) ) then the network becomes asymptotically biseparable. We also present several explicit constructions related to the optimality of these results.

arXiv:2411.12548•Quantum•Dec 31, 2025•0 citations

Open-System Dynamics of Graph-State Entanglement

Daniel Cavalcanti, Rafael Chaves, Leandro Aolita +2 more

We consider graph states of an arbitrary number of particles undergoing generic decoherence. We present methods to obtain lower and upper bounds for the system's entanglement in terms of that of considerably smaller subsystems. For an important class of noisy channels, namely, the Pauli maps, these bounds coincide and thus provide the exact analytical expression for the entanglement evolution. All of the results apply also to (mixed) graph-diagonal states and hold true for any convex entanglement monotone. Since any state can be locally depolarized to some graph-diagonal state, our method provides a lower bound for the entanglement decay of any arbitrary state. Finally, this formalism also allows for the direct identification of the robustness under size scaling of graph states in the presence of decoherence, merely by inspection of their connectivities.

arXiv:0904.1191•Physical Review Letters•Jul 15, 2009•59 citations

Growth of graph states in quantum networks

Martí Cuquet, John Calsamiglia

We propose a scheme to distribute graph states over quantum networks in the presence of noise in the channels and in the operations. The protocol can be implemented efficiently for large graph sates of arbitrary (complex) topology. We benchmark our scheme with two protocols where each connected component is prepared in a node belonging to the component and subsequently distributed via quantum repeaters to the remaining connected nodes. We show that the fidelity of the generated graphs can be written as the partition function of a classical Ising-type Hamiltonian. We give exact expressions of the fidelity of the linear cluster and results for its decay rate in random graphs with arbitrary (uncorrelated) degree distributions.

arXiv:1208.0710•Physical Review A•Oct 3, 2012•28 citations

Dimensional hybridity in measurement-induced criticality

Oliver Lunt, Marcin Szyniszewski, Arijeet Pal

Entanglement transitions in quantum dynamics present a novel class of phase transitions in non-equilibrium systems. When a many-body quantum system undergoes hybrid quantum dynamics, consisting of unitary evolution interspersed with monitored random measurements, the steady-state can exhibit a phase transition between volume- and area-law entanglement. The role of dimension in the nature of these transitions is an open problem. There is a dimensional correspondence between measurement-induced transitions in non-unitary quantum circuits in $d$ spatial dimensions and classical statistical mechanical models in $d+1$ dimensions, where the time dimension in the quantum problem is mapped to a spatial dimension in the classical model. In this work we show that the role of dimension is considerably richer by unveiling a form of `dimensional hybridity': critical properties of the steady-state entanglement are governed by a combination of exponents consistent with $d$-dimensional percolation and $(d+1)$-dimensional percolation. We uncover this dimensional hybridity in 1+1D and 2+1D circuits using a graph-state based simulation algorithm where the entanglement structure is encoded in an underlying graph, providing access to the geometric structure of entanglement. We locate the critical point using the tripartite information, revealing area-law entanglement scaling at criticality, and showing that the entanglement transition coincides with the purification transition. The emergence of this `dimensional hybridity' in these non-unitary quantum circuits sheds new light on the universality of measurement-induced transitions, and opens the way for analyzing the quantum error correcting properties of random unitary circuits in higher dimensions.

•Dec 7, 2020•14 citations

Graph states are entangled states that are essential for quantum information processing. 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. 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. Specifically, in 2D, phase transitions occur only when the degree satisfies d ≥ 6 , while in 3D they already appear at d ≥ 5 . However, for graph states with excessively high degree, such as fully connected graphs, the phase transition disappears. Robustness of graph states against noise is thus determined by their connectivity and spatial dimensionality. Graph states with lower degree and/or dimensionality, which exhibit a smooth crossover, 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. Furthermore, we show that the fidelity can be rewritten in the form of the partition function of a constraint-percolation problem. Within this picture, we discuss the qualitative difference between 2D regular graph states with d = 6 and d = 5 regarding the presence or absence of a phase transition, as well as the suppressed critical behavior of fully connected graph states.

Graph states are entangled states that are useful for several quantum information processing tasks, such as measurement-based quantum computation and quantum metrology. As the size of graph states realized in experiments increases, it becomes more essential to devise efficient methods for estimating the fidelity between the ideal graph state and an experimentally realized actual state. Any efficient fidelity-estimation method, in general, must use multiple experimental settings, i.e., needs to switch between at least two measurements. Recently, it has been shown that a single measurement is sufficient if the noise can be modeled as the phase-flip error. Since the bit-flip error should also occur in several experiments, it is desired to extend this simplest method to noise models that include phase and bit-flip errors. However, it seems to be nontrivial because their result strongly depends on properties of the phase-flip error. In this paper, by analyzing effects of the bit-flip error on stabilizer operators of graph states, we achieve the extension to the depolarizing noise, which is a major noise model including phase and bit-flip errors. We also numerically evaluate our simplest method for noise models interpolating between the phase-flip and depolarizing noises.

Graph states are entangled states useful for several quantum information processing tasks such as measurement-based quantum computation and quantum metrology. As the size of graph states realized in experiments increases, it becomes more essential to devise efficient methods estimating the fidelity between the ideal graph state and an experimentally-realized actual state. Any efficient fidelity-estimation method, in general, must use multiple experimental settings, i.e., needs to switch between at least two measurements. Recently, it has been shown that a single measurement is sufficient if the noise can be modeled as the phase-flip error. Since the bit-flip error should also occur in several experiments, it is desired to extend this simplest method to noise models that include phase and bit-flip errors. However, it seems to be nontrivial because their result strongly depends on properties of the phase-flip error. In this paper, by analyzing effects of the bit-flip error on stabilizer operators of graph states, we achieve the extension to the depolarizing noise, which is a major noise model including phase and bit-flip errors. We also numerically evaluate our simplest method for noise models interpolating between the phase-flip and depolarizing noises.

Quantum networks are promising venues for quantum information processing. This motivates the study of the entanglement properties of the particular multipartite quantum states that underpin these structures. In particular, it has been recently shown 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. However, this difference has only been established considering the two extreme cases of maximally and minimally connected networks (i.e. complete graphs versus trees, respectively). In this article we investigate this question much more in depth and relate this behavior to the growth of several graph theoretic parameters that measure the connectivity of the graph sequence that codifies the structure of the network as the number of parties increases. The strongest conditions are obtained when considering the degree growth. Our main results are that a sufficiently fast degree growth (i.e. Ω ( N ) , where N is the size of the network) is sufficient for asymptotic robustness of GME, while if it is sufficiently slow (i.e. o ( log ⁡ N ) ) then the network becomes asymptotically biseparable. We also present several explicit constructions related to the optimality of these results.

We consider graph states of an arbitrary number of particles undergoing generic decoherence. We present methods to obtain lower and upper bounds for the system's entanglement in terms of that of considerably smaller subsystems. For an important class of noisy channels, namely, the Pauli maps, these bounds coincide and thus provide the exact analytical expression for the entanglement evolution. All of the results apply also to (mixed) graph-diagonal states and hold true for any convex entanglement monotone. Since any state can be locally depolarized to some graph-diagonal state, our method provides a lower bound for the entanglement decay of any arbitrary state. Finally, this formalism also allows for the direct identification of the robustness under size scaling of graph states in the presence of decoherence, merely by inspection of their connectivities.

We propose a scheme to distribute graph states over quantum networks in the presence of noise in the channels and in the operations. The protocol can be implemented efficiently for large graph sates of arbitrary (complex) topology. We benchmark our scheme with two protocols where each connected component is prepared in a node belonging to the component and subsequently distributed via quantum repeaters to the remaining connected nodes. We show that the fidelity of the generated graphs can be written as the partition function of a classical Ising-type Hamiltonian. We give exact expressions of the fidelity of the linear cluster and results for its decay rate in random graphs with arbitrary (uncorrelated) degree distributions.

Entanglement transitions in quantum dynamics present a novel class of phase transitions in non-equilibrium systems. When a many-body quantum system undergoes hybrid quantum dynamics, consisting of unitary evolution interspersed with monitored random measurements, the steady-state can exhibit a phase transition between volume- and area-law entanglement. The role of dimension in the nature of these transitions is an open problem. There is a dimensional correspondence between measurement-induced transitions in non-unitary quantum circuits in

d

spatial dimensions and classical statistical mechanical models in

d+1

dimensions, where the time dimension in the quantum problem is mapped to a spatial dimension in the classical model. In this work we show that the role of dimension is considerably richer by unveiling a form of `dimensional hybridity': critical properties of the steady-state entanglement are governed by a combination of exponents consistent with

d

-dimensional percolation and

(d+1)

-dimensional percolation. We uncover this dimensional hybridity in 1+1D and 2+1D circuits using a graph-state based simulation algorithm where the entanglement structure is encoded in an underlying graph, providing access to the geometric structure of entanglement. We locate the critical point using the tripartite information, revealing area-law entanglement scaling at criticality, and showing that the entanglement transition coincides with the purification transition. The emergence of this `dimensional hybridity' in these non-unitary quantum circuits sheds new light on the universality of measurement-induced transitions, and opens the way for analyzing the quantum error correcting properties of random unitary circuits in higher dimensions.