Mapping Quantum Circuits to Ions in Storage Ring Quantum Computer Architectures
Thomas Robertazzi, Kevin Brown

TL;DR
This paper explores methods for mapping quantum circuits onto ion-based qubits in storage ring quantum computers, analyzing architectures, parallelism, and addressing a key predecessor problem with general solutions.
Contribution
It introduces a general methodology for mapping quantum circuits to storage ring quantum computers, including architectures, parallelism strategies, and a solution to the predecessor problem.
Findings
Parallelism enhances storage ring quantum computer performance
A solution to the predecessor problem improves mapping efficiency
Numerical sizing and timing calculations demonstrate feasibility
Abstract
The mapping of quantum circuits to qubits represented by ion states in a storage ring quantum computer is examined. Serial, parallel and hybrid architectures for mapping such qubits onto a storage ring quantum computer are presented. Parallelism is an important part of the SRQC architecture in terms of multiple ions, windows and lasers. A "predecessor problem" that arises in such architectures is identified and a solution is proposed. Representative numerical sizing and timing calculations are presented. The entire methodology is very general and extends to several implementation options. Open problems are identified.
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 Mechanics and Applications
