Computational Complexity of Projected Entangled Pair States (Q3107793): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The density-matrix renormalization group / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Criticality, the Area Law, and the Computational Power of Projected Entangled Pair States / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Quantum computing, postselection, and probabilistic polynomial-time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Limitations of Quantum Advice and One-Way Communication / rank | |||
Normal rank | |||
Revision as of 19:29, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational Complexity of Projected Entangled Pair States |
scientific article |
Statements
Computational Complexity of Projected Entangled Pair States (English)
0 references
26 December 2011
0 references
0 references
