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

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Conference on Quantum Computing and Engineering (QCE)

Quantum Algorithm for Searching Resonant Frequency Based on Frequency Response Encoding

Kyoung Keun Park, Beomgeun Cho, Kwangyeul Choi, Taehyun Kim

Published Sep 15, 2024• 0 citations
Publisher

Abstract

Frequency response and resonant frequency are crucial aspects of system analysis and design. Quantum computers offer efficient algorithms for solving linear differential equations and performing discrete Fourier transforms. This paper introduces a quantum algorithm that encodes the quantum frequency response state to represent a system's frequency response. We also propose a condition to probabilistically determine resonant frequency of the system with higher-order derivatives. This condition has been validated through computer simulations.

DOI
10.1109/qce60285.2024.10336

Related papers

High-order quantum algorithm for solving linear differential equations

Dominic William Berry

Linear differential equations are ubiquitous in science and engineering. Quantum computers can simulate quantum systems, which are described by a restricted type of linear differential equations. Here we extend quantum simulation algorithms to general inhomogeneous sparse linear differential equations, which describe many classical physical systems. We examine the use of high-order methods to improve the efficiency. These provide scaling close to $Δt^2$ in the evolution time $Δt$. As with other algorithms of this type, the solution is encoded in amplitudes of the quantum state, and it is possible to extract global features of the solution.

arXiv:1010.2745•Journal of Physics A Mathematical and Theoretical•Feb 19, 2014•355 citations

Quantum State Resonance Control and Modulation

Jincheng Zhang

Quantum state resonance control and modulation is a burgeoning field within quantum information science, offering unprecedented opportunities for manipulating and encoding quantum information. This paper explores the application of quantum state resonance control to achieve highly efficient quantum state manipulation. We propose a novel algorithm based on the non-linear properties of quantum states, specifically designed to precisely control the resonant frequencies and amplitudes of quantum systems. The core of this approach involves a self-adaptive resonance mechanism, allowing for dynamic optimization of the quantum state. We demonstrate the effectiveness of this method through simulations and preliminary experimental validation, revealing the potential for significant advancements in quantum information processing and encoding. The proposed approach represents a fundamental shift in how we approach quantum control, paving the way for new quantum information modalities.

•Sep 4, 2026•0 citations

Solving wave propagation problems via geometric quantum state preparation on dispersion manifolds

Yakov Solomons, Lee Peleg, Netanel Barel +3 more

We present a quantum algorithm for solving partial differential equations through a linear-system formulation, focusing on wave propagation problems described by the discretized Helmholtz equation in frequency domain. Although quantum linear-system solvers offer exponential compression of the system degrees of freedom, their runtime complexity is generally governed by the condition number of the discretized operator. Exploiting the analytic structure of the differential operator can provide an alternative to explicit matrix inversion, as illustrated for the screened Poisson equation through an explicit quantum circuit. For the Helmholtz equation, however, the inverse operator becomes singular on the dispersion surface $k^2=ω^2/c^2$, rendering direct Fourier-space state-preparation methods exponentially inefficient. We address this challenge by directly preparing quantum states supported on the resonant manifold and encoding source locations through Fourier phases. The resulting algorithm eliminates the exponentially large overhead associated with post-selection on the resonant manifold, yielding a success probability that depends linearly on the number of sources and is independent of the computational domain size. More generally, our approach applies to hyperbolic differential equations whose Fourier-space solutions possess singular support on dispersion manifolds, recasting their solution as a problem of geometric quantum state preparation.

quant-pharXiv:2609.10282•Sep 10, 2026•0 citations

Algorithmic Quantum Resonance

Jincheng Zhang

