Tailored cluster states with high threshold under biased noise


Journal article


Jahan Claes, J. Bourassa, S. Puri
npj Quantum Information, 2023

Semantic Scholar ArXiv
Cite

Cite

APA   Click to copy
Claes, J., Bourassa, J., & Puri, S. (2023). Tailored cluster states with high threshold under biased noise. Npj Quantum Information.


Chicago/Turabian   Click to copy
Claes, Jahan, J. Bourassa, and S. Puri. “Tailored Cluster States with High Threshold under Biased Noise.” npj Quantum Information (2023).


MLA   Click to copy
Claes, Jahan, et al. “Tailored Cluster States with High Threshold under Biased Noise.” Npj Quantum Information, 2023.


BibTeX   Click to copy

@article{jahan2023a,
  title = {Tailored cluster states with high threshold under biased noise},
  year = {2023},
  journal = {npj Quantum Information},
  author = {Claes, Jahan and Bourassa, J. and Puri, S.}
}

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.


Share



Follow this website


You need to create an Owlstown account to follow this website.


Sign up

Already an Owlstown member?

Log in