Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path | Paper Citation Record

Observation d0d6d9d4-1a48-4deb-b84e-bded2c7224e6 · outbound

This paper cites A Nielsen and I.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path A Nielsen and I

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:05.802680Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 37c4cc25-d28c-4c74-af34-4bb1ead63f85 · outbound

This paper cites Ambainis.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Ambainis

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:07.167949Z

Source-reported events for the cited work

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

Observation f27f339e-dc3a-422f-aff3-09fac3508f5c · outbound

This paper cites Ablayev, M.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Ablayev, M

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:05.814277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b3017a0d-0217-48cc-b878-aa6fe825642b · outbound

This paper cites Ablayev, K.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Ablayev, K

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:05.819190Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f9e22a9a-7a81-450e-a08d-2e02c034f37f · outbound

This paper cites Ablayev and A.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Ablayev and A

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:05.824451Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a4952389-d0ad-4cdd-b13e-10cc5df99156 · outbound

This paper cites Quantum hashing algorithm implementation.arXiv preprint,.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Quantum hashing algorithm implementation.arXiv preprint,

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:05.829761Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 60f45b6a-d50c-4f00-b8ad-db59c9d0775b · outbound

This paper cites Fast probabilistic algorithms.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Fast probabilistic algorithms

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:05.834634Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aa53b07a-4c24-451f-aa86-22951667541f · outbound

This paper cites Ambainis and R.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Ambainis and R

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:05.839980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 95d069fe-1cbf-4c94-bb97-4ad77267235a · outbound

This paper cites Improved constructions of quantum automata.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Improved constructions of quantum automata

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:07.078660Z

Source-reported events for the cited work

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

Observation b2602f75-7a13-4727-ba8b-6cf44be2b543 · outbound

This paper cites Ambainis and N.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Ambainis and N

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:05.850890Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 120ede59-8513-49f1-9a08-6dbcadb4cb49 · outbound

This paper cites Quantum fingerprinting.Physical Review Letters, 87(16):167902, 2001.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Quantum fingerprinting.Physical Review Letters, 87(16):167902, 2001

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:05.856547Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 786c06ce-6603-455c-bbe7-caf647dc57de · outbound

This paper cites Ablayev, A.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Ablayev, A

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:05.861296Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cabc263e-b6a0-43c2-89cc-d8b64f794d5c · outbound

This paper cites Ablayev and A.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Ablayev and A

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:07.024676Z

Source-reported events for the cited work

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

Observation 729caba7-6204-491d-8911-d3621d1466b2 · outbound

This paper cites Ablayev and A.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Ablayev and A

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:07.008359Z

Source-reported events for the cited work

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

Observation a5466e12-9f45-48ea-9893-e821868d0466 · outbound

This paper cites Cryptographic quantum hashing.Laser Physics Letters, 11(2):025202, 2013.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Cryptographic quantum hashing.Laser Physics Letters, 11(2):025202, 2013

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.992007Z

Source-reported events for the cited work

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

Observation 0c828e93-2a37-4dcd-b42e-624f594f3ada · outbound

This paper cites Quan- tum fingerprinting and quantum hashing.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Quan- tum fingerprinting and quantum hashing

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.972230Z

Source-reported events for the cited work

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

Observation ed1769c4-2ca3-4803-b4bd-b5da2a9a3d35 · outbound

This paper cites Exponential separation of quantum and classical online space complexity.Theory of Computing Systems, 45(2):188–202, 2009.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Exponential separation of quantum and classical online space complexity.Theory of Computing Systems, 45(2):188–202, 2009

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:05.884977Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b4bc1760-f68c-4eca-95a5-2df1fa9c574c · outbound

This paper cites Exponential separation of quantum and classical online space complexity.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Exponential separation of quantum and classical online space complexity

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.943694Z

Source-reported events for the cited work

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

Observation 410f7b7c-e702-4582-9950-a1a43c34c9f8 · outbound

This paper cites Ablayev, M.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Ablayev, M

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:05.893879Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 494abf16-74c1-4ab6-81a4-4cb7ddd3b031 · outbound

This paper cites Hybrid classical–quantum text search based on hashing.Mathematics, 12(12):1858, 2024.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Hybrid classical–quantum text search based on hashing.Mathematics, 12(12):1858, 2024

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:05.898584Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5f8ec369-fc8e-42cf-acec-753e14d930ad · outbound

This paper cites Khadiev and A.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Khadiev and A

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:05.903542Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 21a8d680-af9c-454e-a2c4-7c65723a09a1 · outbound

