相关论文: An efficient quantum algorithm for colored Jones p…
An effective quantum field theory description of graphene in the ultra-relativistic regime is given by reduced QED aka. pseudo QED aka. mixed-dimensional QED. It has been speculated in the literature that reduced QED constitutes an example…
In this paper, the problem of constructing an efficient quantum circuit for the implementation of an arbitrary quantum computation is addressed. To this end, a basic block based on the cosine-sine decomposition method is suggested which…
The theory of kernelization can be used to rigorously analyze data reduction for graph coloring problems. Here, the aim is to reduce a q-Coloring input to an equivalent but smaller input whose size is provably bounded in terms of structural…
There is a natural relationship between Jones polynomials and quantum computation. We use this relationship to show that the complexity of evaluating relative-error approximations of Jones polynomials can be used to bound the classical…
We present a classically solvable model that leads to optimized low-depth quantum circuits leveraging separable pair approximations. The obtained circuits are well suited as a baseline circuit for emerging quantum hardware and can, in the…
Given a large social or information network, how can we partition the vertices into sets (i.e., colors) such that no two vertices linked by an edge are in the same set while minimizing the number of sets used. Despite the obvious practical…
Given any diagram of a link, we define on the cube of Kauffman's states a "2-complex" whose homology is an invariant of the associated framed links, and such that the graded Euler characteristic reproduces the unnormalized Kauffman bracket.…
By considering `coloured' braid group representation we have obtained a quantum group, which reduces to the standard $GL_q(2)$ and $GL_{p,q}(2)$ cases at some particular limits of the `colour' parameters. In spite of quite complicated…
Approximate random k-colouring of a graph G=(V,E) is a very well studied problem in computer science and statistical physics. It amounts to constructing a k-colouring of G which is distributed close to Gibbs distribution, i.e. the uniform…
The rapid development of reliable Quantum Processing Units (QPU) opens up novel computational opportunities for machine learning. Here, we introduce a procedure for measuring the similarity between graph-structured data, based on the…
We study relationships between the colored Jones polynomial and the A-polynomial of a knot. We establish for a large class of 2-bridge knots the AJ conjecture (of Garoufalidis) that relates the colored Jones polynomial and the A-polynomial.…
In this paper we prove that the family of colored Jones polynomials of a knot in $S^3$ determines the family of ADO polynomials of this knot. More precisely, we construct a two variables knot invariant unifying both the ADO and the colored…
Given $x, y$ on an unweighted undirected graph $G$, the goal of the pathfinding problem is to find an $x$-$y$ path. In this work, we first construct a graph $G$ based on welded trees and define a pathfinding problem in the adjacency list…
We introduce the partition function of edge-colored graph homomorphisms, of which the usual partition function of graph homomorphisms is a specialization, and present an efficient algorithm to approximate it in a certain domain. Corollaries…
Mapping a quantum algorithm to any practical large-scale quantum computer will require a sequence of compilations and optimizations. At the level of fault-tolerant encoding, one likely requirement of this process is the translation into a…
This work presents an optimization-based scalable quantum neural network framework for approximating $n$-qubit unitaries through generic parametric representation of unitaries, which are obtained as product of exponential of basis elements…
I formulate in a colour-friendly way the FKS method for the computation of QCD cross sections at the next-to-leading order accuracy. This is achieved through the definition of subtraction terms for squared matrix elements, constructed with…
Eisermann has shown that the Jones polynomial of a $n$-component ribbon link $L\subset S^3$ is divided by the Jones polynomial of the trivial $n$-component link. We improve this theorem by extending its range of application from links in…
A quantum computer needs the assistance of a classical algorithm to detect and identify errors that affect encoded quantum information. At this interface of classical and quantum computing the technique of machine learning has appeared as a…
The Four color problem is closely related to other branches of mathematics and practical applications. More than 20 of its reformulations are known, which connect this problem with problems of algebra, statistical mechanics and planning.…