Related papers: An efficient quantum algorithm for colored Jones p…
This paper introduces Quantum Orthogonal Separable Physics-Informed Neural Networks (QO-SPINNs), a novel architecture for solving Partial Differential Equations, integrating quantum computing principles to address the computational…
Current quantum computing devices have different strengths and weaknesses depending on their architectures. This means that flexible approaches to circuit design are necessary. We address this task by introducing a novel space-efficient…
A sequence $f_n(q)$ is $q$-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in $q$ and $q^n$. Our main theorems state that $q$-holonomicity is preserved under twisting, i.e., replacing $q$ by $\omega q$…
We show how to apply the recursive quantum approximate optimization algorithm (RQAOA) to MAX-$k$-CUT, the problem of finding an approximate $k$-vertex coloring of a graph. We compare this proposal to the best known classical and hybrid…
The repertoire of problems theoretically solvable by a quantum computer recently expanded to include the approximate evaluation of knot invariants, specifically the Jones polynomial. The experimental implementation of this evaluation,…
Topological quantum computation may provide a robust approach for encoding and manipulating information utilizing the topological properties of anyonic quasi-particle excitations. We develop an efficient means to map between dense and…
It is known that the colored Jones polynomial of a $+$-adequate link has a well-defined tail consisting of stable coefficients, and that the coefficients of the tail carry geometric and topological information on the $+$-adequate link…
Knot and link polynomials are topological invariants calculated from the expectation value of loop operators in topological field theories. In 3D Chern-Simons theory, these invariants can be found from crossing and braiding matrices of…
We review the q-deformed spin network approach to topological quantum field theory and apply these methods to produce unitary representations of the braid groups that are dense in the unitary groups. The simplest case of these models is the…
In this paper, we describe a parameterized quantum circuit that can be considered as convolutional and pooling layers for graph neural networks. The circuit incorporates the parameterized quantum Fourier circuit where the qubit connections…
Simulating strongly correlated fermionic systems is notoriously hard on classical computers. An alternative approach, as proposed by Feynman, is to use a quantum computer. Here, we discuss quantum simulation of strongly correlated fermionic…
The treewidth of a graph is a useful combinatorial measure of how close the graph is to a tree. We prove that a quantum circuit with $T$ gates whose underlying graph has treewidth $d$ can be simulated deterministically in…
We propose a new gauge theory of quantum electrodynamics (QED) and quantum chromodynamics (QCD) from which we derive knot invariants such as the Jones polynomial. Our approach is inspired by the work of Witten who derived knot invariants…
We show that colored Khovanov homology detects classes of essential surfaces as a direct analogue of the slope conjectures for the colored Jones polynomial. We do this by identifying certain generators of the colored Khovanov chain complex…
We consider the potential function of the colored Jones polynomial for a link with arbitrary colors and obtain the cone-manifold structure for the link complement. In addition, we establish a relationship between a saddle point equation and…
In this paper we show that coloured Jones and coloured Alexander polynomials can both be read off from the same picture provided by two Lagrangians in a symmetric power of a surface. More specifically, the $N^{th}$ coloured Jones and…
This paper is a brief overview of recent results by the authors relating colored Jones polynomials to geometric topology. The proofs of these results appear in the papers [arXiv:1002.0256] and [arXiv:1108.3370], while this survey focuses on…
Using the colored Kauffman skein relation, we study the highest and lowest $4n$ coefficients of the $n^{th}$ unreduced colored Jones polynomial of alternating links. This gives a natural extension of a result by Kauffman in regard with the…
We present an algorithm for efficiently approximating of qubit unitaries over gate sets derived from totally definite quaternion algebras. It achieves $\varepsilon$-approximations using circuits of length $O(\log(1/\varepsilon))$, which is…
For spin systems, such as the $q$-colorings and independent-set models, approximating the partition function in the so-called non-uniqueness region, where the model exhibits long-range correlations, is typically computationally hard for…