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

arXiv:2502.20199

Exploring experimental limit of deep quantum signal processing using a trapped-ion simulator

Jintao Bu, Lei Zhang, Zhan Yu, Jingbo Wang, W. -Q. Ding, W. -F. Yuan, B. Wang, Du, H. -J., Chen, W. -J., Liang Chen, Jianwen Zhang, J. -C. Li, Fei Zhou, Xin Wang, Mang Feng

Published Feb 27, 2025• 0 citations
arXivHTMLPDF

Abstract

Quantum signal processing (QSP), which enables systematic polynomial transformations on quantum data through sequences of qubit rotations, has emerged as a fundamental building block for quantum algorithms and data re-uploading quantum neural networks. While recent experiments have demonstrated the feasibility of shallow QSP circuits, the inherent limitations in scaling QSP to achieve complex transformations on quantum hardware remain an open and critical question. Here we report the first experimental realization of deep QSP circuits in a trapped-ion quantum simulator. By manipulating the qubit encoded in a trapped $^{43}\textrm{Ca}^{+}$ ion, we demonstrate high-precision simulation of some prominent functions used in quantum algorithms and machine learning, with circuit depths ranging from 15 to 360 layers and implementation time significantly longer than coherence time of the qubit. Our results reveal a crucial trade-off between the precision of function simulation and the concomitant accumulation of hardware noise, highlighting the importance of striking a balance between circuit depth and accuracy in practical QSP implementation. This work addresses a key gap in understanding the scalability and limitations of QSP-based algorithms on quantum hardware, providing valuable insights for developing quantum algorithms as well as practically realizing quantum singular value transformation and data re-uploading quantum machine learning models.

DOI
10.48550/arxiv.2502.20199

Related papers

Ensemble-Based Quantum Signal Processing for Error Mitigation

Suying Liu, Yulong Dong, Dong An +1 more

Despite rapid advances in quantum hardware, noise remains a central obstacle to deploying quantum algorithms on near-term devices. In particular, random coherent errors that accumulate during circuit execution constitute a dominant and fundamentally challenging noise source. We introduce a noise-resilient framework for Quantum Signal Processing (QSP) that mitigates such coherent errors without increasing circuit depth or ancillary qubit requirements. Our approach uses ensembles of noisy QSP circuits combined with measurement-level averaging to suppress random phase errors in Z rotations. Building on this framework, we develop robust QSP algorithms for implementing polynomial functions of Hermitian matrices and for estimating observables, with applications to Hamiltonian simulation, quantum linear systems, and ground-state preparation. We analyze the trade-off between approximation error and hardware noise, which is essential for practical implementation under the stringent depth and coherence constraints of current quantum hardware. Our results establish a practical pathway for integrating error mitigation seamlessly into algorithmic design, advancing the development of robust quantum computing, and enabling the discovery of scientific applications with near- and mid-term quantum devices.

quant-pharXiv:2601.20073•Jan 29, 2026•0 citations

Exploring the experimental limit of deep quantum signal processing using a trapped-ion simulator

J.-T. Bu, Lei Zhang, Zhan Yu +12 more

Quantum signal processing (QSP), which enables systematic polynomial transformations on quantum data through sequences of qubit rotations, has emerged as a fundamental building block for quantum algorithms and data reuploading quantum neural networks. While recent experiments have demonstrated the feasibility of shallow QSP circuits, the inherent limitations in scaling QSP to achieve complex transformations on quantum hardware remain an open and critical question. Here we report the first experimental realization of deep QSP circuits in a trapped-ion quantum simulator. By manipulating the qubit encoded in a trapped ${}^{43}{\mathrm{Ca}}^{+}$ ion, we demonstrate high-precision simulation of some prominent functions used in quantum algorithms and machine learning, with circuit depths ranging from 15 to 360 layers and implementation times significantly longer than the coherence time of the qubit. Our results reveal a crucial trade-off between the precision of function simulation and the concomitant accumulation of hardware noise, highlighting the importance of striking a balance between circuit depth and accuracy in practical QSP implementation. This work addresses a key gap in understanding the scalability and limitations of QSP-based algorithms on quantum hardware, providing valuable insights for developing quantum algorithms as well as practically realizing quantum singular value transformation and data reuploading quantum machine learning models.

Physical Review Applied•Mar 25, 2025•2 citations

Realization of quantum signal processing on a noisy quantum computer

Yuta Kikuchi, Conor Mc Keever, Luuk Coopmans +2 more

