Pages that link to "Item:Q4568113"
From MaRDI portal
The following pages link to How to Verify a Quantum Computation (Q4568113):
Displaying 15 items.
- Measurement-based universal blind quantum computation with minor resources (Q2102199) (← links)
- Secure two-party computation based on blind quantum computation (Q2196995) (← links)
- A hybrid universal blind quantum computation (Q2215088) (← links)
- An automated deductive verification framework for circuit-building quantum programs (Q2233453) (← links)
- Verification of quantum computation: an overview of existing approaches (Q2311888) (← links)
- Verification of quantum computation and the price of trust (Q2399359) (← links)
- Blindness and verification of quantum computation with one pure qubit (Q2969059) (← links)
- Optimised resource construction for verifiable quantum computation (Q2988006) (← links)
- The Road to Quantum Computational Supremacy (Q3298037) (← links)
- Distinguishing short quantum computations (Q4910753) (← links)
- (Q5091177) (← links)
- Classical verification of quantum proofs (Q5204823) (← links)
- Interactive proofs for \(\mathsf{BQP}\) via self-tested graph states (Q5741632) (← links)
- Multi-agent blind quantum computation without universal cluster states (Q6559788) (← links)
- Zero-knowledge proof systems for QMA (Q6663093) (← links)