General circuit compilation protocol into partially fault-tolerant quantum computing architecture
Tomochika Kurita

TL;DR
This paper introduces a new circuit execution protocol for the STAR quantum architecture that efficiently implements continuous non-Clifford gates using probabilistic resource states and joint measurements, reducing time overhead.
Contribution
It proposes a novel protocol employing parallel resource state creation and QUBO-based optimization to improve efficiency in fault-tolerant quantum circuit execution.
Findings
Protocol reduces time overhead through parallel trials and optimization.
Performance estimators accurately predict execution time and optimal topology.
Efficient implementation of continuous gates in fault-tolerant quantum computing.
Abstract
As we are entering an early-FTQC era, circuit execution protocols with logical qubits and certain error-correcting codes are being discussed. Here, we propose a circuit execution protocol for the space-time efficient analog rotation (STAR) architecture. Gate operations within the STAR architecture is based on lattice surgery with surface codes, but it allows direct execution of continuous gates as non-Clifford gates instead of . operations involve creation of resource states followed by ZZ joint measurements with target logical qubits. While employing enables more efficient circuit execution, both their creations and joint measurements are probabilistic processes and adopt repeat-until-success (RUS) protocols which are likely to result in considerable…
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.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · Quantum Information and Cryptography
