Zobrazeno 1 - 10
of 1 015
pro vyhledávání: '"Granet, P"'
It is well-known that simulating quantum circuits with low but non-zero hardware noise is more difficult than without noise. It requires either to perform density matrix simulations (coming with a space overhead) or to sample over "quantum trajectori
Externí odkaz:
http://arxiv.org/abs/2410.08639
Autor:
Nigmatullin, Ramil, Hemery, Kevin, Ghanem, Khaldoon, Moses, Steven, Gresh, Dan, Siegfried, Peter, Mills, Michael, Gatterman, Thomas, Hewitt, Nathan, Granet, Etienne, Dreyer, Henrik
The utility of solving the Fermi-Hubbard model has been estimated in the billions of dollars. Digital quantum computers can in principle address this task, but have so far been limited to quasi one-dimensional models. This is because of exponential o
Externí odkaz:
http://arxiv.org/abs/2409.06789
Autor:
Granet, Etienne, Dreyer, Henrik
We provide analytic, numerical and experimental evidence that the amount of noise in digital quantum simulation of local observables can be independent of system size in a number of situations. We provide a microscopic explanation of this dilution of
Externí odkaz:
http://arxiv.org/abs/2409.04254
Despite its simplicity and strong theoretical guarantees, adiabatic state preparation has received considerably less interest than variational approaches for the preparation of low-energy electronic structure states. Two major reasons for this are th
Externí odkaz:
http://arxiv.org/abs/2407.09993
Fix $k\geq 2$, choose $\frac{\log n}{n^{(k-1)/k}}\leq p\leq 1-\Omega(\frac{\log^4 n}{n})$, and consider $G\sim G(n,p)$. For any pair of vertices $v,w\in V(G)$, we give a simple and precise formula for the expected number of steps that a random walk o
Externí odkaz:
http://arxiv.org/abs/2405.10756
Autor:
Granet, Etienne, Dreyer, Henrik
According to the adiabatic theorem of quantum mechanics, a system initially in the ground state of a Hamiltonian remains in the ground state if one slowly changes the Hamiltonian. This can be used in principle to solve hard problems on quantum comput
Externí odkaz:
http://arxiv.org/abs/2404.16001
A longstanding conjecture of Seymour states that in every oriented graph there is a vertex whose second outneighbourhood is at least as large as its outneighbourhood. In this short note we show that, for any fixed $p\in[0,1/2)$, a.a.s. every orientat
Externí odkaz:
http://arxiv.org/abs/2403.02842
Autor:
Granet, Etienne, Dreyer, Henrik
It is generally considered that the signal output by a quantum circuit is attenuated exponentially fast in the number of gates. This letter explores how algorithms using mid-circuit measurements and classical conditioning as computational tools (and
Externí odkaz:
http://arxiv.org/abs/2401.02207
Autor:
Ciavolella, Giorgia, Granet, Julien, Goetz, Jacky, Osmani, Nael, Etchegaray, Christèle, Collin, Annabelle
The spread of metastases is a crucial process in which some questions remain unanswered. In this work, we focus on tumor cells circulating in the bloodstream, the so-called Circulating Tumor Cells (CTCs). Our aim is to characterize their trajectories
Externí odkaz:
http://arxiv.org/abs/2311.02091
Autor:
Granet, Etienne, Dreyer, Henrik
Publikováno v:
npj Quantum Inf 10, 82 (2024)
We introduce an algorithm to compute Hamiltonian dynamics on digital quantum computers that requires only a finite circuit depth to reach an arbitrary precision, i.e. achieves zero discretization error with finite depth. This finite number of gates c
Externí odkaz:
http://arxiv.org/abs/2308.03694