A PhD Fellowship is being offered to work in Deep Quantum Lab – lead by Prof Jacob Biamonte at the Skolkovo Institute of Science and Technology. It is anticipated that the candidate will defend in either VAK 01.04.02 Theoretical Physics or 01.01.03 Mathematical Physics. Applications are now open. Experience in quantum theory/computing is not required. Students who[…]
What is the computational complexity of simulating a given Hamiltonian? What is the computational complexity of finding its ground state?
These questions are fundamental to condensed matter physics, to computational complexity but also have deep practical merit. Ground state quantum computation (e.g. adiabatic quantum computation) utilize properties of the ground states of Hamiltonians to compute.
Adiabatic quantum computing generally relies on the idea of embedding a problem instance into a physical system, such that the systems lowest energy configuration stores the problem instance solution. […]
D-Wave Systems Inc. builds annealing devices that exhibit quantum effects. These devices as well as other physical systems implement a programmable Ising model of the form.
\begin{equation}
H = \sum_i c_i Z_i+\sum_{ ij} c_{ij}Z_iZ_j
\end{equation} […]
We developed quantum computer algorithms which utilize quantum effects to
In our work, we have taken part in several experimental collaborations which have realized prototypes of our algorithms.
In his famous 1981 talk, Feynman proposed that unlike classical computers, which would presumably experience an exponential slowdown when simulating quantum phenomena, a universal quantum simulator would not. An ideal quantum simulator would be controllable, and built using existing technology. […]