Optimal State Preparation for Logical Arrays on Zoned Neutral Atom Quantum Computers
Yannick Stade, Ludwig Schmid, Lukas Burgholzer, Robert Wille

TL;DR
This paper develops optimized scheduling algorithms for state preparation in zoned neutral atom quantum computers, improving fidelity and efficiency essential for fault-tolerant quantum computing.
Contribution
It introduces a novel SMT-based approach for minimal schedule generation tailored to zoned neutral atom architectures, filling a gap in existing software tools.
Findings
Active zone utilization improves qubit fidelity.
SMT-based scheduling reduces preparation time.
Open-source implementation available in MQT.
Abstract
Quantum computing promises to solve problems previously deemed infeasible. However, high error rates necessitate quantum error correction for practical applications. Seminal experiments with zoned neutral atom architectures have shown remarkable potential for fault-tolerant quantum computing. To fully harness their potential, efficient software solutions are vital. A key aspect of quantum error correction is the initialization of physical qubits representing a logical qubit in a highly entangled state. This process, known as state preparation, is the foundation of most quantum error correction codes and, hence, a crucial step towards fault-tolerant quantum computing. Generating a schedule of target-specific instructions to perform the state preparation is highly complex. First software tools exist but are not suitable for the zoned neutral atom architectures. This work addresses this…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Neural Networks and Applications
