Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Sergey Knysh"'
Autor:
Sergey Knysh
Publikováno v:
Nature Communications, Vol 7, Iss 1, Pp 1-9 (2016)
Quantum annealing can solve hard optimization problems, but it is limited by computational bottlenecks. Here, the author obtains the scaling of spin-glass bottlenecks with the problem size and explains a crossover to exponential complexity for large
Externí odkaz:
https://doaj.org/article/3f59fc4bc6c5447ba98c654cc97faa9c
Autor:
Davide Venturelli, Salvatore Mandrà, Sergey Knysh, Bryan O’Gorman, Rupak Biswas, Vadim Smelyanskiy
Publikováno v:
Physical Review X, Vol 5, Iss 3, p 031040 (2015)
Many NP-hard problems can be seen as the task of finding a ground state of a disordered highly connected Ising spin glass. If solutions are sought by means of quantum annealing, it is often necessary to represent those graphs in the annealer’s hard
Externí odkaz:
https://doaj.org/article/2c931efa1982454fade208a3210bd1ba
Publikováno v:
Physical Review B. 102
Optimal parameter setting for applications problems embedded into hardware graphs is key to practical quantum annealers (QA). Embedding chains typically crop up as harmful Griffiths phases, but can be used as a resource as we show here: to balance ou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f17ef42397fa0d5f3991bb4071d08871
https://doi.org/10.1103/physrevb.102.220407
https://doi.org/10.1103/physrevb.102.220407
To gain better insight into the complexity theory of quantum annealing, we propose and solve a class of spin systems which contain bottlenecks of the kind expected to dominate the runtime of quantum annealing as it tries to solve difficult optimizati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a203b61f9eadbb843516a76d5d3a45e8
http://arxiv.org/abs/1909.00322
http://arxiv.org/abs/1909.00322
Autor:
Josh Mutus, Rami Barends, Pedram Roushan, Andre Petukhov, Erik Lucero, Roberto Collins, Hartmut Neven, Paul V. Klimov, Z. Jamie Yao, Austin G. Fowler, Julian Kelly, Xiao Mi, Ryan Babbush, Matthew P. Harrigan, Marissa Giustina, David Landhuis, Jarrod R. McClean, B. Burkett, Joseph C. Bardin, Michael J. Hartmann, Rupak Biswas, Amit Vainsencher, Steve Habegger, Daniel Sank, Eric Ostby, William Courtney, Alexander N. Korotkov, Alan Ho, Keith Guerin, Ofer Naaman, Ping Yeh, Frank Arute, Kevin Sung, Zhang Jiang, Mike Lindmark, Markus R. Hoffmann, Salvatore Mandrà, Matthew D. Trevithick, Fernando G. S. L. Brandão, Dave Bacon, Anthony Megrant, Trent Huang, Theodore White, Andrew Dunsworth, Ben Chiaro, Kristel Michielsen, Adam Zalcman, David A. Buell, Evan Jeffrey, Benjamin Villalonga, John M. Martinis, Kevin J. Satzinger, Eleanor Rieffel, John Platt, Masoud Mohseni, Sergei V. Isakov, R. Graff, Sergio Boixo, Nicholas C. Rubin, Fedor Kostritsa, Dmitry I. Lyakh, Murphy Yuezhen Niu, Sergey Knysh, Kunal Arya, Zijun Chen, Matthew Neeley, Travis S. Humble, Craig Gidney, Chris Quintana, Charles Neill, Yu Chen, Dvir Kafri, Matt McEwen, Brooks Foxen, Vadim Smelyanskiy, Kostyantyn Kechedzhi, Edward Farhi
Publikováno v:
Nature 574(7779), 505-510 (2019). doi:10.1038/s41586-019-1666-5
The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ea7e4f02e0b3aeb69a4fdad3a1d413e
https://juser.fz-juelich.de/record/868375
https://juser.fz-juelich.de/record/868375
We show that quantum diffusion near the quantum critical point can provide a highly very efficient mechanism of open-system quantum annealing. It is based on the diffusion-mediated recombination of excitations. For an Ising spin chain coupled to a bo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8196c20a85271a730561c0c1fc39c90
http://arxiv.org/abs/1511.02581
http://arxiv.org/abs/1511.02581
Publikováno v:
Physical Review A. 83
Phase precision in optimal 2-channel quantum interferometry is studied in the limit of large photon number $N\gg 1$, for losses occurring in either one or both channels. For losses in one channel an optimal state undergoes an intriguing sequence of l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d71daf1be960a2579a535e027d25253c
https://doi.org/10.1103/physreva.83.021804
https://doi.org/10.1103/physreva.83.021804
We simulate the quantum adiabatic algorithm (QAA) for the exact cover problem for sizes up to N=256 using quantum Monte Carlo simulations incorporating parallel tempering. At large N we find that some instances have a discontinuous (first order) quan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7517cda68c6696c59f8f00de1a0e09a6
Autor:
Vadim Smelyanskiy, Sergey Knysh
Publikováno v:
Physical Review E. 78
We study the quantum version of the random $K$-Satisfiability problem in the presence of the external magnetic field $\Gamma$ applied in the transverse direction. We derive the replica-symmetric free energy functional within static approximation and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4b8e28f1df110d016fbf9169ce86ff79
https://doi.org/10.1103/physreve.78.061128
https://doi.org/10.1103/physreve.78.061128
Publikováno v:
Computer Physics Communications. 182:27-28
The Quantum Adiabatic Algorithm has been proposed as a general purpose algorithm for solving hard optimization problems on a quantum computer. Early work on very small sizes indicated that the running time (complexity) only increased as a (quite smal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27b5e83f6cb838fddc1fdcb68042af35
https://doi.org/10.1016/j.cpc.2010.06.001
https://doi.org/10.1016/j.cpc.2010.06.001