Quantum Complexity Science Initiative
QUANTUM MACHINE LEARNING
Develops quantum enhanced algorithms for machine learning tasks—deep learning with Boltzmann machines, absolute physical limits of learning agents
QUANTUM + COMPLEX NETWORKS
A ‘quantum theory’ of networked and complex systems—quantum walks, information theory of complex networks based on quantum statistical mechanics
QUANTUM TENSOR NETWORKS
Graphical calculus representing quantum states, algorithms and invariants—simulating quantum systems, numerical analysis and classical machine learning
adiabatic quantum computing
Universal adiabatic quantum computing and quantum algorithms simulating chemical physics—D-Wave quantum hardware, quantum annealing
A theory of collective quantum effects
Our research induced a topical dichotomy: (i) we work to understand collective quantum effects at the fundamental or basic science level and (ii) this understanding enables us to utilize these same collective quantum effects in e.g. quantum enhanced machine learning software or quantum computer algorithms simulating chemical physics.
Collective quantum effects arise when at least one variable is unbounded and the system/problem exhibits an emergent property: such as an empirically exhibited—though not yet proven—exponential separation between quantum and stochastic computational processes. (Here the unbounded variable would be the size of the problem instance.)
We call our topic, quantum complexity science, as we merge ideas from several disciplines to contrast stochastic and quantum systems in increasingly precise terms. We utilize this knowledge primarily as a quantum computational resource. The conceptual interaction of the building blocks behind our work are illustrated below.
Topical mind map of quantum complexity science—bottom circle: left utilizing and right understanding collective quantum effects.
The Quantum Complexity Science Initiative is proudly part of the Skolkovo Institute of Science and Technology—Skoltech—a unique English-speaking international graduate only research university. Established in collaboration with M.I.T., Skoltech is an integral part of the Skolkovo Innovation Center that comprises a complete high-tech city with a number of international R&D centers and start-up incubators, several of which are focused on quantum technology. We are on the lookout for exceptional talent to join our research program.
Jacob D. Biamonte
-
Short Biography
Jacob Biamonte is an American physicist, quantum computer scientist and Associate Professor at the Skolkovo Institute of Science and Technology and the inaugural Lead of Skoltech's Quantum Complexity Science Initiative. Biamonte has made several contributions to the theory and implementation of quantum computers.
Biamonte was employed as one of the world's first quantum software programmers at D-Wave Systems Inc. in Vancouver B.C., Canada. From this work, he published several celebrated proofs establishing the computational universality of specific quantum many-body ground states used in adiabatic quantum computing. He played a central role in developing aspects of contemporary quantum computing theory, including research recognized as pioneering the emerging field that unites quantum information with complex network theory and machine learning.
Biamonte earned an award winning Doctorate at the University of Oxford and his collective research was recognized in 2013 with the Shapiro Award in Mathematical Physics. He has advised both government agencies and industry and lead several successful interdisciplinary research teams and projects, comprised of students and research staff with backgrounds spanning physics, mathematics and computer science. He supervised four exceptional PhD students and five extraordinarily talented postdocs, two of which are now Assistant Professors. He was invited to become a lifelong member of the Foundational Questions Institute (FQXi) and serves on the editorial boards of several journals including NJP. -
Follow research:
-
Working Team
JACOB BIAMONTE
JACOB TURNER
Postdoctoral and Research Scientist Alumni
MAURO FACCIN
VILLE BERGHOLM
TOMI JOHNSON
JAMES WHITFIELD
ZOLTÁN ZIMBORÁS
PhD and Long-Term Visiting Student Alumni
DAVID YUDONG CAO
JACOB TURNER
PIOTR MIGDAŁ
Administrative Staff
LUSA ZEGLOVA
External and Collaborative Research Council
JOHN C. BAEZ
MIKE MOSCA
SETH LLOYD
Research Highlights
uniting quantum information and complexity science
Universal Adiabatic Quantum Computing
Developed results considered foundational to the field of adiabatic quantum computing. Including the well regarded proof that the tunable sparse two-body model
has a QMA-complete (quantum analogy of the complexity class, randomized NP) ground state energy problem [Phys. Rev. A 78, 012352 (2008)] – establishing the contemporary experimental target. 
Explore our topics
Quantum Theory and Complex Networks
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. […]
Adiabatic Quantum Computing
Our work has been to develop a universal adiabatic quantum computer.
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. […]
Quantum Walks
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 Collaborations
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 […]
Ising Hamiltonian Formulation of Boolean Operations and Gates
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 […]
Quantum Simulation
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
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. […]