{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:SHO4UVXS4MK6QSFP7E3FUVBDUH","short_pith_number":"pith:SHO4UVXS","schema_version":"1.0","canonical_sha256":"91ddca56f2e315e848aff9365a5423a1d8907a8a65c22e8cfa2ac6a95166128d","source":{"kind":"arxiv","id":"2012.09265","version":2},"attestation_state":"computed","paper":{"title":"Variational Quantum Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"quant-ph","authors_text":"Andrew Arrasmith, Jarrod R. McClean, Keisuke Fujii, Kosuke Mitarai, Lukasz Cincio, M. Cerezo, Patrick J. Coles, Ryan Babbush, Simon C. Benjamin, Suguru Endo, Xiao Yuan","submitted_at":"2020-12-16T21:00:46Z","abstract_excerpt":"Applications such as simulating complicated quantum systems or solving large-scale linear algebra problems are very challenging for classical computers due to the extremely high computational cost. Quantum computers promise a solution, although fault-tolerant quantum computers will likely not be available in the near future. Current quantum devices have serious constraints, including limited numbers of qubits and noise processes that limit circuit depth. Variational Quantum Algorithms (VQAs), which use a classical optimizer to train a parametrized quantum circuit, have emerged as a leading str"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2012.09265","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-12-16T21:00:46Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"d898a732d318f88e7409bee771d0f3c2dad45f29892f65f3f33281c3b426e1e0","abstract_canon_sha256":"9bec85dbf7a90c2d6e5b93c496c25f5085c60ee04ebe19f948f36f87cc1953b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:19:41.358438Z","signature_b64":"QAhqwNp9+nv7jDAkqGHuRd8HhRu2eDWdm/WBRu2GJX+FHgGYp7Tpcu15o819j1+CDiRspJhQq0sm80IUOXImBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91ddca56f2e315e848aff9365a5423a1d8907a8a65c22e8cfa2ac6a95166128d","last_reissued_at":"2026-07-05T03:19:41.357933Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:19:41.357933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Variational Quantum Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"quant-ph","authors_text":"Andrew Arrasmith, Jarrod R. McClean, Keisuke Fujii, Kosuke Mitarai, Lukasz Cincio, M. Cerezo, Patrick J. Coles, Ryan Babbush, Simon C. Benjamin, Suguru Endo, Xiao Yuan","submitted_at":"2020-12-16T21:00:46Z","abstract_excerpt":"Applications such as simulating complicated quantum systems or solving large-scale linear algebra problems are very challenging for classical computers due to the extremely high computational cost. Quantum computers promise a solution, although fault-tolerant quantum computers will likely not be available in the near future. Current quantum devices have serious constraints, including limited numbers of qubits and noise processes that limit circuit depth. Variational Quantum Algorithms (VQAs), which use a classical optimizer to train a parametrized quantum circuit, have emerged as a leading str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.09265","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.09265/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2012.09265","created_at":"2026-07-05T03:19:41.357992+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.09265v2","created_at":"2026-07-05T03:19:41.357992+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.09265","created_at":"2026-07-05T03:19:41.357992+00:00"},{"alias_kind":"pith_short_12","alias_value":"SHO4UVXS4MK6","created_at":"2026-07-05T03:19:41.357992+00:00"},{"alias_kind":"pith_short_16","alias_value":"SHO4UVXS4MK6QSFP","created_at":"2026-07-05T03:19:41.357992+00:00"},{"alias_kind":"pith_short_8","alias_value":"SHO4UVXS","created_at":"2026-07-05T03:19:41.357992+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":10,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11306","citing_title":"Implementing Hamiltonian Renormalization Group Flow on Quantum Computers with VAPOR","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01253","citing_title":"Evaluating quantum circuits in the reservoir computing paradigm","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2403.02988","citing_title":"An Operational Framework for Nonclassicality in Quantum Communication Networks","ref_index":61,"is_internal_anchor":false},{"citing_arxiv_id":"2502.06961","citing_title":"Fully optimised variational simulation of a dynamical quantum phase transition on a trapped-ion quantum computer","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2507.01246","citing_title":"Quantum Machine Learning for State Tomography Using Classical Data","ref_index":80,"is_internal_anchor":false},{"citing_arxiv_id":"2509.13528","citing_title":"Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05479","citing_title":"Quantum Simulation of the Real-time Dynamics in the multi-flavor Gross-Neveu Model at the utility scale using Superconducting Quantum Computers","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01253","citing_title":"Evaluating quantum circuits in the reservoir computing paradigm","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19871","citing_title":"Co-Designing Error Mitigation and Error Detection for Logical Qubits","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05627","citing_title":"Loss-aware state space geometry for quantum variational algorithms","ref_index":46,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SHO4UVXS4MK6QSFP7E3FUVBDUH","json":"https://pith.science/pith/SHO4UVXS4MK6QSFP7E3FUVBDUH.json","graph_json":"https://pith.science/api/pith-number/SHO4UVXS4MK6QSFP7E3FUVBDUH/graph.json","events_json":"https://pith.science/api/pith-number/SHO4UVXS4MK6QSFP7E3FUVBDUH/events.json","paper":"https://pith.science/paper/SHO4UVXS"},"agent_actions":{"view_html":"https://pith.science/pith/SHO4UVXS4MK6QSFP7E3FUVBDUH","download_json":"https://pith.science/pith/SHO4UVXS4MK6QSFP7E3FUVBDUH.json","view_paper":"https://pith.science/paper/SHO4UVXS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.09265&json=true","fetch_graph":"https://pith.science/api/pith-number/SHO4UVXS4MK6QSFP7E3FUVBDUH/graph.json","fetch_events":"https://pith.science/api/pith-number/SHO4UVXS4MK6QSFP7E3FUVBDUH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SHO4UVXS4MK6QSFP7E3FUVBDUH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SHO4UVXS4MK6QSFP7E3FUVBDUH/action/storage_attestation","attest_author":"https://pith.science/pith/SHO4UVXS4MK6QSFP7E3FUVBDUH/action/author_attestation","sign_citation":"https://pith.science/pith/SHO4UVXS4MK6QSFP7E3FUVBDUH/action/citation_signature","submit_replication":"https://pith.science/pith/SHO4UVXS4MK6QSFP7E3FUVBDUH/action/replication_record"}},"created_at":"2026-07-05T03:19:41.357992+00:00","updated_at":"2026-07-05T03:19:41.357992+00:00"}