Error Tolerance in Constructing Cluster States

Derek W. Robinson

Feng-Jian Jiang, Shi Ming-Jun, Chong Bo +1 more

We consider the problem often encountered in constructing large cluster states, that is, the σ x measurements in the depolarizing noise, and present a regulation to calculate the error propagation and the accumulation. Rohde et al. first pointed out the question [ Phys. Rev. A 75 (2007) 010302(R) ]. A quantitative analysis is given on the disadvantage influence of the probabilistic gate and noisy environment on the construction of two-dimensional (2D) scalable cluster states. Positivity of partial transpose criteria is used to predict whether the final state is distillable or not. A critical value on the error tolerance in constructing cluster states is determined, which could be used as a test-bed for successful construction of scalable 2D cluster states. Furthermore, our quantitative analysis would also be helpful to find optimal approach to suppress the noise accumulation.

Gerald N. Gilbert, Yaakov S. Weinstein

We explore basic necessary protocols to achieve fault tolerance for quantum computation in the cluster state and circuit models. For the cluster state model we simulate the implementation of an arbitrary rotation via only measurement on a decohered cluster state. Fidelity is used to quantify the accuracy of the initial cluster state and a gate fidelity for the arbitrary rotation is determined. In the circuit model we compare the accuracy of two methods that can be used to construct a logical zero state appropriate for the [7, 1, 3] Steane quantum error correction code in a non-equiprobable Pauli operator error environment: a fault tolerant method done by applying error correction on seven qubits all in the state zero, and a non-fault tolerant method done by implementing the encoding gate sequence. We find that the latter construction method, in spite of its lack of "fault tolerance," outputs a seven qubit state with a higher fidelity than the first (fault tolerant) method. However, the fidelity of the single qubit of stored information exhibits almost equivalent values between the two construction methods.

Hideo Miyata

Ahmed Adel Mahmoud, Gabrielle Tournaire, Sven Bachmann +1 more

Fault-tolerant measurement-based quantum computing (MBQC) provides a compelling framework for fault-tolerant quantum computation, in which quantum information is processed through single-qubit measurements on a three-dimensional entangled resource known as cluster state. To date, this resource has been predominantly studied on Euclidean lattices, most notably in the Raussendorf-Harrington-Goyal (RHG) construction, which underlies topological fault tolerance in MBQC. In this work, we introduce the hyperbolic cluster state, a generalization of the three-dimensional cluster state to negatively curved geometries, obtained via the foliation of periodic hyperbolic lattices. We present an explicit construction of hyperbolic cluster states and investigate their fault-tolerant properties under a realistic circuit-level depolarizing noise model. Using large-scale numerical simulations, we perform memory experiments to characterize their logical error rates and decoding performance. Our results demonstrate that hyperbolic cluster states exhibit a fault-tolerance threshold comparable to that of the Euclidean RHG cluster state, while simultaneously supporting a constant encoding rate in the thermodynamic limit. This represents a substantial improvement in qubit overhead relative to conventional cluster-state constructions. These findings establish hyperbolic geometry as a powerful and experimentally relevant resource for scalable, fault-tolerant MBQC and open new avenues for leveraging negative curvature in quantum information processing.

Da-Sheng Diao, Jinjuan Zhang, Yongsheng Zhang