arXiv subjects

Brenno C. Vallilo

Publications and source records attributed to Brenno C. Vallilo.

3 recordsLinked to original sources

arXiv2013

A construction of integrated vertex operator in the pure spinor sigma-model in AdS5xS5

Vertex operators in string theory come in two varieties: integrated and unintegrated. Understanding both types is important for the calculation of the string theory amplitudes. The relation between them is a descent procedure typically involving the b-ghost. In the pure spinor formalism vertex operators can be identified as cohomology classes of an infinite-dimensional Lie superalgebra formed by covariant derivatives. We show that in this language the construction of the integrated vertex from an unintegrated vertex is very straightforward, and amounts to the evaluation of the cocycle on the generalized Lax currents.

hep-th↗

arXiv2012

On semiclassical analysis of pure spinor superstring in an AdS_5 x S^5 background

Relation between semiclassical analyses of Green-Schwarz and pure spinor formalisms in an AdS_5 x S^5 background is clarified. It is shown that the two formalisms have identical semiclassical partition functions for a simple family of classical solutions. It is also shown that, when the classical string is furthermore rigid, this in turn implies that the two formalisms predict the same one-loop corrections to spacetime energies.

hep-th↗

arXiv2006

Group Theoretical Formulation of Quantum Partial Search Algorithm

Searching and sorting used as a subroutine in many important algorithms. Quantum algorithm can find a target item in a database faster than any classical algorithm. One can trade accuracy for speed and find a part of the database (a block) containing the target item even faster, this is partial search. An example is the following: exact address of the target item is given by a sequence of many bits, but we need to know only some of them. More generally partial search considers the following problem: a database is separated into several blocks. We want to find a block with the target item, not the target item itself. In this paper we reformulate quantum partial search algorithm in terms of group theory.

quant-ph↗