Find a quantum program's classical shortcuts
classical_shortcutsEvery exact classical route to simulating a program, priced on it: the stabilizer tableau, the cut-rank sum, an exact matrix product state at a rigorous bond bound, the light cone of a one-qubit expectation value, and the state vector. The cheapest is named for each question. A cheap route proves the program classically easy; none being cheap proves nothing about hardness. A thorough search, with a contraction tree, runs locally: wai-quantum shortcuts --thorough.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| qasm | Yes |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||