Generalized tensor transforms and their applications in classical and quantum computing

• URL: http://arxiv.org/abs/2507.02420v2
• Date: Thu, 10 Jul 2025 04:37:28 GMT
• Title: Generalized tensor transforms and their applications in classical and quantum computing
• Authors: Alok Shukla, Prakash Vedula,
• Abstract summary: We introduce a novel framework for Generalized Transforms (GTTs), constructed through an $n$-fold tensor product of an arbitrary $b times b$ unitary matrix $W$.<n>For quantum applications, our GTT-based algorithm achieves both gate complexity and circuit depth of $O(log_b N)$, where $N = bn$ denotes the length of the vector input.<n>We explore diverse applications of GTTs in quantum computing, including quantum state compression and transmission, function encoding and quantum digital signal processing.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a novel framework for Generalized Tensor Transforms (GTTs), constructed through an $n$-fold tensor product of an arbitrary $b \times b$ unitary matrix $W$. This construction generalizes many established transforms, by providing a adaptable set of orthonormal basis functions. Our proposed fast classical algorithm for GTT achieves an exponentially lower complexity of $O(N \log_b N)$ in comparison to a naive classical implementation that has an associated computational cost of $O(N^2)$. For quantum applications, our GTT-based algorithm, implemented in the natural spectral ordering, achieves both gate complexity and circuit depth of $O(\log_b N)$, where $N = b^n$ denotes the length of the input vector. This represents a quadratic improvement over Quantum Fourier Transform (QFT), which requires $O((\log_b N)^2)$ gates and depth for $n$ qudits, and an exponential advantage over classical Fast Fourier Transform (FFT) based and Fast Walsh-Hadamard Transform (FWHT) based methods, which incur a computational cost of $O(N \log_b N)$. We explore diverse applications of GTTs in quantum computing, including quantum state compression and transmission, function encoding and quantum digital signal processing. The proposed framework provides fine-grained control of the transformation through the adjustable parameters of the base matrix $W$. This versatility allows precise shaping of each basis function while preserving their effective Walsh-type structure, thus tailoring basis representations to specific quantum data and computational tasks. Our numerical results demonstrate that GTTs enable improved performance in quantum state compression and function encoding compared to fixed transforms (such as FWHT or FFT), achieving higher fidelities with fewer retained components. We also provided novel classical and quantum digital signal filtering algorithms based on our GTT framework.

Related papers

• Quantum Algorithms for Gowers Norm Estimation, Polynomial Testing, and Arithmetic Progression Counting over Finite Abelian Groups [0.0]
  We propose a family of quantum algorithms for estimating Gowers norms $ Uk $ over finite abelian groups.<n>These algorithms leverage recent inverse theorems for Gowers norms, together with amplitude estimation, to reveal higher-order correlations.
  arXiv  Detail & Related papers  (2025-08-02T06:58:12Z)
• Optimization and Synthesis of Quantum Circuits with Global Gates [44.99833362998488]
  We use global interactions, such as the Global Molmer-Sorensen gate present in ion trap hardware, to optimize and synthesize quantum circuits.<n>The algorithm is based on the ZX-calculus and uses a specialized circuit extraction routine that groups entangling gates into Global MolmerSorensen gates.<n>We benchmark the algorithm in a variety of circuits, and show how it improves their performance under state-of-the-art hardware considerations.
  arXiv  Detail & Related papers  (2025-07-28T10:25:31Z)
• Compact Circuits for Constrained Quantum Evolutions of Sparse Operators [0.0]
  We introduce a general framework for constructing compact quantum circuits that implement the real-time evolution of Hamiltonians of the form $H = sigma P_B$.<n>We also construct transposition gates, widely used in quantum computing, that scale more efficiently than the best known constructions in literature.
  arXiv  Detail & Related papers  (2025-04-12T08:47:59Z)
• HQViT: Hybrid Quantum Vision Transformer for Image Classification [48.72766405978677]
  We propose a Hybrid Quantum Vision Transformer (HQViT) to accelerate model training while enhancing model performance.<n>HQViT introduces whole-image processing with amplitude encoding to better preserve global image information without additional positional encoding.<n>Experiments across various computer vision datasets demonstrate that HQViT outperforms existing models, achieving a maximum improvement of up to $10.9%$ (on the MNIST 10-classification task) over the state of the art.
  arXiv  Detail & Related papers  (2025-04-03T16:13:34Z)
• A discrete Fourier transform based quantum circuit for modular multiplication in Shor's algorithm [0.0]
  We propose a quantum circuit for modular exponentiation.<n>The gate-complexity of our proposal is $O(L3)$ where L is the number of bits required to store the number being factorized.
  arXiv  Detail & Related papers  (2025-03-13T03:39:13Z)
• Practical Quantum Circuit Implementation for Simulating Coupled Classical Oscillators [1.3140209441982318]
  We present and implement a detailed quantum circuit construction for simulating one-dimensional spring-mass systems.<n>This circuit-based Hamiltonian simulation approach can substantially reduce computational costs and potentially enable larger-scale many-body studies on future quantum hardware.
  arXiv  Detail & Related papers  (2025-01-10T16:53:56Z)
• Optimization by Decoded Quantum Interferometry [42.169154389732036]
  We introduce a quantum algorithm called Decoded Quantum Interferometry (DQI)<n>For approximating to data over finite fields, DQI achieves a better approximation ratio than any time known to us.
  arXiv  Detail & Related papers  (2024-08-15T17:47:42Z)
• Calculating response functions of coupled oscillators using quantum phase estimation [40.31060267062305]
  We study the problem of estimating frequency response functions of systems of coupled, classical harmonic oscillators using a quantum computer.<n>Our proposed quantum algorithm operates in the standard $s-sparse, oracle-based query access model.<n>We show that a simple adaptation of our algorithm solves the random glued-trees problem in time.
  arXiv  Detail & Related papers  (2024-05-14T15:28:37Z)
• Q-Newton: Hybrid Quantum-Classical Scheduling for Accelerating Neural Network Training with Newton's Gradient Descent [37.59299233291882]
  We propose Q-Newton, a hybrid quantum-classical scheduler for accelerating neural network training with Newton's GD.<n>Q-Newton utilizes a streamlined scheduling module that coordinates between quantum and classical linear solvers.<n>Our evaluation showcases the potential for Q-Newton to significantly reduce the total training time compared to commonly used quantum machines.
  arXiv  Detail & Related papers  (2024-04-30T23:55:03Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Generalized Quantum Signal Processing [0.6768558752130311]
  We present a Generalized Quantum Signal Processing approach, employing general SU(2) rotations as our signal processing operators. Our approach lifts all practical restrictions on the family of achievable transformations, with the sole remaining condition being that $|P|leq 1$. In cases where only $P$ is known, we provide an efficient GPU optimization capable of identifying in under a minute of time, a corresponding $Q$ for degree on the order of $107$.
  arXiv  Detail & Related papers  (2023-08-03T01:51:52Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Speeding up Learning Quantum States through Group Equivariant Convolutional Quantum Ans\"atze [13.651587339535961]
  We develop a framework for convolutional quantum circuits with SU$(d)$symmetry. We prove Harrow's statement on equivalence between $nameSU(d)$ and $S_n$ irrep bases.
  arXiv  Detail & Related papers  (2021-12-14T18:03:43Z)
• Quantum Legendre-Fenchel Transform [6.643082745560234]
  We present a quantum algorithm to compute the discrete Legendre-Fenchel transform. We show that our quantum algorithm is optimal up to polylogarithmic factors.
  arXiv  Detail & Related papers  (2020-06-08T18:00:05Z)

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.