Oracle Separations for Quantum Statistical Zero-Knowledge

01/26/2018
by   Sanketh Menda, et al.
0

This paper investigates the power of quantum statistical zero knowledge interactive proof systems in the relativized setting. We prove the existence of an oracle relative to which quantum statistical zero-knowledge does not contain UP intersect coUP, and we prove that quantum statistical zero knowledge does not contain UP relative to a random oracle with probability 1. Our proofs of these statements rely on a bound on output state discrimination for relativized quantum circuits based on the quantum adversary method of Ambainis, following a technique similar to one used by Ben-David and Kothari to prove limitations on a query complexity variant of quantum statistical zero-knowledge.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/06/2019

Oracle Separations Between Quantum and Non-interactive Zero-Knowledge Classes

We study the relationship between problems solvable by quantum algorithm...
research
10/14/2021

zk-Fabric, a Polylithic Syntax Zero Knowledge Joint Proof System

In this paper, we create a single-use and full syntax zero-knowledge pro...
research
12/18/2019

Practical Relativistic Zero-Knowledge for NP

In this work we consider the following problem: in a Multi-Prover enviro...
research
12/06/2022

On Zero-Knowledge Proofs over the Quantum Internet

This paper presents a new method for quantum identity authentication (QI...
research
03/05/2018

Spatial Isolation Implies Zero Knowledge Even in a Quantum World

Zero knowledge plays a central role in cryptography and complexity. The ...
research
11/30/2022

On the power of nonstandard quantum oracles

We study how the choices made when designing an oracle affect the comple...
research
09/26/2021

Optimal Simulation of Quantum Measurements via the Likelihood POVMs

We provide a new and simplified proof of Winter's measurement compressio...

Please sign up or login with your details

Forgot password? Click here to reset