REVIEW 2 cited by
Error Mitigation in Quantum Computers through Instruction Scheduling
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Quantum systems have potential to demonstrate significant computational advantage, but current quantum devices suffer from the rapid accumulation of error that prevents the storage of quantum information over extended periods. The unintentional coupling of qubits to their environment and each other adds significant noise to computation, and improved methods to combat decoherence are required to boost the performance of quantum algorithms on real machines. While many existing techniques for mitigating error rely on adding extra gates to the circuit, calibrating new gates, or extending a circuit's runtime, this paper's primary contribution leverages the gates already present in a quantum program without extending circuit duration. We exploit circuit slack for single-qubit gates that occur in idle windows, scheduling the gates such that their timing can counteract some errors. Spin-echo corrections that mitigate decoherence on idling qubits act as inspiration for this work. Theoretical models, however, fail to capture all sources of noise in NISQ devices, making practical solutions necessary that better minimize the impact of unpredictable errors in quantum machines. This paper presents TimeStitch: a novel framework that pinpoints the optimum execution schedules for single-qubit gates within quantum circuits. TimeStitch, implemented as a compilation pass, leverages the reversible nature of quantum computation to boost the success of circuits on real quantum machines.
Forward citations
Cited by 2 Pith papers
-
Scalable Quantum Architecture Search via Landscape Analysis
A zero-shot quantum architecture search ranks circuits by relative landscape fluctuation computed with Clifford sampling, then prunes redundant gates, reaching 50-qubit VQE simulations with fewer gates.
-
Zassenhaus Expansion in Solving the Schr\"odinger Equation
The authors report that adding second-order Zassenhaus commutator corrections to a Cartan/KAK fixed-depth ansatz yields small simulation errors on six spin models, with a claimed local error of O(t^3).
Discussion (0). Continue with ORCID to comment.