This paper cites Quantum and classical log-bounded automata for the online disjointness problem.Mathematics, 10(1), 2022.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Quantum and classical log-bounded automata for the online disjointness problem.Mathematics, 10(1), 2022

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:05.908292Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0d33f47f-0284-45c0-881c-cb91f88f473a · outbound

This paper cites Khadiev and A.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Khadiev and A

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.885968Z

Source-reported events for the cited work

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

Observation 3524de4c-deba-4777-bb12-d35b0cd451c8 · outbound

This paper cites Exponential separation be- tween quantum and classical ordered binary decision diagrams, reordering method and hierarchies.Natural Computing, 22(4):723–736, 2023.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Exponential separation be- tween quantum and classical ordered binary decision diagrams, reordering method and hierarchies.Natural Computing, 22(4):723–736, 2023

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:05.917739Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 27d19bb1-d521-479d-b4b5-043d3dd34836 · outbound

This paper cites Ablayev, A.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Ablayev, A

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:05.922594Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f5ed6720-4a89-4084-9516-0de777192cff · outbound

This paper cites A model of quantum communication device for quantum hashing.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path A model of quantum communication device for quantum hashing

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:05.927240Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 13bb81e3-8d21-49db-a824-b422b5ea4b00 · outbound

This paper cites Ambainis and A.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Ambainis and A

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:05.932147Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 28669cf0-c789-4d51-9aed-b35d7c265933 · outbound

This paper cites Automata and quantum computing.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Automata and quantum computing

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.822845Z

Source-reported events for the cited work

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

Observation 95c8e4a4-9ac7-4221-9579-ae0c8e7b9594 · outbound

This paper cites Deterministic construction of qfas based on the quantum fingerprinting technique.Lobachevskii Journal of Mathematics, 44(2):713–723, 2023.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Deterministic construction of qfas based on the quantum fingerprinting technique.Lobachevskii Journal of Mathematics, 44(2):713–723, 2023

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.806226Z

Source-reported events for the cited work

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

Observation 6879af42-a547-4335-b819-924802a07cff · outbound

This paper cites Gainutdinova and A.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Gainutdinova and A

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:05.946499Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dff91330-7395-45de-b8d2-29ab10f00916 · outbound

This paper cites Languagesrecognizedbynondeterministic quantum finite automata.Quantum Information and Computation, 10(9&10):747– 770, 2010.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Languagesrecognizedbynondeterministic quantum finite automata.Quantum Information and Computation, 10(9&10):747– 770, 2010

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.774263Z

Source-reported events for the cited work

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

Observation 65186796-24d6-42f8-bc85-a07f382dcd27 · outbound

This paper cites Gainutdinova and A.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Gainutdinova and A

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.757679Z

Source-reported events for the cited work

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

Observation 62d545c2-a20e-4236-ae1e-91497f56dcfe · outbound

This paper cites Gainutdinova and A.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Gainutdinova and A

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.741559Z

Source-reported events for the cited work

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

Observation 2186d957-0db7-45e6-afce-293b4be0bc2c · outbound

This paper cites Ziiatdinov, F.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Ziiatdinov, F

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:05.966900Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1628841f-c475-4428-9cbb-d947c7a68dad · outbound

This paper cites Beyond classical: The role of data encoding in quantum regression on air quality prediction.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Beyond classical: The role of data encoding in quantum regression on air quality prediction

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.715921Z

Source-reported events for the cited work

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

Observation 8c262c1f-a716-4eab-932e-c9e3b66a020f · outbound

This paper cites Multiqudit quantum hashing and its implementation based on orbital angular momentum encoding.Laser Physics Letters, 19(12):125205, 2022.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Multiqudit quantum hashing and its implementation based on orbital angular momentum encoding.Laser Physics Letters, 19(12):125205, 2022

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:05.976596Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5c7b5d44-82a5-4e62-913a-88b3053608a4 · outbound

This paper cites Quan- tum hashing via single-photon states with orbital angular momentum.Physical Review A, 104(5):052606, 2021.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Quan- tum hashing via single-photon states with orbital angular momentum.Physical Review A, 104(5):052606, 2021

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:05.982834Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9270d87d-9130-4e19-9797-bda6aa5f432b · outbound

This paper cites ZD Plachta, M.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path ZD Plachta, M

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:05.987789Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b748f2d2-2849-43fe-9f3e-bdc5d9d0ddb2 · outbound

This paper cites Experimen- tal demonstration advantage of photonic finite automata.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Experimen- tal demonstration advantage of photonic finite automata

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:05.992417Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4bf45d7b-a1ca-4a11-9a4c-526bab4738e6 · outbound

This paper cites Decompositions of general quantum gates.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Decompositions of general quantum gates

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.651133Z

