Related papers: Quantum dilogarithm identities for n-cycle quivers
We present four quantum algorithms for solving a multidimensional drift-diffusion equation. They rely on a quantum linear system solver, a quantum Hamiltonian simulation, a quantum random walk, and the quantum Fourier transform. We compare…
Identifying symmetries in quantum dynamics, such as identity or time-reversal invariance, is a crucial challenge with profound implications for quantum technologies. We introduce a unified framework combining group representation theory and…
A permutation-invariant code on m qubits is a subspace of the symmetric subspace of the m qubits. We derive permutation-invariant codes that can encode an increasing amount of quantum information while suppressing leading order spontaneous…
Let $Q$ be a finite acyclic valued quiver. We define a bialgebra structure and an integration map on the Hall algebra associated to the morphism category of projective representations of $Q$. As an application, we recover the surjective…
We study space and time efficient quantum algorithms for two graph problems -- deciding whether an $n$-vertex graph is a forest, and whether it is bipartite. Via a reduction to the s-t connectivity problem, we describe quantum algorithms…
A method of Feynman diagrams summation, based on using Schwinger-Dyson equations and Ward identities, is verified by calculating some four-loop diagrams in N=1 supersymmetric electrodynamics, regularized by higher derivatives. In…
Color-ordered amplitudes in gauge theories satisfy non-linear identities involving amplitude products of different helicity configurations. We consider the origin of such identities and connect them to the Kawai-Lewellen-Tye (KLT) relations…
An overview of a quantum algorithm application for the identification of causal singular configurations of multiloop Feynman diagrams is presented. The quantum algorithm is implemented in two different quantum simulators, the output…
The first application of a quantum algorithm to Feynman loop integrals is reviewed. The connection between quantum computing and perturbative quantum field theory is feasible due to fact that the two on-shell states of a Feynman propagator…
We provide combinatorial proofs of some of the q-series identities considered by Andrews, Jimenez-Urroz and Ono [q-series identities and values of certain $L$-functions. Duke Math. J. 108 (2001), no. 3, 395--419].
In this article, first we give two formulae for the delta invariant of a complex curve singularity that can be embedded as a ${\mathbb Q}$-Cartier divisor in a normal surface singularity with rational homology sphere link. Next, we consider…
We calculate eigenvalues of one-dimensional quantum-systems by the exact numerical solution of the Lippmann-Schwinger equation, analogous to the scattering problem. To illustrate our method, we treat elementary problems: the harmonic and…
We notice that the famous pentagon identity for quantum dilogarithm functions and the five-term relation for certain operators related to Macdonald polynomials discovered by Garsia and Mellit can both be understood as specific cases of a…
An upper bound on degrees of elements of a minimal generating system for invariants of quivers of dimension (2,...,2) is established over a field of arbitrary characteristic and its precision is estimated. The proof is based on the…
We obtain a three-parameter $q$-series identity that generalizes two results of Chan and Mao. By specializing our identity, we derive new results of combinatorial significance in connection with $N(r, s, m, n)$, a function counting certain…
Keller proposed a combinatorial conjecture on construction of an n-by-infinite matrix, which comes from showing the existence of many orbits of different sizes in certain linear group actions. He proved it for the case n=4, and we show that…
Since Grover's seminal work, quantum search has been studied in great detail. In the usual search problem, we have a collection of n items and we would like to find a marked item. We consider a new variant of this problem in which…
We study field models for which a quantum action (i.e. the action appearing in the generating functional of Green functions) is invariant under supersymmetric transformations. We derive the Ward identity which is direct consequence of this…
We deal with a problem of finding maximum of a function from the Holder class on a quantum computer. We show matching lower and upper bounds on the complexity of this problem. We prove upper bounds by constructing an algorithm that uses the…
Quantum theory may be formulated using Hilbert spaces over any of the three associative normed division algebras: the real numbers, the complex numbers and the quaternions. Indeed, these three choices appear naturally in a number of…