Since the celebrated work of Impagliazzo and Rudich (STOC 1989), a number of black-box
impossibility results have been established. However, these works only ruled out classical …

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 …

Abstract Non-Interactive Zero-Knowledge Arguments (NIZKs) are cryptographic protocols
that enable a prover to demonstrate the validity of an $\mathsf {NP} $ statement to a verifier …

With the advent of the quantum era, what role the quantum computer will play in optimization
and machine learning becomes a natural and salient question. The development of novel …

Since the celebrated work of Impagliazzo and Rudich (STOC 1989), a number of black-box
impossibility results have been established. However, these works only ruled out classical …

Finding reductions between problems is a fundamental way to evaluate hardness of
computational tasks. With hypothesis in complexity theory such as NP≠ P, finding …