activity
20182023
most citedSuccinct Blind Quantum Computation Using a Random Oracle

13 citations · 18 across the 4 of their papers we have counts for

collaborators

6 papers

quant-ph2023

Formulations and Constructions of Remote State Preparation with Verifiability, with Applications

Jiayu Zhang

Remote state preparation with verifiability (RSPV) is an important quantum cryptographic primitive [GV19,Zha22]. In this primitive, a client would like to prepare a quantum state (…

quant-ph2023

A Quantum Approach For Reducing Communications in Classical Secure Computations with Long Outputs

Jiayu Zhang

How could quantum cryptography help us achieve what are not achievable in classical cryptography? In this work we study the classical cryptographic problem that two parties would l…

quant-ph2022

Classical Verification of Quantum Computations in Linear Time

Jiayu Zhang

In the quantum computation verification problem, a quantum server wants to convince a client that the output of evaluating a quantum circuit is some result that it claims. This…

quant-ph2021

Quantum Meets the Minimum Circuit Size Problem

Nai-Hui Chia, Chi-Ning Chou, Jiayu Zhang +1

In this work, we initiate the study of the Minimum Circuit Size Problem (MCSP) in the quantum setting. MCSP is a problem to compute the circuit complexity of Boolean functions. It…

quant-ph2020★ 13 cited

Succinct Blind Quantum Computation Using a Random Oracle

Jiayu Zhang

In the universal blind quantum computation problem, a client wants to make use of a single quantum server to evaluate where is an arbitrary quantum circuit while k…

quant-ph2018★ 5 cited

Delegating Quantum Computation in the Quantum Random Oracle Model

Jiayu Zhang

A delegation scheme allows a computationally weak client to use a server's resources to help it evaluate a complex circuit without leaking any information about the input (other th…