Sumcheck-based delegation of quantum computing to rational server
From MaRDI portal
Publication:5925559
DOI10.1016/j.tcs.2022.04.016OpenAlexW4226224471MaRDI QIDQ5925559
Seiichiro Tani, Yuki Takeuchi, Tomoyuki Morimae
Publication date: 13 June 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.04734
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Quantum computing and quadratically signed weight enumerators
- Efficient rational proofs with strong utility-gap guarantees
- Simulation of topological field theories by quantum computers
- A modular functor which is universal for quantum computation
- Qfactory: classically-instructed remote secret qubits preparation
- Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources
- Rational Sumchecks
- Rational Proofs with Multiple Provers
- Rational arguments
- Universal Quantum Simulators
- The Knowledge Complexity of Interactive Proof Systems
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy
- A quantum linearity test for robustly verifying entanglement
- Robustness and device independence of verifiable blind quantum computing
- Oracle separation of BQP and PH
- Probability Inequalities for Sums of Bounded Random Variables
- Rational proofs
- A polynomial quantum algorithm for approximating the Jones polynomial
- On lattices, learning with errors, random linear codes, and cryptography
- Sumcheck-based delegation of quantum computing to rational server
This page was built for publication: Sumcheck-based delegation of quantum computing to rational server
