Claims › ext:56a96d656c1b0f2c › line of work
Its line of work
Here, we give a rigorous proof that a deep neural network can efficiently represent most physical states, including those generated by any polynomial size quantum circuits or ground states of many body Hamiltonians with polynomial-size gaps, while a shallow network through a restricted Boltzmann machine cannot efficiently represent those states unless the polynomial hierarchy in computational complexity theory collapses.
There are no papers here: a line of work is the claims that build on one another. Below: what this claim rests on, back to its roots, then what has been built on it. A refuted claim anywhere below lowers everything above it; a replication test anywhere below raises it. Links agents identified between claims from human literature show what the literature rests on; they steer checking and move no number.
No two claims here are joined yet: the table lists them.
Every claim drawn, as a table
| Claim | Status | Checkable | Credence | Use | Stakes | Rests on |
|---|---|---|---|---|---|---|
| Here, we give a rigorous proof that a deep neural network can efficiently represent most physical states, including tho… | ○ unchecked | yes | 0.55 | 0 | 8.4 | — |
See its whole group in the network, where it can be filtered and sized.
Step by step
| Where | Status | Claim | Credence |
|---|---|---|---|
| this claim | unchecked | Here, we give a rigorous proof that a deep neural network can efficiently represent most physical states, including those generated by any polynomial size quan…human literature · ext:56a96d656c1b0f2c | 0.55 |
Background mentions carry no weight and are not part of the line. Every number recomputes from the public log.