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

Motional Dynamics in Trapped Ions and Rydberg Atoms, and Hybrid Quantum Algorithm for Classical Optimization

Zewen Zhang

Published Dec 1, 2024• 0 citations
OpenAlex

Abstract

Quantum information science has emerged as one of the most promising fields in contemporary research, relying on both software and hardware innovations. This thesis looks for both algorithms with quantum features that provide advantages over classical algorithms, and better hardware platforms for experiments and quantum computing. The work spans theoretical studies in both algorithm and hardware design, including hybrid quantum-classical algorithms and the development of quantum information processing platforms. The algorithmic part has focused on the performance of a hybrid quantum algorithm - the Grover Quantum Approximate Optimization Algorithm (Grover QAOA) - designed for problems with multiple solutions. In practice, we find its potential for speedup in solution search and its ability to find all solutions. Furthermore, we propose a simplified protocol that reduces the classical complexity of optimizing the algorithm’s parameters, enhancing its practicality for future applications. Our implementation of Grover QAOA for multiple combinatorial optimization problems on trapped-ion quantum computers demonstrates that the algorithm can fulfill its fair-sampling advantage even on noisy devices. In the hardware part, we mainly explore how the motion of cold atoms can either be used to engineer interactions or lead to previously overlooked decoherence. The first hardware platform we discuss is trapped ions, where we focus on implementing individual addressing to natively simulate new types of many-body systems. Our proposal leverages the exceptional controllability of trapped ions to explore dynamical models such as topological pumping. The second hardware platform we study is Rydberg atom lattices, where we investigate the decoherence processes introduced by atomic motion during dynamics. Using the numerical tool of discrete truncated Wigner approximation, we simulate the coupled dynamics of electronic and motional degrees of freedom, demonstrating that atom motion induced by strong van der Waals interactions in Rydberg atoms can lead to significant decoherence in analog simulation experiments. We have also explored specialized topics involving other quantum hardware platforms. One area of study is the reduction of frequency crowding in superconducting circuit quantum chips. By properly designing the frequencies for each transmon qubit, we can improve the manufacturing yield of collision-free processors. Another area focuses on the SU(N) Fermi-Hubbard models on alkaline-earth-metal optical lattice platforms. We have obtained the phase diagram of unit-filling models with imbalanced spin flavors. This work aids future experiments in searching for potential ground states of the unit-filling SU(N) model.

Related papers

Quantum many-body inspired algorithms for quantum simulation on NISQ devices

Riccardo Cioli

Quantum computers provide a promising platform to understand and control the dynamics of quantum many-body systems, yet current devices operate in the noisy intermediate-scale quantum (NISQ) regime, where decoherence caused by interactions with the environment severely limit their ability to accurately carry out computations. This thesis investigates how these limitations affect the simulation of quantum many-body systems, and explores strategies to design efficient quantum algorithms that can operate under realistic experimental constraints. In the first part, we assess the performance of currently available quantum hardware using lattice gauge theory as a challenging testbed. We study digital quantum simulations of a one-dimensional discretization of quantum electrodynamics on Rydberg atom and superconducting platforms, combining classical simulations with realistic noise models and quantum simulations on actual cloud-accessible devices, and analyze the impact of decoherence and gate errors on the accurate reconstruction of dynamical observables. Our findings show that, for the hardware available at the time of the study, reliable simulations without high quality error mitigation are restricted to short circuit depths or small system sizes. These limitations motivate the second part of the work, where we focus on constructing resource-efficient quantum algorithms by exploiting physical insight from quantum many-body physics. First, we introduce an approximate inversion protocol for classical shadows that enables the efficient estimation of global properties of quantum states using shallow quantum circuits. Then, we propose an algorithm for the preparation of short-range correlated quantum states, based on reconstructing the global state by learning local reduced density matrices through classical variational optimization. Taken together, the results of this thesis provide insight into the capabilities of currently available quantum devices and demonstrate how structure inherent to quantum many-body systems can be leveraged to design algorithms compatible with current hardware.

•Nov 10, 2026•0 citations

Quantum computing and error correction protocols for atomic quantum processors

David Frederik Locher

