The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth | Paper Citation Record

Observation 4b3b09bf-82a4-4784-887d-a21d25f41f0a · outbound

This paper cites Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando G.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando G

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-11T14:09:26.581077Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7e2e1137-dbdf-4227-b9f7-87631ca265fa · outbound

This paper cites Single- Round Proofs of Quantumness from Knowledge Assumptions , May 2024.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Single- Round Proofs of Quantumness from Knowledge Assumptions , May 2024

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-11T14:09:26.589682Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d25cea30-0525-476f-b278-078bd58393ba · outbound

This paper cites PRIMES is in P.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth PRIMES is in P

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-11T14:09:26.595073Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9a5ba932-00ee-4bff-849c-895af85b266b · outbound

This paper cites Ram Murty.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Ram Murty

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-11T14:09:26.601334Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a7239014-d3dc-4abe-a8ec-0b94ac8040b8 · outbound

This paper cites Miller, and Daochen Wang.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Miller, and Daochen Wang

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-11T14:09:26.606886Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 68913c05-e6da-4902-8e36-2bdd6c2d796e · outbound

This paper cites On verifiable quantum advantage with peaked circuit sampling, April 2024.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth On verifiable quantum advantage with peaked circuit sampling, April 2024

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-11T14:09:26.612998Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b4b95db6-6975-48bc-af96-d62fffc55f0b · outbound

This paper cites Bernstein, Jean-Fran c ois Biasse, and Michele Mosca.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Bernstein, Jean-Fran c ois Biasse, and Michele Mosca

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-11T14:09:26.618370Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2718d649-293c-4488-8aeb-3da9e6cb859d · outbound

This paper cites Efficient networks for quantum factoring.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Efficient networks for quantum factoring

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.677472Z

Source-reported events for the cited work

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

Observation 75cf863e-6c46-4bd2-8e75-4e4e7d256ae7 · outbound

This paper cites A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.653938Z

Source-reported events for the cited work

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

Observation e49914b2-3123-4bf3-acba-ea2230fa90d6 · outbound

This paper cites Factoring N = p\( ^ r \)q for large r.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Factoring N = p\( ^ r \)q for large r

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.617190Z

Source-reported events for the cited work

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

Observation efd21f0e-edb8-47d2-8183-e53dfc19409d · outbound

This paper cites Circuit for Shor's algorithm using 2n+3 qubits.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Circuit for Shor's algorithm using 2n+3 qubits

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.596997Z

Source-reported events for the cited work

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

Observation ee16d15c-acf9-4ff7-881b-c911e1a3aa57 · outbound

This paper cites an unresolved cited work.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Unresolved cited work

Reference 12

Resolution: unresolved; raw_fallback, observed 2026-08-11T14:09:28.577896Z

Source-reported events for the cited work

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

Observation bb668dce-4454-48c1-b1a2-699d9e98ced1 · outbound

This paper cites an unresolved cited work.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Unresolved cited work

Reference 13

Resolution: unresolved; raw_fallback, observed 2026-08-11T14:09:28.564084Z

Source-reported events for the cited work

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

Observation 27fa86d2-95d1-437b-92e9-33f7898eec8d · outbound

This paper cites Bernstein, Nadia Heninger, Paul Lou, and Luke Valenta.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Bernstein, Nadia Heninger, Paul Lou, and Luke Valenta

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.546920Z

Source-reported events for the cited work

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

Observation 0b8ee617-01e3-40af-8dcd-58b548ffa041 · outbound

This paper cites Simpler Proofs of Quantumness.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Simpler Proofs of Quantumness

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.528103Z

Source-reported events for the cited work

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

Observation 0e6fb714-768f-4805-a6bc-ae38555c18f6 · outbound

This paper cites Buchmann and Hendrik W.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Buchmann and Hendrik W

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.508585Z

Source-reported events for the cited work

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

Observation 4589861b-af54-40be-a8f2-4834671f0d13 · outbound

