Pages that link to "Item:Q2119074"
From MaRDI portal
The following pages link to Non-interactive classical verification of quantum computation (Q2119074):
Displaying 16 items.
- Robustness verification of quantum classifiers (Q832160) (← links)
- 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)
- Verification of quantum computation: an overview of existing approaches (Q2311888) (← links)
- Secure quantum computation with classical communication (Q2695622) (← links)
- The round complexity of quantum zero-knowledge (Q2695629) (← links)
- Verification of the logical sequence in nonclassical multivalued logic (Q4565258) (← links)
- How to Verify a Quantum Computation (Q4568113) (← links)
- Classical verification of quantum proofs (Q5361888) (← links)
- QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge (Q5868888) (← links)
- NONCLASSICAL TRUTH WITH CLASSICAL STRENGTH. A PROOF-THEORETIC ANALYSIS OF COMPOSITIONAL TRUTH OVER HYPE (Q6041345) (← links)
- Certified everlasting zero-knowledge proof for QMA (Q6097264) (← links)
- Classically verifiable NIZK for QMA with preprocessing (Q6134001) (← links)
- Post-quantum \(\kappa\)-to-1 trapdoor claw-free functions from extrapolated dihedral cosets (Q6550807) (← links)
- Interactive oracle arguments in the QROM and applications to succinct verification of quantum computation (Q6636121) (← links)