This paper explores the potential of utilizing resonant frequencies within quantum systems to accelerate complex calculations and dramatically reduce computational cost. We propose a novel quantum algorithm, 'Resonance Mapping,' that leverages a unique 'resonance mapping' technique based on quantum wave functions to identify and amplify these frequencies. The goal is to develop a method that significantly speeds up calculations compared to classical approaches, offering a fundamental shift in how complex problems are tackled within the quantum realm. The paper details the core mechanism, its potential benefits, and the preliminary design of the algorithm, demonstrating the feasibility of this approach through theoretical analysis and a simplified conceptual model. We anticipate that this algorithm will unlock new possibilities in quantum simulation, optimization, and data analysis.

•Sep 5, 2026•0 citations

Quantum frequency resampling

Emanuele Tumbiolo, Simone Roncallo, Chiara Macchiavello +1 more

Abstract In signal processing, resampling algorithms can modify the number of resources encoding a collection of data points. Downsampling reduces the cost of storage and communication, while upsampling interpolates new data from limited one, e.g., when resizing a digital image. We present a toolset of quantum algorithms to resample data encoded in the probabilities of a quantum register, using the quantum Fourier transform to adjust the number of high-frequency encoding qubits. We discuss advantage over classical resampling algorithms.

arXiv:2501.16283•npj Quantum Information•Jul 25, 2025•1 citation

Quantum algorithm for solving differential equations using SLAC derivatives

Rakshit M. Gharat, Gopikrishnan Muraleedharan, Dominic W. Berry +1 more

In numerical approaches to solving differential equations on a lattice, a representation of the derivative operator that correctly matches the continuum behaviour of functions of momentum up to the band limit must be non-local. We present the construction of efficient linear-combination-of-unitaries ($\mathrm{LCU}$)-based block-encodings for the first-order derivative and Laplacian operators in the non-local \(N=2^n\)-dimensional SLAC representation. We use state-preparation techniques designed for smoothly decaying functions to prepare the dense $\mathrm{LCU}$ amplitudes with high success probability and low gate cost. Furthermore, we demonstrate how Shannon wavelet transforms can be applied to these block-encodings to obtain multiscale representations of the SLAC derivative operators. We then show how to apply a diagonal preconditioner that reduces the condition number of these matrices in the multiscale wavelet basis to a small constant. This enables the solution of partial differential equations (PDEs) with SLAC-discretised derivative operators on a finite lattice using the quantum linear solving algorithm ($\mathrm{QLSA}$). For a $d$-dimensional PDE, after projection away from the nullspace, the resulting quantum linear-system algorithm has overall gate complexity ${O}(dn^3α^{(k)}\log(1/\varepsilon))$, where $α^{(k)}$ is the subnormalisation factor of the order-$k$ SLAC block-encoding and $\varepsilon$ denotes the algorithmic approximation error.

