Tailored cluster states with high threshold under biased noise

• URL: http://arxiv.org/abs/2201.10566v1
• Date: Tue, 25 Jan 2022 19:00:00 GMT
• Title: Tailored cluster states with high threshold under biased noise
• Authors: Jahan Claes, J. Eli Bourassa, Shruti Puri
• Abstract summary: Fault-tolerant cluster states form the basis for scalable measurement-based quantum computation. We introduce a generalization of the cluster state that allows us to foliate stabilizer codes in a bias-preserving way. We demonstrate that our XZZX cluster state has a threshold more than double the usual cluster state when dephasing errors are more likely than errors which cause bit flips by a factor of $O(100)$ or more.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Fault-tolerant cluster states form the basis for scalable measurement-based quantum computation. Recently, new stabilizer codes for scalable circuit-based quantum computation have been introduced that have very high thresholds under biased noise where the qubit predominantly suffers from one type of error, e.g. dephasing. However, extending these advances in stabilizer codes to generate high-threshold cluster states for biased noise has been a challenge, as the standard method for foliating stabilizer codes to generate fault-tolerant cluster states does not preserve the noise bias. In this work, we overcome this barrier by introducing a generalization of the cluster state that allows us to foliate stabilizer codes in a bias-preserving way. As an example of our approach, we construct a foliated version of the XZZX code which we call the XZZX cluster state. We demonstrate that under a circuit-level noise model, our XZZX cluster state has a threshold more than double the usual cluster state when dephasing errors are more likely than errors which cause bit flips by a factor of $O(100)$ or more.

Related papers

• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Latent Class-Conditional Noise Model [54.56899309997246]
  We introduce a Latent Class-Conditional Noise model (LCCN) to parameterize the noise transition under a Bayesian framework. We then deduce a dynamic label regression method for LCCN, whose Gibbs sampler allows us efficiently infer the latent true labels. Our approach safeguards the stable update of the noise transition, which avoids previous arbitrarily tuning from a mini-batch of samples.
  arXiv  Detail & Related papers  (2023-02-19T15:24:37Z)
• High threshold codes for neutral atom qubits with biased erasure errors [0.0]
  We identify a new type of structured noise motivated by neutral atom qubits, biased erasure errors. We study the performance of this model using gate-level simulations of the XZZX surface code. We discuss a potential physical implementation using a single plane of atoms and moveable tweezers.
  arXiv  Detail & Related papers  (2023-02-06T19:01:32Z)
• Quantum error correction with dissipatively stabilized squeezed cat qubits [68.8204255655161]
  We propose and analyze the error correction performance of a dissipatively stabilized squeezed cat qubit. We find that for moderate squeezing the bit-flip error rate gets significantly reduced in comparison with the ordinary cat qubit while leaving the phase flip rate unchanged.
  arXiv  Detail & Related papers  (2022-10-24T16:02:20Z)
• Correcting non-independent and non-identically distributed errors with surface codes [0.8039067099377079]
  We develop and investigate the properties of topological surface codes adapted to a known noise structure by Clifford conjugations. We show that the surface code locally tailored to non-uniform single-qubit noise in conjunction with a scalable matching decoder yields an increase in error thresholds and exponential suppression of sub-threshold failure rates.
  arXiv  Detail & Related papers  (2022-08-03T16:21:44Z)
• Tailored XZZX codes for biased noise [60.12487959001671]
  We study a family of codes having XZZX-type stabilizer generators. We show that these XZZX codes are highly qubit efficient if tailored to biased noise.
  arXiv  Detail & Related papers  (2022-03-30T17:26:31Z)
• Streamlined quantum computing with macronode cluster states [0.0]
  We show that a Clifford gate and GKP error correction can be simultaneously implemented in a single teleportation step. We find that logical error rates of $10-2$-$10-3$, compatible with the thresholds of topological codes, can be achieved with squeezing of 11.9-13.7 dB.
  arXiv  Detail & Related papers  (2021-09-10T05:07:34Z)
• Oscillator-to-oscillator codes do not have a threshold [0.0]
  We show a general lower bound on the logical error probability which is only a function of the amount of squeezing and independent of the number of modes. We find that this is not the case if encoding unitaries involving a constant amount of squeezing and maximum likelihood error decoding are used.
  arXiv  Detail & Related papers  (2021-02-10T16:31:35Z)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)
• The XZZX Surface Code [2.887393074590696]
  We show that a variant of the surface code -- the XZZX code -- offers remarkable performance for fault-tolerant quantum computation. The error threshold of this code matches what can be achieved with random codes (hashing) for every single-qubit Pauli noise channel. We show that it is possible to maintain all of these advantages when we perform fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2020-09-16T18:00:01Z)
• Improving Face Recognition by Clustering Unlabeled Faces in the Wild [77.48677160252198]
  We propose a novel identity separation method based on extreme value theory. It greatly reduces the problems caused by overlapping-identity label noise. Experiments on both controlled and real settings demonstrate our method's consistent improvements.
  arXiv  Detail & Related papers  (2020-07-14T12:26:50Z)

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.