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

A study of Quantum ALgorithms with Ion-trap Quantum Computers

Daiwei Zhu

Published Jan 1, 2021• 0 citations
Publisher

Abstract

Quantum computing will be one of the most incredible breakthroughs in science and technology of our generation. Although the ultimate goal of building quantum computers that hold thousands of error-corrected qubits is still beyond our reach, we have made substantial progress. Compared with the first-generation prototypes, holding a few qubits with gate errors of several percent, the latest generation systems can apply more than a hundred gates (with fidelities above $99\%$) to tens of fully connected qubits. This thesis focuses on the applications of such state-of-the-art ion-trap quantum computers. The latest generation ion-trap quantum computers have become complex enough that automation is necessary for optimal operations. We present a full-stack automation scheme implemented on a system at the University of Maryland. With the automation scheme, the system can operate without human interference for a few days. With automation, such systems can efficiently demonstrate different categories of applications. We present the experimental study of several hybrid algorithms aiming for generation modeling and efficient quantum state preparation. We also present a gate-based digital quantum simulation with the trotterization method. Our result accurately reproduced all the features expected from running the algorithms. Verifying quantum computations with classical simulation is getting increasingly challenging as quantum computers evolve. We present two approaches to validate quantum computations. First, we demonstrate a method based on random measurement for comparing the results from different quantum computers. Our comparison captures the similarities between quantum computers made with the same technology. We then present experimental works in verifying quantum advantage classically with interactive protocols. We show that our results, at scale with real-time interaction, can demonstrate quantum advantages.

DOI
10.13016/dnhi-vsr7

Related papers

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

Quantum Computers as Universal Quantum Simulators: State‐of‐the‐Art and Perspectives

Francesco Tacchino, Alessandro Chiesa, Stefano Carretta +1 more

Abstract The past few years have witnessed the concrete and fast spreading of quantum technologies for practical computation and simulation. In particular, quantum computing platforms based on either trapped ions or superconducting qubits have become available for simulations and benchmarking, with up to few tens of qubits that can be reliably initialized, controlled, and measured. The present Review aims at giving a comprehensive outlook on the state‐of‐the‐art capabilities offered from these near‐term noisy devices as universal quantum simulators, that is, programmable quantum computers potentially able to calculate the time evolution of many physical models. First, a pedagogic overview on the basic theoretical background pertaining digital quantum simulations is given, with a focus on hardware‐dependent mapping of spin‐type Hamiltonians into the corresponding quantum circuit as a key initial step toward simulating more complex models. Then, the main experimental achievements obtained in the last decade are reviewed, focusing on the digital quantum simulation of such spin models by employing two leading quantum architectures. Their performances are compared, and future challenges are outlined, also in view of prospective hybrid technologies, towards the ultimate goal of reaching the long‐sought quantum advantage for the simulation of complex many‐body models in the physical sciences.

arXiv:1907.03505•Advanced Quantum Technologies•Dec 19, 2019•172 citations

CONSTRUCTION, OPTIMIZATION, AND APPLICATIONS OF A SMALL TRAPPED-ION QUANTUM COMPUTER

K. A. Landsman

