Zobrazeno 1 - 10
of 1 766
pro vyhledávání: '"GUTIÉRREZ, FRANCISCO"'
We consider the problems of testing and learning an unknown $n$-qubit Hamiltonian $H$ from queries to its evolution operator $e^{-iHt}$ under the normalized Frobenius norm. We prove: 1. Local Hamiltonians: We give a tolerant testing protocol to decid
Externí odkaz:
http://arxiv.org/abs/2411.00082
In this work we consider the problems of learning junta distributions, their quantum counter-part, quantum junta states, and QAC$^0$ circuits, which we show to be juntas. $\mathbf{Junta\ distributions.\ }$A probability distribution $p:\{-1,1\}^n\to \
Externí odkaz:
http://arxiv.org/abs/2410.15822
We show that the Christensen-Sinclair factorization theorem, when the underlying Hilbert spaces are finite dimensional, is an instance of strong duality of semidefinite programming. This gives an elementary proof of the result and also provides an ef
Externí odkaz:
http://arxiv.org/abs/2407.13716
We consider the problem of learning low-degree quantum objects up to $\varepsilon$-error in $\ell_2$-distance. We show the following results: $(i)$ unknown $n$-qubit degree-$d$ (in the Pauli basis) quantum channels and unitaries can be learned using
Externí odkaz:
http://arxiv.org/abs/2405.10933
In a recent work Li, Qiao, Wigderson, Wigderson and Zhang introduced notions of quantum expansion based on $S_p$ norms and posed as an open question if they were all equivalent. We give an affirmative answer to this question.
Comment: 5 pages
Comment: 5 pages
Externí odkaz:
http://arxiv.org/abs/2405.03517
We consider the problems of testing and learning an $n$-qubit $k$-local Hamiltonian from queries to its evolution operator with respect the 2-norm of the Pauli spectrum, or equivalently, the normalized Frobenius norm. For testing whether a Hamiltonia
Externí odkaz:
http://arxiv.org/abs/2404.06282
We give a new presentation of the main result of Arunachalam, Bri\"et and Palazuelos (SICOMP'19) and show that quantum query algorithms are characterized by a new class of polynomials which we call Fourier completely bounded polynomials. We conjectur
Externí odkaz:
http://arxiv.org/abs/2304.06713
Publikováno v:
Quantum 8, 1526 (2024)
A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the famous Groth
Externí odkaz:
http://arxiv.org/abs/2212.08559
Publikováno v:
In Geomorphology 1 November 2024 464
