Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Patnaik, Pratik"'
Autor:
Barton, Brandon, Sagal, Jacob, Feeney, Sean, Grattan, George, Patnaik, Pratik, Oganesyan, Vadim, Carr, Lincoln D, Kapit, Eliot
In this work, we introduce a new iterative quantum algorithm, called Iterative Symphonic Tunneling for Satisfiability problems (IST-SAT), which solves quantum spin glass optimization problems using high-frequency oscillating transverse fields. IST-SA
Externí odkaz:
http://arxiv.org/abs/2408.06571
Autor:
Kapit, Eliot, Barton, Brandon A., Feeney, Sean, Grattan, George, Patnaik, Pratik, Sagal, Jacob, Carr, Lincoln D., Oganesyan, Vadim
A canonical feature of the constraint satisfaction problems in NP is approximation hardness, where in the worst case, finding sufficient-quality approximate solutions is exponentially hard for all known methods. Fundamentally, the lack of any guided
Externí odkaz:
http://arxiv.org/abs/2312.06104
Autor:
Grattan, George, Barton, Brandon A., Feeney, Sean, Mossi, Gianni, Patnaik, Pratik, Sagal, Jacob C., Carr, Lincoln D., Oganesyan, Vadim, Kapit, Eliot
The exponential suppression of macroscopic quantum tunneling (MQT) in the number of elements to be reconfigured is an essential element of broken symmetry phases. This suppression is also a core bottleneck in quantum algorithms, such as traversing an
Externí odkaz:
http://arxiv.org/abs/2311.17814
Adiabatic rapid passage (ARP) is extensively used to achieve efficient transfer or inversion of populations in quantum systems. Landau and Zener accurately estimated the transfer probability of ARP for a closed system and showed that this probability
Externí odkaz:
http://arxiv.org/abs/2301.10182