Optimal Mapping for Near-Term Quantum Architectures based on Rydberg Atoms
Sebastian Brandhofer, Hans Peter B\"uchler, Ilia Polian

TL;DR
This paper introduces an optimal mapping algorithm for quantum circuits on Rydberg atom architectures with one-dimensional topology displacements, significantly reducing circuit depth and improving fidelity compared to traditional methods.
Contribution
It presents the first optimal circuit-to-architecture mapping algorithm leveraging 1D topology displacements for Rydberg atom quantum computers.
Findings
Circuit depth reduced by up to 58%
Fidelity increased by up to 29%
Conditions identified where topology displacements outperform swap gates
Abstract
Quantum algorithms promise quadratic or exponential speedups for applications in cryptography, chemistry and material sciences. The topologies of today's quantum computers offer limited connectivity, leading to significant overheads for implementing such quantum algorithms. One-dimensional topology displacements that remedy these limits have been recently demonstrated for architectures based on Rydberg atoms, and they are possible in principle in photonic and ion trap architectures. We present the first optimal quantum circuit-to-architecture mapping algorithm that exploits such one-dimensional topology displacements. We benchmark our method on quantum circuits with up to 15 qubits and investigate the improvements compared with conventional mapping based on inserting swap gates into the quantum circuits. Depending on underlying technology parameters, our approach can decrease the…
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 · Cold Atom Physics and Bose-Einstein Condensates
