Paper Citation Record · LEDGER

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation

As of 15 August 2026, this Paper Citation Record lists 59 of 59 outbound references and 2 inbound Pith citation observations for arXiv:2509.20052.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2509.20052 v3

Coverage vector

measured 59 of 59 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-04T15:20:56.227895Z

measured 61 of 61 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-15T06:32:42.880941+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-14T04:53:46.612948Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-05-11T12:46:25.266238Z

Reference resolution

59 of 59 outbound references displayed

verified exact0
verified fuzzy0
unresolved58
parse uncertain0
malformed identifier1
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation ed2b83b0-6946-4093-80fd-a61a2e7c5029 · outbound

This paper cites Although its primary focus is on circuit depth reduction, it also includes aT- count optimization pass.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Although its primary focus is on circuit depth reduction, it also includes aT- count optimization pass

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.639922Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 14d76b74-073c-4ec4-9e0c-9fd2bdb7a5d6 · outbound

This paper cites It includes graph-theoretic optimization techniques such as local complemen- tation and pivoting [21, 22] usingX-Spiders and Z-Spiders.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation It includes graph-theoretic optimization techniques such as local complemen- tation and pivoting [21, 22] usingX-Spiders and Z-Spiders

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.650100Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0074c77e-743f-413c-ad56-36e5f21b0f95 · outbound

This paper cites As described in Sec.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation As described in Sec

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.657677Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1518c150-ab10-46f0-9109-7d9a88a3e2de · outbound

This paper cites an unresolved cited work.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Unresolved cited work

Reference 4

Resolution: malformed identifier; no resolver link, observed 2026-08-04T15:20:55.664639Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1620d3f2-8166-4d8a-844b-5af376ddd7f7 · outbound

This paper cites an unresolved cited work.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Unresolved cited work

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.671790Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fa522289-56e3-46de-a1db-56a4babd5e4b · outbound

This paper cites an unresolved cited work.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Unresolved cited work

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.678614Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1f76344e-1238-4b69-af1e-82794e060bcd · outbound

This paper cites an unresolved cited work.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Unresolved cited work

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.688790Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a658961e-da74-4cf9-ba9e-412f7f7baa1e · outbound

This paper cites Let us determine the number of ways to select the ro- tation axes according to this procedure.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Let us determine the number of ways to select the ro- tation axes according to this procedure

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.696071Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation be8595cf-dd48-4f7e-84ac-e05e65bd548e · outbound

This paper cites an unresolved cited work.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Unresolved cited work

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.706052Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8c42c82c-9592-4c94-a642-c03f07ca1a57 · outbound

This paper cites an unresolved cited work.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Unresolved cited work

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.726667Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7e937774-cf82-42a1-87ec-026441689b94 · outbound

This paper cites Lloyd, Universal quantum simulators, Science273, 1073 (1996).

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Lloyd, Universal quantum simulators, Science273, 1073 (1996)

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.735851Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 77df8d39-f9cf-4de6-a5a1-bc1554674f76 · outbound

This paper cites an unresolved cited work.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Unresolved cited work

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.744379Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ffac96ae-c0b6-437c-a976-85e602af48e3 · outbound

This paper cites an unresolved cited work.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Unresolved cited work

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.752985Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9e94582a-b447-4886-b132-7c86b314ba28 · outbound

This paper cites an unresolved cited work.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Unresolved cited work

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.762287Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6a4ed3ee-6448-4741-9ac2-c082cf0e830f · outbound

This paper cites an unresolved cited work.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Unresolved cited work

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.772303Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cea9aa1d-8593-461f-a202-9f24361f4722 · outbound

This paper cites Bravyi and A.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Bravyi and A

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.781221Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 306ea029-3b55-4803-9116-79cb1ad08c18 · outbound

This paper cites Svore, A.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Svore, A

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.796040Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 333f1bfa-f226-41c5-a83e-608f63690f22 · outbound

This paper cites H¨ aner, D.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation H¨ aner, D

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.804825Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 989f21bc-7924-41ee-9554-33e8d7bf69aa · outbound

