Zobrazeno 1 - 10
of 185
pro vyhledávání: '"Berwald P"'
Adiabatic quantum computing has demonstrated how quantum Zeno can be used to construct quantum optimisers. However, much less work has been done to understand how more general Zeno effects could be used in a similar setting. We use a construction bas
Externí odkaz:
http://arxiv.org/abs/2311.08432
Publikováno v:
Quantum 8, 1532 (2024)
It has previously been established that adiabatic quantum computation, operating based on a continuous Zeno effect due to dynamical phases between eigenstates, is able to realise an optimal Grover-like quantum speedup. In other words, is able to solv
Externí odkaz:
http://arxiv.org/abs/2305.11146
We consider the Quantum Natural Gradient Descent (QNGD) scheme which was recently proposed to train variational quantum algorithms. QNGD is Steepest Gradient Descent (SGD) operating on the complex projective space equipped with the Fubini-Study metri
Externí odkaz:
http://arxiv.org/abs/2211.00615
Publikováno v:
Quantum, Vol 8, p 1532 (2024)
It has previously been established that adiabatic quantum computation, operating based on a continuous Zeno effect due to dynamical phases between eigenstates, is able to realise an optimal Grover-like quantum speedup. In other words, is able to solv
Externí odkaz:
https://doaj.org/article/526e52e363d9475c8582ae6f9f838793
Publikováno v:
Philosophical Transactions of the Royal Society A.381: 20210410 (2022)
We analyze the method of encoding pairwise interactions of higher-than-binary discrete variables (these models are sometimes referred to as discrete quadratic models) into binary variables based on domain walls on one dimensional Ising chains. We dis
Externí odkaz:
http://arxiv.org/abs/2108.12004
Autor:
Chukwu, Uchenna, Dridi, Raouf, Berwald, Jesse, Booth, Michael, Dawson, John, Le, DeYung, Wainger, Mark, Reinhardt, Steven P.
Graph partitioning is one of an important set of well-known compute-intense (NP-hard) graph problems that devolve to discrete constrained optimization. We sampled solutions to the problem via two different quantum-ready methods to understand the pros
Externí odkaz:
http://arxiv.org/abs/2006.15067
Autor:
Booth, Michael, Berwald, Jesse, Chukwu, Uchenna, Dawson, John, Dridi, Raouf, Le, DeYung, Wainger, Mark, Reinhardt, Steven P.
Many organizations that vitally depend on computation for their competitive advantage are keen to exploit the expected performance of quantum computers (QCs) as soon as quantum advantage is achieved. The best approach to deliver hardware quantum adva
Externí odkaz:
http://arxiv.org/abs/2005.11294
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Berwald, Jesse J.
In this article we cover the canonical problem formulation necessary to program the D-Wave quantum processing unit (QPU) and discuss how such a problem is compiled onto the QPU. We also cover recent joint work solving a problem from topological data
Externí odkaz:
http://arxiv.org/abs/1812.00062
Persistence diagrams are a useful tool from topological data analysis which can be used to provide a concise description of a filtered topological space. What makes them even more useful in practice is that they come with a notion of a metric, the Wa
Externí odkaz:
http://arxiv.org/abs/1809.06433