Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Conference on Quantum Computing and Engineering (QCE)

Control Infrastructure for Near-Term Long-Chain QCCD

Andrew Van Horn, Hezekiah Gabaldon, Jungsang Kim, Kenneth R. Brown

Published Sep 17, 2023• 0 citations
Publisher

Abstract

Here, we propose a modular framework for representing and generating voltage solutions for near-term ion trap devices. Voltage graphs are separated into individual segments interconnected by shuttling paths through junctions managed by a Finite State Machine (FSM). This representation then maps onto a modular hardware architecture capable of driving up to 24 96-channel segments at 10MSPS with 10,000 voltage lines per channel. Multi-channel synchronous DACs denoted as “Arbitrary Path Generators” (APG) store the electrode voltages corresponding to each voltage line in a lookup table and execute path traversal sequences. A segment controller then directs the APG to execute a specific shuttling sequence as defined by the graph. Lastly, a trap controller is used to coordinate actions among multiple segments. We also explore the efficient generation and simulation of trap solutions for long-chain systems.

DOI
10.1109/qce57702.2023.10280

Related papers

Toolchain for shuttling trapped-ion qubits in segmented traps

Andreas Conta, Santiago Bogino, Frodo Köhncke +2 more

Scalable trapped-ion quantum computing requires fast and reliable transport of ions through complex, segmented radiofrequency trap architectures without inducing excessive motional excitation. We present a numerical toolchain for the systematic generation of time-dependent electrode voltages enabling fast, low-excitation ion shuttling in segmented radiofrequency traps. Based on a model of the trap electrode geometry, the framework combines an electrostatic field solver, efficient unconstrained optimization, waveform postprocessing, and dynamical simulations of ion motion to compute voltage waveforms that realize prescribed transport trajectories while respecting experimental constraints such as voltage limits and bandwidth. The toolchain supports arbitrary trap geometries, including junctions and multi-zone layouts, and allows for the flexible incorporation of optimization objectives. We provide a detailed assessment of the accuracy of the framework by investigating its numerical stability and by comparing measured and predicted secular frequencies. The framework is optimized for numerical performance, enabling rapid numerical prototyping of trap architectures of increasing complexity. As application examples, we apply the framework to the transport of a potential well along a linear, uniformly segmented trap, and we compute a solution for shuttling a potential well around the corner of an X-type trap junction. The presented approach provides an extensible and highly efficient numerical foundation for designing and validating transport protocols in current and next-generation trapped-ion processors.

quant-pharXiv:2601.08495•AVS Quantum Science•Jan 14, 2026•5 citations

High Output SoC-Based Ion Shuttling Waveform Generator Using Cubic Splines

Tiamike Dudley, Joshua Goldberg, Daniel Lobser +2 more

Surface ion traps have lithographically defined electrode geometries that can be accurately simulated to calculate the voltages needed to store and transport ions, an enabling capability for trapped-ion quantum computing. While these voltage waveforms can be described explicitly as a voltage for each time step, they can be represented more compactly using cubic splines with coefficients calculated from the explicit target waveform. An FPGA would then calculate voltages on-the-fly based on these coefficients with a simple addition loop, sending these values as the input to digital-to-analog converters. Using cubic spline interpolation also increases the flexibility of the control system by simplifying the calibration offsets and time-scaling of waveforms without requiring additional explicit samples. In this paper we show that a single RF system-on-chip can be used to control 100 DAC channels, and propose a system-level architecture that uses scatter gather direct memory access and a highly compact custom data structure to store and generate voltage control waveforms in real-time.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 citations

Trapping an atomic ion using time-division multiplexed digital-to-analog converters

Ryutaro Ohira, Masanari Miyamoto, Shinichi Morisaka +4 more

