Pith. sign in

Paper Citation Record · LEDGER

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks

As of 11 August 2026, this Paper Citation Record lists 87 of 87 outbound references and 0 inbound Pith citation observations for arXiv:2607.08396.

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

pith.paper-citation-record.v1
2607.08396 v1

Coverage vector

measured 87 of 87 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-10T08:07:58.802765Z

measured 87 of 87 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

87 of 87 outbound references displayed

  • verified exact19
  • verified fuzzy40
  • unresolved23
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch5

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation ff9fa55d-2c24-4fa4-947b-58f5d61780a0 · outbound

This paper cites an unresolved cited work.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Unresolved cited work

Reference 1

Resolution
unresolved
raw_fallback, observed 2026-07-10T08:16:59.542865Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:dd410ad9ac657c96d1f2f48044d94a2464e1d31be59a1f94c7b369a15c7f28e5

Observation 8fe0ee1e-17b3-4154-9bcf-7322a9aebc49 · outbound

This paper cites Vertices corresponding to rows are colored blue, and vertices corresponding to columns are colored red.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Vertices corresponding to rows are colored blue, and vertices corresponding to columns are colored red

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:16:59.546827Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:0287c01007adea50617e10f86af7f86935fc41e8d5c99dc032cc9137bdf765ea

Observation f689936c-b809-4979-975e-0607214759a5 · outbound

This paper cites an unresolved cited work.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Unresolved cited work

Reference 3

Resolution
unresolved
raw_fallback, observed 2026-07-10T08:16:59.544781Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:e33fd97ce055d045ee04057eeab5b81b437516b3948302fe3f7ac003ec94f07c

Observation dff41d0a-a2ff-4c3f-9595-b96caa7844d9 · outbound

This paper cites an unresolved cited work.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Unresolved cited work

Reference 4

Resolution
unresolved
raw_fallback, observed 2026-07-10T08:16:59.548806Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:5f6694443f71132559e5633e94ad93b3d7301896f310957a1dec9c6c94015b34

Observation 4dd80fd6-95ba-4f07-8024-967f646bdae0 · outbound

This paper cites an unresolved cited work.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Unresolved cited work

Reference 5

Resolution
unresolved
raw_fallback, observed 2026-07-10T08:16:59.562926Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:68af8052737caf35aded14c93bfb697a343b2298455826a94f6e5cdf65fbfeb7

Observation 2e7338ed-25e4-4ef1-ab1f-2c1df30ba947 · outbound

This paper cites This method allows us to find automorphisms of large codes in a short amount of time and study their logi- cal gates efficiently.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks This method allows us to find automorphisms of large codes in a short amount of time and study their logi- cal gates efficiently

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:16:59.522754Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:163b7d838eb761e190d53deb54777c9e91921c999a0a6305e6e2c637ead0f22f

Observation 59ea6d2b-1f66-4127-ab7f-f068cb7f64b7 · outbound

This paper cites We choose the logical basis ¯X1 =X 1X2, ¯Z1 =Z 1Z3, ¯X2 =X 1X3, ¯Z2 =Z 1Z2.(7) Figure 2 shows the square geometry and the bipartition underlying this choice of logical basis.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks We choose the logical basis ¯X1 =X 1X2, ¯Z1 =Z 1Z3, ¯X2 =X 1X3, ¯Z2 =Z 1Z2.(7) Figure 2 shows the square geometry and the bipartition underlying this choice of logical basis

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:16:59.528095Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:afa033b4da89857feb1938391b07d7b40fa3adb0db68e27f765a4a6bebcc7442

Observation 194113b5-2bc2-4246-92e6-70c3857d92e1 · outbound

This paper cites QEC Readout Testbed.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks QEC Readout Testbed

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:16:59.518526Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:36024ce6b44a9e6d1035ab076e914b2d8d6f2685934189bdbfc2a98d5eb99a2a

Observation facabcaf-78bc-437c-85b9-7a86543f6b02 · outbound

This paper cites an unresolved cited work.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Unresolved cited work

