Quantum state blockchain
In some embodiments, a computing system may comprise a memory for storing a ledger; a computer processor for verification of the ledger, wherein the computer processor comprises at least one of a classical computer processor configured to run a virtual quantum machine and a quantum computer comprising a plurality of qubits; wherein the ledger is configured to store arbitrary classical information and quantum information which is verifiable using the computer processor. Furthermore, in some embodiments the computing system is configured to perform operations comprising: adding to the ledger using the computer processor to solve a mathematically difficult problem which is Quantum-Merlin-Arthur-complete (QMA-complete). In embodiments, a blockchain includes a quantum state. In some aspects, a unitary operator corresponding to a quantum rotation is found when new transaction data are to be secured in the blockchain.
1. A method comprising:
at a computer system, receiving transaction data associated with a new transaction to be secured by a blockchain according to a blockchain protocol;
obtaining a prior quantum state;
after obtaining the prior quantum state, by operation of the computer system, finding a unitary operator that encodes the new transaction in a new quantum state in accordance with the blockchain protocol, the unitary operator corresponding to a quantum rotation, wherein:
t is an integer representing an index for a block to be added to the blockchain;
the prior quantum state comprises a prior n-qubit quantum state |Φ t-1 , and
the new quantum state comprises a new n-qubit quantum state |Φt ; and
generating a block for addition to the blockchain, wherein the block comprises block data identifying the unitary operator and the new quantum state.
2. The method of claim 1 , wherein finding the unitary operator comprises finding a unitary operator that satisfies a Non-Identity Check requirement in accordance with the blockchain protocol.
3. The method of claim 2 , wherein the difficulty of the Non-Identity Check requirement is tuned to control the rate of block generation.
4. The method of claim 1 , wherein finding the unitary operator comprises finding a unitary operator that satisfies a Non-Equivalency check requirement in accordance with the blockchain protocol.
5. The method of claim 1 , wherein finding the unitary operator comprises finding a unitary operator U t that rotates a first quantum state to a second quantum state, the first quantum state comprises the transaction data appended to the prior n-qubit quantum state |Φ t-1 , and the second quantum state comprises the new n-qubit quantum state |Φ t appended to additional data.
6. The method of claim 5 , wherein:
the transaction data comprises a third quantum state |q −t ;
the additional data comprises a fourth quantum state |q −t ′ ;
the first quantum state comprises the tensor product of the prior n-qubit quantum state |Φ t-1 and the third quantum state |q −t ; and
the second quantum state comprises the tensor product of the fourth quantum state |q′ −t and the new n-qubit quantum state |Φ t , such that
U t (|Φ t-1 ⊗| q −t )=| q′ −t ⊗|Φ t .
7. The method of claim 6 , wherein finding the unitary operator comprises finding a unitary operator that satisfies a requirement of the blockchain protocol regarding a relationship between the fourth quantum state |q′ −t and a fifth quantum state |q −(t-1) comprising transaction data associated with a prior transaction that has previously been secured by the blockchain.
8. The method of claim 7 , wherein the blockchain protocol requires
q′ −t |q −(t-n) ≥τ,
for all n<t, where r represents a threshold value specified by the blockchain protocol.
9. The method of claim 1 , further comprising publishing the block in a peer-to-peer network for addition to the blockchain.
10. The method of claim 1 , wherein the computer system comprises a classical computer system, and the classical computer system executes a virtual quantum machine to find the unitary operator.
11. The method of claim 1 , wherein the computer system comprises a hybrid classical-quantum computer system that includes a classical processor and a quantum processor, and the quantum processor is used to find the unitary operator.
12. The method of claim 1 , wherein the blockchain is stored in classical memory.
13. The method of claim 1 , further comprising dequeuing a block from the blockchain.
14. The method of claim 1 , wherein at least a portion of the blockchain is stored in quantum memory.
15. A computing system comprising:
memory storing blockchain data according to a blockchain protocol; and
one or more computer processors configured to perform operations comprising:
receiving transaction data associated with a new transaction to be secured by a blockchain according to the blockchain protocol;
obtaining a prior quantum state;
after obtaining the prior quantum state, finding a unitary operator that encodes the new transaction in a new quantum state in accordance with the blockchain protocol, the unitary operator corresponding to a quantum rotation wherein:
t is an integer representing an index for a block to be added to the blockchain;
the prior quantum state comprises a prior n-qubit quantum state |Φ t-1 , and
the new quantum state comprises a new n-qubit quantum state |Φ t ; and
generating a block for addition to the blockchain, wherein the block comprises block data identifying the unitary operator and the new quantum state.
16. The computing system of claim 15 , wherein the memory is a classical memory.
17. The computing system of claim 15 , wherein the one or more computer processors comprises a quantum computer.
18. The computing system of claim 15 , wherein the memory comprises quantum memory.
19. A computing system comprising:
memory storing blockchain data according to a blockchain protocol; and
means for blockchain mining, wherein the means for blockchain mining comprises one or more processors configured to:
find a unitary operator that encodes a new transaction in a new quantum state in accordance with the blockchain protocol, wherein:
t is an integer representing an index for a block to be added to a blockchain:
a prior quantum state comprises a prior n-qubit quantum state |Φ t-1 , and
the new quantum state comprises a new n-qubit quantum state |Φ t ; and
generate a block for addition to a blockchain, wherein the block comprises block data identifying the unitary operator and the new quantum state.
20. The computing system of claim 19 , wherein the means for blockchain mining comprises a hybrid classical-quantum computer system that includes a classical processor and a quantum processor, and the quantum processor is used to find the unitary operator.
21. The computing system of claim 19 , wherein the memory comprises quantum memory.