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

Elsevier eBooks

Unitary fractional-order derivative operators for quantum computation

Barış Baykant Alagöz, Serkan Alagöz

Published Jan 1, 2022• 0 citations
Publisher
DOI
10.1016/b978-0-32-390090-4.00016-0

Related papers

Quantum Pseudo-fractional Fourier Transform and its application to quantum phase estimation

Vamsi Parasa, Kumar Eswaran

- In this paper we present a method to compute the coefficients of the fractional Fourier transform (FrFT) on a quantum computer using quantum gates of polynomial complexity of the order O(n^3). The FrFt, a generalization of the DFT, has wide applications in signal processing and is particularly useful to implement the Pseudopolar and Radon transforms. Even though the FrFT is a non-unitary operation, to develop its quantum counterpart, we develop a unitary operator called the quantum Pseudo-fraction Fourier Transform (QPFrFT) in a higher-dimensional Hilbert space, in order to computer the coefficients of the FrFT. In this process we develop a unitary operator denoted U by which is an essential step to implement the QPFrFT. We then show the application of the operator U in the problem of quantum phase estimation.

arXiv:0906.1033•FCS•Jun 5, 2009•2 citations

On Fractional Order Quantum Mechanics

E. Ahmed

•Jan 1, 2009•8 citations

Dyadic-Order Quantum Fractional Transforms: Circuit Constructions and Applications to Hartley and Cosine Transform Families

Matheus J. A. Oliveira, Israel F. Araujo, José R. de Oliveira Neto +1 more

This paper presents a generalized circuit framework for constructing Shih-type fractionalizations of unitary operators of dyadic order, i.e., operators $U$ satisfying $U^{2^n}=I$. Building upon the architecture of the quantum fractional Fourier transform (QFrFT), we show that fractionalization can be implemented coherently as a weighted superposition of integer powers, $\sum_k c_k(α)U^k$, where the coefficients are generated through an ancilla-domain quantum Fourier transform and a diagonal phase modulation. Under the assumption that controlled implementations of the required powers of $U$ are available, the resulting circuit yields a parameterized family of operators that interpolates the integer powers of $U$ and satisfies the additive property of fractional transforms. As concrete applications, we derive explicit quantum circuit realizations of the quantum fractional Hartley transform (QFrHT) and of the fractional cosine-transform families associated with Types~I and~IV. These constructions demonstrate the versatility of the proposed dyadic-order fractionalization framework for structured operators arising in quantum signal processing.

quant-pharXiv:2604.09295•Apr 13, 2026•0 citations

Quantum Differential Operators

Josef Janyška, Marco Modugno

Fundamental theories of physics•Jan 1, 2022•0 citations

From fractional Fourier transformation to quantum mechanical fractional squeezing transformation

Cui-hong Lv, Hong-Yi Fan, Dongwei Li

By converting the triangular functions in the integration kernel of the fractional Fourier transformation to the hyperbolic function, i.e., tan α → tanh α , sin α → sinh α , we find the quantum mechanical fractional squeezing transformation (FrST) which satisfies additivity. By virtue of the integration technique within the ordered product of operators (IWOP) we derive the unitary operator responsible for the FrST, which is composite and is made of e i πa † a /2 and exp . The FrST may be implemented in combinations of quadratic nonlinear crystals with different phase mismatches.

Chinese Physics B•Feb 1, 2015•11 citations

Quantum algorithms for distinguishing unitary operators

Shanu, Debajyoti Bera

•Jul 1, 2018•0 citations
- In this paper we present a method to compute the coefficients of the fractional Fourier transform (FrFT) on a quantum computer using quantum gates of polynomial complexity of the order O(n^3). The FrFt, a generalization of the DFT, has wide applications in signal processing and is particularly useful to implement the Pseudopolar and Radon transforms. Even though the FrFT is a non-unitary operation, to develop its quantum counterpart, we develop a unitary operator called the quantum Pseudo-fraction Fourier Transform (QPFrFT) in a higher-dimensional Hilbert space, in order to computer the coefficients of the FrFT. In this process we develop a unitary operator denoted U by which is an essential step to implement the QPFrFT. We then show the application of the operator U in the problem of quantum phase estimation.
This paper presents a generalized circuit framework for constructing Shih-type fractionalizations of unitary operators of dyadic order, i.e., operators UUU satisfying U2n=IU^{2^n}=IU2n=I. Building upon the architecture of the quantum fractional Fourier transform (QFrFT), we show that fractionalization can be implemented coherently as a weighted superposition of integer powers, ∑kck(α)Uk\sum_k c_k(α)U^k∑k​ck​(α)Uk, where the coefficients are generated through an ancilla-domain quantum Fourier transform and a diagonal phase modulation. Under the assumption that controlled implementations of the required powers of UUU are available, the resulting circuit yields a parameterized family of operators that interpolates the integer powers of UUU and satisfies the additive property of fractional transforms. As concrete applications, we derive explicit quantum circuit realizations of the quantum fractional Hartley transform (QFrHT) and of the fractional cosine-transform families associated with Types~I and~IV. These constructions demonstrate the versatility of the proposed dyadic-order fractionalization framework for structured operators arising in quantum signal processing.
By converting the triangular functions in the integration kernel of the fractional Fourier transformation to the hyperbolic function, i.e., tan α → tanh α , sin α → sinh α , we find the quantum mechanical fractional squeezing transformation (FrST) which satisfies additivity. By virtue of the integration technique within the ordered product of operators (IWOP) we derive the unitary operator responsible for the FrST, which is composite and is made of e i πa † a /2 and exp . The FrST may be implemented in combinations of quadratic nonlinear crystals with different phase mismatches.