State-of-the-art quantum computers are not yet capable of executing large-scale fault-tolerant quantum algorithms. However, experiments in recent years have demonstrated remarkable noisy intermediate-scale and early fault-tolerant quantum computations. To use the existing yet limited hardware most effectively, these protocols are typically tailored to a specific device or hardware platform that comes with certain capabilities but also with individual limitations. This thesis studies quantum protocols suited for near-term atomic quantum processors, i.e., neutral atoms in optical tweezer arrays and trapped ions. One challenge these two platforms have in common is the difficulty of performing mid-circuit measurements. On the other hand, both platforms offer advantages in qubit connectivity and scalability, both of which can be achieved by shuttling atoms or ions. Furthermore, neutral-atom and trapped-ion setups provide native support for multiqubit gates. The protocols explored in this thesis focus on quantum error correction, but also touch on quantum simulation. Concretely, we first investigate quantum autoencoders as a tool for measurement-free quantum error correction in a quantum memory. We propose an experimental implementation of this quantum machine-learning model on a shuttling-based trapped-ion quantum processor to demonstrate that quantum autoencoders can independently identify optimal strategies that combat hardware-specific noise. Secondly, we develop a software toolbox to optimize two- and multiqubit Rydberg gates utilized in neutral-atom quantum processors. We show that multiqubit gates can be useful for achieving good performance and efficient implementations of Floquet and measurement-free fault-tolerant quantum error correction with neutral atoms. Thirdly, we study the feasibility of neutral atoms as a platform for bosonic quantum error correction. We devise blueprints for encoding Gottesman-Kitaev-Preskill qubits in selected motional modes of neutral atoms confined in optical dipole traps and compare the suitability of optical tweezers and optical lattices for this purpose. Finally, we investigate a novel dissipative variational quantum eigen solver that enables the study of ground-state properties of the pure Z-2 lattice gauge theory. We demonstrate that the scheme outperforms established unitary approaches in the presence of circuit-level noise and can be implemented in available neutral-atom quantum processors. Overall, the schemes developed in this work could serve as building blocks for executing elaborate protocols on state-of-the-art atomic quantum processors. Therefore, the results of this thesis contribute to bridging the gap between the theoretical development of protocols for quantum error correction or quantum simulation and their experimental realization.

•Jan 1, 2026•0 citations

Hybrid quantum-classical computation – From infrastructure to algorithms

Tobias Schmale

Quantum computers hold the potential of solving problems that are intractable using classical means. Yet, to date no quantum computer has actually solved a problem of general interest that could not have been solved otherwise. Bridging this gap from promised theoretical usefulness to practical relevance is an interdisciplinary challenge, requiring experimental progress, solutions of classical software challenges as well as advances in quantum algorithm design. It is these final two points in which this thesis aims to contribute. One of the most promising quantum computing architectures is based on trapping ions in surface-electrode ion-traps. In order to productively operate such trapped-ion quantum computers, we develop and benchmark a compiler that optimizes ion shuttling sequences in order to efficiently map abstract quantum circuits onto a physical trapped-ion chip. This is a necessary component of the infrastructure of a quantum computing setup, however it is alone not sufficient to execute arbitrary quantum algorithms. In particular, a very promising class of quantum algorithms are so-called hybrid quantum-classical algorithms which leverage the computational resources of both quantum and classical computers. To effectively implement such algorithms, a suitable software setup is necessary to allow for tight interplay between the two types of computers without wasting precious coherence time. To solve this challenge, we propose, implement and benchmark our setup for Interpreted Quantum-Classical Computations (IQCCs), demonstrating its feasibility for trapped-ion quantum computers. For the second part of this thesis we focus on the development of quantum algorithms that make use of this setup. As a first application, we investigate quantum simulations of gauge theories. Such theories are prevalent throughout modern physics and are characterized by local constraints that the dynamics are subject to. Errors in noisy simulations of such theories results in these constraints being violated and the simulations becoming unphysical. We show that this problem can be remedied by measuring gauge operators, decoding possible errors on a classical computer and actively correcting them, which reduces simulation errors. Additionally we interpret the scheme as a sympathetic cooling setup, which allows thermal control of the simulation. We finally turn to the task of preparing ground states of frustration-free Hamiltonians in quantum computers. Studying ground states of various systems is of paramount importance for solving optimization problems and understanding phenomena such as magnetism, superconductivity and superfluidity. We frame the ground-state preparation problem as an error correction problem, wherein energy is measured locally, measurements are decoded and corrections are applied to reduce the energy. In physically relevant examples we show up to exponentially improved runtimes over previous, similar algorithms and give a general run-time bound in terms of the Hamiltonian gap.

