4 problems
- 0 votes0 replies1 view
Algebraic-depth classical hardness conjecture for random brickwall linear optical networks
Let denote the number of modes and let denote the depth of a random brickwall linear optical network, with the input and sampling setting as considered in the paper. Classi…
- 0 votes0 replies1 view
Sun et al.'s optimal sampling complexity conjecture for phase retrieval
Let be the phase-retrieval loss function, where are measurements a…
- 0 votes0 replies0 views
The NISQ quantum computational supremacy conjecture
A sampling task is one in which a computer produces samples from a target probability distribution . A noisy intermediate-scale quantum (NISQ) computer is a quantum computer w…
- 0 votes0 replies0 views
Uniform-sampling conjecture for the sample complexity of TAM
Uniform-sampling sample-complexity conjecture. The same sample complexity as for under the paper's regular-graph sampling, namely samples,…