Pages that link to "Item:Q2120084"
From MaRDI portal
The following pages link to On the round complexity of secure quantum computation (Q2120084):
Displayed 6 items.
- Secure quantum computation with classical communication (Q2695622) (← links)
- Rate-1 quantum fully homomorphic encryption (Q2695630) (← links)
- Certified everlasting zero-knowledge proof for QMA (Q6097264) (← links)
- Classically verifiable NIZK for QMA with preprocessing (Q6134001) (← links)
- On concurrent multi-party quantum computation (Q6190133) (← links)
- Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge) (Q6190138) (← links)