| Predicate |
Object |
| assignee |
http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_878db7929e48d122145a697a0e19ddca |
| classificationCPCAdditional |
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F2111-10 |
| classificationCPCInventive |
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F17-11
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06N10-00
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F17-141
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F30-337 |
| classificationIPCInventive |
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F17-14
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F30-337
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06N10-00 |
| filingDate |
2020-04-06-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| inventor |
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_3e0450afba06c7207c0b502584b19990
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_cff03fa6ee3409dfd9b67dbc305205e2
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_c9e6ae452b79846ef9ac4925f2ca9bff
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_12af851a81de74739af94bd776006ccf |
| publicationDate |
2020-10-08-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber |
US-2020320240-A1 |
| titleOfInvention |
Method for reducing cost and increasing accuracy of variational quantum circuit optimization |
| abstract |
The optimization of circuit parameters of variational quantum algorithms is a challenge for the practical deployment of near-term quantum computing algorithms. Embodiments relate to a hybrid quantum-classical optimization methods. In a first stage, analytical tomography fittings are performed for a local cluster of circuit parameters via sampling of the observable objective function at quadrature points in the circuit parameters. Optimization may be used to determine the optimal circuit parameters within the cluster, with the other circuit parameters frozen. In a second stage, different clusters of circuit parameters are then optimized in “Jacobi sweeps,” leading to a monotonically convergent fixed-point procedure. In a third stage, the iterative history of the fixed-point Jacobi procedure may be used to accelerate the convergence by applying Anderson acceleration/Pulay's direct inversion of the iterative subspace (DIIS). |
| isCitedBy |
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/WO-2022231650-A1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/WO-2021244694-A1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/DE-102020114575-B3 |
| priorityDate |
2019-04-05-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| type |
http://data.epo.org/linked-data/def/patent/Publication |