Independent control of numerous electrodes in quantum charge-coupled device architectures presents a significant challenge for wiring and hardware scalability. To address this issue, we demonstrate a voltage control method based on time-division multiplexing (TDM). This approach utilizes a single high-update-rate digital-to-analog converter (DAC) to sequentially generate control signals for multiple electrodes, thereby reducing both the number of required DACs and associated wiring. We experimentally validate this concept by developing a 10-channel system that operates with only two DACs. The developed TDM-based voltage control system is applied to a surface electrode trap, where we successfully trap a single 40Ca+ ion and demonstrate a simple ion transport primitive. This approach offers a resource-efficient and scalable solution for advanced quantum computing systems based on trapped ions.

arXiv:2508.04093•Applied Physics Letters•Dec 8, 2025•2 citations

Multiplexed Control at Scale for Electrode Arrays in Trapped-Ion Quantum Processors

Ryutaro Ohira, Shinichi Morisaka, Ippei Nakamura +2 more

The scaling up of trapped-ion quantum processors based on the quantum charge-coupled device (QCCD) architecture is difficult owing to the extensive electronics and high-density wiring required to control numerous trap electrodes. In conventional QCCD architectures, each trap electrode is controlled via a dedicated digital-to-analog converter (DAC). The conventional approach places an overwhelming demand on electronic resources and wiring complexity. This is because the number of trap electrodes typically exceeds the number of trapped-ion qubits. This study proposes a method that leverages a high-speed DAC to generate time-division multiplexed signals to control a large-scale QCCD trapped-ion quantum processor. The proposed method replaces conventional DACs with a single high-speed DAC that generates the complete voltage waveforms required to control the trap electrodes, thereby significantly reducing the wiring complexity and overall resource requirements. Based on realistic parameters and commercially available electronics, our analysis demonstrates that a QCCD trapped-ion quantum computer with$\mathbf{1 0, 0 0 0}$trap electrodes can be controlled using only 13 field-programmable gate arrays and 104 high-speed DACs. This is in stark contrast to the$\mathbf{1 0, 0 0 0}$dedicated DACs required by conventional control methods. Consequently, employing this approach, we developed a proof-of-concept electronic system and evaluated its analog output performance.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•2 citations

An Improved Ion-Shuttling Approach for QCCD Architectures

Tung-Yeh Wu, Ting-Chi Wang

Trapped-ion quantum computers offer high-fidelity operations, long coherence times, and all-to-all connectivity within a single trap. However, scaling to large circuits is limited by the trap's ion capacity. The QCCD architecture addresses this by enabling ion shuttling across multiple traps, but excessive shuttling increases execution time and degrades fidelity. This paper presents an improved ion-shuttling approach targeting linear QCCD architectures. Building on a state-of-the-art approach [27] for linear trapped-ion devices, our approach introduces a front-layer-based scheduling method that dynamically prioritizes executable gates, along with a novel destination trap selection method for ion-shuttling, effectively reducing unnecessary ion movements. We also present a look-ahead gate selection strategy based on the gate dependency graph, avoiding the high runtime of the gate proximity approach used in the state-of-the-art approach, especially in circuits with all-to-all communication. Our approach achieves up to a 37.67% reduction in shuttle count and up to a 74.91% reduction in compilation time compared to the state-of-the-art approach for linear trapped-ion devices on actual NISQ benchmarks and synthetic circuits. On average, our approach achieves a 16.44% reduction in shuttle count and a 30.77% reduction in compilation time across all test cases. These improvements highlight the effectiveness of our approach, particularly for actual circuits.

International Symposium on Physical Design•Mar 15, 2026•0 citations

Efficient Compilation for Shuttling Trapped-Ion Machines via the Position Graph Architectural Abstraction

Bao Gia Bach, Ilya Safro, Ed Younis

