Phase Transitions and Noise Robustness of Quantum Graph States

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\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. 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.

14 pages, 8 figures

References in corpus (38)

• Measurement-based quantum computation with cluster states
• Large Scale Modular Quantum Computer Architecture with Atomic Memory and Photonic Interconnects
• Experimental entanglement of six photons in graph states
• General Entanglement Breaking Channels
• All photonic quantum repeaters
• Experimental ten-photon entanglement
• 18-qubit entanglement with photon's three degrees of freedom
• Observation of eight-photon entanglement
• Quantum error-correcting codes associated with graphs
• From three-photon GHZ states to ballistic universal quantum computation
• Experimental demonstration of topological error correction
• Genuine 12-qubit entanglement on a superconducting quantum processor
• Verifiable measurement-only blind quantum computing with stabilizer testing
• 16-qubit IBM universal quantum computer can be fully entangled
• Optimal verification of entangled states with local measurements
• Generation of high-fidelity four-photon cluster state and quantum-domain demonstration of one-way quantum computing
• Entanglement in a 20-Qubit Superconducting Quantum Computer
• Diagnostics of mixed-state topological order and breakdown of quantum memory
• Efficient Verification of Pure Quantum States in the Adversarial Scenario
• Graph States as a Resource for Quantum Metrology
• Verification of Many-Qubit States
• General framework for verifying pure quantum states in the adversarial scenario
• Self-guaranteed measurement-based quantum computation
• Resource-efficient verification of quantum computing using Serfling's bound
• Verifiable fault-tolerance in measurement-based quantum computation
• Entanglement-annihilating and entanglement-breaking channels
• Optimal verification of stabilizer states
• Quantum proofs can be verified using only single qubit measurements
• Generation of three-dimensional cluster entangled state
• Robust and efficient verification of graph states in blind measurement-based quantum computation
• Magic of quantum hypergraph states
• High-fidelity cluster state generation for ultracold atoms in an optical lattice
• Entanglement of random hypergraph states
• Layer by layer generation of cluster states
• $GHZ$ state generation of three Josephson qubits in presence of bosonic baths
• Passive verification protocol for thermal graph states
• Constant-time one-shot testing of large-scale graph states
• Understanding Stabilizer Codes Under Local Decoherence Through a General Statistical Mechanics Mapping