English
Related papers

Related papers: Quantum dilogarithms and partition q-series

200 papers

We investigate the connections between flavored quivers, dimer models, and BPS pyramids for generic toric Calabi-Yau threefolds from various perspectives. We introduce a purely field theoretic definition of both finite and infinite pyramids…

High Energy Physics - Theory · Physics 2015-06-03 Richard Eager , Sebastian Franco

We propose a quantum cloning machine, which clones a qubit into two clones assuming known modulus of expectation value of Pauli Z-matrix. The process is referred to as the mirror phase-covariant cloning, for which the input state is a…

Quantum Physics · Physics 2009-09-10 Karol Bartkiewicz , Adam Miranowicz , Şahin Kaya Özdemir

We show the vertex operator formalism for the quiver gauge theory partition function and the $qq$-character of highest-weight module on quiver, both associated with the integral over the quiver variety.

High Energy Physics - Theory · Physics 2020-10-07 Taro Kimura

We show that R-matricies of all simple quantum groups have the properties which permit to present quantum group twists as transitions to other coordinate frames on quantum spaces. This implies physical equivalence of field theories…

q-alg · Mathematics 2008-11-26 A. P. Demichev

In [4] and [5], Folsom presents a family of modular units as higher-level analogues of the Rogers-Ramanujan $q$-continued fraction. These units are constructed from analytic solutions to the higher-order $q$-recurrence equations of Selberg.…

Number Theory · Mathematics 2015-06-30 Hannah Larson

In this work we have considered formal power series and partial differential equations, and their relationship with Coding Theory. We have obtained the nature of solutions for the partial differential equations for Cycle Poisson Case. The…

Information Theory · Computer Science 2007-07-13 Milan Bradonjic

Many methods solve Poisson equations by using grid techniques which discretize the problem in each dimension. Most of these algorithms are subject to the curse of dimensionality, so that they need exponential runtime. In the paper "Quantum…

Emerging Technologies · Computer Science 2020-06-17 Michael Holzmann , Harald Koestler

It is well-known to the experts that multi-dimensional state integrals of products of Faddeev's quantum dilogarithm which arise in Quantum Topology can be written as finite sums of products of basic hypergeometric series in q=e^{2\pi i\tau}…

Geometric Topology · Mathematics 2013-04-10 Stavros Garoufalidis , Rinat Kashaev

We study higher rank Donaldson-Thomas invariants of a Calabi-Yau 3-fold using Joyce-Song's wall-crossing formula. We construct quivers whose counting invariants coincide with the Donaldson-Thomas invariants. As a corollary, we prove the…

Algebraic Geometry · Mathematics 2010-02-22 Kentaro Nagao

Lectures on quantum computing. Contents: Algorithms. Quantum circuits. Quantum Fourier transform. Elements of number theory. Modular exponentiation. Shor`s algorithm for finding the order. Computational complexity of Schor`s algorithm.…

Quantum Physics · Physics 2007-05-23 Igor V. Volovich

Harrow, Hassidim, and Lloyd showed that for a suitably specified $N \times N$ matrix $A$ and $N$-dimensional vector $\vec{b}$, there is a quantum algorithm that outputs a quantum state proportional to the solution of the linear system of…

Quantum Physics · Physics 2017-12-27 Andrew M. Childs , Robin Kothari , Rolando D. Somma

A nilpotent endomorphism of a quiver representation induces a linear transformation on the vector space at each vertex. Generically among all nilpotent endomorphisms, there is a well-defined Jordan form for these linear transformations,…

Representation Theory · Mathematics 2022-12-15 Alexander Garver , Rebecca Patrias , Hugh Thomas

For each compact, simple, simply-connected Lie group and each integer level we construct a modular tensor category from a quotient of a certain subcategory of the category of representations of the corresponding quantum group. We determine…

Quantum Algebra · Mathematics 2010-02-23 Stephen F. Sawin

We present an algorithm for approximating linear categories of partitions (of sets). We report on concrete computer experiments based on this algorithm which we used to obtain first examples of so-called non-easy linear categories of…

Category Theory · Mathematics 2024-02-07 Daniel Gromada , Moritz Weber

Inspired by a previous work of Nakajima, we consider perverse sheaves over acyclic graded quiver varieties and study the Fourier-Sato-Deligne transform from a representation theoretic point of view. We obtain deformed monoidal…

Representation Theory · Mathematics 2015-01-20 Yoshiyuki Kimura , Fan Qin

We review several procedures of quantization formulated in the framework of (classical) phase space M. These quantization methods consider Quantum Mechanics as a "deformation" of Classical Mechanics by means of the "transformation" of the…

Mathematical Physics · Physics 2007-05-23 Oscar Arratia , Miguel A. Martin , Mariano A. Olmo

In arXiv:0912.1346, four quantum dilogarithm identities containing infinitely many factors are proposed as wall-crossing formula for refined BPS invariant. We give algebraic proof of these identities using the formula for universal R-matrix…

Quantum Algebra · Mathematics 2024-06-04 Masaru Sugawara

We give a cohomological interpretation of both the Kac polynomial and the refined Donaldson-Thomas- invariants of quivers. This interpretation yields a proof of a conjecture of Kac from 1982 and gives a new perspective on recent work of…

Representation Theory · Mathematics 2012-04-17 Tamas Hausel , Emmanuel Letellier , Fernando Rodriguez-Villegas

We compute the Donaldson-Thomas invariants of a local elliptic surface with section. We introduce a new computational technique which is a mixture of motivic and toric methods. This allows us to write the partition function for the…

Algebraic Geometry · Mathematics 2019-08-26 Jim Bryan , Martijn Kool

We provide algorithms computing power series solutions of a large class of differential or $q$-differential equations or systems. Their number of arithmetic operations grows linearly with the precision, up to logarithmic terms.

Symbolic Computation · Computer Science 2013-06-19 Alin Bostan , Muhammad F. I. Chowdhury , Romain Lebreton , Bruno Salvy , Éric Schost
‹ Prev 1 8 9 10 Next ›