This paper cites an unresolved cited work.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Unresolved cited work

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.813291Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f52fde27-e9fe-4ace-bdb8-3d9623a251aa · outbound

This paper cites an unresolved cited work.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Unresolved cited work

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.821675Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e1f2dbcb-36d7-40eb-a950-a6a59218f7a5 · outbound

This paper cites Shende, S.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Shende, S

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.829725Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 30944077-145e-4551-a4fe-5e78836be312 · outbound

This paper cites The Solovay-Kitaev algorithm.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation The Solovay-Kitaev algorithm

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.844344Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 45dc6114-105b-4968-a159-bf3231f4fc34 · outbound

This paper cites Optimal ancilla-free Clifford+T approximation of z-rotations.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Optimal ancilla-free Clifford+T approximation of z-rotations

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.855385Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 94cb5189-ff4b-4ae1-8d13-444509b8f242 · outbound

This paper cites Cowtan, S.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Cowtan, S

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.864644Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bc2cb7b8-3053-4812-bf90-97653d7dc002 · outbound

This paper cites Treinish, J.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Treinish, J

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.876251Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8d59adf4-5b18-44c4-9073-457fdd013412 · outbound

This paper cites Sivarajah, S.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Sivarajah, S

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.888263Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 92207389-609d-4937-8800-8b4573fea568 · outbound

This paper cites Amy and V.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Amy and V

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.898540Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bb4ec787-38b4-4b06-bf26-f41e7d5ca106 · outbound

This paper cites Coecke and R.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Coecke and R

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.905962Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 41283f6c-8196-4cfc-9f48-d5fe76dd9412 · outbound

This paper cites Duncan, A.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Duncan, A

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.916165Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fb5ed8f3-a14c-437e-bbbd-2f0d9eb53681 · outbound

This paper cites Kissinger and J.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Kissinger and J

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.924648Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 269ba612-513f-41cf-823a-4cf543160ff9 · outbound

This paper cites an unresolved cited work.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Unresolved cited work

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.932843Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e3b309e1-c812-4179-8932-04eaccb10dac · outbound

This paper cites an unresolved cited work.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Unresolved cited work

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.943810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 88197d21-d726-4985-baa3-74ee9db217b8 · outbound

This paper cites Amy and M.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Amy and M

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.952622Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1cd032e8-a4e4-4de4-a522-5b38bd767526 · outbound

This paper cites an unresolved cited work.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Unresolved cited work

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.965640Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2e91b362-8a0d-4eca-98b5-3c14d6883368 · outbound

This paper cites Vandaele, LowerT-count with faster algorithms, Quantum9, 1860 (2025).

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Vandaele, LowerT-count with faster algorithms, Quantum9, 1860 (2025)

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.974958Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 105b3929-7a7e-45b5-90d7-a1a3e13907a4 · outbound

This paper cites an unresolved cited work.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Unresolved cited work

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.980955Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 49d166db-d68d-446b-83c8-c316dedbd288 · outbound

This paper cites An algorithm for the T-count.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation An algorithm for the T-count

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:55.994799Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ee8623ca-c425-43ab-a056-127dbb41b473 · outbound

This paper cites Litinski, A game of surface codes: Large-scale quan- tum computing with lattice surgery, Quantum3, 128 (2019).

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Litinski, A game of surface codes: Large-scale quan- tum computing with lattice surgery, Quantum3, 128 (2019)

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:56.006466Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 14ce1bdc-ae7b-4f97-96b7-d46f23aab30b · outbound

This paper cites Hirano and K.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Hirano and K

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:56.017212Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 88174568-98d1-4cc1-9046-1d1fb98935f5 · outbound

This paper cites Optimizing T gates in Clifford+T circuit as $\pi/4$ rotations around Paulis.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Optimizing T gates in Clifford+T circuit as $\pi/4$ rotations around Paulis

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:56.025297Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 14e6c886-a9ae-4a12-b9b6-ad173a8aa381 · outbound

This paper cites Optimal number of parametrized rotations and Hadamard gates in parametrized Clifford circuits with non-repeated parameters.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Optimal number of parametrized rotations and Hadamard gates in parametrized Clifford circuits with non-repeated parameters

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:56.033056Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d519c1fe-b633-4e80-a897-b5821e7b988c · outbound