A large-scale quantum computer will have the ability to solve many computational problems beyond the capabilities of today's most powerful computers. Significant efforts to build such a computer are underway, many of which are small prototypes that are believed to be extensible to larger systems. Such systems, like the one in this thesis built off of 171Yb+ ions, are enticing scientific endeavors for their potential to inform the production of large-scale systems, as well as the interesting experiments they can perform. In this work, experimental research is presented on both topics: scalability as well as compelling computations. The first half of this thesis discusses building and optimizing a quantum computer to have high-fidelity qubit operations. An experimental architecture that allows for individual addressing and individual detection of qubits is presented alongside a discussion of errors and error-reduction. We derive the coherent manipulation of qubits using Raman lasers for rotational gates and the criteria necessary for multi-qubit entangling gates. Methods for efficiently fulfilling these criteria are presented with experimental data. Lastly, we consider coherence-related properties of the system necessary to perform these operations and how they can be experimentally improved. The second half of the thesis features three experimental applications of the quantum computer: quantifying quantum scrambling, applying a quantum error correction code, and measuring Renyi entropy. Quantum scrambling is the coherent delocalization of information through a quantum system and is notably difficult to quantify experimentally. We present an efficient scheme to measure it using quantum teleportation. Quantum error correction is a set of techniques for mitigating the effect of imperfect operations performed on a quantum computer, and we demonstrate some of these techniques in order to fault-tolerantly prepare a logical qubit. Lastly, \renyi entropy is an information theoretic quantity that can be used to directly quantify the amount of entanglement in a system. We present a method for measuring it efficiently using a quantum gate known as a Fredkin gate.

•Jan 1, 2019•1 citation

Digital Quantum Simulation of Many-Body Systems: Making the Most of Intermediate-Scale, Noisy Quantum Computers

Miessen, Alexander

Quantum mechanical problems are among the hardest to simulate and, in some cases, remain intractable even for the most powerful computers. Quantum computing has emerged as a new technological platform to address such challenges, with rapid advances in recent years. Yet, current quantum devices remain noisy and limited in scale. Hence, it is essential to identify classically hard problems of practical interest and tractable with existing quantum devices. Among potential applications, the real-time simulation of quantum systems is one of the most promising to deliver an early, practical quantum advantage. This doctoral thesis is therefore centered around simulating quantum dynamics on quantum devices. We first present an overview of the most relevant quantum algorithms for quantum dynamics, highlighting respective advantages and limitations. Further, we identify relevant problems within quantum dynamics that could benefit from quantum simulation in the near future. Second, we propose a method for benchmarking hardware and error mitigation algorithms that is based on well-understood theoretical results and suffers from no scaling issues. The resulting quality metric is intuitive and transferable to other applications. We successfully implement the scheme on up to 133 qubits, demonstrating coherent evolution up to a two-qubit gate depth of 28, featuring 1396 two-qubit gates, before noise becomes prevalent. Third, we propose a novel variant of probabilistic error amplification to implement open quantum dynamics, relying on characterizing and altering hardware noise to mimic the system-environment interaction under study. Lastly, we present two studies on state preparation and phase classification: first, a hybrid algorithm to prepare ground states of electron-phonon systems; second, a quantum machine learning-based approach to distinguish phases in previously prepared quantum states.

arXiv:2508.21504•Aug 29, 2025•1 citation

Quantum Computation and Quantum Simulation with Atomic and Solid State Systems.

Zhexuan Gong

The ability to manipulate individual quantum systems in a precise way has led to a new era of quantum technologies, including quantum computation and quantum simulation. In this thesis we present several new implementations of these quantum technologies. We first aim at addressing current experimental challenges for quantum dot based quantum computing. We propose a systematic way to study the dynamics of nuclear spin, which is responsible for the short electron spin coherence time. Our calculation is based on diffusion model and is consistent with experiments. We also invent a novel protocol to realize high-fidelity ultrafast universal quantum gate in recently-developed quantum dot molecule system. Experimental realization of our protocol requires only a simple time engineering of optical pulses. We then propose a new quantum state transfer scheme for Nitrogen-Vacancy center based quantum computer, which is applicable at room temperature. Our method accomplishes high fidelity robust quantum state transfer through uncontrolled thermal nitrogen spin chain between two remote NV registers. Our next study helps building a hybrid quantum computer by entangling disparate systems using photonic links. The photons emitted from two types of system need to be matched in both frequency and pulse shape. We propose a simple method to match the emitted pulse shape from two qubit systems with different transition linewidths. We then focus on quantum simulation with trapped ions. We show the possibility of observing a novel type of temperature driven structural phase transition in trapped ion chain, which originates from anharmonic interaction between different vibrational modes. Afterward, an experimental protocol to simulate a conceptually new state of matter, called time crystal, is proposed based on ions trapped in a ring trap. Finally, we propose two new applications based on the recently developed trapped ion quantum simulator of spin models: (1) simulation of Haldane-Shastry model, which opens the way of experimental study to a remarkable theoretical model involving spin liquid ground state and fractional excitations (2) observation of prethermalization and dynamical phase transition, which are poorly understood non-equilibrium phenomena in closed quantum many-body system.

