{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:HB53PZBZIOKI6HRFTWDMWMP3O2","short_pith_number":"pith:HB53PZBZ","schema_version":"1.0","canonical_sha256":"387bb7e43943948f1e259d86cb31fb76b883b1653c0eba1d9b3313f0abb09978","source":{"kind":"arxiv","id":"2011.01055","version":2},"attestation_state":"computed","paper":{"title":"Success-or-Draw: A Strategy Allowing Repeat-Until-Success in Quantum Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Akihito Soeda, Marco T\\'ulio Quintino, Mio Murao, Qingxiuxiong Dong","submitted_at":"2020-11-02T15:38:16Z","abstract_excerpt":"Repeat-until-success strategy is a standard method to obtain success with a probability which grows exponentially in the number of iterations. However, since quantum systems are disturbed after a quantum measurement, it is not straightforward how to perform repeat-until-success strategies in certain quantum algorithms. In this paper, we propose a new structure for probabilistic higher-order transformation named success-or-draw, which allows a repeat-until-success implementation. For that we provide a universal construction of success-or-draw structure which works for any probabilistic higher-o"},"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":"2011.01055","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-11-02T15:38:16Z","cross_cats_sorted":[],"title_canon_sha256":"742c73c779e3a86b11a58486a84847436d83de06b680f78ef81ac8d4923c364b","abstract_canon_sha256":"e5a91c06b3183efedeac5a32a8d3aa6662dcd5f0382273f36649358b09671333"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:32:47.106540Z","signature_b64":"DpU9FfBciuW2iC1nDELQnFTjcAMl22FMltccLjQuQEInAks0ylLdtBPiJGqZBbrBWDkCH08wz/q6WNU5EEtXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"387bb7e43943948f1e259d86cb31fb76b883b1653c0eba1d9b3313f0abb09978","last_reissued_at":"2026-07-05T02:32:47.106066Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:32:47.106066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Success-or-Draw: A Strategy Allowing Repeat-Until-Success in Quantum Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Akihito Soeda, Marco T\\'ulio Quintino, Mio Murao, Qingxiuxiong Dong","submitted_at":"2020-11-02T15:38:16Z","abstract_excerpt":"Repeat-until-success strategy is a standard method to obtain success with a probability which grows exponentially in the number of iterations. However, since quantum systems are disturbed after a quantum measurement, it is not straightforward how to perform repeat-until-success strategies in certain quantum algorithms. In this paper, we propose a new structure for probabilistic higher-order transformation named success-or-draw, which allows a repeat-until-success implementation. For that we provide a universal construction of success-or-draw structure which works for any probabilistic higher-o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.01055","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/2011.01055/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":"2011.01055","created_at":"2026-07-05T02:32:47.106133+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.01055v2","created_at":"2026-07-05T02:32:47.106133+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.01055","created_at":"2026-07-05T02:32:47.106133+00:00"},{"alias_kind":"pith_short_12","alias_value":"HB53PZBZIOKI","created_at":"2026-07-05T02:32:47.106133+00:00"},{"alias_kind":"pith_short_16","alias_value":"HB53PZBZIOKI6HRF","created_at":"2026-07-05T02:32:47.106133+00:00"},{"alias_kind":"pith_short_8","alias_value":"HB53PZBZ","created_at":"2026-07-05T02:32:47.106133+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HB53PZBZIOKI6HRFTWDMWMP3O2","json":"https://pith.science/pith/HB53PZBZIOKI6HRFTWDMWMP3O2.json","graph_json":"https://pith.science/api/pith-number/HB53PZBZIOKI6HRFTWDMWMP3O2/graph.json","events_json":"https://pith.science/api/pith-number/HB53PZBZIOKI6HRFTWDMWMP3O2/events.json","paper":"https://pith.science/paper/HB53PZBZ"},"agent_actions":{"view_html":"https://pith.science/pith/HB53PZBZIOKI6HRFTWDMWMP3O2","download_json":"https://pith.science/pith/HB53PZBZIOKI6HRFTWDMWMP3O2.json","view_paper":"https://pith.science/paper/HB53PZBZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.01055&json=true","fetch_graph":"https://pith.science/api/pith-number/HB53PZBZIOKI6HRFTWDMWMP3O2/graph.json","fetch_events":"https://pith.science/api/pith-number/HB53PZBZIOKI6HRFTWDMWMP3O2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HB53PZBZIOKI6HRFTWDMWMP3O2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HB53PZBZIOKI6HRFTWDMWMP3O2/action/storage_attestation","attest_author":"https://pith.science/pith/HB53PZBZIOKI6HRFTWDMWMP3O2/action/author_attestation","sign_citation":"https://pith.science/pith/HB53PZBZIOKI6HRFTWDMWMP3O2/action/citation_signature","submit_replication":"https://pith.science/pith/HB53PZBZIOKI6HRFTWDMWMP3O2/action/replication_record"}},"created_at":"2026-07-05T02:32:47.106133+00:00","updated_at":"2026-07-05T02:32:47.106133+00:00"}