This paper cites an unresolved cited work.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Unresolved cited work

Reference 17

Resolution: unresolved; raw_fallback, observed 2026-08-11T14:09:28.493392Z

Source-reported events for the cited work

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

Observation fffc9aa8-9b10-4b58-a647-2b288ae70a18 · outbound

This paper cites an unresolved cited work.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Unresolved cited work

Reference 18

Resolution: unresolved; raw_fallback, observed 2026-08-11T14:09:28.478884Z

Source-reported events for the cited work

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

Observation bafffef0-6420-4325-82f6-f0ed21949fc3 · outbound

This paper cites Bach and J.O.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Bach and J.O

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.460430Z

Source-reported events for the cited work

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

Observation fc414bda-a97d-40f8-9126-c6b223b96f68 · outbound

This paper cites Sutherland.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Sutherland

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.446608Z

Source-reported events for the cited work

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

Observation 0a6b2729-a4b1-4d2c-80ee-9be4e8067ca8 · outbound

This paper cites Quantum algorithms revisited.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Quantum algorithms revisited

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.427188Z

Source-reported events for the cited work

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

Observation 7c755d5a-df40-498b-8ca7-adf67dc5a949 · outbound

This paper cites Factoring n=p \^ rq \^ s for large r and s.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Factoring n=p \^ rq \^ s for large r and s

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.396395Z

Source-reported events for the cited work

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

Observation 1852bb83-e8c8-4e72-b7bf-b1691932e6de · outbound

This paper cites Reducing the Number of Qubits in Quantum Factoring , 2024.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Reducing the Number of Qubits in Quantum Factoring , 2024

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.376279Z

Source-reported events for the cited work

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

Observation b6582846-7ed7-4b13-a5fb-5d7f66feab52 · outbound

This paper cites The random oracle methodology, revisited.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth The random oracle methodology, revisited

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.357764Z

Source-reported events for the cited work

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

Observation 60e7ff31-ba6e-4713-9869-d897dd4cf113 · outbound

This paper cites Quantum algorithms for lattice problems.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Quantum algorithms for lattice problems

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.336927Z

Source-reported events for the cited work

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

Observation afc4be59-3ba9-4539-b571-d8b301ac5567 · outbound

This paper cites an unresolved cited work.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Unresolved cited work

Reference 26

Resolution: unresolved; raw_fallback, observed 2026-08-11T14:09:28.320027Z

Source-reported events for the cited work

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

Observation 5b0b8a31-ebde-4539-b154-f2c8eae228b8 · outbound

This paper cites On the security of cryptosystems with quadratic decryption: The nicest cryptanalysis.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth On the security of cryptosystems with quadratic decryption: The nicest cryptanalysis

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.301424Z

Source-reported events for the cited work

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

Observation 3b6f0208-a06d-4c6d-8b24-666efe74728a · outbound

This paper cites G auss and J acobi sums on finite fields and Z /m Z.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth G auss and J acobi sums on finite fields and Z /m Z

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.256889Z

Source-reported events for the cited work

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

Observation 32723e5d-9753-452d-998a-989c68c726e6 · outbound

This paper cites An approximate Fourier transform useful in quantum factoring.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth An approximate Fourier transform useful in quantum factoring

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-11T14:09:26.724872Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 80dcc88a-b686-455f-aad0-e958eb11a7ac · outbound

This paper cites Fast parallel circuits for the quantum Fourier transform.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Fast parallel circuits for the quantum Fourier transform

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.237443Z

Source-reported events for the cited work

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

Observation 14c2b56a-3958-4573-adf8-85b085bac528 · outbound

This paper cites an unresolved cited work.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Unresolved cited work

Reference 31

Resolution: unresolved; raw_fallback, observed 2026-08-11T14:09:28.202236Z

Source-reported events for the cited work

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

Observation 05e6a48e-8d89-4780-8101-58c27c4dcbc3 · outbound

This paper cites Draper, Samuel A.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Draper, Samuel A

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.183810Z

