Quantum Blockchain Based on Dimensional Lifting Generalized Gram-Schmidt
Procedure
- URL: http://arxiv.org/abs/2110.02763v3
- Date: Sat, 22 Oct 2022 02:59:18 GMT
- Title: Quantum Blockchain Based on Dimensional Lifting Generalized Gram-Schmidt
Procedure
- Authors: Kumar Nilesh and P. K. Panigrahi
- Abstract summary: We propose a model of a fully quantum blockchain based on a generalized Gram-Schmidt procedure.
It is shown to be secure even against quantum computing attacks.
We outline a framework for a quantum token built on the same architecture as our blockchain.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: The advancement of quantum computers undermines the security of classical
blockchain, necessitating either a post-quantum upgrade of the existing
architecture or creation of an inherently quantum blockchain. Here we propose a
practically realizable model of a fully quantum blockchain based on a
generalized Gram-Schmidt procedure utilizing dimensional lifting. In this
model, information of transactions stored in a multi-qubit state are
subsequently encoded using the generalized Gram-Schmidt process. The chain is
generated as a result of the reliance of orthogonalized state on the sequence
of states preceding it. Various forking scenarios and their countermeasures are
considered for the proposed model. It is shown to be secure even against
quantum computing attacks using the no-cloning theorem and non-democratic
nature of Generalized Gram-Schmidt orthogonalization. Finally, we outline a
framework for a quantum token built on the same architecture as our blockchain.
Related papers
- Q-PnV: A Quantum Consensus Mechanism for Security Consortium Blockchains [10.20686832651113]
We propose a novel quantum consensus mechanism, named Q-PnV.
This consensus mechanism is based on the classical Proof of Vote (PoV), integrating quantum voting, quantum digital signature and quantum random number generators (QRNGs)
Compared to the classical method, the quantum blockchain based on Q-PnV can resist quantum attacks and shows significant improvements in security and fairness, making it better suit-ed for the future quantum era.
arXiv Detail & Related papers (2024-12-09T09:24:04Z) - Towards post-quantum blockchain: A review on blockchain cryptography
resistant to quantum computing attacks [0.0]
This article studies current state of the art on post-quantum cryptosystems and how they can be applied to blockchains and DLTs.
It provides comparisons on the characteristics and performance of the most promising post-quantum public-key encryption and digital signature schemes for blockchains.
arXiv Detail & Related papers (2024-02-01T17:29:07Z) - From Portfolio Optimization to Quantum Blockchain and Security: A
Systematic Review of Quantum Computing in Finance [0.0]
We provide an overview of the recent work in the quantum finance realm from various perspectives.
The applications in consideration are Portfolio Optimization, Fraud Detection, and Monte Carlo methods for derivative pricing and risk calculation.
We give a comprehensive overview of the applications of quantum computing in the field of blockchain technology.
arXiv Detail & Related papers (2023-06-12T19:53:23Z) - Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical.
We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more.
Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
arXiv Detail & Related papers (2023-03-02T14:18:17Z) - Revocable Cryptography from Learning with Errors [61.470151825577034]
We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities.
We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
arXiv Detail & Related papers (2023-02-28T18:58:11Z) - Trapped Ions as an Architecture for Quantum Computing [110.83289076967895]
We describe one of the most promising platforms for the construction of a universal quantum computer.
We discuss from the physics involved in trapping ions in electromagnetic potentials to the Hamiltonian engineering needed to generate a universal set of logic gates.
arXiv Detail & Related papers (2022-07-23T22:58:50Z) - 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) - Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's
Post-Quantum Security [67.06003361150228]
A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task.
In this work, we examine the hardness of finding such chain of PoWs against quantum strategies.
We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
arXiv Detail & Related papers (2020-12-30T18:03:56Z) - Quantum Gram-Schmidt Processes and Their Application to Efficient State
Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state.
Our protocol suits the case that the output state lies in the row space of the input matrix.
One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05:26Z) - A Quantum Money Solution to the Blockchain Scalability Problem [3.89615163169501]
We give the first example of the use of smart contracts in a quantum setting.
We describe a simple hybrid classical-quantum payment system whose main ingredients are a classical blockchain capable of handling stateful smart contracts.
Our hybrid payment system employs quantum states as banknotes and a classical blockchain to settle disputes and to keep track of the valid serial numbers.
arXiv Detail & Related papers (2020-02-27T09:40:18Z)
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.