Zobrazeno 1 - 10
of 289
pro vyhledávání: '"Coudron P"'
The recent resolution of the NLTS Conjecture [ABN22] establishes a prerequisite to the Quantum PCP (QPCP) Conjecture through a novel use of newly-constructed QLDPC codes [LZ22]. Even with NLTS now solved, there remain many independent and unresolved
Externí odkaz:
http://arxiv.org/abs/2310.01347
The recently-defined No Low-energy Sampleable States (NLSS) conjecture of Gharibian and Le Gall [GL22] posits the existence of a family of local Hamiltonians where all states of low-enough constant energy do not have succinct representations allowing
Externí odkaz:
http://arxiv.org/abs/2302.14755
Publikováno v:
14th Innovations in Theoretical Computer Science Conference (ITCS 2023), Leibniz International Proceedings in Informatics, vol. 251, pp. 37:1-37:22 (2023)
The so-called welded tree problem provides an example of a black-box problem that can be solved exponentially faster by a quantum walk than by any classical algorithm. Given the name of a special ENTRANCE vertex, a quantum walk can find another disti
Externí odkaz:
http://arxiv.org/abs/2211.12447
Autor:
Arora, Atul Singh, Coladangelo, Andrea, Coudron, Matthew, Gheorghiu, Alexandru, Singh, Uttam, Waldner, Hendrik
Publikováno v:
STOC 2023
We give a comprehensive characterization of the computational power of shallow quantum circuits combined with classical computation. Specifically, for classes of search problems, we show that the following statements hold, relative to a random oracle
Externí odkaz:
http://arxiv.org/abs/2210.06454
Autor:
E. Fiorilla, M. Gariglio, F. Gai, V. Zambotto, V. Bongiorno, E.E. Cappone, I. Biasato, S. Bergagna, J. Madrid, S. Martinez-Miró, M.T. Capucchio, D. Ippolito, D. Fabrikov, L. Lyn Castillo, J. Cortes, C. Coudron, A. Schiavone
Publikováno v:
Animal, Vol 18, Iss 8, Pp 101239- (2024)
The demand for sustainable and ethically farmed animal products is on the rise as consumers become more environmentally and animal welfare conscious. The need to diminish the consumption of soybean meal is urgent, and companies are looking for ways t
Externí odkaz:
https://doaj.org/article/77d2e10175cf464c96799cfdfd9c9cc4
We present a classical algorithm that, for any $D$-dimensional geometrically-local, quantum circuit $C$ of polylogarithmic-depth, and any bit string $x \in {0,1}^n$, can compute the quantity $||^2$ to within any inverse-polynomial
Externí odkaz:
http://arxiv.org/abs/2202.08349
Autor:
Coble, Nolan J., Coudron, Matthew
We present a classical algorithm that, for any 3D geometrically-local, polylogarithmic-depth quantum circuit $C$ acting on $n$ qubits, and any bit string $x\in\{0,1\}^n$, can compute the quantity $|< x |C|0^{\otimes n}>|^2$ to within any inverse-poly
Externí odkaz:
http://arxiv.org/abs/2012.05460
Autor:
Coudron, Matthew, Menda, Sanketh
A conjecture of Jozsa (arXiv:quant-ph/0508124) states that any polynomial-time quantum computation can be simulated by polylogarithmic-depth quantum computation interleaved with polynomial-depth classical computation. Separately, Aaronson conjectured
Externí odkaz:
http://arxiv.org/abs/1909.10503
Autor:
Coudron, Matthew, Slofstra, William
We study the problem of approximating the commuting-operator value of a two-player non-local game. It is well-known that it is $\mathrm{NP}$-complete to decide whether the classical value of a non-local game is 1 or $1- \epsilon$. Furthermore, as lon
Externí odkaz:
http://arxiv.org/abs/1905.11635
Autor:
Coudron, Matthew, Harrow, Aram W.
Publikováno v:
34th Computational Complexity Conference (CCC 2019), pp. 20:1--20:25
Entanglement assistance is known to reduce the quantum communication complexity of evaluating functions with distributed inputs. But does the type of entanglement matter, or are EPR pairs always sufficient? This is a natural question because in sever
Externí odkaz:
http://arxiv.org/abs/1902.07699