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

Quantum signal processing by single-qubit dynamics

Guang Hao Low

Published Jan 1, 2017• 7 citations
OpenAlex

Abstract

Quantum computation is the most powerful realizable model of computation, and is uniquely positioned to solve specialized problems intractable to classical computers. This quantum advantage arises from directly exploiting the strangeness of quantum mechanics that is fundamental to reality. As such, one expects our understanding of quantum processes in physical systems to be indispensable to the design and execution of quantum algorithms. We present quantum signal processing, which exploits the dynamics of simple quantum systems to perform non-trivial computations. Such systems applied as computational modules in larger quantum algorithms, offer a natural physical alternative to standard tasks such as the calculation of elementary functions with integer arithmetic. The quantum advantage of this approach, based on simple physics, is of significant practical relevance. In cases, arbitrary bits of precision may be emulated using only constant space. Moreover, the simplicity and performance of quantum signal processing is such that it is the final missing ingredient for realizing a number of optimal quantum algorithms, particularly in Hamiltonian simulation. Quantum signal processing realizes a useful fusion of analog and digital models of quantum computation. At the physical level, we focus on how even a simple two-level system - the qubit, computes through optimal discrete-time quantum control. Whereas quantum control is typically used to synthesize unitary quantum gates, we solve the synthesis problem of unitary quantum functions with a fully characterization of achievable functions, and efficient techniques for their implementation. This furnishes a surprisingly rich framework in the analog model of quantum computation for computing functions. The generality of this model is realized by many applications, often with no modification, to quantum algorithms designed for digital quantum computers, in particular for matrix manipulation. In this manner, we solve a number of open problem related to optimal amplitude amplification algorithms, optimally computing on matrices with a quantum computer, and the simulation of physical systems.

Related papers

Analytic Approach to Quantum Control Using Quantum Signal Processing

Aishwarya Majumdar, John M. Martyn, Yuan Liu +1 more

Realizing coherent quantum computation requires precise and robust manipulation of quantum systems through quantum control protocols. Most quantum control techniques rely on heuristic methods for designing the driving pulses that steer the system towards a target state. Such methods are often based on brute-force optimization and offer limited understanding of the solution landscape. In contrast, quantum algorithms offer a rich body of analytical methods with rigorous error guarantees for implementing unitary and non-unitary transformations, which suggests a promising direction for developing new approaches to quantum control. Among various such algorithms, quantum signal processing (QSP) has emerged as a powerful framework for quantum algorithm design, implementation, and optimization. However, its potential for quantum control remains largely unexplored. In this work, we establish QSP-Control, an analytical framework for quantum control of qubit-oscillator dynamics. We focus on dispersively coupled qubit-oscillator systems and employ the QSP formalism to mitigate unwanted nonlinear effects arising from cross-Kerr interactions. In addition, we develop constructions for precise manipulation of Fock states by designing Fock-state-selective operators, based on structural parallels between the Jaynes-Cummings interaction and QSP. These findings demonstrate how several practically relevant problems in quantum control can be mapped to forms amenable to QSP, offering both a systematic design framework and an interpretable perspective on quantum control.

quant-pharXiv:2606.26085•Jun 25, 2026•3 citations

Optimal Hamiltonian Simulation by Quantum Signal Processing

Guang Hao Low, Isaac L. Chuang

The physics of quantum mechanics is the inspiration for, and underlies, quantum computation. As such, one expects physical intuition to be highly influential in the understanding and design of many quantum algorithms, particularly simulation of physical systems. Surprisingly, this has been challenging, with current Hamiltonian simulation algorithms remaining abstract and often the result of sophisticated but unintuitive constructions. We contend that physical intuition can lead to optimal simulation methods by showing that a focus on simple single-qubit rotations elegantly furnishes an optimal algorithm for Hamiltonian simulation, a universal problem that encapsulates all the power of quantum computation. Specifically, we show that the query complexity of implementing time evolution by a d-sparse Hamiltonian H[over ^] for time-interval t with error ε is O[td∥H[over ^]∥_{max}+log(1/ε)/loglog(1/ε)], which matches lower bounds in all parameters. This connection is made through general three-step "quantum signal processing" methodology, comprised of (i) transducing eigenvalues of H[over ^] into a single ancilla qubit, (ii) transforming these eigenvalues through an optimal-length sequence of single-qubit rotations, and (iii) projecting this ancilla with near unity success probability.