Reference 9

Resolution
unresolved
raw_fallback, observed 2026-07-10T08:26:59.593468Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:7622fc95330b5c4fe2d8728da8a919ec3756794c64efd058a5b8690c91b4e87f

Observation a50f2c2f-ea1a-4e08-927b-2b6b9d3d94ec · outbound

This paper cites Hangleiter, Has quantum advantage been achieved? (2026).

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Hangleiter, Has quantum advantage been achieved? (2026)

Reference 10

Resolution
verified exact
arxiv_id, observed 2026-07-10T08:16:58.910096Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:2a3b2ce4bb6cef026d32dfb078704e010062ba2dc043558713f150cc90d00b1f

Observation 47f6090a-2d85-4396-b172-d4cefc0ef9b3 · outbound

This paper cites The Heisenberg Representation of Quantum Computers.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks The Heisenberg Representation of Quantum Computers

Reference 11

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T08:16:58.916175Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:902a155624b4b488a98351d362464e286ebba12947ab2547e5aa64f9c8eab2d5

Observation ba5693a5-bd94-4754-9e17-e27b6d7fa4b3 · outbound

This paper cites Improved Simulation of Stabilizer Circuits.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Improved Simulation of Stabilizer Circuits

Reference 12

Resolution
verified exact
local_arxiv, observed 2026-07-10T08:16:58.923780Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:0c540adecb6ae117b67131cd3a71c10c08c8d7dc44454669ba854abcf2379307

Observation 35b0fac2-f810-4c1e-b7ba-8a6712821e35 · outbound

This paper cites an unresolved cited work.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Unresolved cited work

Reference 13

Resolution
unresolved
raw_fallback, observed 2026-07-10T08:26:59.591883Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:3e23db30e8881b47e9867db576691045bd36e1c8fb9cfc3f1121dc7fce91ec46

Observation 1718f6d4-c76e-4bca-bb92-c9228bd20515 · outbound

This paper cites Jozsa and A.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Jozsa and A

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:26:59.595134Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:e1987b33aa9c356f67a8be342ce6ee27ba24c863b58e0ac67fc59eda39f4d2f3

Observation 617030fe-b696-4f5d-8df1-0b89408e0d03 · outbound

This paper cites an unresolved cited work.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Unresolved cited work

Reference 15

Resolution
unresolved
raw_fallback, observed 2026-07-10T08:26:59.596797Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:53ae376529dfe6df7bef6ee699a57928f2bd1210592b34b7d78945d95eea8b6e

Observation 6da55b57-afc5-4ed0-912c-4ad52c944d6e · outbound

This paper cites Jordan-Wigner formalism for arbitrary 2-input 2-output matchgates and their classical simulation.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Jordan-Wigner formalism for arbitrary 2-input 2-output matchgates and their classical simulation

Reference 16

Resolution
verified exact
local_arxiv, observed 2026-07-10T08:16:58.862533Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:4fa13ce53a9ff217eaf9384c964b66b0580d399571bce1d3bced8a243a39f6c2

Observation f301c9c1-7862-4d5e-9b65-1c944d6deba2 · outbound

This paper cites Efficient classical simulation of slightly entangled quantum computations.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Efficient classical simulation of slightly entangled quantum computations

Reference 17

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T08:16:58.907092Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:1611af9c214d3b3b2c90abc62a1324a3a46b38ba8738470db7edd531ab108822

Observation cee2e19e-5ce3-45fd-a79e-515a5d4e6882 · outbound

This paper cites The density-matrix renormalization group in the age of matrix product states.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks The density-matrix renormalization group in the age of matrix product states

Reference 18

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T08:16:58.918616Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:612f28952a169d6d6fab35793b1caa815cfc39384f2987e5461a1ee608aad4f1

Observation 279cfd0b-7707-4766-9ae9-0fdf070a9b6a · outbound

This paper cites an unresolved cited work.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Unresolved cited work

Reference 19

Resolution
unresolved
raw_fallback, observed 2026-07-10T08:26:59.600087Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:f5c896a9f1e73b6fab1a639478aee3dc2ba77444ac262ad6b0e2dbd3be45c412

