Quantum circuit for transformation of mixed state vectors
US-2024020563-A1 · Jan 18, 2024 · US
US12445276B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-12445276-B2 |
| Application number | US-202318130449-A |
| Country | US |
| Kind code | B2 |
| Filing date | Apr 4, 2023 |
| Priority date | Apr 4, 2023 |
| Publication date | Oct 14, 2025 |
| Grant date | Oct 14, 2025 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A quantum method, receives by a quantum circuit, quantum information from a first block within a blockchain. The quantum method performs quantum voting in each node in the quantum blockchains. The quantum method uses entanglement capabilities for achieving consensus voting.
Opening claim text (preview).
What is claimed is: 1. A quantum method, comprising: generating, by a quantum system, a random value; encoding, by the quantum system, encodes the random value θ r , wherein random value is encoded in a qubit in the form of ❘ "\[LeftBracketingBar]" φ r 〉 = cos θ r 2 ❘ "\[LeftBracketingBar]" 0 〉 + cos θ r 2 ❘ "\[LeftBracketingBar]" 1 〉 , sending, by the quantum system, the qubit |φ r to each node in a validation set, wherein the qubit |φ r is used by each node to create an entanglement system, of two other qubits, by applying CNOT gate between the qubit |φ r as a control qubit and an ancilla target qubit that is initialized in a state |0 , wherein each of the node in the validation set quantifies the degree of entanglement using a concurrence measure and wherein each of the nodes recognizes a selected leader node LN, wherein LN=fix (C×10 14 mod v), and wherein the quantum system reduces hacking of linkages between different blocks of the blockchain based on the sending the qubit to each node in the validation set. 2. The quantum method of claim 1 further comprising: applying, by a current leader node of the quantum system, a S operator between a set h of given qubits from the register |qD or/and a set g of given qubits from the registers |qH as control qubits and the corresponding qubits, wherein the same indices, of the registers |QD , or/and |QH are target qubits. 3. The quantum method of claim 1 , further comprising: initializing, by the quantum system, a qubit |CS to a state |0 . 4. The quantum method of claim 1 , further comprising: applying, by the quantum system, a |g|+|h|+1-qubit Toffoli gate to a number of given qubits from the register |qD as control qubits or another number of given qubits from the registers |qH as corresponding qubits; and setting a target qubit |CS to a state |0 , wherein the target qubit |CS is flipped to a state |1 only if a state of each qubit of the control qubits is in the state|1 , and wherein a target block is marked by entanglement, wherein the target block is stored in a superposition that stores a quantum ledger in the current leader node. 5. The quantum system of claim 1 , further comprising: applying, by the quantum system, CNOT gate between the qubit |CS , and a qubit |dt as control and target qubits, such that the qubit |dt is initialized in the state |0 , wherein applying the CNOT gate creates entanglement between the two qubits |CS and |dt with a degree of entanglement, C. 6. The quantum of claim 1 , wherein a measurement of the degree of entanglement between the two qubits |CS and |dt , is conducted based on using a concurrence measure. 7. The method of claim 1 , further comprising: encoding, by the quantum system, a hash H i wherein the the hash H i of i th block is H i = 1 2 ( 1 ± 1 - C 2 ) , where the H i hash is a hash of the i th block that is encoded in a probability amplitude H i M . 8. The method of claim 1 , further comprising: determining, by the quantum system, whether binary (H i )=B. 9. The method of claim 1 , further comprising: determining, by the quantum system, that binary (H i )=B then the leader node LN sets the qubit |LNd =|1 and the controlled - NOT v gate is activated such that the control qubit is |LNd , and the target qubit is |Ck ; applying, by the quantum system, a selection step to determine the next leader node among the validator nodes; and teleporting, by the quantum system, the qubit |Ck to the next leader using a quantum teleportation circuit.
Models of quantum computing, e.g. quantum circuits or universal quantum computers · CPC title
using hash chains, e.g. blockchains or hash trees · CPC title
Quantum cryptography (transmission systems employing electromagnetic waves other than radio waves, e.g. light, infrared H04B10/00; wavelength-division multiplex systems H04J14/02; WDM arrangements H04J14/03) · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.