Fault-tolerant quantum computation in concatenation of verified cluster states
classification
🪐 quant-ph
keywords
clusterstatescodecomputationconcatenationfault-tolerantquantumverified
Add this Pith Number to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{G2YJQZSF}
Prints a linked pith:G2YJQZSF badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
A novel scheme is presented for fault-tolerant quantum computation based on the cluster model. Some relevant logical cluster states are constructed in concatenation by post-selection through verification, without necessity of recovery operation, where a suitable code such as the Steane's 7-qubit code is adopted for transversal operations. This simple concatenated construction of verified cluster states achieves a high noise threshold ~1%, and restrains the divergence of resources.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.