Pages that link to "Item:Q5741632"
From MaRDI portal
The following pages link to Interactive proofs for \(\mathsf{BQP}\) via self-tested graph states (Q5741632):
Displaying 14 items.
- Measurement-based universal blind quantum computation with minor resources (Q2102199) (← links)
- Multi-server blind quantum computation protocol with limited classical communication among servers (Q2107013) (← links)
- Verification of quantum computation: an overview of existing approaches (Q2311888) (← links)
- Verification of quantum computation and the price of trust (Q2399359) (← links)
- Equivalence of single-server and multiple-server blind quantum computation protocols (Q2686213) (← links)
- Optimised resource construction for verifiable quantum computation (Q2988006) (← links)
- (Q3385626) (← links)
- Self-Testing Graph States (Q3453314) (← links)
- (Q5005126) (← links)
- (Q5091177) (← links)
- Contextuality in multipartite pseudo-telepathy graph games (Q5915755) (← links)
- Sumcheck-based delegation of quantum computing to rational server (Q5925559) (← links)
- Rigidity of quantum steering and one-sided device-independent verifiable quantum computation (Q6100507) (← links)
- Multi-agent blind quantum computation without universal cluster states (Q6559788) (← links)