{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:SFAKMWOLZCNLZ7N3GMIWQT7KEX","short_pith_number":"pith:SFAKMWOL","schema_version":"1.0","canonical_sha256":"9140a659cbc89abcfdbb3311684fea25ddbcbe02f53c68717a2754fed6e9e5e5","source":{"kind":"arxiv","id":"0708.1882","version":2},"attestation_state":"computed","paper":{"title":"The role of symmetries in adiabatic quantum algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gernot Schaller, Ralf Sch\\\"utzhold","submitted_at":"2007-08-14T13:35:01Z","abstract_excerpt":"Exploiting the similarity between adiabatic quantum algorithms and quantum phase transitions, we argue that second-order transitions -- typically associated with broken or restored symmetries -- should be advantageous in comparison to first-order transitions. Guided by simple examples we construct an alternative adiabatic algorithm for the NP-complete problem {\\em Exact Cover 3}. We show numerically that its average performance (for the considered cases up to ${\\cal O}\\{20\\}$ qubits) is better than that of the conventional scheme. The run-time of adiabatic algorithms is not just determined by "},"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":"0708.1882","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2007-08-14T13:35:01Z","cross_cats_sorted":[],"title_canon_sha256":"0ffd5f5f6cb9e5d15430b4f27e4073ecb8a11d0f42fd8c6564c71c397303ea7c","abstract_canon_sha256":"4a8b728ee1888a758aaedf627b09946069c7d7a0172aa40d0e3a2c41f407350d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:18:55.821146Z","signature_b64":"Wi8PNHBR8YAjFY3qzi7BsExAND4wEO0mw0yMOwVh2WCRhuVLGIpSPIqz/DsslYKJfGFllRg5sRbtNR3YtNffCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9140a659cbc89abcfdbb3311684fea25ddbcbe02f53c68717a2754fed6e9e5e5","last_reissued_at":"2026-07-04T17:18:55.820737Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:18:55.820737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The role of symmetries in adiabatic quantum algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gernot Schaller, Ralf Sch\\\"utzhold","submitted_at":"2007-08-14T13:35:01Z","abstract_excerpt":"Exploiting the similarity between adiabatic quantum algorithms and quantum phase transitions, we argue that second-order transitions -- typically associated with broken or restored symmetries -- should be advantageous in comparison to first-order transitions. Guided by simple examples we construct an alternative adiabatic algorithm for the NP-complete problem {\\em Exact Cover 3}. We show numerically that its average performance (for the considered cases up to ${\\cal O}\\{20\\}$ qubits) is better than that of the conventional scheme. The run-time of adiabatic algorithms is not just determined by "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0708.1882","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/0708.1882/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":"0708.1882","created_at":"2026-07-04T17:18:55.820803+00:00"},{"alias_kind":"arxiv_version","alias_value":"0708.1882v2","created_at":"2026-07-04T17:18:55.820803+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0708.1882","created_at":"2026-07-04T17:18:55.820803+00:00"},{"alias_kind":"pith_short_12","alias_value":"SFAKMWOLZCNL","created_at":"2026-07-04T17:18:55.820803+00:00"},{"alias_kind":"pith_short_16","alias_value":"SFAKMWOLZCNLZ7N3","created_at":"2026-07-04T17:18:55.820803+00:00"},{"alias_kind":"pith_short_8","alias_value":"SFAKMWOL","created_at":"2026-07-04T17:18:55.820803+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.16163","citing_title":"Improving adiabatic quantum factorization via chopped random-basis optimization","ref_index":72,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SFAKMWOLZCNLZ7N3GMIWQT7KEX","json":"https://pith.science/pith/SFAKMWOLZCNLZ7N3GMIWQT7KEX.json","graph_json":"https://pith.science/api/pith-number/SFAKMWOLZCNLZ7N3GMIWQT7KEX/graph.json","events_json":"https://pith.science/api/pith-number/SFAKMWOLZCNLZ7N3GMIWQT7KEX/events.json","paper":"https://pith.science/paper/SFAKMWOL"},"agent_actions":{"view_html":"https://pith.science/pith/SFAKMWOLZCNLZ7N3GMIWQT7KEX","download_json":"https://pith.science/pith/SFAKMWOLZCNLZ7N3GMIWQT7KEX.json","view_paper":"https://pith.science/paper/SFAKMWOL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0708.1882&json=true","fetch_graph":"https://pith.science/api/pith-number/SFAKMWOLZCNLZ7N3GMIWQT7KEX/graph.json","fetch_events":"https://pith.science/api/pith-number/SFAKMWOLZCNLZ7N3GMIWQT7KEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SFAKMWOLZCNLZ7N3GMIWQT7KEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SFAKMWOLZCNLZ7N3GMIWQT7KEX/action/storage_attestation","attest_author":"https://pith.science/pith/SFAKMWOLZCNLZ7N3GMIWQT7KEX/action/author_attestation","sign_citation":"https://pith.science/pith/SFAKMWOLZCNLZ7N3GMIWQT7KEX/action/citation_signature","submit_replication":"https://pith.science/pith/SFAKMWOLZCNLZ7N3GMIWQT7KEX/action/replication_record"}},"created_at":"2026-07-04T17:18:55.820803+00:00","updated_at":"2026-07-04T17:18:55.820803+00:00"}