Optimal Qubit Reuse for Near-Term Quantum Computers
Sebastian Brandhofer, Ilia Polian, Kevin Krsulich

TL;DR
This paper introduces a formal model for optimal qubit reuse in near-term quantum computers, considering reset errors and circuit optimization, leading to improved qubit efficiency and lower error rates.
Contribution
It presents the first provably optimal qubit reuse method considering mapping effort and reset errors, with experimental validation on real quantum hardware.
Findings
Reset fidelity varies from 67.5% to 100% depending on the qubit.
Optimal qubit reuse reduces swap gates and qubit count.
Improves success probability and fidelity of quantum circuits.
Abstract
Near-term quantum computations are limited by high error rates, the scarcity of qubits and low qubit connectivity. Increasing support for mid-circuit measurements and qubit reset in near-term quantum computers enables qubit reuse that may yield quantum computations with fewer qubits and lower errors. In this work, we introduce a formal model for qubit reuse optimization that delivers provably optimal solutions with respect to quantum circuit depth, number of qubits, or number of swap gates for the first time. This is in contrast to related work where qubit reuse is used heuristically or optimally but without consideration of the mapping effort. We further investigate reset errors on near-term quantum computers by performing reset error characterization experiments. Using the hereby obtained reset error characterization and calibration data of a near-term quantum computer, we then…
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 Information and Cryptography · Quantum and electron transport phenomena