•Jan 1, 2026•1 citation

Analog quantum simulation and quantum many-body dynamics in atomic, molecular and optical systems

Fangli Liu

In recent decades, the rapid development of quantum technologies has led to a new era of programmable platforms, enabling the realizations of quantum simulation and quantum computation. This dissertation is motivated by recent experimental progress on controlling individual quantum degrees of freedom in systems such as trapped ions and Rydberg atom arrays. By tailoring the interactions in these quantum systems, we study analog quantum simulations of various physical phenomena, including non-equilibrium quantum dynamics and nontrivial topological physics. In the first part of the dissertation, we study slow quantum many-body dynamics in trapped-ion systems and Rydberg atom arrays. We first show that either the long-range interactions or an additional symmetry-breaking field can give rise to a confining potential. Such a potential can couple domain wall quasiparticles into mesonic or baryonic bound states. These confined quasiparticles strongly suppress the quantum information dynamics and lead to slow thermalization. In thelimit of strict domain-wall confinement, the full Hilbert space is fragmented into exponentially many disconnected subspaces. Furthermore, we demonstrate that thermalization can be halted by quantum engineering a uniformly increasing field in the trapped-ion quantum simulator. The second part of the dissertation focuses on topologically relevant phenomena in quantum simulators. We first study the effect of experimentally relevant disorder in 2D Rydberg atom arrays. We find that there are three distinct localization regimes due to the presence of nontrivial topological bands. We further study the non-equilibrium dynamics of Abelian anyons in a one-dimensional system. We show that the interplay of anyonic statistics and interactions can give rise to spatially asymmetric quantum dynamics. Finally, we use Nielsen’s geometric approach to quantify circuit complexity in topological models. We find that the circuit complexities of ground states and non-equilibrium steady states both exhibit nonanalytical behavior at topological transition points.

•Jan 1, 2021•0 citations

Quantum gates, sensors, and systems with trapped ions

Shannon X. Wang

Quantum information science promises a host of new and useful applications in communication, simulation, and computational algorithms. Trapped atomic ions are one of the leading physical systems with potential to implement a large-scale quantum information system, but many challenges still remain. This thesis describes some experimental approaches to address several such challenges broadly organized under three themes: gates, sensors, and systems. Quantum logic gates are the fundamental building blocks for quantum algorithms. Although they have been demonstrated with trapped ions previously, scalability requires miniaturizing ion traps by using a surface-electrode geometry. Using a single ion in a surface-electrode trap, we perform a two-qubit entangling gate and fully characterize it via quantum process tomography, as an initial validation of surface-electrode ion traps for quantum information processing. Good logic gates are often good sensors for fast fluctuations and energy changes in their environment. Trapped ions are sensitive to fluctuating and static charges, leading to motional state decoherence (heating) and instabilities, problems exacerbated by the surface-electrode geometry. We investigate the material dependence of heating, specifically with aluminum and superconducting traps, to elucidate the physical origin of these fluctuating charges. Static charging is hypothesized to be caused by the trapping and cooling lasers due to the photoelectric effect. We perform systematic experiments with aluminum, gold, and copper traps with lasers at various wavelengths to validate this hypothesis. Realizing quantum processors at the system level requires models and tools for predicting system performance, demonstration of good classical and quantum control, and techniques for integrating different quantum systems. We develop a modeling system for trapped ion quantum computing experiments and simulate the effect of physical and technical noise sources on practical realizations of quantum algorithms in a trapped ion system. We experimentally demonstrate several such algorithms, including the quantum Fourier transform, order-finding, and Shor's algorithm on up to 5 ions. These experiments highlight several unique advantages of ion trap systems and help identify needs for further development. Finally, we explore the integration of ion traps with optical elements including mirrors and photon detectors as key elements in creating future hybrid quantum systems.

•Jan 1, 2012•7 citations

Hamiltonian engineering and quantum compilation

Baßler, Pascal

