Pages that link to "Item:Q4946417"
From MaRDI portal
The following pages link to Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy (Q4946417):
Displaying 8 items.
- Quantum weakly nondeterministic communication complexity (Q387026) (← links)
- Efficient verification of Tunnell's criterion (Q957686) (← links)
- Relativized separation of EQP from \(\text{P}^{\text{NP}}\) (Q1607126) (← links)
- One complexity theorist's view of quantum computing (Q1870556) (← links)
- A common algebraic description for probabilistic and quantum computations (Q2575744) (← links)
- Quantum computing, postselection, and probabilistic polynomial-time (Q5428317) (← links)
- ANALYSIS OF QUANTUM FUNCTIONS (Q5696940) (← links)
- Sumcheck-based delegation of quantum computing to rational server (Q5925559) (← links)