Observation bfd11d89-a869-4269-af85-f08f0fe4b73f · outbound

This paper cites Bravyi and D.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Bravyi and D

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:26:59.603596Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:f71b7f8bfa513dc61e3a1312b5db15dd95e08b448c3d709d7b1c5991b17b0d37

Observation 17ba57a3-51cd-443d-8144-7c71aae81999 · outbound

This paper cites Bravyi, D.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Bravyi, D

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:26:59.611974Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:ec7fd70acb7bb9feacd23ab470b5a0446bfcde59bf1e2b7d6837ae1dc039ec9b

Observation 6137cd6b-f246-48c5-9d00-cddc4cb527fc · outbound

This paper cites Extending Matchgate Simulation Methods to Universal Quantum Circuits.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Extending Matchgate Simulation Methods to Universal Quantum Circuits

Reference 22

Resolution
verified exact
local_arxiv, observed 2026-07-10T08:16:58.921071Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:6d131da8edb95bc403a032f9e5ade18ea6ad421e003297cba9ca7e335dd92739

Observation 91888799-a587-4cc6-8d68-b1df5a1f01cb · outbound

This paper cites Classical simulation of parity-preserving quantum circuits.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Classical simulation of parity-preserving quantum circuits

Reference 23

Resolution
verified exact
local_arxiv, observed 2026-07-10T08:16:58.913455Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:0b8e852978ef20709ad5372f682127e035e682ff3a5c2ac5ad55b10a9a5a3ce9

Observation 1abad3cb-6be3-4c02-bb4a-824e2fdb7486 · outbound

This paper cites an unresolved cited work.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Unresolved cited work

Reference 24

Resolution
unresolved
raw_fallback, observed 2026-07-10T08:16:59.550860Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:afc2355630bd892085549734dd2cb6e8401aee8fd7d4cdd3f204b5d9b0ac4877

Observation 850d7c43-13b0-4b56-b7f1-65c24e495be6 · outbound

This paper cites an unresolved cited work.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Unresolved cited work

Reference 25

Resolution
unresolved
raw_fallback, observed 2026-07-10T08:16:59.554875Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:1a44994b2750c18a860ac7b8f2a37194d8bc99d287e040920c42ac29817f6bb6

Observation 007e80ed-4e61-405f-bfc7-0fbfc5bc97a3 · outbound

This paper cites Calderbank, E.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Calderbank, E

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:16:59.539221Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:bdbcfffac8d09e3c03e76f8beda32fdf4f57c5450b85b365b9b7d2f473d0cc06

Observation 85ab4dae-756c-4c89-94b2-c84c7ebd41a3 · outbound

This paper cites Grassl and M.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Grassl and M

Reference 27

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:26:59.598447Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:8510ce17beb341514fc1a3e57e3a25c7d3732b5ccd9d601fe9b55b45a02aa4e4

Observation 9dc0600e-1e6c-4185-b6c7-c09957a37489 · outbound

This paper cites Sayginel, S.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Sayginel, S

Reference 28

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:16:59.511896Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:2740a59b954be53965a42f00af28285ac96dfcf4eff5b6ec673b4fade663cdde

Observation fe02e2ae-d2f5-42a3-8cbb-ac59efb4002c · outbound

This paper cites an unresolved cited work.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Unresolved cited work

Reference 29

Resolution
unresolved
raw_fallback, observed 2026-07-10T08:16:59.508416Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:e36003cacce2a4dd6fcaa3e306ca28c75e29cab658837d562ae4f085c4cdecb6

Observation cc9dfc1a-65c4-4cc7-84a0-b97d9bce62b1 · outbound

This paper cites an unresolved cited work.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Unresolved cited work

Reference 30

Resolution
unresolved
raw_fallback, observed 2026-07-10T08:16:59.564804Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:5127f5482d24b3c30bfa4ad796c6b0d526f789dacfacbbb33af6af011737a66c

Observation 02ad4ef0-3610-4f06-a67e-bb68d0870d1c · outbound

