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.
Wavefunction preparation and resampling using a quantum computer
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
abstract
We present an algorithm that prepares multidimensional Gaussian wavefunctions on qubit arrays and an application of such wavefunctions to multidimensional resampling, a technique useful in quantum digital simulation.
fields
quant-ph 3verdicts
UNVERDICTED 3representative citing papers
A quantum circuit prepares approximate Gaussian states via single-qubit rotations followed by QFT, achieving high fidelity with optional angle pruning for O(n) gate cost.
The paper reviews advances in quantum simulation of out-of-equilibrium dynamics in gauge theories, covering particle production, string breaking, thermalization, and related phenomena.
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.
-
Efficient Gaussian State Preparation in Quantum Circuits
A quantum circuit prepares approximate Gaussian states via single-qubit rotations followed by QFT, achieving high fidelity with optional angle pruning for O(n) gate cost.
-
Quantum simulation of out-of-equilibrium dynamics in gauge theories
The paper reviews advances in quantum simulation of out-of-equilibrium dynamics in gauge theories, covering particle production, string breaking, thermalization, and related phenomena.