{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HQ2ND2H7LW6A26ZMHZXLKQG5AS","short_pith_number":"pith:HQ2ND2H7","schema_version":"1.0","canonical_sha256":"3c34d1e8ff5dbc0d7b2c3e6eb540dd048a0d9ab2767ec15c2ef30c82339bf58b","source":{"kind":"arxiv","id":"1903.04500","version":3},"attestation_state":"computed","paper":{"title":"Universal Variational Quantum Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jacob Biamonte","submitted_at":"2019-03-11T18:00:02Z","abstract_excerpt":"Variational quantum algorithms dominate contemporary gate-based quantum enhanced optimisation, eigenvalue estimation and machine learning. Here we establish the quantum computational universality of variational quantum computation by developing two objective functions which minimise to prepare outputs of arbitrary quantum circuits. The fleeting resource of variational quantum computation is the number of expected values which must be iteratively minimised using classical-to-quantum outer loop optimisation. An efficient solution to this optimisation problem is given by the quantum circuit being"},"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":"1903.04500","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-03-11T18:00:02Z","cross_cats_sorted":[],"title_canon_sha256":"c960d087a5e3315e1b058a2ff1738e8e6ac5ff9f6686c3d95b191aba9b7006e3","abstract_canon_sha256":"07e7d883a948a66c041b419bed26545c772fc60b85b28e638ab0dbc35710b472"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:42:24.039501Z","signature_b64":"gFsBpk+B4EhBeXCKUNDngExFdcDEHopYPmEN8T9wOLEbJJF7rDY2o8S6/QYnLXoUfEKPexJNNknURpW3De+QAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c34d1e8ff5dbc0d7b2c3e6eb540dd048a0d9ab2767ec15c2ef30c82339bf58b","last_reissued_at":"2026-07-05T02:42:24.039011Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:42:24.039011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Variational Quantum Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jacob Biamonte","submitted_at":"2019-03-11T18:00:02Z","abstract_excerpt":"Variational quantum algorithms dominate contemporary gate-based quantum enhanced optimisation, eigenvalue estimation and machine learning. Here we establish the quantum computational universality of variational quantum computation by developing two objective functions which minimise to prepare outputs of arbitrary quantum circuits. The fleeting resource of variational quantum computation is the number of expected values which must be iteratively minimised using classical-to-quantum outer loop optimisation. An efficient solution to this optimisation problem is given by the quantum circuit being"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04500","kind":"arxiv","version":3},"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/1903.04500/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":"1903.04500","created_at":"2026-07-05T02:42:24.039073+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.04500v3","created_at":"2026-07-05T02:42:24.039073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04500","created_at":"2026-07-05T02:42:24.039073+00:00"},{"alias_kind":"pith_short_12","alias_value":"HQ2ND2H7LW6A","created_at":"2026-07-05T02:42:24.039073+00:00"},{"alias_kind":"pith_short_16","alias_value":"HQ2ND2H7LW6A26ZM","created_at":"2026-07-05T02:42:24.039073+00:00"},{"alias_kind":"pith_short_8","alias_value":"HQ2ND2H7","created_at":"2026-07-05T02:42:24.039073+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.06229","citing_title":"Quantum solvability of noisy linear problems by divide-and-conquer strategy","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HQ2ND2H7LW6A26ZMHZXLKQG5AS","json":"https://pith.science/pith/HQ2ND2H7LW6A26ZMHZXLKQG5AS.json","graph_json":"https://pith.science/api/pith-number/HQ2ND2H7LW6A26ZMHZXLKQG5AS/graph.json","events_json":"https://pith.science/api/pith-number/HQ2ND2H7LW6A26ZMHZXLKQG5AS/events.json","paper":"https://pith.science/paper/HQ2ND2H7"},"agent_actions":{"view_html":"https://pith.science/pith/HQ2ND2H7LW6A26ZMHZXLKQG5AS","download_json":"https://pith.science/pith/HQ2ND2H7LW6A26ZMHZXLKQG5AS.json","view_paper":"https://pith.science/paper/HQ2ND2H7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.04500&json=true","fetch_graph":"https://pith.science/api/pith-number/HQ2ND2H7LW6A26ZMHZXLKQG5AS/graph.json","fetch_events":"https://pith.science/api/pith-number/HQ2ND2H7LW6A26ZMHZXLKQG5AS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HQ2ND2H7LW6A26ZMHZXLKQG5AS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HQ2ND2H7LW6A26ZMHZXLKQG5AS/action/storage_attestation","attest_author":"https://pith.science/pith/HQ2ND2H7LW6A26ZMHZXLKQG5AS/action/author_attestation","sign_citation":"https://pith.science/pith/HQ2ND2H7LW6A26ZMHZXLKQG5AS/action/citation_signature","submit_replication":"https://pith.science/pith/HQ2ND2H7LW6A26ZMHZXLKQG5AS/action/replication_record"}},"created_at":"2026-07-05T02:42:24.039073+00:00","updated_at":"2026-07-05T02:42:24.039073+00:00"}