This paper cites an unresolved cited work.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Unresolved cited work

Reference 31

Resolution
unresolved
raw_fallback, observed 2026-07-10T08:26:59.605221Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:4fc16522027873b9c496fc08d5ad648de576db3844bdab3ead92d155e78d21ba

Observation 7bc7cc01-fdd3-433f-8c24-b5b578afcf6b · outbound

This paper cites Restrictions on Transversal Encoded Quantum Gate Sets.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Restrictions on Transversal Encoded Quantum Gate Sets

Reference 32

Resolution
verified exact
local_arxiv, observed 2026-07-10T08:16:58.901710Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:afc0b2260f90daca5a64813985012189b73bee02f99db8f3d1d38d67cb69f57d

Observation 874eec50-faf9-4a1b-b8b6-3465cfceb4f9 · outbound

This paper cites The Smallest Code with Transversal T.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks The Smallest Code with Transversal T

Reference 33

Resolution
verified exact
local_arxiv, observed 2026-07-10T08:16:58.875970Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:0b2276fcac9c6e4aed817829c338c614b99c333a98f29dadf27734a19beb59a7

Observation 282f7b96-91ba-42fe-9d45-85acbbe97378 · outbound

This paper cites Deger, PhasePoly.jl: Fast exact simulation of mono- mial quantum circuits via phase polynomials,https: 20 //github.com/aydindeger/PhasePoly.jl(2026), julia package, version 0.1.0.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Deger, PhasePoly.jl: Fast exact simulation of mono- mial quantum circuits via phase polynomials,https: 20 //github.com/aydindeger/PhasePoly.jl(2026), julia package, version 0.1.0

Reference 34

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:16:59.567974Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:ee75731d897ecd5498ae72b041ab8734146993356de3e49e7f25ac88a2272acd

Observation cbcf556e-bc1b-4b6c-b906-09bb3567ac29 · outbound

This paper cites Quantum circuits and low-degree polynomials over F_2.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Quantum circuits and low-degree polynomials over F_2

Reference 35

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T08:16:58.893918Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:9c39bdb20c7784bdbf011c18e64a78b46ae9b960676ff0ed5b9788cdac1737f2

Observation 61724ecf-a77e-445e-ae61-0a91e41b0dae · outbound

This paper cites Fast classical simulation of Harvard/QuEra IQP circuits.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Fast classical simulation of Harvard/QuEra IQP circuits

Reference 36

Resolution
verified exact
local_arxiv, observed 2026-07-10T08:16:58.881034Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:21518eb8a024d7dbc44d609f730e311deeaa6a606ea14889bc7a62fc6fa06b52

Observation f0fc6b84-e22e-4b3f-aefb-608dd5c9dc9a · outbound

This paper cites an unresolved cited work.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Unresolved cited work

Reference 37

Resolution
unresolved
raw_fallback, observed 2026-07-10T08:26:59.587183Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:419528d57bc89c82cddc5c6858105d49787cb3995c5cb0d8e8544fe6802432c2

Observation 7237a217-9883-4884-807d-f6cf2c35b3ce · outbound

This paper cites an unresolved cited work.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Unresolved cited work

Reference 38

Resolution
unresolved
raw_fallback, observed 2026-07-10T08:26:59.590356Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:4f6126dcf23e84296b6b50ad2f219686b938207b83fcc390faee8a09292cb1ec

Observation 6e8336b8-e5fe-4767-be5d-6ca401c4abbb · outbound

This paper cites Efficient Quantum Polar Coding.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Efficient Quantum Polar Coding

Reference 39

Resolution
verified exact
local_arxiv, observed 2026-07-10T08:16:58.865041Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:9dc80048c62aa561aec773f2a6cd25c90f3f2bad9267f59d1d4f03f98636e55d

Observation e1530759-64fd-4e3b-aaa0-de2cce10683c · outbound

This paper cites an unresolved cited work.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Unresolved cited work

Reference 40

