Related papers: Differential equation for partition functions and …
We propose a quantum algorithm to solve systems of nonlinear differential equations. Using a quantum feature map encoding, we define functions as expectation values of parametrized quantum circuits. We use automatic differentiation to…
Duality between the coloured quantum group and the coloured quantum algebra corresponding to GL(2) is established. The coloured L^{\pm} functionals are constructed and the dual algebra is derived explicitly. These functionals are then…
We investigate the algebro-geometric structure of a novel two-parameter quantum deformation which exhibits the nature of a semidirect or cross-product algebra built upon GL(2) x GL(1), and is related to several other known examples of…
We define an algorithm k which takes a connected graph G on a totally ordered vertex set and returns an increasing tree R (which is not necessarily a subtree of G). We characterize the set of graphs G such that k(G)=R. Because this set has…
We explore connections between the phenomenon of correlation decay and the location of Lee-Yang and Fisher zeros for various spin systems. In particular we show that, in many instances, proofs showing that weak spatial mixing on the Bethe…
In this paper, we study the stationary orbits of quantum Lindblad systems. We show that they can be characterized in terms of trees and forests on a directed graph with edge weights that depend on the Lindblad operators and the eigenbasis…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
We derive quantum kinetic equations for fermions in a homogeneous time-dependent background in presence of decohering collisions, by use of the Schwinger-Keldysh CTP-formalism. The quantum coherence (between particles and antiparticles) is…
We initiate a systematic study of quantum properties of finite graphs, namely, quantum asymmetry, quantum symmetry, and quantum isomorphism. We define the Schmidt alternative for a class of graphs, which reveals to be a useful tool for…
We study a discrete dynamic on weighted bipartite graphs on a torus, analogous to dimer integrable systems in Goncharov-Kenyon 2013. The dynamic on the graph is an urban renewal together with shrinking all 2-valent vertices, while it is a…
Based on bulk reconstruction from the finite boundary of the Bruhat-Tits tree, the boundary effective theory is obtained after integrating out fields outside this boundary. According to the $~p$-adic version of Anti-de Sitter/Conformal…
In this work, a new relationship is established between the solutions of higher fractional differential equations and a Wright-type transformation. Solutions could be interpreted as expected values of functions in a random time process. As…
The Jordan-Wigner transformation establishes a duality between $su(2)$ and fermionic algebras. We present qualitative arguments and numerical evidence that when mapping spins to fermions, the transformation makes strong correlation weaker,…
A quantum field theory is described which is a supersymmetric classical model. -- Supersymmetry generators of the system are used to split its Liouville operator into two contributions, with positive and negative spectrum, respectively. The…
We give an FPTAS for approximating the partition function of the hard-core model for bipartite graphs when there is sufficient imbalance in the degrees or fugacities between the sides $(L,R)$ of the bipartition. This includes, among others,…
Quantum theory is consistent with a computational model permitting black-box operations to be applied in an indefinite causal order, going beyond the standard circuit model of computation. The quantum switch -- the simplest such example --…
The graph isomorphism problem is theoretically interesting and also has many practical applications. The best known classical algorithms for graph isomorphism all run in time super-polynomial in the size of the graph in the worst case. An…
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yields a new formula for the number of NATs. We also obtain…
We construct normed spaces of real-valued functions with controlled growth on possibly infinite-dimensional state spaces such that semigroups of positive, bounded operators $(P_t)_{t\ge 0}$ thereon with $\lim_{t\to 0+}P_t f(x)=f(x)$ are in…
We introduce a novel family of translationally-invariant su$(m|n)$ supersymmetric spin chains with long-range interaction not directly associated to a root system. We study the symmetries of these models, establishing in particular the…