Add to ORKGThis monograph provides an introduction to the rapidly growing field of Quantum Hamiltonian Complexity, which includes the study of quantum constraint satisfaction problems. It provides a computer science-oriented introduction to the subject in order to help bridge the language barrier between computer scientists and physicists in the field
This dissertation investigates the theory of quantum stochastic processes and its applications in qu...
This book is an introduction to the field of constrained Hamiltonian systems and their quantization,...
This is a set of lecture notes suitable for a Master's course on quantum computation and information...
We survey the growing field of Quantum Hamiltonian Complexity, which includes the study of Quantum C...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
Research and development in the pioneering field of quantum computing involve just about every facet...
AbstractThe complexity of quantum computation remains poorly understood. While physicists attempt to...
The calculation of ground-state energies of physical systems can be formalised as the k-local Hamilt...
In this paper we give an overview of the quantum computational complexity class QMA and a descriptio...
AbstractThe complexity of quantum computation remains poorly understood. While physicists attempt to...
The complexity of quantum computation remains poorly understood. While physicists attempt to find wa...
Two equivalent formulations of the classical PCP theorem, hardness of approximation for constraint ...
The calculation of ground-state energies of physical systems can be formalised as the k-local Hamilt...
Abstract We propose how to compute the complexity of operators generated by Hamiltonians in quantum ...
In this paper, a survey of Kolmogorov complexity is reported. The basics are briefly covered to give...
This dissertation investigates the theory of quantum stochastic processes and its applications in qu...
This book is an introduction to the field of constrained Hamiltonian systems and their quantization,...
This is a set of lecture notes suitable for a Master's course on quantum computation and information...
We survey the growing field of Quantum Hamiltonian Complexity, which includes the study of Quantum C...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
Research and development in the pioneering field of quantum computing involve just about every facet...
AbstractThe complexity of quantum computation remains poorly understood. While physicists attempt to...
The calculation of ground-state energies of physical systems can be formalised as the k-local Hamilt...
In this paper we give an overview of the quantum computational complexity class QMA and a descriptio...
AbstractThe complexity of quantum computation remains poorly understood. While physicists attempt to...
The complexity of quantum computation remains poorly understood. While physicists attempt to find wa...
Two equivalent formulations of the classical PCP theorem, hardness of approximation for constraint ...
The calculation of ground-state energies of physical systems can be formalised as the k-local Hamilt...
Abstract We propose how to compute the complexity of operators generated by Hamiltonians in quantum ...
In this paper, a survey of Kolmogorov complexity is reported. The basics are briefly covered to give...
This dissertation investigates the theory of quantum stochastic processes and its applications in qu...
This book is an introduction to the field of constrained Hamiltonian systems and their quantization,...
This is a set of lecture notes suitable for a Master's course on quantum computation and information...