Resolution
unresolved
raw_fallback, observed 2026-07-10T08:26:59.580779Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:daa8eb58bc5c808b41c64797601063136f5703b927ac30b93a6162cb1a06cf47

Observation 831b052a-7e5e-4e0a-b4d4-6517e7f01d54 · outbound

This paper cites Matos, A.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Matos, A

Reference 41

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:26:59.582454Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:b50f1380adc1bc93241ea977b7c7ab7669944632c1d9f3239a7c966a4e7b0ed3

Observation 2f1e68e3-9c31-40b0-86df-0858b4fd78be · outbound

This paper cites Deger, A.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Deger, A

Reference 42

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:26:59.584041Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:1147b05b9d018837fb67dff605d9633cf476bb1ce7a40c6c0d699a862d24df89

Observation c7925fc4-0db1-4256-b95f-0dbb26a188ba · outbound

This paper cites Leone, S.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Leone, S

Reference 43

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:26:59.585580Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:24357b341e027350c059f947c2b4833e2c8713a34dd28e1726157faedf693321

Observation e1bdfec9-1e15-4496-929f-6482148de5ca · outbound

This paper cites an unresolved cited work.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Unresolved cited work

Reference 44

Resolution
unresolved
raw_fallback, observed 2026-07-10T08:26:59.588786Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:7599e39d4d0e23375b71b720e7ee5d3764ede596ee142be84a09df332db59590

Observation d9305c49-d79e-42fd-952c-80432e3c7d55 · outbound

This paper cites Lami and M.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Lami and M

Reference 45

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:26:59.608533Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:dece4b20a1a38095cd0f39b99dd265e22dec895aa44becb65bcd7fa202588843

Observation 5b2151b9-f0e9-48bf-8382-66223bda9534 · outbound

This paper cites Almheiri, X.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Almheiri, X

Reference 46

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:26:59.570828Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:d5d4a012c56907581fb0515da6f5a2a66c9b173f11756f14ff98927a05741a01

Observation da2c0588-65e0-447c-8891-9a8429495003 · outbound

This paper cites Pastawski, B.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Pastawski, B

Reference 47

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:26:59.567585Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:67117708b171461accb045523da048288f2b7f3f243989129c30c508f13a1ba3

Observation f9f56566-bfe6-44f2-bc32-8cd955d8c953 · outbound

This paper cites Dehaene and B.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Dehaene and B

Reference 48

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:26:59.569162Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:8afb389fb27fa78ad9e20076130fbdad1c75592eb2322eab145d4d313f47d5db

Observation 3585117f-e30b-433f-bddc-aa15a2fa0fee · outbound

This paper cites Gottesman and I.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Gottesman and I

Reference 49

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:26:59.572458Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:9b2c12491ab856608b712779838d5f546bae8bcd984fb56d9b9567e7b0afa99a

Observation 253dae38-a04e-4e52-b4b3-363192561193 · outbound

This paper cites Bravyi and A.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Bravyi and A

Reference 50

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:26:59.574101Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:90bfb09647cbc8d25f505f45bfa5d582bcc5d18343a207c16e7763a6bf59fbe5

Observation 36f1de03-fa32-47e5-a9c6-a76468b6242b · outbound

This paper cites Raussendorf, D.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Raussendorf, D

Reference 51

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:26:59.577566Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:8111a50e14f2c68e97569dafd866906cbde2fbce90052981f875950a3f263127

Observation 95274c97-bf9a-4b29-bf3b-b14e899a0135 · outbound

This paper cites Hebenstreit, R.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Hebenstreit, R

Reference 52

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:26:59.566031Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:53bce3dd6635dc845a0c3e6f63c17423aed38eb9c1f7858642c413bb2a190083

Observation 40e0ff81-7520-4c18-b7d5-08b6264859b9 · outbound

This paper cites Dias and R.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Dias and R

Reference 53

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:26:59.564406Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:a9d6c7033bd8532c6f1e21ba0777f629b2b0a471ee0f82ce6422d69229bf293a

Observation 0e317efa-b011-43c7-9ea3-9ca2e8967da4 · outbound