With the growth of quantum platforms for gate-based quantum computation, compilation holds a crucial role in deciding the success of the implementation. While there has been rich research in compilation techniques for the superconducting-qubit regime. The trapped-ion architectures, currently leading in robust quantum computations for their reliable operations, still lack competitive compilation strategies. This work introduces a unifying hardware abstraction, the “position graph”, representing various hardware architectures. With this abstraction, we model trapped-ion Quantum Charge-Coupled Device (QCCD) architectures, enabling high-quality, scalable compilation methods. Specifically, we propose scheduling algorithms called SHuttling-Aware PERmutative (SHAPER) and SHuttling-AWare (SHAW) heuristic searches to tackle the complex constraints and dynamics of trapped-ion machines, with the cooperation of state-of-the-art permutation-aware mapping. These approaches generate executable circuits and native instructions that respect the physical constraints of shuttling-based architectures. We evaluate proposed algorithms across theorized and real architectures using the position graph framework. For completeness, we also introduce a linear program of trapped-ion scheduling that yields the optimal schedules, enabling a direct comparison with our heuristics. Our algorithm can successfully compile programs for extreme architectures where prior algorithms fail. When the baseline does complete, our produced schedules are 1.45 times faster on average, with best-case speedups up to 4 times faster.

arXiv:2501.12470•ACM Transactions on Quantum Computing•Jul 14, 2026•14 citations
Here, we propose a modular framework for representing and generating voltage solutions for near-term ion trap devices. Voltage graphs are separated into individual segments interconnected by shuttling paths through junctions managed by a Finite State Machine (FSM). This representation then maps onto a modular hardware architecture capable of driving up to 24 96-channel segments at 10MSPS with 10,000 voltage lines per channel. Multi-channel synchronous DACs denoted as “Arbitrary Path Generators” (APG) store the electrode voltages corresponding to each voltage line in a lookup table and execute path traversal sequences. A segment controller then directs the APG to execute a specific shuttling sequence as defined by the graph. Lastly, a trap controller is used to coordinate actions among multiple segments. We also explore the efficient generation and simulation of trap solutions for long-chain systems.
Scalable trapped-ion quantum computing requires fast and reliable transport of ions through complex, segmented radiofrequency trap architectures without inducing excessive motional excitation. We present a numerical toolchain for the systematic generation of time-dependent electrode voltages enabling fast, low-excitation ion shuttling in segmented radiofrequency traps. Based on a model of the trap electrode geometry, the framework combines an electrostatic field solver, efficient unconstrained optimization, waveform postprocessing, and dynamical simulations of ion motion to compute voltage waveforms that realize prescribed transport trajectories while respecting experimental constraints such as voltage limits and bandwidth. The toolchain supports arbitrary trap geometries, including junctions and multi-zone layouts, and allows for the flexible incorporation of optimization objectives. We provide a detailed assessment of the accuracy of the framework by investigating its numerical stability and by comparing measured and predicted secular frequencies. The framework is optimized for numerical performance, enabling rapid numerical prototyping of trap architectures of increasing complexity. As application examples, we apply the framework to the transport of a potential well along a linear, uniformly segmented trap, and we compute a solution for shuttling a potential well around the corner of an X-type trap junction. The presented approach provides an extensible and highly efficient numerical foundation for designing and validating transport protocols in current and next-generation trapped-ion processors.
Surface ion traps have lithographically defined electrode geometries that can be accurately simulated to calculate the voltages needed to store and transport ions, an enabling capability for trapped-ion quantum computing. While these voltage waveforms can be described explicitly as a voltage for each time step, they can be represented more compactly using cubic splines with coefficients calculated from the explicit target waveform. An FPGA would then calculate voltages on-the-fly based on these coefficients with a simple addition loop, sending these values as the input to digital-to-analog converters. Using cubic spline interpolation also increases the flexibility of the control system by simplifying the calibration offsets and time-scaling of waveforms without requiring additional explicit samples. In this paper we show that a single RF system-on-chip can be used to control 100 DAC channels, and propose a system-level architecture that uses scatter gather direct memory access and a highly compact custom data structure to store and generate voltage control waveforms in real-time.
Independent control of numerous electrodes in quantum charge-coupled device architectures presents a significant challenge for wiring and hardware scalability. To address this issue, we demonstrate a voltage control method based on time-division multiplexing (TDM). This approach utilizes a single high-update-rate digital-to-analog converter (DAC) to sequentially generate control signals for multiple electrodes, thereby reducing both the number of required DACs and associated wiring. We experimentally validate this concept by developing a 10-channel system that operates with only two DACs. The developed TDM-based voltage control system is applied to a surface electrode trap, where we successfully trap a single 40Ca+ ion and demonstrate a simple ion transport primitive. This approach offers a resource-efficient and scalable solution for advanced quantum computing systems based on trapped ions.
The scaling up of trapped-ion quantum processors based on the quantum charge-coupled device (QCCD) architecture is difficult owing to the extensive electronics and high-density wiring required to control numerous trap electrodes. In conventional QCCD architectures, each trap electrode is controlled via a dedicated digital-to-analog converter (DAC). The conventional approach places an overwhelming demand on electronic resources and wiring complexity. This is because the number of trap electrodes typically exceeds the number of trapped-ion qubits. This study proposes a method that leverages a high-speed DAC to generate time-division multiplexed signals to control a large-scale QCCD trapped-ion quantum processor. The proposed method replaces conventional DACs with a single high-speed DAC that generates the complete voltage waveforms required to control the trap electrodes, thereby significantly reducing the wiring complexity and overall resource requirements. Based on realistic parameters and commercially available electronics, our analysis demonstrates that a QCCD trapped-ion quantum computer with10,000\mathbf{1 0, 0 0 0}10,000trap electrodes can be controlled using only 13 field-programmable gate arrays and 104 high-speed DACs. This is in stark contrast to the10,000\mathbf{1 0, 0 0 0}10,000dedicated DACs required by conventional control methods. Consequently, employing this approach, we developed a proof-of-concept electronic system and evaluated its analog output performance.
Trapped-ion quantum computers offer high-fidelity operations, long coherence times, and all-to-all connectivity within a single trap. However, scaling to large circuits is limited by the trap's ion capacity. The QCCD architecture addresses this by enabling ion shuttling across multiple traps, but excessive shuttling increases execution time and degrades fidelity. This paper presents an improved ion-shuttling approach targeting linear QCCD architectures. Building on a state-of-the-art approach [27] for linear trapped-ion devices, our approach introduces a front-layer-based scheduling method that dynamically prioritizes executable gates, along with a novel destination trap selection method for ion-shuttling, effectively reducing unnecessary ion movements. We also present a look-ahead gate selection strategy based on the gate dependency graph, avoiding the high runtime of the gate proximity approach used in the state-of-the-art approach, especially in circuits with all-to-all communication. Our approach achieves up to a 37.67% reduction in shuttle count and up to a 74.91% reduction in compilation time compared to the state-of-the-art approach for linear trapped-ion devices on actual NISQ benchmarks and synthetic circuits. On average, our approach achieves a 16.44% reduction in shuttle count and a 30.77% reduction in compilation time across all test cases. These improvements highlight the effectiveness of our approach, particularly for actual circuits.
With the growth of quantum platforms for gate-based quantum computation, compilation holds a crucial role in deciding the success of the implementation. While there has been rich research in compilation techniques for the superconducting-qubit regime. The trapped-ion architectures, currently leading in robust quantum computations for their reliable operations, still lack competitive compilation strategies. This work introduces a unifying hardware abstraction, the “position graph”, representing various hardware architectures. With this abstraction, we model trapped-ion Quantum Charge-Coupled Device (QCCD) architectures, enabling high-quality, scalable compilation methods. Specifically, we propose scheduling algorithms called SHuttling-Aware PERmutative (SHAPER) and SHuttling-AWare (SHAW) heuristic searches to tackle the complex constraints and dynamics of trapped-ion machines, with the cooperation of state-of-the-art permutation-aware mapping. These approaches generate executable circuits and native instructions that respect the physical constraints of shuttling-based architectures. We evaluate proposed algorithms across theorized and real architectures using the position graph framework. For completeness, we also introduce a linear program of trapped-ion scheduling that yields the optimal schedules, enabling a direct comparison with our heuristics. Our algorithm can successfully compile programs for extreme architectures where prior algorithms fail. When the baseline does complete, our produced schedules are 1.45 times faster on average, with best-case speedups up to 4 times faster.