Two enhancements to the Grover-Rudolph algorithm reduce CNOT gates and control qubits for sparse quantum state preparation, including an approximate variant with a classically computable overlap estimate.
Quantum circuits for sparse isometries.Quantum, 5:412
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
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.
citing papers explorer
-
Approximate Sparse State Preparation with the Grover-Rudolph Algorithm
Two enhancements to the Grover-Rudolph algorithm reduce CNOT gates and control qubits for sparse quantum state preparation, including an approximate variant with a classically computable overlap estimate.
-
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.