activity
20192026
most citedPermutation Superposition Oracles for Quantum Query Lower Bounds

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

collaborators
Showing 2024Show all

5 papers · 1 filter

quant-ph2024★ 3 cited

A New World in the Depths of Microcrypt: Separating OWSGs and Quantum Money from QEFID

Amit Behera, Giulio Malavolta, Tomoyuki Morimae +2

While in classical cryptography, one-way functions (OWFs) are widely regarded as the "minimal assumption," the situation in quantum cryptography is less clear. Recent works have pu…

quant-ph2024★ 4 cited

A bound on the quantum value of all compiled nonlocal games

Alexander Kulpe, Giulio Malavolta, Connor Paddock +2

A cryptographic compiler introduced by Kalai et al. (STOC'23) converts any nonlocal game into an interactive protocol with a single computationally bounded prover. Although the com…

quant-ph2024★ 4 cited

Permutation Superposition Oracles for Quantum Query Lower Bounds

Christian Majenz, Giulio Malavolta, Michael Walter

We propose a generalization of Zhandry's compressed oracle method to random permutations, where an algorithm can query both the permutation and its inverse. We show how to use the…

quant-ph2024

Exponential Quantum One-Wayness and EFI Pairs

Giulio Malavolta, Tomoyuki Morimae, Michael Walter +1

In classical cryptography, one-way functions are widely considered to be the minimal computational assumption. However, when taking quantum information into account, the situation…

quant-ph2024★ 1 cited

A Computational Tsirelson's Theorem for the Value of Compiled XOR Games

David Cui, Giulio Malavolta, Arthur Mehta +5

Nonlocal games are a foundational tool for understanding entanglement and constructing quantum protocols in settings with multiple spatially separated quantum devices. In this work…