Source-reported events for the cited work

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

Observation 6fb1eb65-ade2-4978-baf8-22d30d9cce9a · outbound

This paper cites Extending R egev's factoring algorithm to compute discrete logarithms.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Extending R egev's factoring algorithm to compute discrete logarithms

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.162852Z

Source-reported events for the cited work

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

Observation 4268a500-9fb8-4a10-ac94-c9cfc35d22fd · outbound

This paper cites A high-level comparison of state-of-the-art quantum algorithms for breaking asymmetric cryptography.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth A high-level comparison of state-of-the-art quantum algorithms for breaking asymmetric cryptography

Reference 34

Resolution: verified exact; local_arxiv, observed 2026-08-11T14:09:27.092280Z

Source-reported events for the cited work

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

Observation 01a54480-e639-4a41-bb02-0c704a5709b3 · outbound

This paper cites Quantum algorithms for computing short discrete logarithms and factoring RSA integers.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Quantum algorithms for computing short discrete logarithms and factoring RSA integers

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.143557Z

Source-reported events for the cited work

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

Observation 426d37a7-570e-42f9-a619-54e441d7454b · outbound

This paper cites How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.119879Z

Source-reported events for the cited work

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

Observation fe710117-df26-4cad-904f-e30dd47ffef2 · outbound

This paper cites Factoring with n+2 clean qubits and n-1 dirty qubits.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Factoring with n+2 clean qubits and n-1 dirty qubits

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-11T14:09:26.761688Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a349d79e-057b-4e16-a35d-8f95240b1bc5 · outbound

This paper cites Asymptotically Efficient Quantum Karatsuba Multiplication.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Asymptotically Efficient Quantum Karatsuba Multiplication

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-11T14:09:26.766499Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6537f98b-6f8a-4437-be6c-6c35f6b86345 · outbound

This paper cites Creating superpositions that correspond to efficiently integrable probability distributions, 2002.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Creating superpositions that correspond to efficiently integrable probability distributions, 2002

Reference 39

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.102948Z

Source-reported events for the cited work

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

Observation 9fef0299-d1c3-43e8-abee-770241c747ae · outbound

This paper cites Smooth numbers: Computational number theory and beyond.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Smooth numbers: Computational number theory and beyond

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.084629Z

Source-reported events for the cited work

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

Observation fb6322f0-4ac1-45a0-a527-dba9989b19e1 · outbound

This paper cites An improved quantum Fourier transform algorithm and applications.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth An improved quantum Fourier transform algorithm and applications

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.062333Z

Source-reported events for the cited work

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

Observation 503e877d-9272-4e17-af0a-e90f720c82cc · outbound

This paper cites A deterministic algorithm for finding r-power divisors.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth A deterministic algorithm for finding r-power divisors

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.037165Z

Source-reported events for the cited work

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

Observation c0e6190e-3a22-4d3a-b285-dc923247c642 · outbound

This paper cites Improved Quantum Circuits for Elliptic Curve Discrete Logarithms.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Improved Quantum Circuits for Elliptic Curve Discrete Logarithms

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:28.009728Z

Source-reported events for the cited work

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

Observation ec354e09-d735-45e0-82fe-734d51ec3689 · outbound

This paper cites an unresolved cited work.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Unresolved cited work

Reference 44

Resolution: unresolved; raw_fallback, observed 2026-08-11T14:09:27.989602Z

Source-reported events for the cited work

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

Observation 78b89932-6f05-49b2-a4d5-cbc7d42afe0a · outbound

This paper cites Integer multiplication in time O (n n).

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Integer multiplication in time O (n n)

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.960005Z

Source-reported events for the cited work

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

Observation 9c199697-bf28-4fec-adf5-de47b0f7ccb4 · outbound

This paper cites an unresolved cited work.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Unresolved cited work

Reference 46

Resolution: unresolved; raw_fallback, observed 2026-08-11T14:09:27.934381Z

