Pages that link to "Item:Q2119074"
From MaRDI portal
The following pages link to Non-interactive classical verification of quantum computation (Q2119074):
Displayed 11 items.
- A black-box approach to post-quantum zero-knowledge in constant rounds (Q2120081) (← links)
- Multi-theorem designated-verifier NIZK for QMA (Q2120083) (← links)
- Constant-round blind classical verification of quantum sampling (Q2170108) (← links)
- Secure quantum computation with classical communication (Q2695622) (← links)
- The round complexity of quantum zero-knowledge (Q2695629) (← links)
- QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge (Q5868888) (← links)
- Certified everlasting zero-knowledge proof for QMA (Q6097264) (← links)
- On the impossibility of key agreements from quantum random oracles (Q6104333) (← links)
- Succinct classical verification of quantum computation (Q6104334) (← links)
- Classically verifiable NIZK for QMA with preprocessing (Q6134001) (← links)
- Black-box separations for non-interactive classical commitments in a quantum world (Q6138082) (← links)