•Jan 1, 2013•1 citation

Building and Programming a Universal Ion Trap Quantum Computer

Caroline Figgatt

Quantum computing represents an exciting frontier in the realm of information processing; it is a promising technology that may provide future advances in a wide range of fields, from quantum chemistry to optimization problems. This thesis discusses experimental results for several quantum algorithms performed on a programmable quantum computer consisting of a linear chain of five or seven trapped 171Yb+ atomic clock ions with long coherence times and high gate fidelities. We execute modular one- and two-qubit computation gates through Raman transitions driven by a beat note between counter-propagating beams from a pulsed laser. The system's individual addressing capability provides arbitrary single-qubit rotations as well as all possible two-qubit entangling gates, which are implemented using a pulse-segmentation scheme. The quantum computer can be programmed from a high-level interface to execute arbitrary quantum circuits, and comes with a toolbox of many important composite gates and quantum subroutines. We present experimental results for a complete three-qubit Grover quantum search algorithm, a hallmark application of a quantum computer with a well-known speedup over classical searches of an unsorted database, and report better-than-classical performance. The algorithm is performed for all 8 possible single-result oracles and all 28 possible two-result oracles. All quantum solutions are shown to outperform their classical counterparts. Performing parallel operations will be a powerful capability as deeper circuits on larger, more complex quantum computers present new challenges. Here, we perform a pair of 2-qubit gates simultaneously in a single chain of trapped ions. We employ a pre-calculated pulse shaping scheme that modulates the phase and amplitude of the Raman transitions to drive programmable high-fidelity 2-qubit entangling gates in parallel by coupling to the collective modes of motion of the ion chain. Ensuring the operation yields only spin-spin interactions between the desired pairs, with neither residual spin-motion entanglement nor crosstalk spin-spin entanglement, is a nonlinear constraint problem, and pulse solutions are found using optimization techniques. As an application, we demonstrate the quantum full adder using a depth-4 circuit requiring the use of parallel 2-qubit operations.

