4 papers
Optimal inequalities for completely bounded polynomials and the limitations of quantum query algorithms
Francisco Escudero Gutiérrez, Miquel Saucedo, Carlos Palazuelos
We consider the problem of establishing limitations on the power of quantum query algorithms via the completely bounded polynomial method. In particular, we prove several optimal f…
No-signaling values of quantum games--an operator algebra perspective
Roy Araiza, Marius Junge, Carlos Palazuelos
The aim of this work is to study two-prover quantum games (i.e., games with quantum inputs and outputs) from an operator-algebraic and operator-space point of view. We characterize…
Asymptotic robustness of entanglement in noisy quantum networks and graph connectivity
Fernando Lledó, Carlos Palazuelos, Julio I. de Vicente
Quantum networks are promising venues for quantum information processing. This motivates the study of the entanglement properties of the particular multipartite quantum states that…
Learning low-degree quantum objects
Srinivasan Arunachalam, Arkopal Dutt, Francisco Escudero Gutiérrez +1
We consider the problem of learning low-degree quantum objects up to -error in -distance. We show the following results: unknown -qubit degree- (in…