A quantum adjacency state on 2 log N qubits plus ancilla enables subgraph count estimation via m-fold tensor product measurements, producing quantum logspace algorithms for motif counting.
Simple quantum algorithm to efficiently prepare sparse states.Physical Review A, 110(3):032609
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Quantum embedding of graphs for subgraph counting
A quantum adjacency state on 2 log N qubits plus ancilla enables subgraph count estimation via m-fold tensor product measurements, producing quantum logspace algorithms for motif counting.