•Jan 1, 2018•2 citations
Quantum computing will be one of the most incredible breakthroughs in science and technology of our generation. Although the ultimate goal of building quantum computers that hold thousands of error-corrected qubits is still beyond our reach, we have made substantial progress. Compared with the first-generation prototypes, holding a few qubits with gate errors of several percent, the latest generation systems can apply more than a hundred gates (with fidelities above 99%99\%99%) to tens of fully connected qubits. This thesis focuses on the applications of such state-of-the-art ion-trap quantum computers. The latest generation ion-trap quantum computers have become complex enough that automation is necessary for optimal operations. We present a full-stack automation scheme implemented on a system at the University of Maryland. With the automation scheme, the system can operate without human interference for a few days. With automation, such systems can efficiently demonstrate different categories of applications. We present the experimental study of several hybrid algorithms aiming for generation modeling and efficient quantum state preparation. We also present a gate-based digital quantum simulation with the trotterization method. Our result accurately reproduced all the features expected from running the algorithms. Verifying quantum computations with classical simulation is getting increasingly challenging as quantum computers evolve. We present two approaches to validate quantum computations. First, we demonstrate a method based on random measurement for comparing the results from different quantum computers. Our comparison captures the similarities between quantum computers made with the same technology. We then present experimental works in verifying quantum advantage classically with interactive protocols. We show that our results, at scale with real-time interaction, can demonstrate quantum advantages.
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.
Abstract The past few years have witnessed the concrete and fast spreading of quantum technologies for practical computation and simulation. In particular, quantum computing platforms based on either trapped ions or superconducting qubits have become available for simulations and benchmarking, with up to few tens of qubits that can be reliably initialized, controlled, and measured. The present Review aims at giving a comprehensive outlook on the state‐of‐the‐art capabilities offered from these near‐term noisy devices as universal quantum simulators, that is, programmable quantum computers potentially able to calculate the time evolution of many physical models. First, a pedagogic overview on the basic theoretical background pertaining digital quantum simulations is given, with a focus on hardware‐dependent mapping of spin‐type Hamiltonians into the corresponding quantum circuit as a key initial step toward simulating more complex models. Then, the main experimental achievements obtained in the last decade are reviewed, focusing on the digital quantum simulation of such spin models by employing two leading quantum architectures. Their performances are compared, and future challenges are outlined, also in view of prospective hybrid technologies, towards the ultimate goal of reaching the long‐sought quantum advantage for the simulation of complex many‐body models in the physical sciences.
A large-scale quantum computer will have the ability to solve many computational problems beyond the capabilities of today's most powerful computers. Significant efforts to build such a computer are underway, many of which are small prototypes that are believed to be extensible to larger systems. Such systems, like the one in this thesis built off of 171Yb+ ions, are enticing scientific endeavors for their potential to inform the production of large-scale systems, as well as the interesting experiments they can perform. In this work, experimental research is presented on both topics: scalability as well as compelling computations. The first half of this thesis discusses building and optimizing a quantum computer to have high-fidelity qubit operations. An experimental architecture that allows for individual addressing and individual detection of qubits is presented alongside a discussion of errors and error-reduction. We derive the coherent manipulation of qubits using Raman lasers for rotational gates and the criteria necessary for multi-qubit entangling gates. Methods for efficiently fulfilling these criteria are presented with experimental data. Lastly, we consider coherence-related properties of the system necessary to perform these operations and how they can be experimentally improved. The second half of the thesis features three experimental applications of the quantum computer: quantifying quantum scrambling, applying a quantum error correction code, and measuring Renyi entropy. Quantum scrambling is the coherent delocalization of information through a quantum system and is notably difficult to quantify experimentally. We present an efficient scheme to measure it using quantum teleportation. Quantum error correction is a set of techniques for mitigating the effect of imperfect operations performed on a quantum computer, and we demonstrate some of these techniques in order to fault-tolerantly prepare a logical qubit. Lastly, \renyi entropy is an information theoretic quantity that can be used to directly quantify the amount of entanglement in a system. We present a method for measuring it efficiently using a quantum gate known as a Fredkin gate.
Quantum mechanical problems are among the hardest to simulate and, in some cases, remain intractable even for the most powerful computers. Quantum computing has emerged as a new technological platform to address such challenges, with rapid advances in recent years. Yet, current quantum devices remain noisy and limited in scale. Hence, it is essential to identify classically hard problems of practical interest and tractable with existing quantum devices. Among potential applications, the real-time simulation of quantum systems is one of the most promising to deliver an early, practical quantum advantage. This doctoral thesis is therefore centered around simulating quantum dynamics on quantum devices. We first present an overview of the most relevant quantum algorithms for quantum dynamics, highlighting respective advantages and limitations. Further, we identify relevant problems within quantum dynamics that could benefit from quantum simulation in the near future. Second, we propose a method for benchmarking hardware and error mitigation algorithms that is based on well-understood theoretical results and suffers from no scaling issues. The resulting quality metric is intuitive and transferable to other applications. We successfully implement the scheme on up to 133 qubits, demonstrating coherent evolution up to a two-qubit gate depth of 28, featuring 1396 two-qubit gates, before noise becomes prevalent. Third, we propose a novel variant of probabilistic error amplification to implement open quantum dynamics, relying on characterizing and altering hardware noise to mimic the system-environment interaction under study. Lastly, we present two studies on state preparation and phase classification: first, a hybrid algorithm to prepare ground states of electron-phonon systems; second, a quantum machine learning-based approach to distinguish phases in previously prepared quantum states.
The ability to manipulate individual quantum systems in a precise way has led to a new era of quantum technologies, including quantum computation and quantum simulation. In this thesis we present several new implementations of these quantum technologies. We first aim at addressing current experimental challenges for quantum dot based quantum computing. We propose a systematic way to study the dynamics of nuclear spin, which is responsible for the short electron spin coherence time. Our calculation is based on diffusion model and is consistent with experiments. We also invent a novel protocol to realize high-fidelity ultrafast universal quantum gate in recently-developed quantum dot molecule system. Experimental realization of our protocol requires only a simple time engineering of optical pulses. We then propose a new quantum state transfer scheme for Nitrogen-Vacancy center based quantum computer, which is applicable at room temperature. Our method accomplishes high fidelity robust quantum state transfer through uncontrolled thermal nitrogen spin chain between two remote NV registers. Our next study helps building a hybrid quantum computer by entangling disparate systems using photonic links. The photons emitted from two types of system need to be matched in both frequency and pulse shape. We propose a simple method to match the emitted pulse shape from two qubit systems with different transition linewidths. We then focus on quantum simulation with trapped ions. We show the possibility of observing a novel type of temperature driven structural phase transition in trapped ion chain, which originates from anharmonic interaction between different vibrational modes. Afterward, an experimental protocol to simulate a conceptually new state of matter, called time crystal, is proposed based on ions trapped in a ring trap. Finally, we propose two new applications based on the recently developed trapped ion quantum simulator of spin models: (1) simulation of Haldane-Shastry model, which opens the way of experimental study to a remarkable theoretical model involving spin liquid ground state and fractional excitations (2) observation of prethermalization and dynamical phase transition, which are poorly understood non-equilibrium phenomena in closed quantum many-body system.
Quantum computing represents an exciting frontier in the realm of information processing; it is a promising technology that may provide future advances in a wide range of fields, from quantum chemistry to optimization problems. This thesis discusses experimental results for several quantum algorithms performed on a programmable quantum computer consisting of a linear chain of five or seven trapped 171Yb+ atomic clock ions with long coherence times and high gate fidelities. We execute modular one- and two-qubit computation gates through Raman transitions driven by a beat note between counter-propagating beams from a pulsed laser. The system's individual addressing capability provides arbitrary single-qubit rotations as well as all possible two-qubit entangling gates, which are implemented using a pulse-segmentation scheme. The quantum computer can be programmed from a high-level interface to execute arbitrary quantum circuits, and comes with a toolbox of many important composite gates and quantum subroutines. We present experimental results for a complete three-qubit Grover quantum search algorithm, a hallmark application of a quantum computer with a well-known speedup over classical searches of an unsorted database, and report better-than-classical performance. The algorithm is performed for all 8 possible single-result oracles and all 28 possible two-result oracles. All quantum solutions are shown to outperform their classical counterparts. Performing parallel operations will be a powerful capability as deeper circuits on larger, more complex quantum computers present new challenges. Here, we perform a pair of 2-qubit gates simultaneously in a single chain of trapped ions. We employ a pre-calculated pulse shaping scheme that modulates the phase and amplitude of the Raman transitions to drive programmable high-fidelity 2-qubit entangling gates in parallel by coupling to the collective modes of motion of the ion chain. Ensuring the operation yields only spin-spin interactions between the desired pairs, with neither residual spin-motion entanglement nor crosstalk spin-spin entanglement, is a nonlinear constraint problem, and pulse solutions are found using optimization techniques. As an application, we demonstrate the quantum full adder using a depth-4 circuit requiring the use of parallel 2-qubit operations.