Search results for "Quantum"
showing 10 items of 9714 documents
Structure of Kac-Moody groups
2008
For a phys ic i s t , a Kac-Moody algebra is the current algebra of a quantum f i e l d theory model in I + I space-time dimensions with an in terna l symmetry group G [ I ] . A More p rec ise ly , l e t ~ be the Lie algebra of G . The Kac-Moody algebra g is a one-dimensional central extension of the loop algebra Map(S I , g ) . I f f l ' f2 C Map(S I ,~ ) , then the commutator is defined point -wise,
Action-Angle Variables
2001
In the following we will assume that the Hamiltonian does not depend explicitly on time; ∂H/∂t = 0. Then we know that the characteristic function W(q i , P i ) is the generator of a canonical transformation to new constant momenta P i , (all Q i , are ignorable), and the new Hamiltonian depends only on the P i ,: H = K = K(P i ). Besides, the following canonical equations are valid: $$ \dot Q_i = \frac{{\partial K}} {{\partial P_i }} = v_i = const. $$ (1) $$ \dot P_i = \frac{{\partial K}} {{\partial Q_i }} = 0. $$ (2)
Types of Motion in the Oblate Planet Problem
1985
We consider a mass point in the gravitational field of an oblate planet and in a meridianal plane. The Hamiltonian of the problem is: $$ \frac{1}{2}\left( {p_r^2 + \frac{{p_{\theta }^2}}{{{r^2}}}} \right) - \frac{1}{r} - \frac{\varepsilon }{{{r^3}}}\left( {1 - 3{{\sin }^2}\theta } \right) $$ .
h analogue of Newton's binomial formula
1998
In this letter, the $h$--analogue of Newton's binomial formula is obtained in the $h$--deformed quantum plane which does not have any $q$--analogue. For $h=0$, this is just the usual one as it should be. Furthermore, the binomial coefficients reduce to $\frac{n!}{(n-k)!}$ for $h=1$. \\ Some properties of the $h$--binomial coefficients are also given. \\ Finally, I hope that such results will contribute to an introduction of the $h$--analogue of the well--known functions, $h$--special functions and $h$--deformed analysis.
Quantum Queries on Permutations
2015
K. Iwama and R. Freivalds considered query algorithms where the black box contains a permutation. Since then several authors have compared quantum and deterministic query algorithms for permutations. It turns out that the case of \(n\)-permutations where \(n\) is an odd number is difficult. There was no example of a permutation problem where quantization can save half of the queries for \((2m+1)\)-permutations if \(m\ge 2\). Even for \((2m)\)-permutations with \(m\ge 2\), the best proved advantage of quantum query algorithms is the result by Iwama/Freivalds where the quantum query complexity is \(m\) but the deterministic query complexity is \((2m-1)\). We present a group of \(5\)-permutati…
Novel patterns for vector mesons from the large-Nc limit
2008
We report on a relation between the decay constants of \rho-like J^{PC}=1^{--} vector mesons, which arises solely from the perturbative analysis of the VV, TT and VT correlators at order \alpha_s^0 in the large-N_c limit. We find f_{V}^T/f_{V}=1/\sqrt{2} for highly excited states together with a pattern of alternation in sign. Quite remarkably, recent lattice determinations reported f_{\rho}^T/f_{\rho}=0.72(2), in excellent agreement with our large-N_c result. This seems to suggest a pattern like f_{Vn}^T/f_{Vn}=(-1)^n/\sqrt{2} for the whole (1^{--}) states. In order to test this conjecture in real QCD we construct a set of spectral sum rules, which turn out to comply nicely with this scena…
Exact Quantum Query Complexity of $$\text {EXACT}_{k,l}^n$$
2017
In the exact quantum query model a successful algorithm must always output the correct function value. We investigate the function that is true if exactly k or l of the n input bits given by an oracle are 1. We find an optimal algorithm (for some cases), and a nontrivial general lower and upper bound on the minimum number of queries to the black box.
Quantum Query Complexity for Some Graph Problems
2004
The paper [4] by H. Buhrman and R. de Wolf contains an impressive survey of solved and open problems in quantum query complexity, including many graph problems. We use recent results by A.Ambainis [1] to prove higher lower bounds for some of these problems. Some of our new lower bounds do not close the gap between the best upper and lower bounds. We prove in these cases that it is impossible to provide a better application of Ambainis’ technique for these problems.
Quantum Algorithm for Dyck Language with Multiple Types of Brackets
2021
We consider the recognition problem of the Dyck Language generalized for multiple types of brackets. We provide an algorithm with quantum query complexity \(O(\sqrt{n}(\log n)^{0.5k})\), where n is the length of input and k is the maximal nesting depth of brackets. Additionally, we show the lower bound for this problem which is \(\varOmega (\sqrt{n}c^{k})\) for some constant c.
The Structure Group and the Permutation Group of a Set-Theoretic Solution of the Quantum Yang–Baxter Equation
2021
We describe the left brace structure of the structure group and the permutation group associated to an involutive, non-degenerate set-theoretic solution of the quantum YangBaxter equation by using the Cayley graph of its permutation group with respect to its natural generating system. We use our descriptions of the additions in both braces to obtain new properties of the structure and the permutation groups and to recover some known properties of these groups in a more transparent way.