By correctly studying information as an entity fundamentally governed by the laws of physics, development of an emerging common language is already binding certain ideas and mapping some techniques between the fields of quantum physics and complexity science. […]
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. […]
Chiral quantum walks offer a means to control quantum evolutions on graphs by controlling time-reversal symmetry breaking and the interplay of this effect with the global topological structure of the underlying network. The theory is part of a larger idea to merge time-symmetry theory with quantum information science and to address the quantum challenges of control on complex networks. […]
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. […]
Tensor networks gave rise to efficiently compact representations for certain classes of quantum states, and provide a graphical language to reason about quantum processes.
The methods reach outside of physics to large areas of computer science and even more recently have found applications in complex networks. […]