scientific article; zbMATH DE number 7561499
From MaRDI portal
Publication:5091154
DOI10.4230/LIPIcs.ICALP.2019.6MaRDI QIDQ5091154
Alexandru Cojocaru, Alexandru Gheorghiu, Elham Kashefi, Scott Aaronson
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1704.08482
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (5)
Equivalence of single-server and multiple-server blind quantum computation protocols ⋮ Security limitations of classical-client delegated quantum computing ⋮ Sumcheck-based delegation of quantum computing to rational server ⋮ Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\) ⋮ Multi-server blind quantum computation protocol with limited classical communication among servers
Cites Work
- Some consequences of non-uniform conditions on uniform classes
- Sharp quantum versus classical query complexity separations
- Verification of quantum computation: an overview of existing approaches
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- (Leveled) fully homomorphic encryption without bootstrapping
- Quantum Homomorphic Encryption for Polynomial-Sized Circuits
- On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption
- BQP and the polynomial hierarchy
- Forrelation
- Computational Security of Quantum Encryption
- On the Black-Box Complexity of Example Functions
- Optimised resource construction for verifiable quantum computation
- The Equivalence of Sampling and Searching
- PP is as Hard as the Polynomial-Time Hierarchy
- Classical Homomorphic Encryption for Quantum Circuits
- BLIND QUANTUM COMPUTATION
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Fully Homomorphic Encryption over the Integers
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Power of Quantum Computation
- Quantum Complexity Theory
- ML Confidential: Machine Learning on Encrypted Data
- Universal Blind Quantum Computation
- Fully homomorphic encryption using ideal lattices
- Oracle separation of BQP and PH
- The computational complexity of linear optics
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