arXiv:1606.02685•Physical Review Letters•Jan 5, 2017•970 citations

Classical Computation in the Quantum World

Jiachen Huang

Quantum computation is by far the most powerful computational model allowed by the laws of physics. By carefully manipulating microscopic systems governed by quantum mechanics, one can efficiently solve computational problems that may be classically intractable; on the contrary, such speed-ups are rarely possible without the help of classical computation, since most quantum algorithms heavily rely on subroutines that are purely classical. A better understanding of the relationship between classical and quantum computation is indispensable, in particular in an era where the first quantum device exceeding classical computational power is within reach. In the first part of the thesis, we study some differences between classical and quantum computation. We first show that quantum cryptographic hashing is maximally resilient against classical leakage, a property beyond reach for any classical hash function. Next, we consider the limitation of strong (amplitude-wise) simulation of quantum computation. We prove an unconditional and explicit complexity lower bound for a category of simulations called monotone strong simulation and further prove conditional complexity lower bounds for general strong simulation techniques. Both results indicate that strong simulation is fundamentally unscalable. In the second part of the thesis, we propose classical algorithms that facilitate quantum computing. We propose a new classical algorithm for the synthesis of a quantum algorithm paradigm called quantum signal processing. Empirically, our algorithm demonstrates numerical stability and acceleration of more than one magnitude compared to state-of-the-art algorithms. Finally, we propose a randomized algorithm for transversally switching between arbitrary stabilizer quantum error-correcting codes. It has the property of preserving the code distance and thus might prove useful for designing fault-tolerant code-switching schemes.

•Jan 1, 2019•0 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

Efficient fully-coherent quantum signal processing algorithms for real-time dynamics simulation

John M. Martyn, Yuan Liu, Zachary E. Chin +1 more

Simulating the unitary dynamics of a quantum system is a fundamental problem of quantum mechanics, in which quantum computers are believed to have significant advantage over their classical counterparts. One prominent such instance is the simulation of electronic dynamics, which plays an essential role in chemical reactions, non-equilibrium dynamics, and material design. These systems are time-dependent, which requires that the corresponding simulation algorithm can be successfully concatenated with itself over different time intervals to reproduce the overall coherent quantum dynamics of the system. In this paper, we quantify such simulation algorithms by the property of being fully-coherent: the algorithm succeeds with arbitrarily high success probability 1 − δ while only requiring a single copy of the initial state. We subsequently develop fully-coherent simulation algorithms based on quantum signal processing (QSP), including a novel algorithm that circumvents the use of amplitude amplification while also achieving a query complexity additive in time t, ln(1/δ), and ln(1/ϵ) for error tolerance ϵ: Θ‖H‖|t|+ln(1/ϵ)+ln(1/δ). Furthermore, we numerically analyze these algorithms by applying them to the simulation of the spin dynamics of the Heisenberg model and the correlated electronic dynamics of an H2 molecule. Since any electronic Hamiltonian can be mapped to a spin Hamiltonian, our algorithm can efficiently simulate time-dependent ab initio electronic dynamics in the circuit model of quantum computation. Accordingly, it is also our hope that the present work serves as a bridge between QSP-based quantum algorithms and chemical dynamics, stimulating a cross-fertilization between these exciting fields.

arXiv:2110.11327•The Journal of Chemical Physics•Jan 10, 2023•68 citations

Quantum signal processing with the one-dimensional quantum Ising model

V. M. Bastidas, Sina Zeytinoǧlu, Zane M. Rossi +2 more

Quantum signal processing (QSP) has emerged as a promising framework to manipulate and determine properties of quantum systems. QSP not only unifies most existing quantum algorithms but also provides tools to discover new ones. Quantum signal processing is applicable to single-qubit or multiqubit systems that can be ``qubitized'' so one can exploit the SU(2) structure of system evolution within special invariant two-dimensional subspaces. In the context of quantum algorithms, this SU(2) structure is artificially imposed on the system through highly nonlocal evolution operators that are difficult to implement on near-term quantum devices. In this work, we propose QSP protocols for the infinite-dimensional Onsager Lie algebra, which is relevant to the physical dynamics of quantum devices that can simulate the transverse-field Ising model. To this end, we consider QSP sequences in the Heisenberg picture, allowing us to exploit the emergent SU(2) structure in momentum space and ``synthesize'' QSP sequences for the Onsager algebra. Our results demonstrate a concrete connection between QSP techniques and noisy intermediate scale quantum protocols. We provide examples and applications of our approach in diverse fields ranging from space-time dual quantum circuits and quantum simulation to quantum control.

arXiv:2309.04538•Physical review. B./Physical review. B•Jan 10, 2024•1 citation
Quantum computation is the most powerful realizable model of computation, and is uniquely positioned to solve specialized problems intractable to classical computers. This quantum advantage arises from directly exploiting the strangeness of quantum mechanics that is fundamental to reality. As such, one expects our understanding of quantum processes in physical systems to be indispensable to the design and execution of quantum algorithms. We present quantum signal processing, which exploits the dynamics of simple quantum systems to perform non-trivial computations. Such systems applied as computational modules in larger quantum algorithms, offer a natural physical alternative to standard tasks such as the calculation of elementary functions with integer arithmetic. The quantum advantage of this approach, based on simple physics, is of significant practical relevance. In cases, arbitrary bits of precision may be emulated using only constant space. Moreover, the simplicity and performance of quantum signal processing is such that it is the final missing ingredient for realizing a number of optimal quantum algorithms, particularly in Hamiltonian simulation. Quantum signal processing realizes a useful fusion of analog and digital models of quantum computation. At the physical level, we focus on how even a simple two-level system - the qubit, computes through optimal discrete-time quantum control. Whereas quantum control is typically used to synthesize unitary quantum gates, we solve the synthesis problem of unitary quantum functions with a fully characterization of achievable functions, and efficient techniques for their implementation. This furnishes a surprisingly rich framework in the analog model of quantum computation for computing functions. The generality of this model is realized by many applications, often with no modification, to quantum algorithms designed for digital quantum computers, in particular for matrix manipulation. In this manner, we solve a number of open problem related to optimal amplitude amplification algorithms, optimally computing on matrices with a quantum computer, and the simulation of physical systems.
Realizing coherent quantum computation requires precise and robust manipulation of quantum systems through quantum control protocols. Most quantum control techniques rely on heuristic methods for designing the driving pulses that steer the system towards a target state. Such methods are often based on brute-force optimization and offer limited understanding of the solution landscape. In contrast, quantum algorithms offer a rich body of analytical methods with rigorous error guarantees for implementing unitary and non-unitary transformations, which suggests a promising direction for developing new approaches to quantum control. Among various such algorithms, quantum signal processing (QSP) has emerged as a powerful framework for quantum algorithm design, implementation, and optimization. However, its potential for quantum control remains largely unexplored. In this work, we establish QSP-Control, an analytical framework for quantum control of qubit-oscillator dynamics. We focus on dispersively coupled qubit-oscillator systems and employ the QSP formalism to mitigate unwanted nonlinear effects arising from cross-Kerr interactions. In addition, we develop constructions for precise manipulation of Fock states by designing Fock-state-selective operators, based on structural parallels between the Jaynes-Cummings interaction and QSP. These findings demonstrate how several practically relevant problems in quantum control can be mapped to forms amenable to QSP, offering both a systematic design framework and an interpretable perspective on quantum control.
The physics of quantum mechanics is the inspiration for, and underlies, quantum computation. As such, one expects physical intuition to be highly influential in the understanding and design of many quantum algorithms, particularly simulation of physical systems. Surprisingly, this has been challenging, with current Hamiltonian simulation algorithms remaining abstract and often the result of sophisticated but unintuitive constructions. We contend that physical intuition can lead to optimal simulation methods by showing that a focus on simple single-qubit rotations elegantly furnishes an optimal algorithm for Hamiltonian simulation, a universal problem that encapsulates all the power of quantum computation. Specifically, we show that the query complexity of implementing time evolution by a d-sparse Hamiltonian H[over ^] for time-interval t with error ε is O[td∥H[over ^]∥_{max}+log(1/ε)/loglog(1/ε)], which matches lower bounds in all parameters. This connection is made through general three-step "quantum signal processing" methodology, comprised of (i) transducing eigenvalues of H[over ^] into a single ancilla qubit, (ii) transforming these eigenvalues through an optimal-length sequence of single-qubit rotations, and (iii) projecting this ancilla with near unity success probability.
Quantum computation is by far the most powerful computational model allowed by the laws of physics. By carefully manipulating microscopic systems governed by quantum mechanics, one can efficiently solve computational problems that may be classically intractable; on the contrary, such speed-ups are rarely possible without the help of classical computation, since most quantum algorithms heavily rely on subroutines that are purely classical. A better understanding of the relationship between classical and quantum computation is indispensable, in particular in an era where the first quantum device exceeding classical computational power is within reach. In the first part of the thesis, we study some differences between classical and quantum computation. We first show that quantum cryptographic hashing is maximally resilient against classical leakage, a property beyond reach for any classical hash function. Next, we consider the limitation of strong (amplitude-wise) simulation of quantum computation. We prove an unconditional and explicit complexity lower bound for a category of simulations called monotone strong simulation and further prove conditional complexity lower bounds for general strong simulation techniques. Both results indicate that strong simulation is fundamentally unscalable. In the second part of the thesis, we propose classical algorithms that facilitate quantum computing. We propose a new classical algorithm for the synthesis of a quantum algorithm paradigm called quantum signal processing. Empirically, our algorithm demonstrates numerical stability and acceleration of more than one magnitude compared to state-of-the-art algorithms. Finally, we propose a randomized algorithm for transversally switching between arbitrary stabilizer quantum error-correcting codes. It has the property of preserving the code distance and thus might prove useful for designing fault-tolerant code-switching schemes.
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.
Simulating the unitary dynamics of a quantum system is a fundamental problem of quantum mechanics, in which quantum computers are believed to have significant advantage over their classical counterparts. One prominent such instance is the simulation of electronic dynamics, which plays an essential role in chemical reactions, non-equilibrium dynamics, and material design. These systems are time-dependent, which requires that the corresponding simulation algorithm can be successfully concatenated with itself over different time intervals to reproduce the overall coherent quantum dynamics of the system. In this paper, we quantify such simulation algorithms by the property of being fully-coherent: the algorithm succeeds with arbitrarily high success probability 1 − δ while only requiring a single copy of the initial state. We subsequently develop fully-coherent simulation algorithms based on quantum signal processing (QSP), including a novel algorithm that circumvents the use of amplitude amplification while also achieving a query complexity additive in time t, ln(1/δ), and ln(1/ϵ) for error tolerance ϵ: Θ‖H‖|t|+ln(1/ϵ)+ln(1/δ). Furthermore, we numerically analyze these algorithms by applying them to the simulation of the spin dynamics of the Heisenberg model and the correlated electronic dynamics of an H2 molecule. Since any electronic Hamiltonian can be mapped to a spin Hamiltonian, our algorithm can efficiently simulate time-dependent ab initio electronic dynamics in the circuit model of quantum computation. Accordingly, it is also our hope that the present work serves as a bridge between QSP-based quantum algorithms and chemical dynamics, stimulating a cross-fertilization between these exciting fields.
Quantum signal processing (QSP) has emerged as a promising framework to manipulate and determine properties of quantum systems. QSP not only unifies most existing quantum algorithms but also provides tools to discover new ones. Quantum signal processing is applicable to single-qubit or multiqubit systems that can be ``qubitized'' so one can exploit the SU(2) structure of system evolution within special invariant two-dimensional subspaces. In the context of quantum algorithms, this SU(2) structure is artificially imposed on the system through highly nonlocal evolution operators that are difficult to implement on near-term quantum devices. In this work, we propose QSP protocols for the infinite-dimensional Onsager Lie algebra, which is relevant to the physical dynamics of quantum devices that can simulate the transverse-field Ising model. To this end, we consider QSP sequences in the Heisenberg picture, allowing us to exploit the emergent SU(2) structure in momentum space and ``synthesize'' QSP sequences for the Onsager algebra. Our results demonstrate a concrete connection between QSP techniques and noisy intermediate scale quantum protocols. We provide examples and applications of our approach in diverse fields ranging from space-time dual quantum circuits and quantum simulation to quantum control.