Classical simulability, entanglement breaking, and quantum computation thresholds (Q3102424): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Quantum Circuits That Can Be Simulated Classically in Polynomial Time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear transformations which preserve trace and positive semidefiniteness of operators / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Quantum coding theorems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: QUANTUM COMPUTATION BY MEASUREMENTS / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Quantum computation by measurement and quantum memory / rank | |||
Normal rank | |||
Revision as of 16:53, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Classical simulability, entanglement breaking, and quantum computation thresholds |
scientific article |
Statements
Classical simulability, entanglement breaking, and quantum computation thresholds (English)
0 references
4 December 2011
0 references