This paper cites Classical simulation of free-fermionic dynamics and quantum chemistry with magic input.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Classical simulation of free-fermionic dynamics and quantum chemistry with magic input

Reference 54

Resolution
verified exact
local_arxiv, observed 2026-07-10T08:16:58.878536Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:1a3f53e57566288b53c0d5b074fc0549811883f79753b3d9646dbda9b9ea02d9

Observation effafff1-81c1-4dec-8d9e-7ad8b882b95d · outbound

This paper cites Stabilizer Codes and Quantum Error Correction.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Stabilizer Codes and Quantum Error Correction

Reference 55

Resolution
verified exact
local_arxiv, observed 2026-07-10T08:16:58.904098Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:a309893ba4fe7d18255f6625440b8908ad89df947a44af466bac4f20ac99c9d6

Observation 1047f45a-f0a9-421c-a14b-7bb20645b345 · outbound

This paper cites Gottesman, Surviving as a Quantum Computer in a Classical World, 2024 Draft (2024).

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Gottesman, Surviving as a Quantum Computer in a Classical World, 2024 Draft (2024)

Reference 56

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:26:59.562722Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:2e5893a7dc27eae84e7dfa019148422546429ce936fedabaa2f8da50504b5a81

Observation adb3bf72-baa8-4316-af07-57b6d4a6c791 · outbound

This paper cites Investigations on Automorphism Groups of Quantum Stabilizer Codes.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Investigations on Automorphism Groups of Quantum Stabilizer Codes

Reference 57

Resolution
verified exact
local_arxiv, observed 2026-07-10T08:16:58.883400Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:de92fb3fe8fe6e4d4d4667eecbe80c0037bb50cfe4558bdd80299b41e1f31284

Observation 57902c91-eaa5-4a1c-8199-3f2ad2eb0b20 · outbound

This paper cites Barenco, C.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Barenco, C

Reference 58

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:16:58.841499Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:bc5e85e3dc192c0d6a66398931b81c30ac0b4d2588fb054e279a590dcca26b30

Observation 485d74d8-e2a3-42ef-a63d-426047138797 · outbound

This paper cites an unresolved cited work.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Unresolved cited work

Reference 59

Resolution
unresolved
raw_fallback, observed 2026-07-10T08:26:59.579154Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:2b74adec6306c938f2e08346cf2cea129460f5c991969b00b9d2393c14b5f5b3

Observation cfd86569-525f-4b00-bba0-5f90e73eabef · outbound

This paper cites Tanner, IEEE Transactions on Information Theory 27, 533 (1981).

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Tanner, IEEE Transactions on Information Theory 27, 533 (1981)

Reference 60

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:16:59.520597Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:a77a6d934b87d0f182c4d877baaa1d26267bfdf6b3247fb9f6ca04d162efa5ff

Observation a6b506ed-604d-473e-8447-a038f060db21 · outbound

This paper cites Junttila and P.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Junttila and P

Reference 61

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:16:59.530021Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:9db8a2172b81bd5e0a0e09744b31ea1c3432a87d5dc8e372be13a0fcf24cfc66

Observation 5a0dcc25-fbc0-497d-94bc-1f3af48c804c · outbound

This paper cites an unresolved cited work.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Unresolved cited work

Reference 62

Resolution
unresolved
raw_fallback, observed 2026-07-10T08:16:59.531831Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:97ac5515202d87abe29dc35b0975dc5df459dc583701a63f694d505c4ec0fa72

Observation b2e55658-a63d-47db-ae94-0cf1a39b433b · outbound

This paper cites Bomb´ ın and M.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Bomb´ ın and M

Reference 63

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:16:59.535689Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:3be6e5a518f8a9152a410f8123c715de69278aea996debeafa48527a9594564d

Observation 43785aca-80d6-4bae-95e9-22e7e7b53483 · outbound

This paper cites Bomb´ ın, New Journal of Physics17, 083002 (2015).

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Bomb´ ın, New Journal of Physics17, 083002 (2015)