Quantum computers hold the promise of solving certain computational problems significantly faster than classical computers. Unlocking the full potential of quantum hardware depends on our ability to efficiently translate high-level quantum algorithms into executable sequences of quantum operations tailored to the specific constraints of a given device, a task known as quantum compilation. Among the most promising applications is the simulation of quantum systems, such as in quantum chemistry, where scalable, error resilient, and experimentally feasible Hamiltonian simulation techniques are essential. In the first part of this thesis, we present recent advances in the field of quantum compilation, emphasizing on efficient gate decomposition and circuit optimization. In particular, we analyze compilation techniques for Clifford circuits and general single-qubit rotations. Clifford operations play a central role in quantum error correction, the characterization of quantum devices and quantum cryptography. We explore asymptotically optimal decomposition methods, including constructions using either two-qubit gates or global entangling operations, the latter being especially well-suited for platforms like trapped ions. For single-qubit unitaries, we discuss approximation schemes that achieve the theoretically optimal scaling of gate count with respect to the desired precision. Beyond gate synthesis, we examine various hardware-aware optimization strategies aimed at reducing circuit depth and gate overhead. These include techniques for qubit routing in systems with limited connectivity, as well as methods for removing redundant operations. The second and primary, scientific contribution of this thesis focuses on implementation of effective many-body interactions on quantum hardware by combining the system’s native dynamics with control operations, which we call Hamiltonian engineering. Motivated by the central role of Hamiltonian simulation in quantum science, we introduce a general and efficient framework for synthesizing arbitrary target Hamiltonians under mild locality constraints. We propose a novel linear programming (LP) approach that computes pulse sequences consisting of single-qubit π or π/2 rotations applied at certain times during free evolution under the system’s native Hamiltonian. Our LP-based framework offers multiple advantages. First, its classical runtime depends only on the number and locality of the interactions in the system Hamiltonian, not directly on the overall system size. Second, we extend the method to include robustness against common error sources such as finite pulse time effects and systematic control errors, leveraging tools from average Hamiltonian theory and robust composite pulses. Our approach enables the efficient realization of high-fidelity Hamiltonian dynamics with minimal experimental overhead. The scalability of the approach are demonstrated through simulations, including the engineering of a random two-body Hamiltonian on a 225 qubit lattice in under a minute of classical preprocessing. In conclusion, this thesis contributes both theoretical insights and practical tools that bridge the gap between algorithm design and experimental implementation in quantum computing. The techniques developed here are directly applicable to a variety of platforms, including trapped ions, neutral atoms, and superconducting circuits. By advancing the frontiers of Hamiltonian engineering, this work enables more efficient, robust, and scalable quantum simulations on nearterm devices. Finally, it brings us closer to realizing quantum technologies, which are possibly capable of solving meaningful problems.

