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.
Decomposition of multi-controlled special unitary single-qubit gates
4 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
fields
quant-ph 4verdicts
UNVERDICTED 4roles
background 1polarities
unclear 1representative citing papers
A recursive construction preserves O(sqrt(N)) quantum search complexity with local operations on tensor-decomposable partitions, eliminating the need for global diffusion via degeneracy in reflection angles.
A gadget-based simulator directly simulates high-level quantum gates via low-rank stabilizer decompositions of magic states, improving both theoretical complexity and practical runtime over standard compilation-based methods.
A penalty-free, fully quantum algorithm is proposed for finding ground and excited states of many-body Hamiltonians.
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 Search without Global Diffusion
A recursive construction preserves O(sqrt(N)) quantum search complexity with local operations on tensor-decomposable partitions, eliminating the need for global diffusion via degeneracy in reflection angles.
-
Efficient Simulation of High-Level Quantum Gates
A gadget-based simulator directly simulates high-level quantum gates via low-rank stabilizer decompositions of magic states, improving both theoretical complexity and practical runtime over standard compilation-based methods.
-
A penalty-free quantum algorithm to find energy eigenstates
A penalty-free, fully quantum algorithm is proposed for finding ground and excited states of many-body Hamiltonians.