Quantum cryptography in algorithmica
We construct a classical oracle relative to which P= NP yet single-copy secure
pseudorandom quantum states exist. In the language of Impagliazzo's five worlds, this is a …
pseudorandom quantum states exist. In the language of Impagliazzo's five worlds, this is a …
Paradigms for unconditional pseudorandom generators
This is a survey of unconditional pseudorandom generators (PRGs). A PRG uses a short,
truly random seed to generate a long," pseudorandom" sequence of bits. To be more …
truly random seed to generate a long," pseudorandom" sequence of bits. To be more …
[PDF][PDF] Recent progress on derandomizing space-bounded computation
WM Hoza - Bulletin of EATCS, 2022 - eatcs.org
Is randomness ever necessary for space-efficient computation? It is commonly conjectured
that L= BPL, meaning that halting decision algorithms can always be derandomized without …
that L= BPL, meaning that halting decision algorithms can always be derandomized without …
Pseudorandom generators for unbounded-width permutation branching programs
We prove that the Impagliazzo-Nisan-Wigderson [Impagliazzo et al., 1994] pseudorandom
generator (PRG) fools ordered (read-once) permutation branching programs of unbounded …
generator (PRG) fools ordered (read-once) permutation branching programs of unbounded …
Pseudorandom generators for width-3 branching programs
We construct pseudorandom generators of seed length Õ (log (n)· log (1/є)) that є-fool
ordered read-once branching programs (ROBPs) of width 3 and length n. For unordered …
ordered read-once branching programs (ROBPs) of width 3 and length n. For unordered …
Weighted pseudorandom generators via inverse analysis of random walks and shortcutting
A weighted pseudorandom generator (WPRG) is a generalization of a pseudorandom
generator (PRG) in which, roughly speaking, probabilities are replaced with weights that are …
generator (PRG) in which, roughly speaking, probabilities are replaced with weights that are …
An optimal separation of randomized and quantum query complexity
We prove that for every decision tree, the absolute values of the Fourier coefficients of given
order t≥ 1 sum to at most (cd/t) t/2 (1+ log n)(t− 1)/2, where n is the number of variables, d is …
order t≥ 1 sum to at most (cd/t) t/2 (1+ log n)(t− 1)/2, where n is the number of variables, d is …
Hitting sets for regular branching programs
A Bogdanov, WM Hoza, G Prakriya… - … Conference (CCC 2022 …, 2022 - drops.dagstuhl.de
We construct improved hitting set generators (HSGs) for ordered (read-once) regular
branching programs in two parameter regimes. First, we construct an explicit ε-HSG for …
branching programs in two parameter regimes. First, we construct an explicit ε-HSG for …
On the Pauli Spectrum of QAC0
The circuit class QAC 0 was introduced by Moore (1999) as a model for constant depth
quantum circuits where the gate set includes many-qubit Toffoli gates. Proving lower bounds …
quantum circuits where the gate set includes many-qubit Toffoli gates. Proving lower bounds …