Zobrazeno 1 - 10
of 53
pro vyhledávání: '"Knysh S"'
Autor:
Knysh, S., Smelyanskiy, V.
Two recent preprints [B. Altshuler, H. Krovi, and J. Roland, "Quantum adiabatic optimization fails for random instances of NP-complete problems", arXiv:0908.2782 and "Anderson localization casts clouds over adiabatic quantum optimization", arXiv:0912
Externí odkaz:
http://arxiv.org/abs/1005.3011
Publikováno v:
Phys. Rev. Lett. 104, 020502 (2010)
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:
http://arxiv.org/abs/0910.1378
Publikováno v:
Phys. Rev. Lett. 101, 170503 (2008)
We study the typical (median) value of the minimum gap in the quantum version of the Exact Cover problem using Quantum Monte Carlo simulations, in order to understand the complexity of the quantum adiabatic algorithm (QAA) for much larger sizes than
Externí odkaz:
http://arxiv.org/abs/0803.3971
Autor:
Knysh, S., Smelyanskiy, V. N.
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:
http://arxiv.org/abs/0803.0149
Autor:
Knysh, S., Smelyanskiy, V. N.
In this paper we show that the performance of the quantum adiabatic algorithm is determined by phase transitions in underlying problem in the presence of transverse magnetic field $\Gamma$. We show that the quantum version of random Satisfiability pr
Externí odkaz:
http://arxiv.org/abs/cond-mat/0602257
Autor:
Knysh, S., Smelyanskiy, V. N.
We propose an approach suitable for solving NP-complete problems via adiabatic quantum computation with an architecture based on a lattice of interacting spins (qubits) driven by locally adjustable effective magnetic fields. Interactions between qubi
Externí odkaz:
http://arxiv.org/abs/quant-ph/0511131
Using methods and ideas from statistical mechanics, we propose a simple method for obtaining rigorous upper bounds for satisfiability transition in random boolean expressions composed of N variables and M clauses with K variables per clause. Determin
Externí odkaz:
http://arxiv.org/abs/cond-mat/0403416
In this paper we analyze the performance of the Quantum Adiabatic Evolution algorithm on a variant of Satisfiability problem for an ensemble of random graphs parametrized by the ratio of clauses to variables, $\gamma=M/N$. We introduce a set of macro
Externí odkaz:
http://arxiv.org/abs/quant-ph/0402199
Autor:
Markelova E.V. Markelova, Matyushkina L.S. Matyushkina L, Tulupova M.S. Tulupova M, Knysh S.V. Knysh S, Nevezhkina T.A. Nevezhkina
Publikováno v:
Akusherstvo i ginekologiia. :142-148
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::108dc4618e4dbf821b25132016e943e9
https://doi.org/10.18565/aig.2021.2.142-148
https://doi.org/10.18565/aig.2021.2.142-148
Publikováno v:
In Computer Physics Communications 2011 182(1):27-28