{"as_of":"2026-08-12T19:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9162d85f2e730c6dc4389d1b5b49e1e5fefcc170bcc61d31f903c304ae369337","coverage":[{"denominator":59,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":59,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T15:20:56.227895Z","state":"measured"},{"denominator":60,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":60,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T02:57:14.073182Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T12:46:25.266238Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"cited_work":{"arxiv_id":"2509.20052","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.20052","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Nontrivial multi- product commutation relation for reducing T-count in sequential Pauli- based computation","venue":null,"work_id":"bc6554ba-27de-42f5-a078-7c5ef37e7a9f","year":2025},"citing_paper":{"arxiv_id":"2604.19717","last_updated":"2026-04-21T17:43:44Z","snapshot_observed_at":"2026-08-08T02:20:55.570707Z","submitted_at":"2026-04-21T17:43:44Z","title":"Qubit Routing for (Almost) Free","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-10T02:57:14.073182Z"},"links":{"cited_paper":"/paper/2509.20052","citing_paper":"/paper/2604.19717"},"observation_digest":"sha256:d234e8928c6f3f736ea9c5d2c014a5663706ba120015cbe96263b1f75376245e","observation_id":"53d39b43-06d7-4461-9aa3-4acd6a47f391","resolution":{"observed_at":"2026-06-02T04:04:48.485991Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2509.20052/citation-record","integrity":"/paper/2509.20052/integrity","json":"/paper/2509.20052/citation-record.json","paper":"/paper/2509.20052"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.639922Z","title":"Although its primary focus is on circuit depth reduction, it also includes aT- count optimization pass","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.639922Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:dd56f44cc1fd13a66b9e07a97d3b8bdba43e8ebf66740a418bfc58104c8351a6","observation_id":"ed2b83b0-6946-4093-80fd-a61a2e7c5029","resolution":{"observed_at":"2026-08-04T15:20:55.639922Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.650100Z","title":"It includes graph-theoretic optimization techniques such as local complemen- tation and pivoting [21, 22] usingX-Spiders and Z-Spiders","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.650100Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:78a2827e62b93a6863304bc79aa3e2de8bb6958ac3e60961a8f954740f79c7e8","observation_id":"14d76b74-073c-4ec4-9e0c-9fd2bdb7a5d6","resolution":{"observed_at":"2026-08-04T15:20:55.650100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.657677Z","title":"As described in Sec","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.657677Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:4871ce279bd876793af3c766f7f6dfda491aa6543ca0253d58e2f0262928ccf6","observation_id":"0074c77e-743f-413c-ad56-36e5f21b0f95","resolution":{"observed_at":"2026-08-04T15:20:55.657677Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.664639Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.664639Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:5fd13f8bb3ddfe2d691fa1dd11c746eaaf3a6cf776adfea39f354da523fab919","observation_id":"1518c150-ab10-46f0-9109-7d9a88a3e2de","resolution":{"observed_at":"2026-08-04T15:20:55.664639Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.671790Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.671790Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:212ab97123aa9b7904f73ac3922a2ef6cf46df3267de5ab7399cf89f964f548d","observation_id":"1620d3f2-8166-4d8a-844b-5af376ddd7f7","resolution":{"observed_at":"2026-08-04T15:20:55.671790Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.678614Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.678614Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:7cb55d938312dcea0c55b9da4797368e3e674e7c2fcb43e6ab1b2a30c6deb708","observation_id":"fa522289-56e3-46de-a1db-56a4babd5e4b","resolution":{"observed_at":"2026-08-04T15:20:55.678614Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.688790Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.688790Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:61462199b31c99cbab27c92ccf5c72b543b0b1d060145e2f7ed249478774ed4a","observation_id":"1f76344e-1238-4b69-af1e-82794e060bcd","resolution":{"observed_at":"2026-08-04T15:20:55.688790Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.696071Z","title":"Let us determine the number of ways to select the ro- tation axes according to this procedure","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.696071Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:3e69764189538c8d0e3f8a3c8d782bda09aa101164bece4e62304d7288af19f0","observation_id":"a658961e-da74-4cf9-ba9e-412f7f7baa1e","resolution":{"observed_at":"2026-08-04T15:20:55.696071Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.706052Z","title":null,"venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.706052Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:d1749100915c45f9e119a52eb75aa7cdcc880f2aa0ced1386b0a20711a44f28f","observation_id":"be8595cf-dd48-4f7e-84ac-e05e65bd548e","resolution":{"observed_at":"2026-08-04T15:20:55.706052Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.726667Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.726667Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:42e21e025b74bde21e9b7746b17b23f2c08cfe10f06bbc4e073eec29cd5fd6b7","observation_id":"8c42c82c-9592-4c94-a642-c03f07ca1a57","resolution":{"observed_at":"2026-08-04T15:20:55.726667Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.735851Z","title":"Lloyd, Universal quantum simulators, Science273, 1073 (1996)","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.735851Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:68210edd10790c2641cc9864a3e0c8454862c0a34307756c317dbb0e3afb806b","observation_id":"7e937774-cf82-42a1-87ec-026441689b94","resolution":{"observed_at":"2026-08-04T15:20:55.735851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.744379Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.744379Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:fe2379867d5520a7fae14abb25c0b41bc556cb2983e2f6656291c9be20fdfd32","observation_id":"77df8d39-f9cf-4de6-a5a1-bc1554674f76","resolution":{"observed_at":"2026-08-04T15:20:55.744379Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.752985Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.752985Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:35ec9dbbd26b57fcd29f4479378d5941cff285d67a65e0c05deec44cea71d425","observation_id":"ffac96ae-c0b6-437c-a976-85e602af48e3","resolution":{"observed_at":"2026-08-04T15:20:55.752985Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.762287Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.762287Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:de0630361be32cb32e2ec3907a91f7e029a91e3eeacc74a31538a9a7e1e6c502","observation_id":"9e94582a-b447-4886-b132-7c86b314ba28","resolution":{"observed_at":"2026-08-04T15:20:55.762287Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.772303Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.772303Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:d45c362edfb54fca77eb189bcd332d109fe39001c6e1b0dd5756b7dd5ac4c9d8","observation_id":"6a4ed3ee-6448-4741-9ac2-c082cf0e830f","resolution":{"observed_at":"2026-08-04T15:20:55.772303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.781221Z","title":"Bravyi and A","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.781221Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:fa7c8ed6bfef5599e889cb2988a394e37e3ed648cc1c2e3561b09cffd863a037","observation_id":"cea9aa1d-8593-461f-a202-9f24361f4722","resolution":{"observed_at":"2026-08-04T15:20:55.781221Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.796040Z","title":"Svore, A","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.796040Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:85bd597756ed317fda43cd5c752f5f015bc7644d75416ce91b74b424c76a7517","observation_id":"306ea029-3b55-4803-9116-79cb1ad08c18","resolution":{"observed_at":"2026-08-04T15:20:55.796040Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.804825Z","title":"H¨ aner, D","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.804825Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:1ba4713fa4d249d5c109f98673cbaeb494bf38286ba5ea2407bea8a782f8e6fc","observation_id":"333f1bfa-f226-41c5-a83e-608f63690f22","resolution":{"observed_at":"2026-08-04T15:20:55.804825Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.813291Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.813291Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:47202ef3cd2134cadcdc5cac102e6ee2702b536b7c7ecefc519cad9a99f2b0cb","observation_id":"989f21bc-7924-41ee-9554-33e8d7bf69aa","resolution":{"observed_at":"2026-08-04T15:20:55.813291Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.821675Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.821675Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:aa49b150929cb095f796d1185e4a698bf8118c1b175728833e17887a90f39471","observation_id":"f52fde27-e9fe-4ace-bdb8-3d9623a251aa","resolution":{"observed_at":"2026-08-04T15:20:55.821675Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.829725Z","title":"Shende, S","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.829725Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:648703b28be778b1189921b566e701dee37565fc5269a8151d22e1eec9f1d865","observation_id":"e1f2dbcb-36d7-40eb-a950-a6a59218f7a5","resolution":{"observed_at":"2026-08-04T15:20:55.829725Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0505030","last_updated":"2005-08-23T01:12:00Z","snapshot_observed_at":"2026-07-07T07:19:07.719177Z","submitted_at":"2005-05-06T00:55:45Z","title":"The Solovay-Kitaev algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0505030","snapshot_observed_at":"2026-08-04T15:20:55.844344Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.844344Z"},"links":{"cited_paper":"/paper/quant-ph/0505030","citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:d6e6c40c53fe3dcc0e4be6fb72935c2d1d9a9951d2cca7c067deb32452efad64","observation_id":"30944077-145e-4551-a4fe-5e78836be312","resolution":{"observed_at":"2026-08-04T15:20:55.844344Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1403.2975","last_updated":"2016-06-15T08:46:03Z","snapshot_observed_at":"2026-08-09T05:56:44.444450Z","submitted_at":"2014-03-12T15:37:00Z","title":"Optimal ancilla-free Clifford+T approximation of z-rotations","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1403.2975","snapshot_observed_at":"2026-08-04T15:20:55.855385Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.855385Z"},"links":{"cited_paper":"/paper/1403.2975","citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:950d8015007899cdf7a1ec695b2e8253ab6d8393be6468f190122682ad40c747","observation_id":"45dc6114-105b-4968-a159-bf3231f4fc34","resolution":{"observed_at":"2026-08-04T15:20:55.855385Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.864644Z","title":"Cowtan, S","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.864644Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:6f5c1096af249b5c8bdca894f8fe1342b7b61148c3dc8f975aed4b994c7a996b","observation_id":"94cb5189-ff4b-4ae1-8d13-444509b8f242","resolution":{"observed_at":"2026-08-04T15:20:55.864644Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.876251Z","title":"Treinish, J","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.876251Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:e06002264ce007a234378286a6849b2deb46e14fc1988634f95501308de0c6a1","observation_id":"bc2cb7b8-3053-4812-bf90-97653d7dc002","resolution":{"observed_at":"2026-08-04T15:20:55.876251Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.888263Z","title":"Sivarajah, S","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.888263Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:44fef7084a0bc6331b21d0a7d8d37c23a43ee7a865793c4b84ce9a7dc55cffd8","observation_id":"8d59adf4-5b18-44c4-9073-457fdd013412","resolution":{"observed_at":"2026-08-04T15:20:55.888263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.898540Z","title":"Amy and V","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.898540Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:ef13b9a56df13126fc8ef8e95c376664afd99d67242c0e46206ccde9b59f8ce4","observation_id":"92207389-609d-4937-8800-8b4573fea568","resolution":{"observed_at":"2026-08-04T15:20:55.898540Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.905962Z","title":"Coecke and R","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.905962Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:7e902561c937f6da5801b8363d9e7d79a3281dc746845a07a085550225d14cc2","observation_id":"bb4ec787-38b4-4b06-bf26-f41e7d5ca106","resolution":{"observed_at":"2026-08-04T15:20:55.905962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.916165Z","title":"Duncan, A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.916165Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:2fb070fb7168e021ceaa0b72691f89b9e098f4da68a01cc9e0db9a35c40738eb","observation_id":"41283f6c-8196-4cfc-9f48-d5fe76dd9412","resolution":{"observed_at":"2026-08-04T15:20:55.916165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.924648Z","title":"Kissinger and J","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.924648Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:51459891aef49614343e451cfd19020a176bea8bff27a667d17def49deb70df2","observation_id":"fb5ed8f3-a14c-437e-bbbd-2f0d9eb53681","resolution":{"observed_at":"2026-08-04T15:20:55.924648Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.932843Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.932843Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:505ecab1463c1221c8ff5e2da12f6bd68110de6e9d8bf81fa052a33c4fcd5801","observation_id":"269ba612-513f-41cf-823a-4cf543160ff9","resolution":{"observed_at":"2026-08-04T15:20:55.932843Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.943810Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.943810Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:dd3419931e48d2d6ee296c23a861d0fdc29aa901098e0578fa6a35d93a6475f0","observation_id":"e3b309e1-c812-4179-8932-04eaccb10dac","resolution":{"observed_at":"2026-08-04T15:20:55.943810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.952622Z","title":"Amy and M","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.952622Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:cd7cc656dbefba3565a34854f024eec568efa9aa6659911396cfc5361625da3d","observation_id":"88197d21-d726-4985-baa3-74ee9db217b8","resolution":{"observed_at":"2026-08-04T15:20:55.952622Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.965640Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.965640Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:82a38ac54e4a70a279d6ea8e189a3dcfc10bd63e597140d1821bc637b9dec527","observation_id":"1cd032e8-a4e4-4de4-a522-5b38bd767526","resolution":{"observed_at":"2026-08-04T15:20:55.965640Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.974958Z","title":"Vandaele, LowerT-count with faster algorithms, Quantum9, 1860 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.974958Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:fdb3a52ab72632cd4a06d52298e31bdfe589b96c03ffbabc3feeb7ba73fb4df6","observation_id":"2e91b362-8a0d-4eca-98b5-3c14d6883368","resolution":{"observed_at":"2026-08-04T15:20:55.974958Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:55.980955Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.980955Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:4fbfef0b3a051ae36c0cea4c7c2685036e028f093f1ee50907e9e54e4ec4f266","observation_id":"105b3929-7a7e-45b5-90d7-a1a3e13907a4","resolution":{"observed_at":"2026-08-04T15:20:55.980955Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1308.4134","last_updated":"2013-08-19T20:00:01Z","snapshot_observed_at":"2026-07-06T03:20:57.363489Z","submitted_at":"2013-08-19T20:00:01Z","title":"An algorithm for the T-count","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1308.4134","snapshot_observed_at":"2026-08-04T15:20:55.994799Z","title":"Gosset, V","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:55.994799Z"},"links":{"cited_paper":"/paper/1308.4134","citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:86829d9685618c8eae827c3374f8a10b84cd2c0b75d7b96f3745ba07be5e9230","observation_id":"49d166db-d68d-446b-83c8-c316dedbd288","resolution":{"observed_at":"2026-08-04T15:20:55.994799Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:56.006466Z","title":"Litinski, A game of surface codes: Large-scale quan- tum computing with lattice surgery, Quantum3, 128 (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:56.006466Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:79e4b8e668ad269d9056144408bf123f9f2b0a1c98a96f802749c2eaaad6c55d","observation_id":"ee8623ca-c425-43ab-a056-127dbb41b473","resolution":{"observed_at":"2026-08-04T15:20:56.006466Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:56.017212Z","title":"Hirano and K","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:56.017212Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:7565aecffe3ab7192fa293b09a0c5588741e217aac4fb34718c1bfbd38e0f4cd","observation_id":"14ce1bdc-ae7b-4f97-96b7-d46f23aab30b","resolution":{"observed_at":"2026-08-04T15:20:56.017212Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1903.12456","last_updated":"2019-03-29T11:55:10Z","snapshot_observed_at":"2026-07-06T07:42:29.865230Z","submitted_at":"2019-03-29T11:55:10Z","title":"Optimizing T gates in Clifford+T circuit as $\\pi/4$ rotations around Paulis","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.12456","snapshot_observed_at":"2026-08-04T15:20:56.025297Z","title":"Zhang and J","venue":null,"work_id":null,"year":1903},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:56.025297Z"},"links":{"cited_paper":"/paper/1903.12456","citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:dfa54cb724c215f00a8976e0833b732d8d61ac7f090dc1e401edd05c5fecac2b","observation_id":"88174568-98d1-4cc1-9046-1d1fb98935f5","resolution":{"observed_at":"2026-08-04T15:20:56.025297Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.07846","last_updated":"2024-07-10T17:08:18Z","snapshot_observed_at":"2026-07-06T18:44:24.873040Z","submitted_at":"2024-07-10T17:08:18Z","title":"Optimal number of parametrized rotations and Hadamard gates in parametrized Clifford circuits with non-repeated parameters","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.07846","snapshot_observed_at":"2026-08-04T15:20:56.033056Z","title":"Vandaele, S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:56.033056Z"},"links":{"cited_paper":"/paper/2407.07846","citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:286ea407df4c21c29e6eb73f15d31db98f178adc8bd8761cd063a5b7385cc3d6","observation_id":"14e6c886-a9ae-4a12-b9b6-ad173a8aa381","resolution":{"observed_at":"2026-08-04T15:20:56.033056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:56.046991Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:56.046991Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:9b7367138dabf5e08278414213f8f1bf7e247bd4806498030e1a8b815fa58fc2","observation_id":"d519c1fe-b633-4e80-a897-b5821e7b988c","resolution":{"observed_at":"2026-08-04T15:20:56.046991Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:56.054613Z","title":"Kissinger and J","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:56.054613Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:41cca190372b7a436a46eb9d3a46ebdd0709629700ee2273829b176c4716688e","observation_id":"f9d23759-08d4-421d-994d-6dd5feb182f2","resolution":{"observed_at":"2026-08-04T15:20:56.054613Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:56.077620Z","title":"Gidney, Stim: a fast stabilizer circuit simulator, Quan- tum5, 497 (2021)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:56.077620Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:78f29021335e56bf7a5f4f2155f172a63c411211ba84784d5cf3f0a39f3f3e9c","observation_id":"475e62ce-fd7d-4cab-85e9-a76223a19efc","resolution":{"observed_at":"2026-08-04T15:20:56.077620Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.03429","last_updated":"2017-07-13T21:23:15Z","snapshot_observed_at":"2026-07-06T05:50:42.132417Z","submitted_at":"2017-07-11T18:49:44Z","title":"Open Quantum Assembly Language","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.03429","snapshot_observed_at":"2026-08-04T15:20:56.086296Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:56.086296Z"},"links":{"cited_paper":"/paper/1707.03429","citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:d3db17a881080ff1f85ee2209e606bc82398d76cdc71275da74c7d7e4d589832","observation_id":"141a15dd-4b5e-457e-9731-c468cace9342","resolution":{"observed_at":"2026-08-04T15:20:56.086296Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:56.095706Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:56.095706Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:a2fa9cb5d32c033cd3840870a8c7e43a6b44941bba1428d7292ad804b1966093","observation_id":"dca0ab12-e516-4446-813f-80f086c2b4c5","resolution":{"observed_at":"2026-08-04T15:20:56.095706Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17543","last_updated":"2024-05-27T18:00:00Z","snapshot_observed_at":"2026-07-06T18:20:52.408832Z","submitted_at":"2024-05-27T18:00:00Z","title":"The MQT Handbook: A Summary of Design Automation Tools and Software for Quantum Computing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.17543","snapshot_observed_at":"2026-08-04T15:20:56.101425Z","title":"Wille, L","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:56.101425Z"},"links":{"cited_paper":"/paper/2405.17543","citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:214e8d62c58b4a9d6269f07cf50a610ade5914caf4ec82c87ef88ec5dc0953e9","observation_id":"66c9fca1-db83-44f9-a4a4-3161554cc751","resolution":{"observed_at":"2026-08-04T15:20:56.101425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:56.116833Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:56.116833Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:3f9a5a1b2dfe461804a5a77043551d7acfc3333a1278da4a0430aa390982966e","observation_id":"11833983-ece4-4059-84eb-285ded93ab93","resolution":{"observed_at":"2026-08-04T15:20:56.116833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:56.128555Z","title":"Peruzzo, J","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:56.128555Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:1c84070576a6f966a6abe9900173e9519003b72d0a4e9413b0886e20b31c0dd1","observation_id":"61d53d9e-3d13-4683-adf0-2ac3ad278612","resolution":{"observed_at":"2026-08-04T15:20:56.128555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1411.4028","last_updated":"2014-11-14T19:57:57Z","snapshot_observed_at":"2026-07-06T04:00:38.324755Z","submitted_at":"2014-11-14T19:57:57Z","title":"A Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-08-04T15:20:56.136392Z","title":"Farhi, J","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:56.136392Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:75083018d1dba9965d8f14b19f9a0a11f9f91f4f869306d75f6683cb7cbd5085","observation_id":"83d58532-b5f4-4110-a0d3-a62486b7c264","resolution":{"observed_at":"2026-08-04T15:20:56.136392Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:56.146405Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:56.146405Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:aa43df5ebdaa65a6183718281c291f86b5a58920a578d356a84b455c2a22a120","observation_id":"765e9434-24c7-4942-921c-911dd30be8d8","resolution":{"observed_at":"2026-08-04T15:20:56.146405Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:56.153393Z","title":"Akahoshi, K","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:56.153393Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:c02f465204d66ce66eb9d5a01d4b7c369a221a18bbf3220b186dacf8ce9c163e","observation_id":"a75f5ddc-3269-4e9e-a7f6-364b06020f62","resolution":{"observed_at":"2026-08-04T15:20:56.153393Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:56.164636Z","title":"Toshio, Y","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:56.164636Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:75c8b881c5e8fab0f0f17c7ce6a18f8d647cd053ac4f6187c3ac21cca677e806","observation_id":"8127c4ad-1c49-4cb1-a8ea-cd22694981d2","resolution":{"observed_at":"2026-08-04T15:20:56.164636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:56.174425Z","title":"van de Wetering, R","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:56.174425Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:d285af47e5f905a2bb486bd5806793db1d7c2245276ba2f8098de1d5a8eaa01f","observation_id":"eecfe4af-5e39-4bf6-979a-4a5515502245","resolution":{"observed_at":"2026-08-04T15:20:56.174425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:56.186440Z","title":"Nakano, H","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:56.186440Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:fc332f755ad679194b5b9f775be33b48f1853edac684c677bfeff92bb06f7262","observation_id":"418eeffd-ebd5-486a-9261-acd6190d14fc","resolution":{"observed_at":"2026-08-04T15:20:56.186440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:56.200523Z","title":"Gottesman and I","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:56.200523Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:80e6c785bf3abb4f6a0d72f25af2cdf5ad47cee7ec6de47837b67e5a83992da0","observation_id":"f20adb76-81d0-4b2a-8ab6-353802943ef5","resolution":{"observed_at":"2026-08-04T15:20:56.200523Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:56.213600Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:56.213600Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:b5635382b6770e1710763d8bba3d3d22b5d6c984c4c2936151f5273d1b8028f3","observation_id":"cfd3dc7f-0ad3-4c68-a1ee-2b7fc1c117f5","resolution":{"observed_at":"2026-08-04T15:20:56.213600Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:56.221449Z","title":"H ˚ astad, Tensor rank is NP-complete, Journal of algo- rithms11, 644 (1990)","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:56.221449Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:0ea757c38d289a6f2aa917d83438304510018292700a1867facaab5b89293dc5","observation_id":"a2cf400c-3685-4d34-b97a-c4ec4a00c6a3","resolution":{"observed_at":"2026-08-04T15:20:56.221449Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:20:56.227895Z","title":"Kiumi and B","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-04T15:20:56.227895Z"},"links":{"citing_paper":"/paper/2509.20052"},"observation_digest":"sha256:14ee131b49146ad7cc03e96ca8f12d741a03a12f9dd81d4b6e546fc9e19b39a0","observation_id":"b326279e-43cd-46cf-9c79-6463712e6dd0","resolution":{"observed_at":"2026-08-04T15:20:56.227895Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-06T22:08:12.214546Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation"},"reference_resolution":{"displayed":59,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":58,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":59},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 59 of 59 outbound references and 1 inbound Pith citation observation for arXiv:2509.20052."}