Permuting block-sparse MPS tensors to block-diagonal form and modifying real unitary synthesis reduces Toffoli cost by factors of 10-30 for molecular systems.
Sparse quantum state preparation with improved Tof- foli cost
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 4years
2026 4roles
background 1polarities
background 1representative citing papers
New SelectCopy architecture and qubit-constrained optimizations reduce QROM Toffoli cost from ~2N/λ to ~(1 + 1/b)N/λ while preserving the ability to trade dirty qubits for lower gate count.
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.
Symmetry-adapted Pauli-orbit and modified Gell-Mann bases make polynomial-dimensional dynamical Lie algebras practically simulable beyond free fermions.
citing papers explorer
-
Faster matrix product state preparation by exploiting symmetry-induced block-sparsity
Permuting block-sparse MPS tensors to block-diagonal form and modifying real unitary synthesis reduces Toffoli cost by factors of 10-30 for molecular systems.
-
Halving the cost of QROM
New SelectCopy architecture and qubit-constrained optimizations reduce QROM Toffoli cost from ~2N/λ to ~(1 + 1/b)N/λ while preserving the ability to trade dirty qubits for lower gate count.
-
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.
-
Enabling Lie-Algebraic Classical Simulation beyond Free Fermions
Symmetry-adapted Pauli-orbit and modified Gell-Mann bases make polynomial-dimensional dynamical Lie algebras practically simulable beyond free fermions.