analiza aiqbench
This paper presents a novel fault-tolerant quantum computer architecture that optimizes the trade-off between logical qubit density and execution latency by strategically placing surface code patches around ancilla regions. By leveraging workload-specific $T$-gate characteristics to inform floorplan placement and enabling concurrent program execution, the design achieves up to 21% fewer data tiles while maintaining near-optimal instruction cycles. This approach directly addresses critical resource overhead challenges in scaling practical quantum advantage applications.
Rings Around the Ancilla: A Workload-Aware FTQC Architecture
arXiv:2604.19855v3 Announce Type: replace Abstract: Obtaining a quantum advantage in practical applications over classical machines requires a fault-tolerant model of computation. However, the resource overhead of developing a fault-tolerant quantum computer (FTQC) architecture is quite high. Current state-of-the-art architecture designs promise constant-time access to logical qubits at the expense of a high qubit overhead, or qubit-dense layouts at the expense of increased latency in the execution of a quantum workload. In this paper, we propose (a) an architecture design that balances the tradeoff of execution time of workloads with the density of logical qubits by placing the surface code patches around the ancilla region, giving almost equal access of the ancilla region to all the data qubits, (b) design a novel algorithm to leverage the $T$-gate characteristics of the user workload to suggest the optimal placement strategy in the floorplan of our architecture, (c) a workload-selective fast-$Y$ optimization knob that accelerates $Y$-basis measurements only for qubits whose $Y$-gate demand justifies the additional tile cost, and (d) explore the scope of executing multiple programs concurrently, which enhances the reconfigurability of our proposed design. Through numerical evaluation, we observe that the proposed architecture design maintains the cycles per instruction time close to optimal while using up to $\sim21\%$ fewer data tiles, and up to $\sim90\%$ efficiency under a 10-way concurrency.
Abstract:Obtaining a quantum advantage in practical applications over classical machines requires a fault-tolerant model of computation. However, the resource overhead of developing a fault-tolerant quantum computer (FTQC) architecture is quite high. Current state-of-the-art architecture designs promise constant-time access to logical qubits at the expense of a high qubit overhead, or qubit-dense layouts at the expense of increased latency in the execution of a quantum workload. In this paper, we propose (a) an architecture design that balances the tradeoff of execution time of workloads with the density of logical qubits by placing the surface code patches around the ancilla region, giving almost equal access of the ancilla region to all the data qubits, (b) design a novel algorithm to leverage the $T$-gate characteristics of the user workload to suggest the optimal placement strategy in the floorplan of our architecture, (c) a workload-selective fast-$Y$ optimization knob that accelerates $Y$-basis measurements only for qubits whose $Y$-gate demand justifies the additional tile cost, and (d) explore the scope of executing multiple programs concurrently, which enhances the reconfigurability of our proposed design. Through numerical evaluation, we observe that the proposed architecture design maintains the cycles per instruction time close to optimal while using up to $\sim21\%$ fewer data tiles, and up to $\sim90\%$ efficiency under a 10-way concurrency.
Quantum Physics (quant-ph); Hardware Architecture (cs.AR)
arXiv:2604.19855 [quant-ph]
(or arXiv:2604.19855v3 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2604.19855 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 308 cuvinte
