Post-Quantum Zero-Knowledge with Space-Bounded Simulation

• URL: http://arxiv.org/abs/2210.06093v1
• Date: Wed, 12 Oct 2022 11:13:56 GMT
• Title: Post-Quantum Zero-Knowledge with Space-Bounded Simulation
• Authors: Prabhanjan Ananth and Alex B. Grilo
• Abstract summary: We introduce a fine-grained notion of post-quantum zero-knowledge that is more compatible with near-term quantum devices. For verifiers with logarithmic quantum space $s$ and classical space, we show that $(s,f)$-space-bounded QZK, for $f(s)=2s$, can be achieved. For verifiers with superlogarithmic quantum space $s$, assuming existence of post-quantum one-way, we show that $(s,f)$-space-bounded QZK protocols, with fully black
• Score: 8.69082943773532
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The traditional definition of quantum zero-knowledge stipulates that the knowledge gained by any quantum polynomial-time verifier in an interactive protocol can be simulated by a quantum polynomial-time algorithm. One drawback of this definition is that it allows the simulator to consume significantly more computational resources than the verifier. We argue that this drawback renders the existing notion of quantum zero-knowledge not viable for certain settings, especially when dealing with near-term quantum devices. In this work, we initiate a fine-grained notion of post-quantum zero-knowledge that is more compatible with near-term quantum devices. We introduce the notion of $(s,f)$ space-bounded quantum zero-knowledge. In this new notion, we require that an $s$-qubit malicious verifier can be simulated by a quantum polynomial-time algorithm that uses at most $f(s)$-qubits, for some function $f(\cdot)$, and no restriction on the amount of the classical memory consumed by either the verifier or the simulator. We explore this notion and establish both positive and negative results: - For verifiers with logarithmic quantum space $s$ and (arbitrary) polynomial classical space, we show that $(s,f)$-space-bounded QZK, for $f(s)=2s$, can be achieved based on the existence of post-quantum one-way functions. Moreover, our protocol runs in constant rounds. - For verifiers with super-logarithmic quantum space $s$, assuming the existence of post-quantum secure one-way functions, we show that $(s,f)$-space-bounded QZK protocols, with fully black-box simulation (classical analogue of black-box simulation) can only be achieved for languages in BQP.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
  We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$. In particular, we design global protocols for small set expansion, unique games, and PCP verification. We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
  arXiv  Detail & Related papers  (2024-02-29T01:35:46Z)
• A Cryptographic Perspective on the Verifiability of Quantum Advantage [5.857929080874288]
  This paper investigates the verification of quantum advantage from a cryptographic perspective. We establish a strong connection between the verifiability of quantum advantage and cryptographic and complexity primitives. Our work shows that the quest for verifiable quantum advantages may lead to applications of quantum cryptography.
  arXiv  Detail & Related papers  (2023-10-23T00:31:51Z)
• Fundamental causal bounds of quantum random access memories [13.19534468575575]
  We study the intrinsic bounds of rapid quantum memories based on causality. We show that QRAM can accommodate up to $mathcalO(107)$ logical qubits in 1 dimension, $mathcalO(1015)$ to $mathcalO(1020)$ in various 2D architectures, and $mathcalO(1024)$ in 3 dimensions.
  arXiv  Detail & Related papers  (2023-07-25T12:40:48Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Calculation of generating function in many-body systems with quantum computers: technical challenges and use in hybrid quantum-classical methods [0.0]
  The generating function of a Hamiltonian $H$ is defined as $F(t)=langle e-itHrangle$, where $t$ is the time and where the expectation value is taken on a given initial quantum state. We show how the information content of this function can be used a posteriori on classical computers to solve quantum many-body problems.
  arXiv  Detail & Related papers  (2021-04-16T15:44:27Z)
• A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds [12.525959293825318]
  We construct a constant round interactive proof for NP that satisfies statistical soundness and black-box $epsilon$-zero-knowledge against quantum attacks. At the heart of our results is a new quantum rewinding technique that enables a simulator to extract a committed message of a malicious verifier.
  arXiv  Detail & Related papers  (2020-11-05T05:40:05Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• Quantum advantage for computations with limited space [6.327095331866255]
  We consider space-restricted computations, where input is a read-only memory and only one (qu)bit can be computed on. We experimentally demonstrate computations of $3$-, $4$-, $5$-, and $6$- by quantum circuits, leveraging custom two-qubit gates.
  arXiv  Detail & Related papers  (2020-08-14T17:31:12Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.