Search Results - "Grilo, Alex B."

QMA-hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge by Broadbent, Anne, Grilo, Alex B.

“…We provide several advances to the understanding of the class of Quantum Merlin-Arthur proof systems (QMA), the quantum analogue of NP. Our central…”
Get full text

Perfect Zero Knowledge for Quantum Multiprover Interactive Proofs by Grilo, Alex B., Slofstra, William, Yuen, Henry

“…In this work we consider the interplay between multiprover interactive proofs, quantum entanglement, and zero knowledge proofs - notions that are central…”
Get full text

Quantum learning algorithms imply circuit lower bounds by Arunachalam, Srinivasan, Grilo, Alex B., Gur, Tom, Oliveira, Igor C., Sundaram, Aarthi

“…We establish the first general connection between the design of quantum algorithms and circuit lower bounds. Specifically, let \mathfrak{C} be a class of…”
Get full text

Stoquastic PCP vs. Randomness by Aharonov, Dorit, Bredariol Grilo, Alex

“…The derandomization of MA, the probabilistic version of NP, is a long standing open question. In this work, we connect this problem to a variant of another…”
Get full text

The Round Complexity of Proofs in the Bounded Quantum Storage Model by Grilo, Alex B, Lamontagne, Philippe

“…The round complexity of interactive proof systems is a key question of practical and theoretical relevance in complexity theory and cryptography. Moreover,…”
Get full text

Complexity of geometrically local stoquastic Hamiltonians by Raza, Asad, Eisert, Jens, Grilo, Alex B

“…The QMA-completeness of the local Hamiltonian problem is a landmark result of the field of Hamiltonian complexity that studies the computational complexity of…”
Get full text

Post-Quantum Zero-Knowledge with Space-Bounded Simulation by Ananth, Prabhanjan, Grilo, Alex B

“…The traditional definition of quantum zero-knowledge stipulates that the knowledge gained by any quantum polynomial-time verifier in an interactive protocol…”
Get full text

QMA-hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge by Broadbent, Anne, Grilo, Alex B

“…SIAM Journal on Computing, Vol. 51, Iss. 4 (2022) We provide several advances to the understanding of the class of Quantum Merlin-Arthur proof systems (QMA),…”
Get full text

The Role of piracy in quantum proofs by Broadbent, Anne, Grilo, Alex B, Podder, Supartha, Sikora, Jamie

“…A well-known feature of quantum information is that it cannot, in general, be cloned. Recently, a number of quantum-enabled information-processing tasks have…”
Get full text

On-State Commutativity of Measurements and Joint Distributions of Their Outcomes by Czajkowski, Jan, Grilo, Alex B

“…In this note, we analyze joint probability distributions that arise from outcomes of sequences of quantum measurements performed on sets of quantum states…”
Get full text

Two combinatorial MA-complete problems by Aharonov, Dorit, Grilo, Alex B

“…Despite the interest in the complexity class MA, the randomized analog of NP, just a few natural MA-complete problems are known. The first problem was found by…”
Get full text

Encryption with Quantum Public Keys by Grilo, Alex B, Sattath, Or, Vu, Quoc-Huy

“…It is an important question to find constructions of quantum cryptographic protocols which rely on weaker computational assumptions than classical protocols…”
Get full text

Subspace Preserving Quantum Convolutional Neural Network Architectures by Monbroussou, Léo, Landman, Jonas, Wang, Letao, Grilo, Alex B, Kashefi, Elham

“…Subspace preserving quantum circuits are a class of quantum algorithms that, relying on some symmetries in the computation, can offer theoretical guarantees…”
Get full text

Quantum security of subset cover problems by Bouaziz--Ermann, Samuel, Grilo, Alex B, Vergnaud, Damien

“…The subset cover problem for $k \geq 1$ hash functions, which can be seen as an extension of the collision problem, was introduced in 2002 by Reyzin and Reyzin…”
Get full text

A Practical Protocol for Quantum Oblivious Transfer from One-Way Functions by Diamanti, Eleni, Grilo, Alex B, Innocenzi, Adriano, Lefebvre, Pascal, Yacoub, Verena, Yángüez, Álvaro

“…We present a new simulation-secure quantum oblivious transfer (QOT) protocol based on one-way functions in the plain model. With a focus on practical…”
Get full text

A simple protocol for verifiable delegation of quantum computation in one round by Grilo, Alex B

“…The importance of being able to verify quantum computation delegated to remote servers increases with recent development of quantum technologies. In some of…”
Get full text

StoqMA vs. MA: the power of error reduction by Aharonov, Dorit, Grilo, Alex B, Liu, Yupan

“…StoqMA characterizes the computational hardness of stoquastic local Hamiltonians, which is a family of Hamiltonians that does not suffer from the sign problem…”
Get full text

Stoquastic PCP vs. Randomness by Aharonov, Dorit, Grilo, Alex B

“…The derandomization of MA, the probabilistic version of NP, is a long standing open question. In this work, we connect this problem to a variant of another…”
Get full text

Towards the Impossibility of Quantum Public Key Encryption with Classical Keys from One-Way Functions by Bouaziz--Ermann, Samuel, Grilo, Alex B, Vergnaud, Damien, Vu, Quoc-Huy

“…There has been a recent interest in proposing quantum protocols whose security relies on weaker computational assumptions than their classical counterparts…”
Get full text

Trainability and Expressivity of Hamming-Weight Preserving Quantum Circuits for Machine Learning by Monbroussou, Léo, Mamon, Eliott Z, Landman, Jonas, Grilo, Alex B, Kukla, Romain, Kashefi, Elham

“…Quantum machine learning (QML) has become a promising area for real world applications of quantum computers, but near-term methods and their scalability are…”
Get full text