scientific article; zbMATH DE number 7378343

DOI10.4230/LIPIcs.MFCS.2018.26MaRDI QIDQ5005126

François Le Gall, Harumichi Nishimura, Tomoyuki Morimae, Yuki Takeuchi

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1805.03385

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

quantum computinginteractive proofsgroup-theoretic problems

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Sumcheck-based delegation of quantum computing to rational server

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast Monte Carlo algorithms for permutation groups
• Quantum and classical tradeoffs
• Classical Homomorphic Encryption for Quantum Circuits
• Bounded Round Interactive Proofs in Finite Groups
• Algebraic methods for interactive proof systems
• IP = PSPACE
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the Power of Quantum Computation
• Quantum Complexity Theory
• Pseudo-deterministic Proofs
• Polynomial-time theory of matrix groups
• Quantum algorithms for solvable groups
• Classical verification of quantum proofs
• EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM

This page was built for publication: