Deterministic information loss yields TC0 post-quantum pseudorandomness from lattices
Learning with algebraic rounding achieves TC0 pseudorandomness from quantum worst-case lattice hardness with fixed polynomial parameters.
2 stories, newest first · one card per story
Learning with algebraic rounding achieves TC0 pseudorandomness from quantum worst-case lattice hardness with fixed polynomial parameters.
Simple local quantum processes can match unitary designs yet remain efficiently distinguishable from truly random unitaries.
Today 1.5K readers · 2.4K views · 754 reads · all time 189K views