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 algorithms for approximate function loading
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
Hybrid algorithm classically diagonalizes Hamiltonian tensor factors to construct block-encodings for quantum simulation via QSVD, with extensions for commuting time-dependent cases.
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.
-
Hybrid Quantum-Classical Algorithm for Hamiltonian Simulation
Hybrid algorithm classically diagonalizes Hamiltonian tensor factors to construct block-encodings for quantum simulation via QSVD, with extensions for commuting time-dependent cases.