Source-reported events for the cited work

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

Observation f47262df-48c0-4144-9bf8-8d3dc5f17dd7 · outbound

This paper cites Classically-Verifiable Quantum Advantage from a Computational Bell Test.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Classically-Verifiable Quantum Advantage from a Computational Bell Test

Reference 47

Resolution: metadata mismatch; local_arxiv, observed 2026-08-11T14:09:27.046706Z

Source-reported events for the cited work

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

Observation dbacb560-f457-428b-be9e-69b8ee6f43ed · outbound

This paper cites Quantum Advantage from Any Non-local Game.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Quantum Advantage from Any Non-local Game

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.896116Z

Source-reported events for the cited work

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

Observation 01000f2a-50fd-430a-b150-0839a171e45c · outbound

This paper cites an unresolved cited work.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Unresolved cited work

Reference 49

Resolution: unresolved; raw_fallback, observed 2026-08-11T14:09:27.710470Z

Source-reported events for the cited work

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

Observation d881f313-28cf-4be3-8572-8aa0ac917e22 · outbound

This paper cites Kahanamoku-Meyer and Norman Y.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Kahanamoku-Meyer and Norman Y

Reference 50

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.694632Z

Source-reported events for the cited work

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

Observation 188618fb-d0c5-44ea-b1d3-b09bc494fbc5 · outbound

This paper cites The Art of Computer Programming, Volume II : Seminumerical Algorithms , 3rd Edition.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth The Art of Computer Programming, Volume II : Seminumerical Algorithms , 3rd Edition

Reference 51

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.679742Z

Source-reported events for the cited work

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

Observation ccf191db-2261-4fb6-bf5b-3543b638958a · outbound

This paper cites an unresolved cited work.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Unresolved cited work

Reference 52

Resolution: unresolved; raw_fallback, observed 2026-08-11T14:09:27.661331Z

Source-reported events for the cited work

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

Observation 4cfde45d-8fbd-436d-a1b8-c1f29bba468a · outbound

This paper cites Lenstra, Hendrik W.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Lenstra, Hendrik W

Reference 53

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.647527Z

Source-reported events for the cited work

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

Observation 724a002a-4cb0-473d-a5d7-cce2cd9571ba · outbound

This paper cites An efficient exact quantum algorithm for the integer square-free decomposition problem.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth An efficient exact quantum algorithm for the integer square-free decomposition problem

Reference 54

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.634386Z

Source-reported events for the cited work

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

Observation 23280312-2407-4b92-92f4-36702d1feebc · outbound

This paper cites Levine and Alan T.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Levine and Alan T

Reference 55

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.621898Z

Source-reported events for the cited work

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

Observation bce4c61f-c111-4d62-b20c-3b12d1a095c0 · outbound

This paper cites Using LLL -reduction for solving RSA and factorization problems.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Using LLL -reduction for solving RSA and factorization problems

Reference 56

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.607456Z

Source-reported events for the cited work

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

Observation 06eb267c-ded9-4243-bdca-ca73231b4466 · outbound

This paper cites Verschoor.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Verschoor

Reference 57

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.590602Z

Source-reported events for the cited work

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

Observation 6c475c5d-b972-4226-bd71-8fd29df6af2c · outbound

This paper cites an unresolved cited work.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Unresolved cited work

Reference 58

Resolution: unresolved; raw_fallback, observed 2026-08-11T14:09:27.575344Z

Source-reported events for the cited work

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

Observation 55a97b70-26c8-4601-a37c-36f956b68fd6 · outbound

This paper cites o ller. On S ch \.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth o ller. On S ch \

Reference 59

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.562179Z

Source-reported events for the cited work

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

Observation 762709d2-4846-490a-b82a-b5ee5d49830e · outbound

This paper cites Montgomery.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Montgomery

Reference 60

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.545454Z

Source-reported events for the cited work

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

Observation b64fb96c-8d27-41b5-8354-8d225db25e25 · outbound

