Applications are invited for a postdoctoral research position in the theory of modern quantum algorithms. The position will be held at Skolkovo Institute of Science and Technology (Skoltech), Moscow, Russia. The start date is flexible but we would like to fill these position(s) as soon as possible. The successful applicant will work in the research[…]
Title of project “Quantum Computing Simulation in Mathematica” Overview Participants will build functions to simulate quantum processes, quantum circuits and quantum algorithms using Mathematica. No experience in Mathematica is required; no experience in quantum computing is required either. Emphasis will be placed on using the numerical functions built into Mathematica, but some symbolic functions can[…]
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. […]
Experimental quantum physics is where the rubber meets the road. There’s been incredible progress in demonstrating various quantum algorithms and other building blocks for a future device to surpass the best conceivable classical computer. The most interesting aspect of quantum information science is the fact that […]
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. […]