Reference 64

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:26:59.606918Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:f9a0cae446d033193dcc31cf7d5a20b25617e89e6ac3733d2e63e8f9431f4af3

Observation 77d8b91a-7bb2-429c-9604-b14ce75d1219 · outbound

This paper cites Vasmer and D.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Vasmer and D

Reference 65

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:26:59.610190Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:47dc42f87d1c4178b9883c18c15e2bc41aa487e0601ce6069f891a8c98aea3c3

Observation 5fbf6c13-c09d-4d1d-848b-7cd6eae25bdd · outbound

This paper cites Honciuc Menendez, A.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Honciuc Menendez, A

Reference 66

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:26:59.601929Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:9b4e8e6f37a9128d1c79e5da4b941bfc885da590394561b0bcab57fedb2e3323

Observation ffb9a11c-c6ef-4107-a8e8-7d9b29bca503 · outbound

This paper cites Gong and J.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Gong and J

Reference 67

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:16:59.510155Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:b3774a2f012c692388b0251cde60e18dece8de8cce808ba627e27708cd3c029b

Observation 2ebe026f-89d0-4db9-a943-63354cc62067 · outbound

This paper cites Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels

Reference 68

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T08:16:58.867444Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:1e10406810d1644dd6fa6b668cd4ca2477eff12b175db738d7fd02f70814b93d

Observation 955c0d5e-7181-4260-b802-8faa2586b3a6 · outbound

This paper cites an unresolved cited work.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Unresolved cited work

Reference 69

Resolution
unresolved
raw_fallback, observed 2026-07-10T08:16:59.516221Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:ba62cff49439b87d7fda3d5ae5196fccb6838246ffc31b9cb17eb4b87814161b

Observation a179e2bb-ddc5-4f69-b5fd-8138e3c6d56c · outbound

This paper cites Bravyi and J.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Bravyi and J

Reference 70

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:16:59.514085Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:c85177d9a7a40c3e444d54008eaae191bd82cbca5d56444e34eb497d0da61c19

Observation ab870db8-50bc-470b-bab3-5e9bbb1c2509 · outbound

This paper cites an unresolved cited work.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Unresolved cited work

Reference 71

Resolution
unresolved
raw_fallback, observed 2026-07-10T08:16:59.506487Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:ed172afda8b6a7d89d4da249fb6346aea0950dec5709d80e461597175d9cfa42

Observation 79109122-ff1b-48ec-b146-aecd10f4d7f1 · outbound

This paper cites Polar codes for classical-quantum channels.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Polar codes for classical-quantum channels

Reference 72

Resolution
verified exact
local_arxiv, observed 2026-07-10T08:16:58.872813Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:36c849df689b8d15f315551d52c4fb8ea0d9cc79e032b09c5776384d46433464

Observation e462f7b3-fe2b-47bc-9e53-5292dba6aaa5 · outbound

This paper cites Entanglement in the stabilizer formalism.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Entanglement in the stabilizer formalism

Reference 73

Resolution
verified exact
local_arxiv, observed 2026-07-10T08:16:58.888616Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:34abdc7a3eb49af775b9b49b9685cf20d3497d9c9b6d64c3dc47f43818d65fa1

Observation bd4385af-236c-45aa-9e88-6e1d7fe70f5a · outbound

This paper cites Nahum, J.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Nahum, J

Reference 74

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:16:59.537492Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:939653feda7f9858b8186dd6f2fe1e88747c6981f5c347268404338b68f8ccdb

Observation d7338bff-454c-4401-b14c-7a01c365e9c0 · outbound

This paper cites Hayden and J.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Hayden and J

Reference 75

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:16:58.819221Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:fd904511dff02aabd22bd88a1aa8958c43ff8effbfd5573c4f1c4b76d465c367

Observation 11b32d5f-36ee-4e2b-8e77-4bf08992b04a · outbound

This paper cites Sekino and L.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Sekino and L

Reference 76

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:16:58.825345Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:73c40711be99ef4bc6558113461a4747e9c826e799a07b3df1974874f62fb786

Observation 89270d80-94ea-413c-a078-118ae40fb73a · outbound

