{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YK7GT7ZUMUBQ5JOHYRM54CMOUH","short_pith_number":"pith:YK7GT7ZU","schema_version":"1.0","canonical_sha256":"c2be69ff3465030ea5c7c459de098ea1e75a48aafcc945826b207cbd347984cc","source":{"kind":"arxiv","id":"1901.04405","version":2},"attestation_state":"computed","paper":{"title":"Quadratization in discrete optimization and quantum mechanics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.DM","math.OC","physics.chem-ph"],"primary_cat":"quant-ph","authors_text":"Nike Dattani","submitted_at":"2019-01-14T17:06:40Z","abstract_excerpt":"A book about turning high-degree optimization problems into quadratic optimization problems that maintain the same global minimum (ground state). This book explores quadratizations for pseudo-Boolean optimization, perturbative gadgets used in QMA completeness theorems, and also non-perturbative k-local to 2-local transformations used for quantum mechanics, quantum annealing and universal adiabatic quantum computing. The book contains ~70 different Hamiltonian transformations, each of them on a separate page, where the cost (in number of auxiliary binary variables or auxiliary qubits, or number"},"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":"1901.04405","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-14T17:06:40Z","cross_cats_sorted":["cs.CV","cs.DM","math.OC","physics.chem-ph"],"title_canon_sha256":"7f57841d66ce21490a4a4b104c648195c6817bf2621904fae13a5cc05af17a99","abstract_canon_sha256":"a3a0eaea644bae8e923795b1477c08125fe761a42ae0955f8d0a331f713190ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:06:05.959224Z","signature_b64":"aml7MscBvGggeuzlN5PUlQ20wGNLmZLaBwoL4wjzlEbodbxfLaxC3lydxA33Tm7aLF+bjmv8BfyrmZcpbaa7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2be69ff3465030ea5c7c459de098ea1e75a48aafcc945826b207cbd347984cc","last_reissued_at":"2026-07-05T00:06:05.958799Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:06:05.958799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quadratization in discrete optimization and quantum mechanics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.DM","math.OC","physics.chem-ph"],"primary_cat":"quant-ph","authors_text":"Nike Dattani","submitted_at":"2019-01-14T17:06:40Z","abstract_excerpt":"A book about turning high-degree optimization problems into quadratic optimization problems that maintain the same global minimum (ground state). This book explores quadratizations for pseudo-Boolean optimization, perturbative gadgets used in QMA completeness theorems, and also non-perturbative k-local to 2-local transformations used for quantum mechanics, quantum annealing and universal adiabatic quantum computing. The book contains ~70 different Hamiltonian transformations, each of them on a separate page, where the cost (in number of auxiliary binary variables or auxiliary qubits, or number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04405","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/1901.04405/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":"1901.04405","created_at":"2026-07-05T00:06:05.958855+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.04405v2","created_at":"2026-07-05T00:06:05.958855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04405","created_at":"2026-07-05T00:06:05.958855+00:00"},{"alias_kind":"pith_short_12","alias_value":"YK7GT7ZUMUBQ","created_at":"2026-07-05T00:06:05.958855+00:00"},{"alias_kind":"pith_short_16","alias_value":"YK7GT7ZUMUBQ5JOH","created_at":"2026-07-05T00:06:05.958855+00:00"},{"alias_kind":"pith_short_8","alias_value":"YK7GT7ZU","created_at":"2026-07-05T00:06:05.958855+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.12301","citing_title":"An iterative Ising decoder for quantum error correction codes","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2501.19221","citing_title":"VeloxQ: A Fast and Efficient QUBO Solver","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16955","citing_title":"From Constraint to Code: DQI-Kit -- A Software Framework for Decoded Quantum Interferometry","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2510.06337","citing_title":"Recent quantum runtime (dis)advantages","ref_index":67,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12139","citing_title":"BoolXLLM: LLM-Assisted Explainability for Boolean Models","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01620","citing_title":"Structured Parameterization and Non-Stabilizerness in Hypergraph QAOA","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06857","citing_title":"Quantum Annealing: Optimisation, Sampling, and Many-Body Dynamics","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YK7GT7ZUMUBQ5JOHYRM54CMOUH","json":"https://pith.science/pith/YK7GT7ZUMUBQ5JOHYRM54CMOUH.json","graph_json":"https://pith.science/api/pith-number/YK7GT7ZUMUBQ5JOHYRM54CMOUH/graph.json","events_json":"https://pith.science/api/pith-number/YK7GT7ZUMUBQ5JOHYRM54CMOUH/events.json","paper":"https://pith.science/paper/YK7GT7ZU"},"agent_actions":{"view_html":"https://pith.science/pith/YK7GT7ZUMUBQ5JOHYRM54CMOUH","download_json":"https://pith.science/pith/YK7GT7ZUMUBQ5JOHYRM54CMOUH.json","view_paper":"https://pith.science/paper/YK7GT7ZU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.04405&json=true","fetch_graph":"https://pith.science/api/pith-number/YK7GT7ZUMUBQ5JOHYRM54CMOUH/graph.json","fetch_events":"https://pith.science/api/pith-number/YK7GT7ZUMUBQ5JOHYRM54CMOUH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YK7GT7ZUMUBQ5JOHYRM54CMOUH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YK7GT7ZUMUBQ5JOHYRM54CMOUH/action/storage_attestation","attest_author":"https://pith.science/pith/YK7GT7ZUMUBQ5JOHYRM54CMOUH/action/author_attestation","sign_citation":"https://pith.science/pith/YK7GT7ZUMUBQ5JOHYRM54CMOUH/action/citation_signature","submit_replication":"https://pith.science/pith/YK7GT7ZUMUBQ5JOHYRM54CMOUH/action/replication_record"}},"created_at":"2026-07-05T00:06:05.958855+00:00","updated_at":"2026-07-05T00:06:05.958855+00:00"}