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.
An efficient algorithm for sparse quantum state preparation
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3years
2026 3verdicts
UNVERDICTED 3representative 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.
Sampling-based methods for quantum state preparation achieve asymptotically lower T-count than rotation-based methods and maintain an advantage in total gate count after accounting for compilation overhead.
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.
-
Logical Resource Estimation for Quantum State Preparation with Compilation
Sampling-based methods for quantum state preparation achieve asymptotically lower T-count than rotation-based methods and maintain an advantage in total gate count after accounting for compilation overhead.