{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:DGLWGBATRSBSPNYVGVVRMOCX5R","short_pith_number":"pith:DGLWGBAT","schema_version":"1.0","canonical_sha256":"19976304138c8327b715356b163857ec5ee45bb28afda49f89582eefc7c1d98b","source":{"kind":"arxiv","id":"2109.01714","version":1},"attestation_state":"computed","paper":{"title":"Accelerating Variational Quantum Algorithms Using Circuit Concurrency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.ET","authors_text":"Anthony Gutierrez, Gabriel Loh, Joon Suk Huh, Mark Oskin, Salonik Resch, Srikant Bharadwaj, Swamit Tannu, Yasuko Eckert","submitted_at":"2021-09-03T19:31:36Z","abstract_excerpt":"Variational quantum algorithms (VQAs) provide a promising approach to achieve quantum advantage in the noisy intermediate-scale quantum era. In this era, quantum computers experience high error rates and quantum error detection and correction is not feasible. VQAs can utilize noisy qubits in tandem with classical optimization algorithms to solve hard problems. However, VQAs are still slow relative to their classical counterparts. Hence, improving the performance of VQAs will be necessary to make them competitive. While VQAs are expected perform better as the problem sizes increase, increasing "},"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":"2109.01714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2021-09-03T19:31:36Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"f7aa1f19fba2ca1800fac50fba59ad86142bc7b6005d580ea1a2dc178dbb12db","abstract_canon_sha256":"6766112e6103a36c596747323577f75f1a6c9ad9cdd63a0c26244f8eeb174bd5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:11:49.731326Z","signature_b64":"Y8o+CXasOQQ3fHny79iPoSh4w61YDqH2soyKo9ieJY879q7EqIszQwmdPKg8QTTbrYJ3c6SBJqBHbolpYp1bBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19976304138c8327b715356b163857ec5ee45bb28afda49f89582eefc7c1d98b","last_reissued_at":"2026-07-05T03:11:49.730887Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:11:49.730887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating Variational Quantum Algorithms Using Circuit Concurrency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.ET","authors_text":"Anthony Gutierrez, Gabriel Loh, Joon Suk Huh, Mark Oskin, Salonik Resch, Srikant Bharadwaj, Swamit Tannu, Yasuko Eckert","submitted_at":"2021-09-03T19:31:36Z","abstract_excerpt":"Variational quantum algorithms (VQAs) provide a promising approach to achieve quantum advantage in the noisy intermediate-scale quantum era. In this era, quantum computers experience high error rates and quantum error detection and correction is not feasible. VQAs can utilize noisy qubits in tandem with classical optimization algorithms to solve hard problems. However, VQAs are still slow relative to their classical counterparts. Hence, improving the performance of VQAs will be necessary to make them competitive. While VQAs are expected perform better as the problem sizes increase, increasing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.01714","kind":"arxiv","version":1},"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/2109.01714/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":"2109.01714","created_at":"2026-07-05T03:11:49.730946+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.01714v1","created_at":"2026-07-05T03:11:49.730946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.01714","created_at":"2026-07-05T03:11:49.730946+00:00"},{"alias_kind":"pith_short_12","alias_value":"DGLWGBATRSBS","created_at":"2026-07-05T03:11:49.730946+00:00"},{"alias_kind":"pith_short_16","alias_value":"DGLWGBATRSBSPNYV","created_at":"2026-07-05T03:11:49.730946+00:00"},{"alias_kind":"pith_short_8","alias_value":"DGLWGBAT","created_at":"2026-07-05T03:11:49.730946+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.27540","citing_title":"EFaaS: A Quantum-Classical Serverless Entangled Scheduler for Hybrid Variational Algorithms","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DGLWGBATRSBSPNYVGVVRMOCX5R","json":"https://pith.science/pith/DGLWGBATRSBSPNYVGVVRMOCX5R.json","graph_json":"https://pith.science/api/pith-number/DGLWGBATRSBSPNYVGVVRMOCX5R/graph.json","events_json":"https://pith.science/api/pith-number/DGLWGBATRSBSPNYVGVVRMOCX5R/events.json","paper":"https://pith.science/paper/DGLWGBAT"},"agent_actions":{"view_html":"https://pith.science/pith/DGLWGBATRSBSPNYVGVVRMOCX5R","download_json":"https://pith.science/pith/DGLWGBATRSBSPNYVGVVRMOCX5R.json","view_paper":"https://pith.science/paper/DGLWGBAT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.01714&json=true","fetch_graph":"https://pith.science/api/pith-number/DGLWGBATRSBSPNYVGVVRMOCX5R/graph.json","fetch_events":"https://pith.science/api/pith-number/DGLWGBATRSBSPNYVGVVRMOCX5R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DGLWGBATRSBSPNYVGVVRMOCX5R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DGLWGBATRSBSPNYVGVVRMOCX5R/action/storage_attestation","attest_author":"https://pith.science/pith/DGLWGBATRSBSPNYVGVVRMOCX5R/action/author_attestation","sign_citation":"https://pith.science/pith/DGLWGBATRSBSPNYVGVVRMOCX5R/action/citation_signature","submit_replication":"https://pith.science/pith/DGLWGBATRSBSPNYVGVVRMOCX5R/action/replication_record"}},"created_at":"2026-07-05T03:11:49.730946+00:00","updated_at":"2026-07-05T03:11:49.730946+00:00"}