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.
Title resolution pending
6 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
fields
quant-ph 6representative citing papers
Presents LCNU-plus-embedding data loading for any polynomial Carleman-linearized autonomous system and applies it to the 3D LBE, yielding Ns ~ O(α²Q²) terms and explicit T-gate resource estimates for two solvers.
A quantum solver for PDEs is introduced via flexible matrix product operator representations with mid-circuit measurements and state-dependent norm correction to handle non-unitary dynamics.
Demonstration of quantum circuit implementation for 2D obstacle flow via Carleman-linearized LBM solved with QSVT, achieving logarithmic qubit and gate scaling with lattice points.
Adiabatic solver slightly outperforms shortcut when solution norm unknown; shortcut significantly better for non-Hermitian matrices when norm known.
A comprehensive review of scaling paths for superconducting quantum computers, with resource and sensitivity analyses for utility-scale applications under realistic error distributions.
citing papers explorer
No citing papers match the current filters.