This paper cites Fast square-free decomposition of integers using class groups.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Fast square-free decomposition of integers using class groups

Reference 61

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.530282Z

Source-reported events for the cited work

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

Observation d69b8bc3-332d-4009-b977-81925fcb32b1 · outbound

This paper cites Proofs of quantumness from trapdoor permutations.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Proofs of quantumness from trapdoor permutations

Reference 62

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.514262Z

Source-reported events for the cited work

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

Observation 6a699cfd-789d-49a2-a788-37e839857b35 · outbound

This paper cites Quantum Circuit Design for Integer Multiplication Based on Sch \"o nhage -- Strassen Algorithm.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Quantum Circuit Design for Integer Multiplication Based on Sch \"o nhage -- Strassen Algorithm

Reference 63

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.496465Z

Source-reported events for the cited work

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

Observation 230a03fd-9327-455b-beb7-4dbd41f782e8 · outbound

This paper cites an unresolved cited work.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Unresolved cited work

Reference 64

Resolution: unresolved; raw_fallback, observed 2026-08-11T14:09:27.477868Z

Source-reported events for the cited work

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

Observation c1d32f92-6dd6-48a8-b9ff-f4233c9d2c06 · outbound

This paper cites A new public-key cryptosystem as secure as factoring.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth A new public-key cryptosystem as secure as factoring

Reference 65

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.459871Z

Source-reported events for the cited work

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

Observation f6bbc189-698b-42f5-b2de-5e9d7b7689f0 · outbound

This paper cites an unresolved cited work.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Unresolved cited work

Reference 66

Resolution: unresolved; raw_fallback, observed 2026-08-11T14:09:27.443715Z

Source-reported events for the cited work

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

Observation 1d0096c3-a003-4d70-87c5-8b23c5777b73 · outbound

This paper cites Faster factoring of integers of a special form.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Faster factoring of integers of a special form

Reference 67

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.427216Z

Source-reported events for the cited work

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

Observation 424b880e-d9eb-4eb2-aa1e-9b9223219ac0 · outbound

This paper cites an unresolved cited work.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Unresolved cited work

Reference 68

Resolution: unresolved; raw_fallback, observed 2026-08-11T14:09:27.412970Z

Source-reported events for the cited work

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

Observation 6932ca76-4b19-4817-a507-d6fcc2d95624 · outbound

This paper cites A new public-key cryptosystem over a quadratic order with quadratic decryption time.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth A new public-key cryptosystem over a quadratic order with quadratic decryption time

Reference 69

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.397863Z

Source-reported events for the cited work

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

Observation 13576dc2-fdcf-461a-8049-4df1b6ac890b · outbound

This paper cites Shor's discrete logarithm quantum algorithm for elliptic curves.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Shor's discrete logarithm quantum algorithm for elliptic curves

Reference 70

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.383363Z

Source-reported events for the cited work

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

Observation e706babc-0023-40a2-b58b-7f59115efc11 · outbound

This paper cites On lattices, learning with errors, random linear codes, and cryptography.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth On lattices, learning with errors, random linear codes, and cryptography

Reference 71

Resolution: unresolved; no resolver link, observed 2026-08-11T14:09:26.928377Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0489d553-c2aa-497d-af3e-0f1e3e6eade7 · outbound

This paper cites An efficient quantum factoring algorithm.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth An efficient quantum factoring algorithm

Reference 72

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.358911Z

Source-reported events for the cited work

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

Observation 2e0b0445-cdb3-4cfe-8ee2-c4c9663ddce4 · outbound

This paper cites Quantum resource estimates for computing elliptic curve discrete logarithms.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Quantum resource estimates for computing elliptic curve discrete logarithms

Reference 73

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.342168Z

Source-reported events for the cited work

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

Observation 63cb66a2-78b1-45e8-95cd-58314c51cc63 · outbound

This paper cites Space-efficient and noise-robust quantum factoring.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Space-efficient and noise-robust quantum factoring

