Generating and verifying graph states for fault-tolerant topological measurement-based quantum computing in 2D optical lattices
Jaewoo Joo, Emilio Alba, Juan Jos\'e Garc\'ia-Ripoll, Timothy P., Spiller

TL;DR
This paper introduces two schemes for creating and verifying graph states in 2D optical lattices, enabling fault-tolerant measurement-based quantum computing with practical verification methods.
Contribution
It presents novel schemes for generating and verifying graph states in 2D optical lattices, facilitating fault-tolerant quantum computation.
Findings
Schemes successfully create bilayer cluster and surface code states.
Verification protocol ensures experimental feasibility.
Simulations indicate potential for fault-tolerant quantum computing.
Abstract
We propose two schemes for implementing graph states useful for fault-tolerant topological measurement-based quantum computation in 2D optical lattices. We show that bilayer cluster and surface code states can be created by global single-row and controlled-Z operations. The schemes benefit from the accessibility of atom addressing on 2D optical lattices and the existence of an efficient verification protocol which allows us to ensure the experimental feasibility of measuring the fidelity of the system against the ideal graph state. The simulation results show potential for a physical realization toward fault-tolerant measurement-based quantum computation against dephasing and unitary phase errors in optical lattices.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
