{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreigtcbd4v7raoudr2wyxp6uvgn4a5xmqvp7m3bbg2n4zs6qkarmmcm",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mk2qkk4rnpl2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2604.18754v1",
  "publishedAt": "2026-04-22T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Bibhas Adhikari"
  ],
  "textContent": "**Authors:** Bibhas Adhikari\n\nWe develop a unified quantum framework for subgraph counting in graphs. We encode a graph on $N$ vertices into a quantum state on $2\\lceil \\log_2 N \\rceil$ working qubits and $2$ ancilla qubits using its adjacency list, with worst-case gate complexity $O(N^2)$, which we refer to as the graph adjacency state. We design quantum measurement operators that capture the edge structure of a target subgraph, enabling estimation of its count via measurements on the $m$-fold tensor product of the adjacency state, where $m$ is the number of edges in the subgraph. We illustrate the framework for triangles, cycles, and cliques. This approach yields quantum logspace algorithms for motif counting, with no known classical counterpart.",
  "title": "Quantum embedding of graphs for subgraph counting"
}