Source-reported events for the cited work

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

Observation e6a220c3-0cbf-459f-9141-99f192275ba8 · outbound

This paper cites Quantum circuits with uniformly controlled one-qubit gates.Physical Review A—Atomic, Molecular, and Optical Physics, 71(5):052330, 2005.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Quantum circuits with uniformly controlled one-qubit gates.Physical Review A—Atomic, Molecular, and Optical Physics, 71(5):052330, 2005

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:06.002070Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 716558ec-a943-4bf7-9d09-10ba4e5a737d · outbound

This paper cites Efficient implementation of ampli- tude form of quantum hashing using state-of-the-art quantum processors.Russian Microelectronics, 52(Suppl 1):S390–S394, 2023.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Efficient implementation of ampli- tude form of quantum hashing using state-of-the-art quantum processors.Russian Microelectronics, 52(Suppl 1):S390–S394, 2023

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:06.007056Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2605b9db-9d46-453c-8aaa-fd484c23c825 · outbound

This paper cites Quantum random forest model prediction circuit gate complexity.Russian Microelectronics, 54(8):1442–1448, 2025.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Quantum random forest model prediction circuit gate complexity.Russian Microelectronics, 54(8):1442–1448, 2025

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.612930Z

Source-reported events for the cited work

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

Observation 255484d7-3181-4430-b842-a145ac7b8a55 · outbound

This paper cites Safina, K.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Safina, K

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.595831Z

Source-reported events for the cited work

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

Observation 49b664e4-3a8c-4870-8e98-af550dd27313 · outbound

This paper cites Kvantu algoritmu realiz¯ acija fizisk¯ a kvantu dator¯ a.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Kvantu algoritmu realiz¯ acija fizisk¯ a kvantu dator¯ a

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:06.021312Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0ccf944a-8e99-4a9d-a56c-9a98948df850 · outbound

This paper cites Ziiatdinov and A.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Ziiatdinov and A

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:06.025844Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a0985e3b-ad76-4551-a007-f205da32ee9a · outbound

This paper cites Ziiatdinov, A.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Ziiatdinov, A

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.553040Z

Source-reported events for the cited work

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

Observation 9f5c88db-19f8-459d-b7fd-c21ffbb74c32 · outbound

This paper cites Khadieva, O Salehi, and A.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Khadieva, O Salehi, and A

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:06.034894Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a4db36f4-4eaa-4af1-bec8-498d92e9aa6b · outbound

This paper cites Khadiev, A.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Khadiev, A

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:06.039696Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c329aabc-5a9a-41e6-b6e6-1efb66a15d76 · outbound

This paper cites Constant-depth algorithm for quantum hashing.Russian Microelec- tronics, 52(Suppl 1):S399–S402, 2023.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Constant-depth algorithm for quantum hashing.Russian Microelec- tronics, 52(Suppl 1):S399–S402, 2023

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:06.044123Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c202e873-4fe1-4e0e-a299-8e85b2125408 · outbound

This paper cites Shallow circuit imple- mentation for the phase form of quantum hashing and local-sensitive hashing on ibmq noisy emulators.Russian Microelectronics, 53(8):1449–1457, 2025.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Shallow circuit imple- mentation for the phase form of quantum hashing and local-sensitive hashing on ibmq noisy emulators.Russian Microelectronics, 53(8):1449–1457, 2025

Reference 51

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:06.048811Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b9c167b6-b9d4-4bff-9788-72a54b26a8dc · outbound

This paper cites Quantum error correction below the surface code threshold.Nature, 638:27, 2025.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Quantum error correction below the surface code threshold.Nature, 638:27, 2025

Reference 52

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.494915Z

Source-reported events for the cited work

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

Observation 1ad01bcb-d548-4e1d-b753-4bb2d7207a34 · outbound

This paper cites Establishing a new benchmark in quantum computational advantage with 105-qubit zuchongzhi 3.0 processor.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Establishing a new benchmark in quantum computational advantage with 105-qubit zuchongzhi 3.0 processor

Reference 53

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.478119Z

Source-reported events for the cited work

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

Observation a77b9e3f-f999-4e41-88d6-e712781b2e76 · outbound

This paper cites Quantum computing, 1987.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Quantum computing, 1987

Reference 54

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.460005Z

Source-reported events for the cited work

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

Observation efcebc70-7faf-4b42-bd6d-a5c78aaa99f8 · outbound

This paper cites Efficient algorithms for solving the shortest covering path problem.Transportation Science, 28(4):317–327, 1994.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Efficient algorithms for solving the shortest covering path problem.Transportation Science, 28(4):317–327, 1994

