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

• URL: http://arxiv.org/abs/2604.09295v1
• Date: Fri, 10 Apr 2026 13:04:55 GMT
• Title: Dyadic-Order Quantum Fractional Transforms: Circuit Constructions and Applications to Hartley and Cosine Transform Families
• Abstract summary: We show that fractionalization can be implemented coherently as a weighted superposition of integer powers, $sum_k c_k()Uk$.<n>We derive explicit quantum circuit realizations of the quantum fractional Hartley transform (QFrHT) and of the fractional cosine-transform families associated with TypesI andIV.
• Score: 0.8283026597815732
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Quantum algorithms for second-order boundary value problems [0.0]
  We introduce a framework for explicitly constructing finite-dimensional counterparts of continuous differential operators in a form compatible with quantum computation.<n>We derive discrete realizations of second-order operators on primal--dual cell complexes and reformulate them as star-local update rules.<n>This yields simple, uniform, and scalable quantum circuits.
  arXiv  Detail & Related papers  (2026-07-13T11:17:35Z)
• Revisiting Padded Transformer Expressivity: Which Architectural Choices Matter and Which Don't [78.36679389968772]
  We find that padded $textL$ constantprecision transformers are surprisingly robust to expressivity.<n>$logd-looped constant-precision transformers reach $textFO-uniform TCd$, and growing-precision ones reach $textFO-uniform TCd$.
  arXiv  Detail & Related papers  (2026-05-28T19:58:43Z)
• Higher-order transformations of bidirectional quantum processes [37.129018407842445]
  Bidirectional devices are devices for which the roles of the input and output ports can be exchanged.<n>Recently, it has been shown that quantum devices can, in principle, be used in ways that are incompatible with a definite input-output direction.
  arXiv  Detail & Related papers  (2026-01-31T18:39:36Z)
• Transmutation based Quantum Simulation for Non-unitary Dynamics [35.35971148847751]
  We present a quantum algorithm for simulating dissipative diffusion dynamics generated by positive semidefinite operators of the form $A=Ldagger L$.<n>Our main tool is the Kannai transform, which represents the diffusion semigroup $e-TA$ as a Gaussian-weighted superposition of unitary wave propagators.
  arXiv  Detail & Related papers  (2026-01-07T05:47:22Z)
• On the Feasibility of Exact Unitary Transformations for Many-body Hamiltonians [2.7522708287669495]
  We show that exact unitary transformations arise whenever the adjoint action of a unitary's generator defines a linear map within a finite-dimensional operator space.<n>This perspective brings together previously disparate examples of exact transformations under a single unifying principle.<n>We illustrate this framework for unitary coupled-cluster and involutory generators, identifying cases in which a single commutator suffices.
  arXiv  Detail & Related papers  (2025-10-13T03:09:43Z)
• Explicit Quantum Circuits for Simulating Linear Differential Equations via Dilation [0.0]
  We present a concrete pipeline that connects the dilation formalism with explicit quantum circuit constructions.<n>On the analytical side, we introduce a discretization of the continuous dilation operator that is tailored for quantum implementation.<n>We prove that the resulting scheme achieves a global error bound of order $O(M-3/2)$, up to exponentially small boundary effects.
  arXiv  Detail & Related papers  (2025-09-20T18:54:49Z)
• The Counting Power of Transformers [45.96383652484399]
  We provide a formal framework for investigating the counting power of transformers.<n>Our main result is that transformers can express counting properties that are highly nonlinear.<n>More precisely, we prove that transformers can capture all semialgebraic counting properties.
  arXiv  Detail & Related papers  (2025-05-16T12:56:59Z)
• A Novel Finite Fractional Fourier Transform and its Quantum Circuit Implementation on Qudits [0.0]
  We present a new number theoretic definition of discrete fractional Fourier transform (DFrFT)<n>The DFrFT is defined as the $N times N$ dimensional unitary representation of the generator of the arithmetic rotational group $SO_2[mathbbZ_pn]$.
  arXiv  Detail & Related papers  (2024-09-09T16:15:53Z)
• Quantum Random Walks and Quantum Oscillator in an Infinite-Dimensional Phase Space [45.9982965995401]
  We consider quantum random walks in an infinite-dimensional phase space constructed using Weyl representation of the coordinate and momentum operators. We find conditions for their strong continuity and establish properties of their generators.
  arXiv  Detail & Related papers  (2024-06-15T17:39:32Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.<n>We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.<n>We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• The mixed Schur transform: efficient quantum circuit and applications [0.0]
  The Schur transform is an important primitive in quantum information and theoretical physics. We give a generalization of its quantum circuit implementation due to Bacon, Chuang, and Harrow (SODA 2007) We show how the mixed Schur transform enables efficient implementation of unitary-equivariant channels in various settings.
  arXiv  Detail & Related papers  (2023-10-02T20:03:56Z)
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits [37.84307089310829]
  Variational quantum computing schemes train a loss function by sending an initial state through a parametrized quantum circuit. Despite their promise, the trainability of these algorithms is hindered by barren plateaus. We present a general Lie algebra that provides an exact expression for the variance of the loss function of sufficiently deep parametrized quantum circuits.
  arXiv  Detail & Related papers  (2023-09-17T18:14:10Z)
• Near-optimal quantum circuit construction via Cartan decomposition [4.900041609957432]
  We show the applicability of the Cartan decomposition of Lie algebras to quantum circuits. This approach can be used to synthesize circuits that can efficiently implement any desired unitary operation.
  arXiv  Detail & Related papers  (2022-12-25T17:01:13Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Generalized quantum circuit differentiation rules [23.87373187143897]
  Variational quantum algorithms that are used for quantum machine learning rely on the ability to automatically differentiate parametrized quantum circuits. Here, we propose the rules for differentiating quantum circuits (unitaries) with arbitrary generators.
  arXiv  Detail & Related papers  (2021-08-03T00:29:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.