Abstract Quantum signal processing (QSP) is a powerful toolbox for the design of quantum algorithms and can lead to asymptotically optimal computational costs. Its realization on noisy quantum computers without fault tolerance, however, is challenging because it requires a deep quantum circuit in general. We propose a strategy to run an entire QSP protocol on noisy quantum hardware by carefully reducing overhead costs at each step. To illustrate the approach, we consider the application of Hamiltonian simulation for which QSP implements a polynomial approximation of the time evolution operator. We test the protocol by running the algorithm on the Quantinuum H1-1 trapped-ion quantum computer powered by Honeywell. In particular, we compute the time dependence of bipartite entanglement entropies for Ising spin chains and find good agreements with exact numerical simulations. To make the best use of the device, we determine optimal experimental parameters by using a simplified error model for the hardware and numerically studying the trade-off between Hamiltonian simulation time, polynomial degree, and total accuracy. Our results are the first step in the experimental realization of QSP-based quantum algorithms.

arXiv:2303.05533•npj Quantum Information•Sep 23, 2023•41 citations

Realization of an ion trap quantum classifier

Tarun Dutta, Adrián Pérez-Salinas, Jasper Phua Sing Cheng +2 more

We report the realization of a versatile classifier based on the quantum mechanics of a single atom. The problem of classification has been extensively studied by the classical machine learning community, with plenty of proposed algorithms that have been refined over time. Quantum computation must necessarily develop quantum classifiers and benchmark them against their classical counterparts. It is not obvious how to make use of our increasing ability to precisely control and evolve a quantum state to solve this kind of problems, while there is only a limited number of strong theorems backing the quantum algorithms for classification. Here we show that both of these limitations can be successfully addressed by the implementation of a recently proposed data re-uploading algorithm in an ion trap based quantum processing unit. The quantum classifier is trained in two steps: first, the quantum circuit is fed with an optimal set of variational parameters found by classical simulation; then, the variational circuit is optimized by inspecting the parameter landscape with only the quantum processing unit. This second step provides a partial cancellation of the systematic errors inherent to the quantum device. The accuracy of our quantum supervised classifier is benchmarked on a variety of datasets, that imply, finding the separation of classes associated to regions in a plane in both binary and multi-class problems, as well as in higher-dimensional feature spaces. Our experiments show that a single-ion quantum classifier circuit made out of $k$ gates is as powerful as a neural network with one intermediate hidden layer of $k$ neurons.

•Jun 26, 2021•3 citations

Quantum Signal Processing: A New Frontier in Information Processing

A. Karthik, V Asha, Ginni Nijhawan +3 more

Quantum Signal Processing (QSP) emerges as a groundbreaking paradigm, exploiting the principles of quantum mechanics to revolutionize the analysis, manipulation, and interpretation of signals. This paper introduces a novel framework for QSP, delineating its theoretical foundations and potential to surpass classical signal processing capabilities. The research delves into the development of quantum algorithms that exhibit superior efficiency in the frequency domain analysis and the processing of temporally entangled signal structures. A pivotal aspect of this work is the introduction of quantum Fourier transforms as a mechanism to achieve exponential speed-ups in signal decomposition. Furthermore, the paper explores the implementation of quantum error correction techniques to enhance the robustness of signal processing in the presence of quantum noise and decoherence. The practicality of QSP is demonstrated through simulated quantum circuits, providing a blueprint for future quantum computing hardware applications. The implications of this research are profound, suggesting a transformative impact on fields ranging from secure communications to biomedical imaging. By harnessing the entanglement and superposition properties inherent to quantum systems, QSP is poised to redefine the limits of what is computationally feasible within information processing.

IEEE Uttar Pradesh Section International Conference on Electrical, Electronics and Computer Engineering (UPCON)•Dec 1, 2023•2 citations

Quantum Signal Processing for High-Dimensional Quantum Control and Precision Sensing

Jasmine Sinanan-Singh

Making sense of the world happens through receiving and processing signals, whether it be sound, light, or other waves that interact with us. The fields of nuclear magnetic resonance and digital signal processing each built a rigorous language for manipulating and extracting information from signals of particular types. Quantum signal processing (QSP) connects these two traditions, providing a unified algebraic framework for understanding how quantum systems are transformed by both classical and quantum signals. QSP provides a systematic framework for characterizing possible transformations. QSP was developed for qubit systems, but physical quantum systems are rarely two-level and the full richness of high-dimensional Hilbert spaces has remained largely unexplored. This thesis extends and applies QSP in two directions: from qubits to high-dimensional systems such as finite-level qudits and infinite-dimensional oscillators and from static signals to signals that include continuous-time noise processes. We will also show how QSP for qudits leads to novel experimental applications in trapped-ion systems. One type of high-dimensional system is a qubit coupled to an oscillator, and a qubit-oscillator qudit can be formed and universally controlled using only a limited set of interactions. In this qubit-oscillator space, a bosonic version of QSP allows novel incarnations of quantum algorithms and sensing. The quantum Fourier transform can be performed by clever conversion of information in a many-qubit system into a single oscillator, and an interferometric protocol uses binary decisions from a qubit to sense a signal affecting the oscillator. Another type of high-dimensional system is a qudit made from the electronic levels of an atom. This thesis presents a new construction of Grover’s algorithm using a qudit in an atomic hyperfine manifold, along with a calibration method that finds accurate QSP pulse parameters for the experiment. For decision algorithms, QSP in qudits enables theoretically perfect decision-making for quantum channel discrimination problems with certain symmetries. In the face of noise, temporal QSP is developed to extend the canonical framework to continuous-time stochastic noise. Combined with Kubo linear-response theory, a noise filter function description emerges which formalizes the optimization of atomic clock performance. These results from qudit, bosonic, and temporal QSP establish QSP as a natural language for high-dimensional quantum control and sensing.

