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 4 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-03T06:30:56.289259+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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

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-03T06:30:56.289259+00:00.

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

Pith citing papers

No inbound Pith citation observations are available.