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

Hyperdimensional Computing for Distributed Quantum State Teleportation

Jincheng Zhang

Published Aug 28, 2026• 0 citations
Publisher

Abstract

This paper explores a novel approach to quantum state teleportation leveraging hyperdimensional computing (HDC). Traditional quantum state teleportation protocols face limitations due to qubit fidelity requirements and the complexity associated with distributing entangled qubits over long distances. We propose utilizing HDC – high-dimensional vectors characterized by near-orthogonal components – to represent and transmit quantum states. Our method significantly reduces the need for direct qubit entanglement, offering a potentially scalable and robust alternative. The core mechanism involves encoding the quantum state information into the high-dimensional vector components and subsequently extracting the state at the destination. We detail the mathematical framework underpinning this approach, focusing on vector projections, inner products, and state reconstruction. The results demonstrate a viable path towards distributed quantum state teleportation, addressing the key challenges of fidelity and entanglement distribution. We provide a detailed analysis of the computational complexity and potential advantages of this HDC-based teleportation scheme.

DOI
10.5281/zenodo.22138433

Related papers

Hyperdimensional Computing for Quantum State Tomography

Jincheng Zhang

Quantum state tomography (QST) is a fundamental technique for characterizing quantum systems, but it often suffers from significant experimental challenges, including high measurement complexity and resource demands. This paper explores the potential of hyperdimensional computing (HDC) as a viable alternative to traditional QST. HDC leverages high-dimensional vectors to represent and manipulate quantum states, allowing for the development of algorithms that exploit inherent correlations to reconstruct quantum state information with reduced measurement requirements. The core claim is that HDC offers a potentially efficient and scalable approach to QST. This work details the theoretical framework, outlining key algorithms and highlighting the advantages of utilizing HDC for quantum state characterization. The focus is on demonstrating the feasibility of this approach through conceptual design, emphasizing the reduced complexity compared to conventional QST methods. We propose a framework for representing quantum states within HDC vectors and present a simplified reconstruction algorithm.

•Aug 28, 2026•0 citations

Quantum Teleportation-Based Distributed Storage and Computation

Jincheng Zhang

This paper investigates the potential of quantum teleportation for enabling distributed storage and computation. The core argument centers on leveraging quantum teleportation to circumvent the limitations imposed by physical constraints in traditional storage and computing architectures. We propose a framework for constructing a quantum network where quantum teleportation facilitates the transmission and storage of quantum information. Furthermore, we explore the utilization of quantum entanglement to support distributed computation. This research represents an initial exploration into the possibilities of quantum networks, offering a novel approach to future distributed storage and computation paradigms. The key mathematical formulations underpinning the concepts presented are detailed throughout the paper. We focus on the theoretical underpinnings and potential architectures, omitting experimental details. ---

•Sep 5, 2026•0 citations

Quantum-StateHD: Leveraging Random Quantum States for Hyperdimensional Learning

Yangjie Xu, Hui Huang, Radu State

Hyperdimensional Computing (HDC) is a brain-inspired computational paradigm that utilizes high-dimensional vector spaces to represent, bind, and process information efficiently. Its robustness, scalability, and adaptability make HDC particularly effective for machine learning tasks such as classification and pattern recognition. In this work, we introduce Quantum-StateHD (QSHD), a novel approach that leverages random quantum states as encoding mechanisms for high-dimensional spaces within the HDC framework. Quantum states, with their inherent properties of high-dimensionality, near-orthogonality, and probabilistic distributions, provide a natural substrate for constructing robust representations. Quantum-StateHD encodes classical data into the coefficients of random quantum states and seamlessly integrates these representations into the HDC pipeline. Experimental results on several benchmark classification datasets demonstrate that Quantum-StateHD achieves competitive or superior performance compared to traditional state-of-the-art HDC methods, showcasing its potential for robust and efficient high-dimensional information processing. This study bridges the gap between quantum information science and HDC, offering a promising direction for hybrid quantum-classical machine learning architectures.

International Joint Conference on Neural Networks (IJCNN)•Jun 30, 2025•0 citations

Hyperdimensional Quantum Factorization

Prathyush Poduval, Zhuowen Zou, Alvaro Velasquez +1 more

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.

arXiv:2406.11889•Jun 13, 2024•4 citations

QeHDC: Hyperdimensional Computing based on Quantum-enhanced binding and SuperClass Construction

Yangjie Xu, H Huang, Li Ning +1 more

Hyperdimensional Computing (HDC) is a robust computational framework inspired by human cognition characterized by simple and efficient operations within high-dimensional vector spaces. Quantum-enhanced Hyperdimensional Computing (QeHDC) extends classical HDC by leveraging quantum mechanical properties to enhance computational efficiency. In this paper, 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. Our framework introduces an innovative reference-state-based quantum binding operation realized via quantum circuits. Furthermore, we propose a density-matrix-based superclass generation strategy employing eigenvalue decomposition to extract critical quantum state features effectively, enabling a more accurate and robust class representation. Experimental evaluations conducted on standard benchmark datasets demonstrate our approach's superior performance, robustness to noise, and computational feasibility compared to traditional classical and existing quantum-enhanced approaches. The results highlight the practical benefits and potential of Quantum HDC for quantum-enhanced classification tasks and pave the way for future advancements in quantum-inspired computational paradigms.

arXiv:2606.22421•Jun 21, 2026•0 citations

Quantum Networking Protocol Based on Quantum Teleportation

Jincheng Zhang

