Search results for "Computer Science::Databases"
showing 10 items of 183 documents
Properties and application of nondeterministic quantum query algorithms
2006
Many quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given by a black box. As in the classical version of decision trees, different kinds of quantum query algorithms are possible: exact, zero-error, bounded-error and even nondeterministic. In this paper, we study the latter class of algorithms. We introduce a fresh notion in addition to already studied nondeterministic algorithms and introduce dual nondeterministic quantum query algorithms. We examine properties of such algorithms and prove relations with exact and nondeterministic quantum query algorithm complexity. As a result and as an example of the application of discovered properties, we…
Quantum Algorithm for k-distinctness with Prior Knowledge on the Input
2011
It is known that the dual of the general adversary bound can be used to build quantum query algorithms with optimal complexity. Despite this result, not many quantum algorithms have been designed this way. This paper shows another example of such algorithm. We use the learning graph technique from arXiv:1105.4024 to give a quantum algorithm for $k$-distinctness problem that runs in $o(n^{3/4})$ queries, for a fixed $k$, given some prior knowledge on the structure of the input. The best known quantum algorithm for the unconditional problem uses $O(n^{k/(k+1)})$ queries.
QCD Perturbative Calculation of the Scattering Processes at Hadron Colliders
2015
When two high energetic particles A and B collide, a large number of final-state particles can be produced.
Recent Developments in Quantum Algorithms and Complexity
2014
We survey several recent developments in quantum algorithms and complexity: Reichardt’s characterization of quantum query algorithms via span programs [15]; New bounds on the number of queries that are necessary for simulating a quantum algorithm that makes a very small number of queries [2]; Exact quantum algorithms with superlinear advantage over the best classical algorithm [4].
Ultrametric Vs. Quantum Query Algorithms
2014
Ultrametric algorithms are similar to probabilistic algorithms but they describe the degree of indeterminism by p-adic numbers instead of real numbers. This paper introduces the notion of ultrametric query algorithms and shows an example of advantages of ultrametric query algorithms over deterministic, probabilistic and quantum query algorithms.
Quantum versus classical query complexity of relation
2011
This paper investigates the computability of mathematical relations in a quantum query model. The important task in complexity theory is to find examples with a large gap between classical and quantum algorithm complexity of the same computational problem. We present new results in quantum query algorithm design that allow achieving a large separation between classical and quantum query complexity of a specific relation. We demonstrate an example where quantum query algorithm for a finite relation needs more than two times fewer queries than the best possible classical analogue. We also show that relation can be extended to infinite family of relations with an input of general size N.
"Table 22" of "Freeze-out radii extracted from three-pion cumulants in pp, p-Pb and Pb-Pb collisions at the LHC"
2014
Exponential radii scaled down by sqrt(pi) and intercept parameters in PbPb collisions versus Nch at low KT3.
"Table 25" of "Freeze-out radii extracted from three-pion cumulants in pp, p-Pb and Pb-Pb collisions at the LHC"
2014
Exponential radii scaled down by sqrt(pi) and intercept parameters in PbPb collisions versus Nch at high KT3.
"Table 20" of "Freeze-out radii extracted from three-pion cumulants in pp, p-Pb and Pb-Pb collisions at the LHC"
2014
Exponential radii scaled down by sqrt(pi) and intercept parameters in pp collisions versus Nch at low KT3.
"Table 23" of "Freeze-out radii extracted from three-pion cumulants in pp, p-Pb and Pb-Pb collisions at the LHC"
2014
Exponential radii scaled down by sqrt(pi) and intercept parameters in pp collisions versus Nch at high KT3.