quant-pharXiv:2605.04861•May 7, 2026•3 citations
Frequency response and resonant frequency are crucial aspects of system analysis and design. Quantum computers offer efficient algorithms for solving linear differential equations and performing discrete Fourier transforms. This paper introduces a quantum algorithm that encodes the quantum frequency response state to represent a system's frequency response. We also propose a condition to probabilistically determine resonant frequency of the system with higher-order derivatives. This condition has been validated through computer simulations.
Linear differential equations are ubiquitous in science and engineering. Quantum computers can simulate quantum systems, which are described by a restricted type of linear differential equations. Here we extend quantum simulation algorithms to general inhomogeneous sparse linear differential equations, which describe many classical physical systems. We examine the use of high-order methods to improve the efficiency. These provide scaling close to Δt2Δt^2Δt2 in the evolution time ΔtΔtΔt. As with other algorithms of this type, the solution is encoded in amplitudes of the quantum state, and it is possible to extract global features of the solution.
Quantum state resonance control and modulation is a burgeoning field within quantum information science, offering unprecedented opportunities for manipulating and encoding quantum information. This paper explores the application of quantum state resonance control to achieve highly efficient quantum state manipulation. We propose a novel algorithm based on the non-linear properties of quantum states, specifically designed to precisely control the resonant frequencies and amplitudes of quantum systems. The core of this approach involves a self-adaptive resonance mechanism, allowing for dynamic optimization of the quantum state. We demonstrate the effectiveness of this method through simulations and preliminary experimental validation, revealing the potential for significant advancements in quantum information processing and encoding. The proposed approach represents a fundamental shift in how we approach quantum control, paving the way for new quantum information modalities.
We present a quantum algorithm for solving partial differential equations through a linear-system formulation, focusing on wave propagation problems described by the discretized Helmholtz equation in frequency domain. Although quantum linear-system solvers offer exponential compression of the system degrees of freedom, their runtime complexity is generally governed by the condition number of the discretized operator. Exploiting the analytic structure of the differential operator can provide an alternative to explicit matrix inversion, as illustrated for the screened Poisson equation through an explicit quantum circuit. For the Helmholtz equation, however, the inverse operator becomes singular on the dispersion surface k2=ω2/c2k^2=ω^2/c^2k2=ω2/c2, rendering direct Fourier-space state-preparation methods exponentially inefficient. We address this challenge by directly preparing quantum states supported on the resonant manifold and encoding source locations through Fourier phases. The resulting algorithm eliminates the exponentially large overhead associated with post-selection on the resonant manifold, yielding a success probability that depends linearly on the number of sources and is independent of the computational domain size. More generally, our approach applies to hyperbolic differential equations whose Fourier-space solutions possess singular support on dispersion manifolds, recasting their solution as a problem of geometric quantum state preparation.
This paper explores the potential of utilizing resonant frequencies within quantum systems to accelerate complex calculations and dramatically reduce computational cost. We propose a novel quantum algorithm, 'Resonance Mapping,' that leverages a unique 'resonance mapping' technique based on quantum wave functions to identify and amplify these frequencies. The goal is to develop a method that significantly speeds up calculations compared to classical approaches, offering a fundamental shift in how complex problems are tackled within the quantum realm. The paper details the core mechanism, its potential benefits, and the preliminary design of the algorithm, demonstrating the feasibility of this approach through theoretical analysis and a simplified conceptual model. We anticipate that this algorithm will unlock new possibilities in quantum simulation, optimization, and data analysis.
Abstract In signal processing, resampling algorithms can modify the number of resources encoding a collection of data points. Downsampling reduces the cost of storage and communication, while upsampling interpolates new data from limited one, e.g., when resizing a digital image. We present a toolset of quantum algorithms to resample data encoded in the probabilities of a quantum register, using the quantum Fourier transform to adjust the number of high-frequency encoding qubits. We discuss advantage over classical resampling algorithms.
In numerical approaches to solving differential equations on a lattice, a representation of the derivative operator that correctly matches the continuum behaviour of functions of momentum up to the band limit must be non-local. We present the construction of efficient linear-combination-of-unitaries (LCU\mathrm{LCU}LCU)-based block-encodings for the first-order derivative and Laplacian operators in the non-local N=2nN=2^nN=2n-dimensional SLAC representation. We use state-preparation techniques designed for smoothly decaying functions to prepare the dense LCU\mathrm{LCU}LCU amplitudes with high success probability and low gate cost. Furthermore, we demonstrate how Shannon wavelet transforms can be applied to these block-encodings to obtain multiscale representations of the SLAC derivative operators. We then show how to apply a diagonal preconditioner that reduces the condition number of these matrices in the multiscale wavelet basis to a small constant. This enables the solution of partial differential equations (PDEs) with SLAC-discretised derivative operators on a finite lattice using the quantum linear solving algorithm (QLSA\mathrm{QLSA}QLSA). For a ddd-dimensional PDE, after projection away from the nullspace, the resulting quantum linear-system algorithm has overall gate complexity O(dn3α(k)log⁡(1/ε)){O}(dn^3α^{(k)}\log(1/\varepsilon))O(dn3α(k)log(1/ε)), where α(k)α^{(k)}α(k) is the subnormalisation factor of the order-kkk SLAC block-encoding and ε\varepsilonε denotes the algorithmic approximation error.