This paper proposes a novel quantum networking protocol leveraging quantum teleportation for rapid quantum information transfer within a network. Traditional quantum network architectures suffer from limited transmission speeds due to the requirement of physically transporting qubits. This protocol overcomes this limitation by utilizing the quantum entanglement and Bell states to facilitate instantaneous information transfer, circumventing the need for direct qubit conveyance. The core of the protocol relies on establishing and maintaining entanglement between nodes, followed by a Bell state measurement and classical communication to reconstruct the quantum state at the destination. This design offers a significantly faster method for quantum information distribution compared to conventional approaches. The theoretical framework is presented with detailed mathematical formulations of the key steps, including the Bell state measurement, the process of quantum state transfer, and the necessary classical communication protocols. This work contributes to the advancement of quantum networking technology and provides a foundation for future high-speed quantum communication systems.

•Aug 28, 2026•0 citations
This paper explores a novel approach to quantum state teleportation leveraging hyperdimensional computing (HDC). Traditional quantum state teleportation protocols face limitations due to qubit fidelity requirements and the complexity associated with distributing entangled qubits over long distances. We propose utilizing HDC – high-dimensional vectors characterized by near-orthogonal components – to represent and transmit quantum states. Our method significantly reduces the need for direct qubit entanglement, offering a potentially scalable and robust alternative. The core mechanism involves encoding the quantum state information into the high-dimensional vector components and subsequently extracting the state at the destination. We detail the mathematical framework underpinning this approach, focusing on vector projections, inner products, and state reconstruction. The results demonstrate a viable path towards distributed quantum state teleportation, addressing the key challenges of fidelity and entanglement distribution. We provide a detailed analysis of the computational complexity and potential advantages of this HDC-based teleportation scheme.
Quantum state tomography (QST) is a fundamental technique for characterizing quantum systems, but it often suffers from significant experimental challenges, including high measurement complexity and resource demands. This paper explores the potential of hyperdimensional computing (HDC) as a viable alternative to traditional QST. HDC leverages high-dimensional vectors to represent and manipulate quantum states, allowing for the development of algorithms that exploit inherent correlations to reconstruct quantum state information with reduced measurement requirements. The core claim is that HDC offers a potentially efficient and scalable approach to QST. This work details the theoretical framework, outlining key algorithms and highlighting the advantages of utilizing HDC for quantum state characterization. The focus is on demonstrating the feasibility of this approach through conceptual design, emphasizing the reduced complexity compared to conventional QST methods. We propose a framework for representing quantum states within HDC vectors and present a simplified reconstruction algorithm.
This paper investigates the potential of quantum teleportation for enabling distributed storage and computation. The core argument centers on leveraging quantum teleportation to circumvent the limitations imposed by physical constraints in traditional storage and computing architectures. We propose a framework for constructing a quantum network where quantum teleportation facilitates the transmission and storage of quantum information. Furthermore, we explore the utilization of quantum entanglement to support distributed computation. This research represents an initial exploration into the possibilities of quantum networks, offering a novel approach to future distributed storage and computation paradigms. The key mathematical formulations underpinning the concepts presented are detailed throughout the paper. We focus on the theoretical underpinnings and potential architectures, omitting experimental details. ---
Hyperdimensional Computing (HDC) is a brain-inspired computational paradigm that utilizes high-dimensional vector spaces to represent, bind, and process information efficiently. Its robustness, scalability, and adaptability make HDC particularly effective for machine learning tasks such as classification and pattern recognition. In this work, we introduce Quantum-StateHD (QSHD), a novel approach that leverages random quantum states as encoding mechanisms for high-dimensional spaces within the HDC framework. Quantum states, with their inherent properties of high-dimensionality, near-orthogonality, and probabilistic distributions, provide a natural substrate for constructing robust representations. Quantum-StateHD encodes classical data into the coefficients of random quantum states and seamlessly integrates these representations into the HDC pipeline. Experimental results on several benchmark classification datasets demonstrate that Quantum-StateHD achieves competitive or superior performance compared to traditional state-of-the-art HDC methods, showcasing its potential for robust and efficient high-dimensional information processing. This study bridges the gap between quantum information science and HDC, offering a promising direction for hybrid quantum-classical machine learning architectures.
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.
Hyperdimensional Computing (HDC) is a robust computational framework inspired by human cognition characterized by simple and efficient operations within high-dimensional vector spaces. Quantum-enhanced Hyperdimensional Computing (QeHDC) extends classical HDC by leveraging quantum mechanical properties to enhance computational efficiency. In this paper, 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. Our framework introduces an innovative reference-state-based quantum binding operation realized via quantum circuits. Furthermore, we propose a density-matrix-based superclass generation strategy employing eigenvalue decomposition to extract critical quantum state features effectively, enabling a more accurate and robust class representation. Experimental evaluations conducted on standard benchmark datasets demonstrate our approach's superior performance, robustness to noise, and computational feasibility compared to traditional classical and existing quantum-enhanced approaches. The results highlight the practical benefits and potential of Quantum HDC for quantum-enhanced classification tasks and pave the way for future advancements in quantum-inspired computational paradigms.
This paper proposes a novel quantum networking protocol leveraging quantum teleportation for rapid quantum information transfer within a network. Traditional quantum network architectures suffer from limited transmission speeds due to the requirement of physically transporting qubits. This protocol overcomes this limitation by utilizing the quantum entanglement and Bell states to facilitate instantaneous information transfer, circumventing the need for direct qubit conveyance. The core of the protocol relies on establishing and maintaining entanglement between nodes, followed by a Bell state measurement and classical communication to reconstruct the quantum state at the destination. This design offers a significantly faster method for quantum information distribution compared to conventional approaches. The theoretical framework is presented with detailed mathematical formulations of the key steps, including the Bell state measurement, the process of quantum state transfer, and the necessary classical communication protocols. This work contributes to the advancement of quantum networking technology and provides a foundation for future high-speed quantum communication systems.