Reference 55

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:06.067194Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 05046a91-d15e-4067-9783-9253f046803b · outbound

This paper cites McGraw-Hill, 2001.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path McGraw-Hill, 2001

Reference 56

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:06.071694Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d7cda9db-c4be-4f41-8d71-7167a955f0d7 · outbound

This paper cites Lecture Notes on Quantum Algorithms.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Lecture Notes on Quantum Algorithms

Reference 57

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:06.075980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 03ec0750-42ed-4294-83bb-99485df2ad02 · outbound

This paper cites Ablayev, A.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Ablayev, A

Reference 58

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:06.081016Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8d8d05af-3414-4ae7-bf38-f93a0440d6c9 · outbound

This paper cites Classical and quantum parallelism in the quantum fingerprinting method.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Classical and quantum parallelism in the quantum fingerprinting method

Reference 59

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.411259Z

Source-reported events for the cited work

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

Observation cf689b82-9096-4a29-a66a-456942d91a8e · outbound

This paper cites M Ablayev and A.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path M Ablayev and A

Reference 60

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.395176Z

Source-reported events for the cited work

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

Observation 757ead0b-7ea9-40e1-b9d7-3d98b6ee42c5 · outbound

This paper cites Ant colonies for the travelling sales- man problem.Biosystems, 43(2):73–81, 1997.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Ant colonies for the travelling sales- man problem.Biosystems, 43(2):73–81, 1997

Reference 61

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.378517Z

Source-reported events for the cited work

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

Observation e418bf2d-15b5-40bf-8151-5f7b80fb120b · outbound

This paper cites The traveling salesman problem: a case study.Local search in combinatorial optimization, pages 215–310, 1997.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path The traveling salesman problem: a case study.Local search in combinatorial optimization, pages 215–310, 1997

Reference 62

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.358799Z

Source-reported events for the cited work

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

Observation 7c275864-b04e-424d-9c99-7143238226d2 · outbound

This paper cites Approximation algorithms for connected domi- nating sets.Algorithmica, 20:374–387, 1998.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Approximation algorithms for connected domi- nating sets.Algorithmica, 20:374–387, 1998

Reference 63

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.342060Z

Source-reported events for the cited work

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

Observation cb1d0e84-9114-48ac-8763-5f0120a272a6 · outbound

This paper cites Christofides.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Christofides

Reference 64

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.326972Z

Source-reported events for the cited work

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

Observation 899bbf97-954b-41d0-9ab0-b245d1d00ef4 · outbound

This paper cites On some extremal walks in graphs (in russian).Upravlyaemye sistemy, (17):76–79, 1978.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path On some extremal walks in graphs (in russian).Upravlyaemye sistemy, (17):76–79, 1978

Reference 65

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.311649Z

Source-reported events for the cited work

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

Observation b435b971-6120-4d75-86dc-f6d9c8609eda · outbound

This paper cites good” in the following sense. A set of parametersK={k 1, . . . , kt}is called “good.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path good” in the following sense. A set of parametersK={k 1, . . . , kt}is called “good

Reference 66

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.297163Z

Source-reported events for the cited work

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

Observation 3f19cddd-d88a-4a5e-a6ea-aecb0a31cbd3 · outbound

This paper cites an unresolved cited work.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Unresolved cited work

Reference 67

Resolution: unresolved; no resolver link, observed 2026-08-11T23:04:06.126125Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 99b4c44e-6077-49e7-b4f8-d7934baad135 · outbound

This paper cites collects.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path collects

Reference 68

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.268286Z

Source-reported events for the cited work

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

Observation 8ae193bf-90db-40a8-b2ea-85e512a73ddf · outbound

This paper cites Then we ac- cept the input if the outcome is the all-zero state.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Then we ac- cept the input if the outcome is the all-zero state

Reference 69

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.248803Z

Source-reported events for the cited work

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

Observation 5c6b512b-9ad1-4968-bfb5-87cdf9115ba1 · outbound

This paper cites an unresolved cited work.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path Unresolved cited work

Reference 70

Resolution: unresolved; raw_fallback, observed 2026-08-11T23:04:06.231993Z

Source-reported events for the cited work

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

Observation 0784d2ea-a2d1-49d2-a19e-e82bf435a52d · outbound

This paper cites The angleξ r corresponds to the qubitqr associated with the vertexv.

Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path The angleξ r corresponds to the qubitqr associated with the vertexv

Reference 71

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T23:04:06.214910Z

Source-reported events for the cited work

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

Coverage vector

Reference resolution

Outbound references

Pith citing papers