Pages that link to "Item:Q5428317"
From MaRDI portal
The following pages link to Quantum computing, postselection, and probabilistic polynomial-time (Q5428317):
Displayed 8 items.
- Perfect state distinguishability and computational speedups with postselected closed timelike curves (Q427292) (← links)
- A broader view on the limitations of information processing and communication by nature (Q885681) (← links)
- A linear-optical proof that the permanent is # <b>P</b> -hard (Q2901811) (← links)
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy (Q3088963) (← links)
- Computational Complexity of Projected Entangled Pair States (Q3107793) (← links)
- The learnability of quantum states (Q3508097) (← links)
- Temporally unstructured quantum computation (Q3561913) (← links)
- Quantum multiparty communication complexity and circuit lower bounds (Q3616221) (← links)