Reference 74

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.321360Z

Source-reported events for the cited work

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

Observation 7d558538-55a6-4f83-96fc-d8b2ae773bd4 · outbound

This paper cites Sch \"o nhage.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Sch \"o nhage

Reference 75

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.303489Z

Source-reported events for the cited work

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

Observation f053b808-d2ef-487d-8437-e1ba263a405f · outbound

This paper cites an unresolved cited work.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Unresolved cited work

Reference 76

Resolution: unresolved; raw_fallback, observed 2026-08-11T14:09:27.284144Z

Source-reported events for the cited work

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

Observation 65251a9f-c8d3-4d04-86c6-821ba0b9c6bd · outbound

This paper cites Using fewer qubits in Shor ’s factorization algorithm via simultaneous Diophantine approximation.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Using fewer qubits in Shor ’s factorization algorithm via simultaneous Diophantine approximation

Reference 77

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.265246Z

Source-reported events for the cited work

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

Observation e169b207-61f5-4c75-976e-380e9dc6e9bc · outbound

This paper cites an unresolved cited work.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Unresolved cited work

Reference 78

Resolution: unresolved; no resolver link, observed 2026-08-11T14:09:26.958762Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 247a8089-43a1-4b00-92db-15e9048e24b1 · outbound

This paper cites Fast multiplication of large numbers.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Fast multiplication of large numbers

Reference 79

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.241030Z

Source-reported events for the cited work

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

Observation dc4cfcbb-5429-49de-ad20-c79f88a1a428 · outbound

This paper cites A new R abin-type trapdoor permutation equivalent to factoring.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth A new R abin-type trapdoor permutation equivalent to factoring

Reference 80

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.225131Z

Source-reported events for the cited work

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

Observation 0df9ea7a-920a-4f5b-ae48-f1fb206d3b02 · outbound

This paper cites Fast RSA -type cryptosystem modulo p\( ^ k \)q.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Fast RSA -type cryptosystem modulo p\( ^ k \)q

Reference 81

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.209172Z

Source-reported events for the cited work

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

Observation 7ca95435-301c-467e-afc1-70907acc3261 · outbound

This paper cites A quantum circuit for Shor's factoring algorithm using 2n+2 qubits.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth A quantum circuit for Shor's factoring algorithm using 2n+2 qubits

Reference 82

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.197044Z

Source-reported events for the cited work

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

Observation 322dc971-492c-4d62-a8c9-5d1b563b4a9f · outbound

This paper cites A uni ed approach to hgcd algorithms for polynomials and integers, 1990.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth A uni ed approach to hgcd algorithms for polynomials and integers, 1990

Reference 83

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.181560Z

Source-reported events for the cited work

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

Observation 3c49328c-d498-4f03-958d-9609fe99b5e2 · outbound

This paper cites Quantum networks for elementary arithmetic operations.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Quantum networks for elementary arithmetic operations

Reference 84

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.164244Z

Source-reported events for the cited work

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

Observation b8a3142d-505c-4474-80de-d852809e1182 · outbound

This paper cites an unresolved cited work.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Unresolved cited work

Reference 85

Resolution: unresolved; raw_fallback, observed 2026-08-11T14:09:27.149199Z

Source-reported events for the cited work

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

Observation abed54a1-41cd-4262-8f62-584ce40ac437 · outbound

This paper cites Verifiable Quantum Advantage without Structure.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Verifiable Quantum Advantage without Structure

Reference 86

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.134936Z

Source-reported events for the cited work

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

Observation d6af7749-b45f-4c10-9d02-1d9ea47c0e08 · outbound

This paper cites Shor's algorithm with fewer (pure) qubits, 2006.

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth Shor's algorithm with fewer (pure) qubits, 2006

Reference 87

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T14:09:27.121615Z

Source-reported events for the cited work

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

Coverage vector

Reference resolution

Outbound references

Pith citing papers