This paper cites an unresolved cited work.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Unresolved cited work

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:56.046991Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f9d23759-08d4-421d-994d-6dd5feb182f2 · outbound

This paper cites Kissinger and J.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Kissinger and J

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:56.054613Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 475e62ce-fd7d-4cab-85e9-a76223a19efc · outbound

This paper cites Gidney, Stim: a fast stabilizer circuit simulator, Quan- tum5, 497 (2021).

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Gidney, Stim: a fast stabilizer circuit simulator, Quan- tum5, 497 (2021)

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:56.077620Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 141a15dd-4b5e-457e-9731-c468cace9342 · outbound

This paper cites Open Quantum Assembly Language.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Open Quantum Assembly Language

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:56.086296Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dca0ab12-e516-4446-813f-80f086c2b4c5 · outbound

This paper cites an unresolved cited work.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Unresolved cited work

Reference 47

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:56.095706Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 66c9fca1-db83-44f9-a4a4-3161554cc751 · outbound

This paper cites The MQT Handbook: A Summary of Design Automation Tools and Software for Quantum Computing.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation The MQT Handbook: A Summary of Design Automation Tools and Software for Quantum Computing

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:56.101425Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 11833983-ece4-4059-84eb-285ded93ab93 · outbound

This paper cites an unresolved cited work.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Unresolved cited work

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:56.116833Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 61d53d9e-3d13-4683-adf0-2ac3ad278612 · outbound

This paper cites Peruzzo, J.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Peruzzo, J

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:56.128555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 83d58532-b5f4-4110-a0d3-a62486b7c264 · outbound

This paper cites A Quantum Approximate Optimization Algorithm.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation A Quantum Approximate Optimization Algorithm

Reference 51

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:56.136392Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 765e9434-24c7-4942-921c-911dd30be8d8 · outbound

This paper cites an unresolved cited work.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Unresolved cited work

Reference 52

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:56.146405Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a75f5ddc-3269-4e9e-a7f6-364b06020f62 · outbound

This paper cites Akahoshi, K.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Akahoshi, K

Reference 53

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:56.153393Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8127c4ad-1c49-4cb1-a8ea-cd22694981d2 · outbound

This paper cites Toshio, Y.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Toshio, Y

Reference 54

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:56.164636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eecfe4af-5e39-4bf6-979a-4a5515502245 · outbound

This paper cites van de Wetering, R.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation van de Wetering, R

Reference 55

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:56.174425Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 418eeffd-ebd5-486a-9261-acd6190d14fc · outbound

This paper cites Nakano, H.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Nakano, H

Reference 56

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:56.186440Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f20adb76-81d0-4b2a-8ab6-353802943ef5 · outbound

This paper cites Gottesman and I.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Gottesman and I

Reference 57

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:56.200523Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cfd3dc7f-0ad3-4c68-a1ee-2b7fc1c117f5 · outbound

This paper cites an unresolved cited work.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Unresolved cited work

Reference 58

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:56.213600Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a2cf400c-3685-4d34-b97a-c4ec4a00c6a3 · outbound

This paper cites H ˚ astad, Tensor rank is NP-complete, Journal of algo- rithms11, 644 (1990).

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation H ˚ astad, Tensor rank is NP-complete, Journal of algo- rithms11, 644 (1990)

Reference 59

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:56.221449Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b326279e-43cd-46cf-9c79-6463712e6dd0 · outbound

This paper cites Kiumi and B.

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation Kiumi and B

Reference 60

Resolution: unresolved; no resolver link, observed 2026-08-04T15:20:56.227895Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

Observation 53d39b43-06d7-4461-9aa3-4acd6a47f391 · inbound

Qubit Routing for (Almost) Free cites this paper.

Qubit Routing for (Almost) Free Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation

Reference 18

Resolution: verified exact; arxiv_id, observed 2026-06-02T04:04:48.485991Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 4af58321-1d1a-49b3-9a1d-4a726b9e016e · inbound

Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology cites this paper.

Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-14T04:53:46.612948Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.