http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-111291892-A
Outgoing Links
| Predicate | Object |
|---|---|
| assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_78160fe5924d399deb065f8cbc5ad347 |
| classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06N10-00 |
| classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06N10-00 |
| filingDate | 2020-01-17-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_d82d211e3bf1f991e2c83cfdf7058902 http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_2c85b0f193a733cfcc30aaef1224bc1f |
| publicationDate | 2020-06-16-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber | CN-111291892-A |
| titleOfInvention | A Quantum Parallel Search Method |
| abstract | The present invention relates to a quantum parallel search method. If the Oracle operator is used as a unit, the method described in the present invention can run at a time complexity of O(2 n/4 ) and a circuit complexity of O(2 n/ 4 ) to find the solution to the search problem with a probability close to 1. From the properties of Grover's algorithm, it can be known that the quantum iterative circuit is composed of G operators in series one after another. When the number of input qubits n is relatively large, the huge quantum circuit scale is the main obstacle to the practical application of Grover's algorithm. The main purpose of the present invention is to propose an improved Grover quantum search method, aiming at solving the problem of reducing the circuit complexity of the existing Grover algorithm. |
| isCitedBy | http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-112966456-A http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-112966456-B http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-115511094-B http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-115511094-A |
| priorityDate | 2020-01-17-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 22.