Zobrazeno 1 - 10
of 244
pro vyhledávání: '"Ma, Fermi"'
Autor:
Ma, Fermi, Huang, Hsin-Yuan
The existence of pseudorandom unitaries (PRUs) -- efficient quantum circuits that are computationally indistinguishable from Haar-random unitaries -- has been a central open question, with significant implications for cryptography, complexity theory,
Externí odkaz:
http://arxiv.org/abs/2410.10116
The Unitary Synthesis Problem (Aaronson-Kuperberg 2007) asks whether any $n$-qubit unitary $U$ can be implemented by an efficient quantum algorithm $A$ augmented with an oracle that computes an arbitrary Boolean function $f$. In other words, can the
Externí odkaz:
http://arxiv.org/abs/2310.08870
What does it mean to commit to a quantum state? In this work, we propose a simple answer: a commitment to quantum messages is binding if, after the commit phase, the committed state is hidden from the sender's view. We accompany this new definition w
Externí odkaz:
http://arxiv.org/abs/2210.05138
Autor:
Bartusek, James, Kalai, Yael Tauman, Lombardi, Alex, Ma, Fermi, Malavolta, Giulio, Vaikuntanathan, Vinod, Vidick, Thomas, Yang, Lisa
We construct a classically verifiable succinct interactive argument for quantum computation (BQP) with communication complexity and verifier runtime that are poly-logarithmic in the runtime of the BQP computation (and polynomial in the security param
Externí odkaz:
http://arxiv.org/abs/2206.14929
A major difficulty in quantum rewinding is the fact that measurement is destructive: extracting information from a quantum state irreversibly changes it. This is especially problematic in the context of zero-knowledge simulation, where preserving the
Externí odkaz:
http://arxiv.org/abs/2111.12257
We prove that Kilian's four-message succinct argument system is post-quantum secure in the standard model when instantiated with any probabilistically checkable proof and any collapsing hash function (which in turn exist based on the post-quantum har
Externí odkaz:
http://arxiv.org/abs/2103.08140
We prove that quantum-hard one-way functions imply simulation-secure quantum oblivious transfer (QOT), which is known to suffice for secure computation of arbitrary quantum functionalities. Furthermore, our construction only makes black-box use of th
Externí odkaz:
http://arxiv.org/abs/2011.13486
We construct the first constant-round protocols for secure quantum computation in the two-party (2PQC) and multi-party (MPQC) settings with security against malicious adversaries. Our protocols are in the common random string (CRS) model. - Assuming
Externí odkaz:
http://arxiv.org/abs/2011.11212
Publikováno v:
In Theoretical Computer Science 14 November 2018 748:28-39
Publikováno v:
Proceedings of the 55th Annual ACM Symposium on Theory of Computing.
What does it mean to commit to a quantum state? In this work, we propose a simple answer: a commitment to quantum messages is binding if, after the commit phase, the committed state is hidden from the sender's view. We accompany this new definition w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3ed14bd450732a866c320f374274e2a9
https://doi.org/10.1145/3564246.3585198
https://doi.org/10.1145/3564246.3585198