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 12 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-12T06:34:41.77262+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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

Pith citing papers

No inbound Pith citation observations are available.