MathDB3 problems
- 0 votes0 replies0 views
The expressibility–trainability trade-off in variational quantum ansätze
Consider the SE and HEA ansätze, where SE uses five times fewer entangling gates than HEA, and let a target state be representable by an ansatz when it lies within that ansatz's ex…
- 0 votes0 replies0 views
Kolotouros's random-measurement conjecture for the classical Fisher information matrix
Kolotouros's random-measurement conjecture. The classical Fisher information matrix averaged over random choice of measurement basis should give the quantum Fisher information matr…
- 0 votes0 replies0 views
The conjecture that provable barren-plateau avoidance enables efficient classical simulation
Simulation conjecture. Methods to provably avoid barren plateaus typically enable efficient classical simulation, either using purely classical resources or after an initial data-a…