Quantum rejection sampling yields a quadratically faster discrete Gaussian sampler on lattices, enabling two improved versions of quantum dual attacks with trade-offs in speed and memory.
Fortschritte der Physik 46(4-5), 493–505 (1998)
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
A Grover-search-based quantum model for CVRPTW that encodes constraints with only linear additional decision qubits relative to TSP formulations.
Fermion mappings combined with Z2 tapering and frozen-core approximations reduce qubit counts by up to 50%, gate counts by up to 27.5x, and Pauli strings by up to 2.75x for VQE on small molecules.
citing papers explorer
-
Quantum algorithm for Discrete Gaussian Sampling
Quantum rejection sampling yields a quadratically faster discrete Gaussian sampler on lattices, enabling two improved versions of quantum dual attacks with trade-offs in speed and memory.
-
Quantum Model for CVRPTW
A Grover-search-based quantum model for CVRPTW that encodes constraints with only linear additional decision qubits relative to TSP formulations.
-
Resource Estimation for VQE on Small Molecules: Impact of Fermion Mappings and Hamiltonian Reductions
Fermion mappings combined with Z2 tapering and frozen-core approximations reduce qubit counts by up to 50%, gate counts by up to 27.5x, and Pauli strings by up to 2.75x for VQE on small molecules.