Related papers: A full dichotomy for Holant$^c$, inspired by quant…
Quantum computing (QC) is a new computational paradigm whose foundations relate to quantum physics. Notable progress has been made, driving the birth of a series of quantum-based algorithms that take advantage of quantum computational…
Quantum tasks are quantum computations with inputs and outputs occurring at specified spacetime locations. Considering such tasks in the context of AdS/CFT has led to novel constraints relating bulk geometry and boundary entanglement. In…
A finite dimensional system with a quadratic Hamiltonian constraint is Dirac quantized in holomorphic, antiholomorphic and mixed representations. A unique inner product is found by imposing Hermitian conjugacy relations on an operator…
We study techniques for deciding the computational complexity of infinite-domain constraint satisfaction problems. For certain fundamental algebraic structures Delta, we prove definability dichotomy theorems of the following form: for every…
Completely integrable Hamiltonian systems look promising for controllability since their first integrals are stable under an internal evolution, and one may hope to find a perturbation of a Hamiltonian which drives the first integrals at…
We discover a novel connection between two classical mathematical notions, Eulerian orientations and Hadamard codes by studying the counting problem of Eulerian orientations (\#EO) with local constraint functions imposed on vertices. We…
We give a complexity dichotomy theorem for the counting Constraint Satisfaction Problem (#CSP in short) with complex weights. To this end, we give three conditions for its tractability. Let F be any finite set of complex-valued functions,…
The statistical mechanics of quantum-classical systems with holonomic constraints is formulated rigorously by unifying the classical Dirac bracket and the quantum-classical bracket in matrix form. The resulting Dirac quantum-classical…
We view the determinant and permanent as functions on directed weighted graphs and introduce their analogues for the undirected graphs. We prove that the task of computing the undirected determinants as well as permanents for planar graphs,…
Coordinated inference problems are being introduced as a basis for a neural network representation of the locality problem in the holographic bulk. It is argued that a type of problem originating in the "prisoners and hats" dilemma involves…
We introduce the holonomy-diffeomorphism algebra, a C*-algebra generated by flows of vectorfields and the compactly supported smooth functions on a manifold. We show that the separable representations of the holonomy-diffeomorphism algebra…
We introduce a framework for generating, organizing, and reasoning with computational knowledge. It is motivated by the observation that most problems in Computational Sciences and Engineering (CSE) can be formulated as that of completing…
Determining the satisfiability of Boolean constraint-satisfaction problems with different types of constraints, that is hybrid constraints, is a well-studied problem with important applications. We study here a new application of hybrid…
Holonomy algebras arise naturally in the classical description of Yang-Mills fields and gravity, and it has been suggested, at a heuristic level, that they may also play an important role in a non-perturbative treatment of the quantum…
The quantum mechanical formalism doesn't support our intuition, nor does it elucidate the key concepts that govern the behaviour of the entities that are subject to the laws of quantum physics. The arrays of complex numbers are kin to the…
The problem 2-quantum-satisfiability (2-QSAT) is the generalisation of the 2-CNF-SAT problem to quantum bits, and is equivalent to determining whether or not a spin-1/2 Hamiltonian with two-body terms is frustration-free. Similarly to the…
Subgraph and homomorphism counting are fundamental algorithmic problems. Given a constant-sized pattern graph $H$ and a large input graph $G$, we wish to count the number of $H$-homomorphisms/subgraphs in $G$. Given the massive sizes of…
There is much recent development towards interferometric measurements of holographic quantum uncertainties in an emergent background space-time. Despite increasing promise for the target detection regime of Planckian strain power spectral…
Dualities are hidden symmetries that map seemingly unrelated physical systems onto each other. The goal of this work is to systematically construct families of Hamiltonians endowed with a given duality and to provide a universal description…
In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…