A High-Dimensional Quantum Blockchain Protocol Based on Time- Entanglement
- URL: http://arxiv.org/abs/2512.20489v1
- Date: Tue, 23 Dec 2025 16:31:12 GMT
- Title: A High-Dimensional Quantum Blockchain Protocol Based on Time- Entanglement
- Authors: Aktaş, Arzu, Yılmaz, İhsan,
- Abstract summary: Protocol combines high-dimensional Bell states, time-entanglement, entanglement, and high-dimensional superdense coding.<n>Time-entanglement provides distributed authentication, non-repudiation, and tamper detection across the blockchain.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Rapid advancements in quantum computing and machine learning threaten the long-term security of classical blockchain systems, whose protection mechanisms largely rely on computational difficulties. In this study, we propose a quantum blockchain protocol whose protection mechanism is directly derived from quantum mechanical principles. The protocol combines high-dimensional Bell states, time-entanglement, entanglement switching, and high-dimensional superdense coding. Encoding classical block information into time-delimited qudit states allows block identity and data verification to be implemented through the causal sequencing of quantum measurements instead of cryptographic hash functions. High-dimensional coding increases the information capacity per quantum carrier and improves noise resistance. Time-entanglement provides distributed authentication, non-repudiation, and tamper detection across the blockchain. Each block derives its own public-private key pair directly from the observed quantum correlations by performing high-dimensional Bell state measurements in successive time steps. Because these keys are dependent on the time ordering of measurements, attempts to alter block data or disrupt the protocol's timing structure inevitably affect the reconstructed correlations and are revealed during validation. Recent advances in the creation and detection of high-dimensional time-slice entanglement demonstrate that the necessary quantum resources are compatible with emerging quantum communication platforms. Taken together, these considerations suggest that the proposed framework can be evaluated as a viable and scalable candidate for quantum-secure blockchain architectures in future quantum network environments.
Related papers
- A Quantum Walk-Enabled Blockchain with Weighted Quantum Voting Consensus [7.048887159038287]
This work proposes a novel quantum blockchain framework based on quantum walks.<n>We propose a quantum consensus mechanism based on a weighted quantum voting protocol.<n>Compared with existing entanglement-dependent approaches, our framework achieves stronger stability and enables simpler verification of block integrity.
arXiv Detail & Related papers (2025-10-09T07:26:14Z) - Time Entangled Quantum Blockchain with Phase Encoding for Classical Data [0.46797467897340006]
It is widely believed that there will be quantum hardware capable of compromising classical cryptography.<n>This is mainly due to the operational realizations of quantum algorithms such as Grover and Shor.<n>One approach to secure blockchain is to attempt to achieve information theoretical security by defining blockchain on quantum technologies.
arXiv Detail & Related papers (2025-07-20T06:50:41Z) - Quantum-Accelerated Wireless Communications: Concepts, Connections, and Implications [59.0413662882849]
Quantum computing is poised to redefine the algorithmic foundations of communication systems.<n>This article outlines the fundamentals of quantum computing in a style familiar to the communications society.<n>We highlight a mathematical harmony between quantum and wireless systems, which makes the topic more enticing to wireless researchers.
arXiv Detail & Related papers (2025-06-25T22:25:47Z) - Information-theoretically secure quantum timestamping with one-time universal hashing [5.968836846058194]
Classical timestamp protocols rely on computational assumptions for security, rendering them vulnerable to quantum attacks.<n>We propose an information-theoretically secure quantum timestamping protocol based on one-time universal hashing with quantum keys.<n>Our protocol simultaneously achieves information-theoretic security and high efficiency, enabling secure timestamping for arbitrarily long documents.
arXiv Detail & Related papers (2025-05-20T03:46:15Z) - Practical hybrid PQC-QKD protocols with enhanced security and performance [44.8840598334124]
We develop hybrid protocols by which QKD and PQC inter-operate within a joint quantum-classical network.
In particular, we consider different hybrid designs that may offer enhanced speed and/or security over the individual performance of either approach.
arXiv Detail & Related papers (2024-11-02T00:02:01Z) - Quantum delegated and federated learning via quantum homomorphic encryption [0.5939164722752263]
We present a general framework that enables quantum delegated and federated learning with atheoretical data privacy guarantee.
We show that learning and inference under this framework feature substantially lower communication complexity compared with schemes based on blind quantum computing.
arXiv Detail & Related papers (2024-09-28T14:13:50Z) - The Evolution of Quantum Secure Direct Communication: On the Road to the Qinternet [49.8449750761258]
Quantum secure direct communication (QSDC) is provably secure and overcomes the threat of quantum computing.<n>We will detail the associated point-to-point communication protocols and show how information is protected and transmitted.
arXiv Detail & Related papers (2023-11-23T12:40:47Z) - An Evolutionary Pathway for the Quantum Internet Relying on Secure
Classical Repeaters [64.48099252278821]
We conceive quantum networks using secure classical repeaters combined with the quantum secure direct communication principle.
In these networks, the ciphertext gleaned from a quantum-resistant algorithm is transmitted using QSDC along the nodes.
We have presented the first experimental demonstration of a secure classical repeater based hybrid quantum network.
arXiv Detail & Related papers (2022-02-08T03:24:06Z) - Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
"Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation.
We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
arXiv Detail & Related papers (2021-12-09T19:00:00Z) - Quantum-resistance in blockchain networks [46.63333997460008]
This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Quantum Computing (CQC), and Tecnologico de Monterrey to identify and eliminate quantum threats in blockchain networks.
The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms.
arXiv Detail & Related papers (2021-06-11T23:39:25Z) - Anti-Forging Quantum Data: Cryptographic Verification of Quantum
Computational Power [1.9737117321211988]
Quantum cloud computing is emerging as a popular model for users to experience the power of quantum computing through the internet.
How can users be sure that the output strings sent by the server are really from a quantum hardware?
arXiv Detail & Related papers (2020-05-04T14:28:14Z) - Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies.
We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived.
This is the first quantum protocol that can be used against the most general adversaries.
arXiv Detail & Related papers (2020-03-20T17:56: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.