10 problems

A graph class is vertex-minor-closed if it contains every vertex-minor of each of its graphs. Geelen's simulation conjecture. Measurement-based quantum computation (MBQC) is effici…

Optimal scaling conjecture. This bound has the best possible scaling in both $\varepsilon$ and $t$.

Early-break conjecture. A finer analysis of the dynamics of the weight should show that, with high probability, this early-break condition is met before the runtime stated in Propo…

Simulation conjecture. Methods to provably avoid barren plateaus typically enable efficient classical simulation, either using purely classical resources or after an initial data-a…

A quantum neural network is a parametrized quantum circuit whose output is used to generate a function, and a barren plateau is a regime in which training gradients become exponent…

Gaussian boson sampling is a variant of boson sampling in which squeezed Gaussian states are used as input. A network is unbalanced when its losses are not uniform across the optic…

Gaussian boson sampling uses squeezed Gaussian states as input to a linear-optical network. Let $k$ denote the number of input modes containing squeezed states, and let…

Partial-QFT and quadratic-phase simulation conjecture. There exist nontrivial families of abelian hypergroups for which the normalizer circuits of the paper's simulation theorem re…

Extension conjecture. The simulation result can be extended to all normalizer gates, despite the non-monomiality and non-unitarity issues of hypergroup Pauli operators.

Let $V^{1111}_0$ denote the qubit model shown in the paper's Figure 1, and allow measurements of total charges of metaplectic anyons. A model is Ising like if its braidings and the…