Hyperdimensional Quantum Factorization

• URL: http://arxiv.org/abs/2406.11889v1
• Date: Thu, 13 Jun 2024 20:50:02 GMT
• Title: Hyperdimensional Quantum Factorization
• Abstract summary: HDQF encodes potential factors as a quantum superposition using qubit states and bipolar vector representation. This yields a quadratic speedup over classical search methods and effectively mitigates Hypervector Factorization capacity issues.
• Score: 12.607568833115407
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper presents a quantum algorithm for efficiently decoding hypervectors, a crucial process in extracting atomic elements from hypervectors - an essential task in Hyperdimensional Computing (HDC) models for interpretable learning and information retrieval. HDC employs high-dimensional vectors and efficient operators to encode and manipulate information, representing complex objects from atomic concepts. When one attempts to decode a hypervector that is the product (binding) of multiple hypervectors, the factorization becomes prohibitively costly with classical optimization-based methods and specialized recurrent networks, an inherent consequence of the binding operation. We propose HDQF, an innovative quantum computing approach, to address this challenge. By exploiting parallels between HDC and quantum computing and capitalizing on quantum algorithms' speedup capabilities, HDQF encodes potential factors as a quantum superposition using qubit states and bipolar vector representation. This yields a quadratic speedup over classical search methods and effectively mitigates Hypervector Factorization capacity issues.

Related papers

• QeHDC: Hyperdimensional Computing based on Quantum-enhanced binding and SuperClass Construction [8.130961247419288]
  Quantum-enhanced Hyperdimensional Computing (QeHDC) extends classical HDC by leveraging quantum mechanical properties to enhance computational efficiency.<n>We propose a novel Quantum HDC framework featuring a one-pass training method, leveraging sinusoidal and quantum encoding to project classical data into quantum amplitude states efficiently.
  arXiv  Detail & Related papers  (2026-06-21T10:18:04Z)
• Quantum Hyperdimensional Computing: a foundational paradigm for quantum neuromorphic architectures [0.5785414922972825]
  We introduce Quantum Hyperdimensional Computing (QHDC), a fundamentally new paradigm.<n>We demonstrate that the core operations of its classical counterpart, Hyperdimensional Computing (HDC), map with remarkable elegance and direct correspondence onto the native operations of a QC.<n>We present the first-ever implementation of this framework, validated through symbolic analogical reasoning and supervised classification tasks.
  arXiv  Detail & Related papers  (2025-11-16T16:01:56Z)
• Vectorized Attention with Learnable Encoding for Quantum Transformer [0.6766416093990318]
  We propose the Vectorized Quantum Transformer (VQT), a model that supports ideal masked attention matrix computation.<n>Our noise intermediate-scale quantum friendly VQT approach unlocks a novel architecture for end-to-end machine learning in quantum computing.
  arXiv  Detail & Related papers  (2025-08-25T20:33:14Z)
• An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
  Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks. We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings. We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
  arXiv  Detail & Related papers  (2025-04-13T11:49:53Z)
• Optimization of the Qubit Coupled Cluster Ansatz on classical computers [0.0]
  We report two schemes for improving the amplitude optimisation in the iterative qubit coupled cluster (iQCC) method. First scheme approximates the QCC unitary as a sum of generators coupled up to a given order. Second scheme limits the size of the expansion space in which the QCC unitary is generated.
  arXiv  Detail & Related papers  (2025-02-24T19:11:40Z)
• QCircuitBench: A Large-Scale Dataset for Benchmarking Quantum Algorithm Design [63.02824918725805]
  Quantum computing is recognized for the significant speedup it offers over classical computing through quantum algorithms.<n>QCircuitBench is the first benchmark dataset designed to evaluate AI's capability in designing and implementing quantum algorithms.
  arXiv  Detail & Related papers  (2024-10-10T14:24:30Z)
• Multi-reference Quantum Davidson Algorithm for Quantum Dynamics [3.3869539907606603]
  Quantum Krylov Subspace (QKS) methods have been developed, enhancing the ability to perform accelerated simulations on noisy intermediate-scale quantum computers. We introduce and evaluate two QKS methods derived from the QDavidson algorithm, a novel approach for determining the ground and excited states of many-body systems.
  arXiv  Detail & Related papers  (2024-06-12T22:30:52Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Indirect Quantum Approximate Optimization Algorithms: application to the TSP [1.1786249372283566]
  Quantum Alternating Operator Ansatz takes into consideration a general parameterized family of unitary operators to efficiently model the Hamiltonian describing the set of vectors. This algorithm creates an efficient alternative to QAOA, where: 1) a Quantum parametrized circuit executed on a quantum machine models the set of string vectors; 2) a Classical meta-optimization loop executed on a classical machine; 3) an estimation of the average cost of each string vector computing.
  arXiv  Detail & Related papers  (2023-11-06T17:39:14Z)
• Charged particle reconstruction for future high energy colliders with Quantum Approximate Optimization Algorithm [0.0]
  The charged particle reconstruction, the so-called track reconstruction, can be considered as a quadratic unconstrained binary optimization problem. The Quantum Approximate Optimization Algorithm (QAOA) is one of the most promising algorithms to solve such problems and to seek for a quantum advantage. It is found that the QAOA shows promising performance and demonstrated itself as one of the candidates for the track reconstruction using quantum computers.
  arXiv  Detail & Related papers  (2023-10-16T10:26:37Z)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Approximate complex amplitude encoding algorithm and its application to data classification problems [1.4843656413993453]
  The task of loading a classical data vector into a quantum state requires an exponential number of quantum gates. The approximate amplitude encoding (AAE) method, which uses a variational means to approximately load a given real-valued data vector into the amplitude of a quantum state, was recently proposed as a general approach to this problem mainly for near-term devices. In this work, we extend AAE so that it can handle a complex-valued data vector.
  arXiv  Detail & Related papers  (2022-11-23T15:46:29Z)
• Optimizing Tensor Network Contraction Using Reinforcement Learning [86.05566365115729]
  We propose a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem. The problem is extremely challenging due to the huge search space, the heavy-tailed reward distribution, and the challenging credit assignment. We show how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges.
  arXiv  Detail & Related papers  (2022-04-18T21:45:13Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)
• Efficient Discrete Feature Encoding for Variational Quantum Classifier [3.7576442570677253]
  Variational quantum classification (VQC) is one of such methods with possible quantum advantage. We introduce the use of quantum random-access coding (QRAC) to map discrete features efficiently into limited number of qubits for VQC. We experimentally show that QRAC can help speeding up the training of VQC by reducing its parameters via saving on the number of qubits for the mapping.
  arXiv  Detail & Related papers  (2020-05-29T04:43:14Z)

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.