{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:S3TGV2WJZOM5FAVZCGND2YPMJE","short_pith_number":"pith:S3TGV2WJ","schema_version":"1.0","canonical_sha256":"96e66aeac9cb99d282b9119a3d61ec492df4368c8f8a553e17659ac7a3b7f17a","source":{"kind":"arxiv","id":"2012.06119","version":1},"attestation_state":"computed","paper":{"title":"Solving Inequality-Constrained Binary Optimization Problems on Quantum Annealer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"quant-ph","authors_text":"Kouki Yonaga, Masamichi J. Miyama, Masayuki Ohzeki","submitted_at":"2020-12-11T04:30:16Z","abstract_excerpt":"We propose a new method for solving binary optimization problems under inequality constraints using a quantum annealer. To deal with inequality constraints, we often use slack variables, as in previous approaches. When we use slack variables, we usually conduct a binary expansion, which requires numerous physical qubits. Therefore, the problem of the current quantum annealer is limited to a small scale. In this study, we employ the alternating direction method of multipliers. This approach allows us to deal with various types using constraints in the current quantum annealer without slack vari"},"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.06119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-12-11T04:30:16Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"ac39ef101ec7d70fadf05921cf9badfdaaf7ac9ea15fc413287c1e893944aa82","abstract_canon_sha256":"1917d8fc892f88ae7b919c6d1284cc33b47fe0543ac1ab75cda2f810c0711e7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:58:47.933582Z","signature_b64":"tZ6QPR4lSZGVdjDH/La5h3kFzhxXqg1EceOjN4nxHQRg4gRwMGCELwNsnu7iKsct/2eRSXMoRFAT/qVlJGlJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96e66aeac9cb99d282b9119a3d61ec492df4368c8f8a553e17659ac7a3b7f17a","last_reissued_at":"2026-07-05T01:58:47.933131Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:58:47.933131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Inequality-Constrained Binary Optimization Problems on Quantum Annealer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"quant-ph","authors_text":"Kouki Yonaga, Masamichi J. Miyama, Masayuki Ohzeki","submitted_at":"2020-12-11T04:30:16Z","abstract_excerpt":"We propose a new method for solving binary optimization problems under inequality constraints using a quantum annealer. To deal with inequality constraints, we often use slack variables, as in previous approaches. When we use slack variables, we usually conduct a binary expansion, which requires numerous physical qubits. Therefore, the problem of the current quantum annealer is limited to a small scale. In this study, we employ the alternating direction method of multipliers. This approach allows us to deal with various types using constraints in the current quantum annealer without slack vari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.06119","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/2012.06119/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.06119","created_at":"2026-07-05T01:58:47.933181+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.06119v1","created_at":"2026-07-05T01:58:47.933181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.06119","created_at":"2026-07-05T01:58:47.933181+00:00"},{"alias_kind":"pith_short_12","alias_value":"S3TGV2WJZOM5","created_at":"2026-07-05T01:58:47.933181+00:00"},{"alias_kind":"pith_short_16","alias_value":"S3TGV2WJZOM5FAVZ","created_at":"2026-07-05T01:58:47.933181+00:00"},{"alias_kind":"pith_short_8","alias_value":"S3TGV2WJ","created_at":"2026-07-05T01:58:47.933181+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.20088","citing_title":"CVaR-Assisted Custom Penalty Function for Constrained Optimization","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S3TGV2WJZOM5FAVZCGND2YPMJE","json":"https://pith.science/pith/S3TGV2WJZOM5FAVZCGND2YPMJE.json","graph_json":"https://pith.science/api/pith-number/S3TGV2WJZOM5FAVZCGND2YPMJE/graph.json","events_json":"https://pith.science/api/pith-number/S3TGV2WJZOM5FAVZCGND2YPMJE/events.json","paper":"https://pith.science/paper/S3TGV2WJ"},"agent_actions":{"view_html":"https://pith.science/pith/S3TGV2WJZOM5FAVZCGND2YPMJE","download_json":"https://pith.science/pith/S3TGV2WJZOM5FAVZCGND2YPMJE.json","view_paper":"https://pith.science/paper/S3TGV2WJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.06119&json=true","fetch_graph":"https://pith.science/api/pith-number/S3TGV2WJZOM5FAVZCGND2YPMJE/graph.json","fetch_events":"https://pith.science/api/pith-number/S3TGV2WJZOM5FAVZCGND2YPMJE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S3TGV2WJZOM5FAVZCGND2YPMJE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S3TGV2WJZOM5FAVZCGND2YPMJE/action/storage_attestation","attest_author":"https://pith.science/pith/S3TGV2WJZOM5FAVZCGND2YPMJE/action/author_attestation","sign_citation":"https://pith.science/pith/S3TGV2WJZOM5FAVZCGND2YPMJE/action/citation_signature","submit_replication":"https://pith.science/pith/S3TGV2WJZOM5FAVZCGND2YPMJE/action/replication_record"}},"created_at":"2026-07-05T01:58:47.933181+00:00","updated_at":"2026-07-05T01:58:47.933181+00:00"}