Advanced Shuttle Strategies for Parallel QCCD Architectures
Trapped ions (TIs) are at the forefront of quantum computing implementation, offering unparalleled coherence, fidelity, and connectivity. However, the scalability of TI systems is hampered by the limited capacity of individual ion traps, necessitating intricate ion shuttling for advanced computation...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2024-01-01
|
| Series: | IEEE Transactions on Quantum Engineering |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10546265/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832586861947650048 |
|---|---|
| author | Weining Dai Kevin A. Brown Thomas G. Robertazzi |
| author_facet | Weining Dai Kevin A. Brown Thomas G. Robertazzi |
| author_sort | Weining Dai |
| collection | DOAJ |
| description | Trapped ions (TIs) are at the forefront of quantum computing implementation, offering unparalleled coherence, fidelity, and connectivity. However, the scalability of TI systems is hampered by the limited capacity of individual ion traps, necessitating intricate ion shuttling for advanced computational tasks. The quantum charge-coupled device (QCCD) framework has emerged as a promising solution, facilitating ion mobility for universal quantum computation. Current QCCD architectures predominantly feature a linear topology, which is increasingly recognized as inefficient for complex quantum operations. Anticipating the shift toward more efficacious designs, this article introduces an innovative quantum scheduling strategy optimized for parallel QCCD topologies. Our strategy proposes a probabilistic formula for ion movement, alongside ingenious methods for local layer generation and layer compression, yielding a significant reduction in ion shuttle times. Through simulations, we demonstrate that our strategy not only substantially outstrips the linear model but also exhibits better performance over other parallel strategies that employ greedy algorithms. This is achieved through our nuanced resolution of complexities, such as traffic blocks and trap capacity limitations. The consequent reduction in shuttle operations leads to lower energy consumption and an enhancement in the quantum computer's fidelity, ultimately accelerating program execution times. |
| format | Article |
| id | doaj-art-6868a556bfa34126b17144e59d026a19 |
| institution | Kabale University |
| issn | 2689-1808 |
| language | English |
| publishDate | 2024-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Transactions on Quantum Engineering |
| spelling | doaj-art-6868a556bfa34126b17144e59d026a192025-01-25T00:03:41ZengIEEEIEEE Transactions on Quantum Engineering2689-18082024-01-01511810.1109/TQE.2024.340875710546265Advanced Shuttle Strategies for Parallel QCCD ArchitecturesWeining Dai0https://orcid.org/0000-0003-0689-8061Kevin A. Brown1https://orcid.org/0000-0002-6891-4189Thomas G. Robertazzi2https://orcid.org/0000-0002-2382-1843Department of Electrical and Computer Engineering, Stony Brook University, Stony Brook, NY, USADepartment of Electrical and Computer Engineering, Stony Brook University, Stony Brook, NY, USADepartment of Electrical and Computer Engineering, Stony Brook University, Stony Brook, NY, USATrapped ions (TIs) are at the forefront of quantum computing implementation, offering unparalleled coherence, fidelity, and connectivity. However, the scalability of TI systems is hampered by the limited capacity of individual ion traps, necessitating intricate ion shuttling for advanced computational tasks. The quantum charge-coupled device (QCCD) framework has emerged as a promising solution, facilitating ion mobility for universal quantum computation. Current QCCD architectures predominantly feature a linear topology, which is increasingly recognized as inefficient for complex quantum operations. Anticipating the shift toward more efficacious designs, this article introduces an innovative quantum scheduling strategy optimized for parallel QCCD topologies. Our strategy proposes a probabilistic formula for ion movement, alongside ingenious methods for local layer generation and layer compression, yielding a significant reduction in ion shuttle times. Through simulations, we demonstrate that our strategy not only substantially outstrips the linear model but also exhibits better performance over other parallel strategies that employ greedy algorithms. This is achieved through our nuanced resolution of complexities, such as traffic blocks and trap capacity limitations. The consequent reduction in shuttle operations leads to lower energy consumption and an enhancement in the quantum computer's fidelity, ultimately accelerating program execution times.https://ieeexplore.ieee.org/document/10546265/Energy consumptionparallel schedulingquantum schedulingquantum shuttle strategytrapped ion (TI) system |
| spellingShingle | Weining Dai Kevin A. Brown Thomas G. Robertazzi Advanced Shuttle Strategies for Parallel QCCD Architectures IEEE Transactions on Quantum Engineering Energy consumption parallel scheduling quantum scheduling quantum shuttle strategy trapped ion (TI) system |
| title | Advanced Shuttle Strategies for Parallel QCCD Architectures |
| title_full | Advanced Shuttle Strategies for Parallel QCCD Architectures |
| title_fullStr | Advanced Shuttle Strategies for Parallel QCCD Architectures |
| title_full_unstemmed | Advanced Shuttle Strategies for Parallel QCCD Architectures |
| title_short | Advanced Shuttle Strategies for Parallel QCCD Architectures |
| title_sort | advanced shuttle strategies for parallel qccd architectures |
| topic | Energy consumption parallel scheduling quantum scheduling quantum shuttle strategy trapped ion (TI) system |
| url | https://ieeexplore.ieee.org/document/10546265/ |
| work_keys_str_mv | AT weiningdai advancedshuttlestrategiesforparallelqccdarchitectures AT kevinabrown advancedshuttlestrategiesforparallelqccdarchitectures AT thomasgrobertazzi advancedshuttlestrategiesforparallelqccdarchitectures |