Running a Quantum Circuit at the Speed of Data
Nemanja Isailovic, Mark Whitney, Yatish Patel, John Kubiatowicz

TL;DR
This paper proposes a new quantum computing architecture that optimizes ancilla generation, significantly reducing resource dependence and achieving over five times faster performance for quantum circuits.
Contribution
It introduces optimized ancilla factories and a novel architecture with data-only regions, improving efficiency and speed in quantum circuit execution.
Findings
Reduced reliance on teleportation
More efficient ancilla distribution
Over five times speedup over previous methods
Abstract
We analyze circuits for a number of kernels from popular quantum computing applications, characterizing the hardware resources necessary to take ancilla preparation off the critical path. The result is a chip entirely dominated by ancilla generation circuits. To address this issue, we introduce optimized ancilla factories and analyze their structure and physical layout for ion trap technology. We introduce a new quantum computing architecture with highly concentrated data-only regions surrounded by shared ancilla factories. The results are a reduced dependence on costly teleportation, more efficient distribution of generated ancillae and more than five times speedup over previous proposals.
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 Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum and electron transport phenomena