This paper cites Van den Nest, New Journal of Physics13, 123004 (2011).

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Van den Nest, New Journal of Physics13, 123004 (2011)

Reference 77

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:26:59.575856Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:2cf6b8a9239c85b4e88de8119cd945facaa8fc655fca1c081e2b2aa223aae162

Observation d813c386-9dc2-44d4-9477-e32ff42fe94e · outbound

This paper cites Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning

Reference 78

Resolution
verified exact
local_arxiv, observed 2026-07-10T08:16:58.896472Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:74d73da5c4774fe59b54541b59caecccb5212a4d433fd0fd2fea5452a9a05518

Observation ec2ef45a-0d8c-4dce-b318-e69df36a4a9d · outbound

This paper cites Leveraging Phase Polynomials for Quantum Circuit Optimization.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Leveraging Phase Polynomials for Quantum Circuit Optimization

Reference 79

Resolution
verified exact
local_arxiv, observed 2026-07-10T08:16:58.886205Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:225f6a9461f07b78c45739853ce4d23d2ab2c75e5a94a910e8cb22d27738e3ba

Observation b8e95b4b-5680-4f99-bdf4-eb913583b6c8 · outbound

This paper cites Classical simulation of quantum circuits by half Gauss sums.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Classical simulation of quantum circuits by half Gauss sums

Reference 80

Resolution
verified exact
local_arxiv, observed 2026-07-10T08:16:58.899228Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:560d9829769663d590c023e63688958680f404a15df5406756f97dc104e55a6b

Observation f0379468-5bb6-4d22-9a3f-5e850b53a7fc · outbound

This paper cites Veroni, A.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Veroni, A

Reference 81

Resolution
verified exact
arxiv_id, observed 2026-07-10T08:16:58.870158Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:06b49fcf7c0ab19b12db5e5860c0cc27c0982ebf2c5f810be3f16b936fe24195

Observation d6bfa263-fc5b-4680-bb9b-14f7847b21c8 · outbound

This paper cites Tirrito, P.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Tirrito, P

Reference 82

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:16:58.807643Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:39e5ee7cb904809e3ef3d931a04d9b1952ce2cb122a994fe917459edf2e50d4a

Observation beeea1e1-e4f5-4ab8-b469-26234f0de14a · outbound

This paper cites an unresolved cited work.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Unresolved cited work

Reference 83

Resolution
unresolved
raw_fallback, observed 2026-07-10T08:16:58.805569Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:1ee3c5515827c1aff3e5ecfdb82c6b3980f3eb6a41ce5b42a688a1589aa85cb5

Observation 436c770e-1158-4d24-88f4-9ce84f836972 · outbound

This paper cites an unresolved cited work.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Unresolved cited work

Reference 84

Resolution
unresolved
raw_fallback, observed 2026-07-10T08:16:59.558904Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:233fe9f3c2d32044f482d078d0ee448d2217db5a1584edb6ff77cddfe2d68723

Observation 5b85f206-9afb-4f4c-af6d-1f8042ffdb2f · outbound

This paper cites Aharonov, X.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Aharonov, X

Reference 85

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:16:59.556978Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:9eed397e1ab4f5782f6e99fa285340b8a73e6731fa45b229b2b19eef08ac6657

Observation 01c1da61-4b73-4d5a-b0d4-12b4116b55e8 · outbound

This paper cites Angrisani, A.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Angrisani, A

Reference 86

Resolution
verified exact
arxiv_id, observed 2026-07-10T08:16:58.891281Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:4c85841118e0d2b7f41e1709bbb9e16924eb7ca4c786ac8d0a52f6f7350d7994

Observation 55eeff2c-41ad-48f0-b009-45fc56e4d9cd · outbound

This paper cites Tindall and M.

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks Tindall and M

Reference 87

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T08:16:59.560955Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-07-10T08:07:58.802765Z digest=sha256:2cdba484bc66d072ebbbce40a6f53304aeae50906379c19c3a28a7f79929e868

Pith citing papers

No inbound Pith citation observations are available.