•Dec 8, 2025•0 citations
Quantum information science has emerged as one of the most promising fields in contemporary research, relying on both software and hardware innovations. This thesis looks for both algorithms with quantum features that provide advantages over classical algorithms, and better hardware platforms for experiments and quantum computing. The work spans theoretical studies in both algorithm and hardware design, including hybrid quantum-classical algorithms and the development of quantum information processing platforms. The algorithmic part has focused on the performance of a hybrid quantum algorithm - the Grover Quantum Approximate Optimization Algorithm (Grover QAOA) - designed for problems with multiple solutions. In practice, we find its potential for speedup in solution search and its ability to find all solutions. Furthermore, we propose a simplified protocol that reduces the classical complexity of optimizing the algorithm’s parameters, enhancing its practicality for future applications. Our implementation of Grover QAOA for multiple combinatorial optimization problems on trapped-ion quantum computers demonstrates that the algorithm can fulfill its fair-sampling advantage even on noisy devices. In the hardware part, we mainly explore how the motion of cold atoms can either be used to engineer interactions or lead to previously overlooked decoherence. The first hardware platform we discuss is trapped ions, where we focus on implementing individual addressing to natively simulate new types of many-body systems. Our proposal leverages the exceptional controllability of trapped ions to explore dynamical models such as topological pumping. The second hardware platform we study is Rydberg atom lattices, where we investigate the decoherence processes introduced by atomic motion during dynamics. Using the numerical tool of discrete truncated Wigner approximation, we simulate the coupled dynamics of electronic and motional degrees of freedom, demonstrating that atom motion induced by strong van der Waals interactions in Rydberg atoms can lead to significant decoherence in analog simulation experiments. We have also explored specialized topics involving other quantum hardware platforms. One area of study is the reduction of frequency crowding in superconducting circuit quantum chips. By properly designing the frequencies for each transmon qubit, we can improve the manufacturing yield of collision-free processors. Another area focuses on the SU(N) Fermi-Hubbard models on alkaline-earth-metal optical lattice platforms. We have obtained the phase diagram of unit-filling models with imbalanced spin flavors. This work aids future experiments in searching for potential ground states of the unit-filling SU(N) model.
Quantum computers provide a promising platform to understand and control the dynamics of quantum many-body systems, yet current devices operate in the noisy intermediate-scale quantum (NISQ) regime, where decoherence caused by interactions with the environment severely limit their ability to accurately carry out computations. This thesis investigates how these limitations affect the simulation of quantum many-body systems, and explores strategies to design efficient quantum algorithms that can operate under realistic experimental constraints. In the first part, we assess the performance of currently available quantum hardware using lattice gauge theory as a challenging testbed. We study digital quantum simulations of a one-dimensional discretization of quantum electrodynamics on Rydberg atom and superconducting platforms, combining classical simulations with realistic noise models and quantum simulations on actual cloud-accessible devices, and analyze the impact of decoherence and gate errors on the accurate reconstruction of dynamical observables. Our findings show that, for the hardware available at the time of the study, reliable simulations without high quality error mitigation are restricted to short circuit depths or small system sizes. These limitations motivate the second part of the work, where we focus on constructing resource-efficient quantum algorithms by exploiting physical insight from quantum many-body physics. First, we introduce an approximate inversion protocol for classical shadows that enables the efficient estimation of global properties of quantum states using shallow quantum circuits. Then, we propose an algorithm for the preparation of short-range correlated quantum states, based on reconstructing the global state by learning local reduced density matrices through classical variational optimization. Taken together, the results of this thesis provide insight into the capabilities of currently available quantum devices and demonstrate how structure inherent to quantum many-body systems can be leveraged to design algorithms compatible with current hardware.
State-of-the-art quantum computers are not yet capable of executing large-scale fault-tolerant quantum algorithms. However, experiments in recent years have demonstrated remarkable noisy intermediate-scale and early fault-tolerant quantum computations. To use the existing yet limited hardware most effectively, these protocols are typically tailored to a specific device or hardware platform that comes with certain capabilities but also with individual limitations. This thesis studies quantum protocols suited for near-term atomic quantum processors, i.e., neutral atoms in optical tweezer arrays and trapped ions. One challenge these two platforms have in common is the difficulty of performing mid-circuit measurements. On the other hand, both platforms offer advantages in qubit connectivity and scalability, both of which can be achieved by shuttling atoms or ions. Furthermore, neutral-atom and trapped-ion setups provide native support for multiqubit gates. The protocols explored in this thesis focus on quantum error correction, but also touch on quantum simulation. Concretely, we first investigate quantum autoencoders as a tool for measurement-free quantum error correction in a quantum memory. We propose an experimental implementation of this quantum machine-learning model on a shuttling-based trapped-ion quantum processor to demonstrate that quantum autoencoders can independently identify optimal strategies that combat hardware-specific noise. Secondly, we develop a software toolbox to optimize two- and multiqubit Rydberg gates utilized in neutral-atom quantum processors. We show that multiqubit gates can be useful for achieving good performance and efficient implementations of Floquet and measurement-free fault-tolerant quantum error correction with neutral atoms. Thirdly, we study the feasibility of neutral atoms as a platform for bosonic quantum error correction. We devise blueprints for encoding Gottesman-Kitaev-Preskill qubits in selected motional modes of neutral atoms confined in optical dipole traps and compare the suitability of optical tweezers and optical lattices for this purpose. Finally, we investigate a novel dissipative variational quantum eigen solver that enables the study of ground-state properties of the pure Z-2 lattice gauge theory. We demonstrate that the scheme outperforms established unitary approaches in the presence of circuit-level noise and can be implemented in available neutral-atom quantum processors. Overall, the schemes developed in this work could serve as building blocks for executing elaborate protocols on state-of-the-art atomic quantum processors. Therefore, the results of this thesis contribute to bridging the gap between the theoretical development of protocols for quantum error correction or quantum simulation and their experimental realization.
Quantum computers hold the potential of solving problems that are intractable using classical means. Yet, to date no quantum computer has actually solved a problem of general interest that could not have been solved otherwise. Bridging this gap from promised theoretical usefulness to practical relevance is an interdisciplinary challenge, requiring experimental progress, solutions of classical software challenges as well as advances in quantum algorithm design. It is these final two points in which this thesis aims to contribute. One of the most promising quantum computing architectures is based on trapping ions in surface-electrode ion-traps. In order to productively operate such trapped-ion quantum computers, we develop and benchmark a compiler that optimizes ion shuttling sequences in order to efficiently map abstract quantum circuits onto a physical trapped-ion chip. This is a necessary component of the infrastructure of a quantum computing setup, however it is alone not sufficient to execute arbitrary quantum algorithms. In particular, a very promising class of quantum algorithms are so-called hybrid quantum-classical algorithms which leverage the computational resources of both quantum and classical computers. To effectively implement such algorithms, a suitable software setup is necessary to allow for tight interplay between the two types of computers without wasting precious coherence time. To solve this challenge, we propose, implement and benchmark our setup for Interpreted Quantum-Classical Computations (IQCCs), demonstrating its feasibility for trapped-ion quantum computers. For the second part of this thesis we focus on the development of quantum algorithms that make use of this setup. As a first application, we investigate quantum simulations of gauge theories. Such theories are prevalent throughout modern physics and are characterized by local constraints that the dynamics are subject to. Errors in noisy simulations of such theories results in these constraints being violated and the simulations becoming unphysical. We show that this problem can be remedied by measuring gauge operators, decoding possible errors on a classical computer and actively correcting them, which reduces simulation errors. Additionally we interpret the scheme as a sympathetic cooling setup, which allows thermal control of the simulation. We finally turn to the task of preparing ground states of frustration-free Hamiltonians in quantum computers. Studying ground states of various systems is of paramount importance for solving optimization problems and understanding phenomena such as magnetism, superconductivity and superfluidity. We frame the ground-state preparation problem as an error correction problem, wherein energy is measured locally, measurements are decoded and corrections are applied to reduce the energy. In physically relevant examples we show up to exponentially improved runtimes over previous, similar algorithms and give a general run-time bound in terms of the Hamiltonian gap.
In recent decades, the rapid development of quantum technologies has led to a new era of programmable platforms, enabling the realizations of quantum simulation and quantum computation. This dissertation is motivated by recent experimental progress on controlling individual quantum degrees of freedom in systems such as trapped ions and Rydberg atom arrays. By tailoring the interactions in these quantum systems, we study analog quantum simulations of various physical phenomena, including non-equilibrium quantum dynamics and nontrivial topological physics. In the first part of the dissertation, we study slow quantum many-body dynamics in trapped-ion systems and Rydberg atom arrays. We first show that either the long-range interactions or an additional symmetry-breaking field can give rise to a confining potential. Such a potential can couple domain wall quasiparticles into mesonic or baryonic bound states. These confined quasiparticles strongly suppress the quantum information dynamics and lead to slow thermalization. In thelimit of strict domain-wall confinement, the full Hilbert space is fragmented into exponentially many disconnected subspaces. Furthermore, we demonstrate that thermalization can be halted by quantum engineering a uniformly increasing field in the trapped-ion quantum simulator. The second part of the dissertation focuses on topologically relevant phenomena in quantum simulators. We first study the effect of experimentally relevant disorder in 2D Rydberg atom arrays. We find that there are three distinct localization regimes due to the presence of nontrivial topological bands. We further study the non-equilibrium dynamics of Abelian anyons in a one-dimensional system. We show that the interplay of anyonic statistics and interactions can give rise to spatially asymmetric quantum dynamics. Finally, we use Nielsen’s geometric approach to quantify circuit complexity in topological models. We find that the circuit complexities of ground states and non-equilibrium steady states both exhibit nonanalytical behavior at topological transition points.
Quantum information science promises a host of new and useful applications in communication, simulation, and computational algorithms. Trapped atomic ions are one of the leading physical systems with potential to implement a large-scale quantum information system, but many challenges still remain. This thesis describes some experimental approaches to address several such challenges broadly organized under three themes: gates, sensors, and systems. Quantum logic gates are the fundamental building blocks for quantum algorithms. Although they have been demonstrated with trapped ions previously, scalability requires miniaturizing ion traps by using a surface-electrode geometry. Using a single ion in a surface-electrode trap, we perform a two-qubit entangling gate and fully characterize it via quantum process tomography, as an initial validation of surface-electrode ion traps for quantum information processing. Good logic gates are often good sensors for fast fluctuations and energy changes in their environment. Trapped ions are sensitive to fluctuating and static charges, leading to motional state decoherence (heating) and instabilities, problems exacerbated by the surface-electrode geometry. We investigate the material dependence of heating, specifically with aluminum and superconducting traps, to elucidate the physical origin of these fluctuating charges. Static charging is hypothesized to be caused by the trapping and cooling lasers due to the photoelectric effect. We perform systematic experiments with aluminum, gold, and copper traps with lasers at various wavelengths to validate this hypothesis. Realizing quantum processors at the system level requires models and tools for predicting system performance, demonstration of good classical and quantum control, and techniques for integrating different quantum systems. We develop a modeling system for trapped ion quantum computing experiments and simulate the effect of physical and technical noise sources on practical realizations of quantum algorithms in a trapped ion system. We experimentally demonstrate several such algorithms, including the quantum Fourier transform, order-finding, and Shor's algorithm on up to 5 ions. These experiments highlight several unique advantages of ion trap systems and help identify needs for further development. Finally, we explore the integration of ion traps with optical elements including mirrors and photon detectors as key elements in creating future hybrid quantum systems.
Quantum computers hold the promise of solving certain computational problems significantly faster than classical computers. Unlocking the full potential of quantum hardware depends on our ability to efficiently translate high-level quantum algorithms into executable sequences of quantum operations tailored to the specific constraints of a given device, a task known as quantum compilation. Among the most promising applications is the simulation of quantum systems, such as in quantum chemistry, where scalable, error resilient, and experimentally feasible Hamiltonian simulation techniques are essential. In the first part of this thesis, we present recent advances in the field of quantum compilation, emphasizing on efficient gate decomposition and circuit optimization. In particular, we analyze compilation techniques for Clifford circuits and general single-qubit rotations. Clifford operations play a central role in quantum error correction, the characterization of quantum devices and quantum cryptography. We explore asymptotically optimal decomposition methods, including constructions using either two-qubit gates or global entangling operations, the latter being especially well-suited for platforms like trapped ions. For single-qubit unitaries, we discuss approximation schemes that achieve the theoretically optimal scaling of gate count with respect to the desired precision. Beyond gate synthesis, we examine various hardware-aware optimization strategies aimed at reducing circuit depth and gate overhead. These include techniques for qubit routing in systems with limited connectivity, as well as methods for removing redundant operations. The second and primary, scientific contribution of this thesis focuses on implementation of effective many-body interactions on quantum hardware by combining the system’s native dynamics with control operations, which we call Hamiltonian engineering. Motivated by the central role of Hamiltonian simulation in quantum science, we introduce a general and efficient framework for synthesizing arbitrary target Hamiltonians under mild locality constraints. We propose a novel linear programming (LP) approach that computes pulse sequences consisting of single-qubit π or π/2 rotations applied at certain times during free evolution under the system’s native Hamiltonian. Our LP-based framework offers multiple advantages. First, its classical runtime depends only on the number and locality of the interactions in the system Hamiltonian, not directly on the overall system size. Second, we extend the method to include robustness against common error sources such as finite pulse time effects and systematic control errors, leveraging tools from average Hamiltonian theory and robust composite pulses. Our approach enables the efficient realization of high-fidelity Hamiltonian dynamics with minimal experimental overhead. The scalability of the approach are demonstrated through simulations, including the engineering of a random two-body Hamiltonian on a 225 qubit lattice in under a minute of classical preprocessing. In conclusion, this thesis contributes both theoretical insights and practical tools that bridge the gap between algorithm design and experimental implementation in quantum computing. The techniques developed here are directly applicable to a variety of platforms, including trapped ions, neutral atoms, and superconducting circuits. By advancing the frontiers of Hamiltonian engineering, this work enables more efficient, robust, and scalable quantum simulations on nearterm devices. Finally, it brings us closer to realizing quantum technologies, which are possibly capable of solving meaningful problems.