•May 1, 2026•0 citations
Quantum signal processing (QSP), which enables systematic polynomial transformations on quantum data through sequences of qubit rotations, has emerged as a fundamental building block for quantum algorithms and data re-uploading quantum neural networks. While recent experiments have demonstrated the feasibility of shallow QSP circuits, the inherent limitations in scaling QSP to achieve complex transformations on quantum hardware remain an open and critical question. Here we report the first experimental realization of deep QSP circuits in a trapped-ion quantum simulator. By manipulating the qubit encoded in a trapped 43Ca+^{43}\textrm{Ca}^{+}43Ca+ ion, we demonstrate high-precision simulation of some prominent functions used in quantum algorithms and machine learning, with circuit depths ranging from 15 to 360 layers and implementation time significantly longer than coherence time of the qubit. Our results reveal a crucial trade-off between the precision of function simulation and the concomitant accumulation of hardware noise, highlighting the importance of striking a balance between circuit depth and accuracy in practical QSP implementation. This work addresses a key gap in understanding the scalability and limitations of QSP-based algorithms on quantum hardware, providing valuable insights for developing quantum algorithms as well as practically realizing quantum singular value transformation and data re-uploading quantum machine learning models.
Despite rapid advances in quantum hardware, noise remains a central obstacle to deploying quantum algorithms on near-term devices. In particular, random coherent errors that accumulate during circuit execution constitute a dominant and fundamentally challenging noise source. We introduce a noise-resilient framework for Quantum Signal Processing (QSP) that mitigates such coherent errors without increasing circuit depth or ancillary qubit requirements. Our approach uses ensembles of noisy QSP circuits combined with measurement-level averaging to suppress random phase errors in Z rotations. Building on this framework, we develop robust QSP algorithms for implementing polynomial functions of Hermitian matrices and for estimating observables, with applications to Hamiltonian simulation, quantum linear systems, and ground-state preparation. We analyze the trade-off between approximation error and hardware noise, which is essential for practical implementation under the stringent depth and coherence constraints of current quantum hardware. Our results establish a practical pathway for integrating error mitigation seamlessly into algorithmic design, advancing the development of robust quantum computing, and enabling the discovery of scientific applications with near- and mid-term quantum devices.
Quantum signal processing (QSP), which enables systematic polynomial transformations on quantum data through sequences of qubit rotations, has emerged as a fundamental building block for quantum algorithms and data reuploading quantum neural networks. While recent experiments have demonstrated the feasibility of shallow QSP circuits, the inherent limitations in scaling QSP to achieve complex transformations on quantum hardware remain an open and critical question. Here we report the first experimental realization of deep QSP circuits in a trapped-ion quantum simulator. By manipulating the qubit encoded in a trapped 43Ca+{}^{43}{\mathrm{Ca}}^{+}43Ca+ ion, we demonstrate high-precision simulation of some prominent functions used in quantum algorithms and machine learning, with circuit depths ranging from 15 to 360 layers and implementation times significantly longer than the coherence time of the qubit. Our results reveal a crucial trade-off between the precision of function simulation and the concomitant accumulation of hardware noise, highlighting the importance of striking a balance between circuit depth and accuracy in practical QSP implementation. This work addresses a key gap in understanding the scalability and limitations of QSP-based algorithms on quantum hardware, providing valuable insights for developing quantum algorithms as well as practically realizing quantum singular value transformation and data reuploading quantum machine learning models.
Abstract Quantum signal processing (QSP) is a powerful toolbox for the design of quantum algorithms and can lead to asymptotically optimal computational costs. Its realization on noisy quantum computers without fault tolerance, however, is challenging because it requires a deep quantum circuit in general. We propose a strategy to run an entire QSP protocol on noisy quantum hardware by carefully reducing overhead costs at each step. To illustrate the approach, we consider the application of Hamiltonian simulation for which QSP implements a polynomial approximation of the time evolution operator. We test the protocol by running the algorithm on the Quantinuum H1-1 trapped-ion quantum computer powered by Honeywell. In particular, we compute the time dependence of bipartite entanglement entropies for Ising spin chains and find good agreements with exact numerical simulations. To make the best use of the device, we determine optimal experimental parameters by using a simplified error model for the hardware and numerically studying the trade-off between Hamiltonian simulation time, polynomial degree, and total accuracy. Our results are the first step in the experimental realization of QSP-based quantum algorithms.
We report the realization of a versatile classifier based on the quantum mechanics of a single atom. The problem of classification has been extensively studied by the classical machine learning community, with plenty of proposed algorithms that have been refined over time. Quantum computation must necessarily develop quantum classifiers and benchmark them against their classical counterparts. It is not obvious how to make use of our increasing ability to precisely control and evolve a quantum state to solve this kind of problems, while there is only a limited number of strong theorems backing the quantum algorithms for classification. Here we show that both of these limitations can be successfully addressed by the implementation of a recently proposed data re-uploading algorithm in an ion trap based quantum processing unit. The quantum classifier is trained in two steps: first, the quantum circuit is fed with an optimal set of variational parameters found by classical simulation; then, the variational circuit is optimized by inspecting the parameter landscape with only the quantum processing unit. This second step provides a partial cancellation of the systematic errors inherent to the quantum device. The accuracy of our quantum supervised classifier is benchmarked on a variety of datasets, that imply, finding the separation of classes associated to regions in a plane in both binary and multi-class problems, as well as in higher-dimensional feature spaces. Our experiments show that a single-ion quantum classifier circuit made out of kkk gates is as powerful as a neural network with one intermediate hidden layer of kkk neurons.
Quantum Signal Processing (QSP) emerges as a groundbreaking paradigm, exploiting the principles of quantum mechanics to revolutionize the analysis, manipulation, and interpretation of signals. This paper introduces a novel framework for QSP, delineating its theoretical foundations and potential to surpass classical signal processing capabilities. The research delves into the development of quantum algorithms that exhibit superior efficiency in the frequency domain analysis and the processing of temporally entangled signal structures. A pivotal aspect of this work is the introduction of quantum Fourier transforms as a mechanism to achieve exponential speed-ups in signal decomposition. Furthermore, the paper explores the implementation of quantum error correction techniques to enhance the robustness of signal processing in the presence of quantum noise and decoherence. The practicality of QSP is demonstrated through simulated quantum circuits, providing a blueprint for future quantum computing hardware applications. The implications of this research are profound, suggesting a transformative impact on fields ranging from secure communications to biomedical imaging. By harnessing the entanglement and superposition properties inherent to quantum systems, QSP is poised to redefine the limits of what is computationally feasible within information processing.
Making sense of the world happens through receiving and processing signals, whether it be sound, light, or other waves that interact with us. The fields of nuclear magnetic resonance and digital signal processing each built a rigorous language for manipulating and extracting information from signals of particular types. Quantum signal processing (QSP) connects these two traditions, providing a unified algebraic framework for understanding how quantum systems are transformed by both classical and quantum signals. QSP provides a systematic framework for characterizing possible transformations. QSP was developed for qubit systems, but physical quantum systems are rarely two-level and the full richness of high-dimensional Hilbert spaces has remained largely unexplored. This thesis extends and applies QSP in two directions: from qubits to high-dimensional systems such as finite-level qudits and infinite-dimensional oscillators and from static signals to signals that include continuous-time noise processes. We will also show how QSP for qudits leads to novel experimental applications in trapped-ion systems. One type of high-dimensional system is a qubit coupled to an oscillator, and a qubit-oscillator qudit can be formed and universally controlled using only a limited set of interactions. In this qubit-oscillator space, a bosonic version of QSP allows novel incarnations of quantum algorithms and sensing. The quantum Fourier transform can be performed by clever conversion of information in a many-qubit system into a single oscillator, and an interferometric protocol uses binary decisions from a qubit to sense a signal affecting the oscillator. Another type of high-dimensional system is a qudit made from the electronic levels of an atom. This thesis presents a new construction of Grover’s algorithm using a qudit in an atomic hyperfine manifold, along with a calibration method that finds accurate QSP pulse parameters for the experiment. For decision algorithms, QSP in qudits enables theoretically perfect decision-making for quantum channel discrimination problems with certain symmetries. In the face of noise, temporal QSP is developed to extend the canonical framework to continuous-time stochastic noise. Combined with Kubo linear-response theory, a noise filter function description emerges which formalizes the optimization of atomic clock performance. These results from qudit, bosonic, and temporal QSP establish QSP as a natural language for high-dimensional quantum control and sensing.