TL;DR
This paper introduces Orchestrated Trios, a new quantum compiler approach that optimizes multi-qubit gate compilation and routing, significantly reducing error-prone operations and improving success rates on IBM quantum hardware.
Contribution
It proposes a novel compiler structure that first decomposes to three-qubit gates, then routes and finishes decomposition, enabling architecture-tuned optimizations and reducing communication overhead.
Findings
35% decrease in two-qubit gate count on IBM Johannesburg
23% increase in success rate of a single Toffoli gate
344% average increase in success rate for benchmark algorithms
Abstract
Current quantum computers are especially error prone and require high levels of optimization to reduce operation counts and maximize the probability the compiled program will succeed. These computers only support operations decomposed into one- and two-qubit gates and only two-qubit gates between physically connected pairs of qubits. Typical compilers first decompose operations, then route data to connected qubits. We propose a new compiler structure, Orchestrated Trios, that first decomposes to the three-qubit Toffoli, routes the inputs of the higher-level Toffoli operations to groups of nearby qubits, then finishes decomposition to hardware-supported gates. This significantly reduces communication overhead by giving the routing pass access to the higher-level structure of the circuit instead of discarding it. A second benefit is the ability to now select an architecture-tuned…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
