Search results for "complexity"

Grover’s Search with Faults on Some Marked Elements

2018

Grover’s algorithm is a quantum query algorithm solving the unstructured search problem of size [Formula: see text] using [Formula: see text] queries. It provides a significant speed-up over any classical algorithm [3]. The running time of the algorithm, however, is very sensitive to errors in queries. Multiple authors have analysed the algorithm using different models of query errors and showed the loss of quantum speed-up [2, 6]. We study the behavior of Grover’s algorithm in the model where the search space contains both faulty and non-faulty marked elements. We show that in this setting it is indeed possible to find one of marked elements in [Formula: see text] queries. We also analyze…

Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection

2015

We show that an improvement to the best known quantum lower bound for GRAPH-COLLISION problem implies an improvement to the best known lower bound for TRIANGLE problem in the quantum query complexity model. In GRAPH-COLLISION we are given free access to a graph $(V,E)$ and access to a function $f:V\rightarrow \{0,1\}$ as a black box. We are asked to determine if there exist $(u,v) \in E$, such that $f(u)=f(v)=1$. In TRIANGLE we have a black box access to an adjacency matrix of a graph and we have to determine if the graph contains a triangle. For both of these problems the known lower bounds are trivial ($\Omega(\sqrt{n})$ and $\Omega(n)$, respectively) and there is no known matching upper …

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.

The Ghost of the Hawk: Top Predator Shaping Bird Communities in Space and Time

2021

Despite the wide recognition that strongly interacting species can influence distributions of other species, species interactions are often disregarded when assessing or projecting biodiversity distributions. In particular, it remains largely uncharted the extent to which the disappearance of a keystone species cast repercussions in the species composition of future communities. We tested whether an avian top predator can exert both positive and negative effects on spatial distribution of other species, and if these effects persist even after the predator disappeared. We acquired bird count data at different distances from occupied and non-occupied nests of Northern goshawks Accipiter genti…

Adequate number of consumers in a liking test. Insights from resampling in seven studies

2014

The recommended number of consumers to be enrolled in a hedonic test comparing several products usually ranges from 50 to 100, at least if no liking segmentation is sought. This paper seeks to examine whether such a panel size range is adequate, by means of 7 trials with different levels of product space complexity. Five types of products were tested: Two varied in fattiness and sweetness and were tested under the same conditions in two separate laboratories (4 trials); the remaining three, varying in taste and texture, were each tested in a different laboratory (3 trials). Each of the 7 trials was run by a different laboratory. Each of the seven laboratories enrolled in its trial 150 consu…

Nonlinear Optical Characterization of InP@ZnS Core-Shell Colloidal Quantum Dots Using 532 nm, 10 ns Pulses

2021

InP@ZnS core-shell colloidal quantum dots (CQDs) were synthesized and characterized using the z-scan technique. The nonlinear refraction and nonlinear absorption coefficients (γ = −2 × 10−12 cm2 W−1, β = 4 × 10−8 cm W−1) of these CQDs were determined using 10 ns, 532 nm pulses. The saturable absorption (β = −1.4 × 10−9 cm W−1, Isat = 3.7 × 108 W cm−2) in the 3.5 nm CQDs dominated at small intensities of the probe pulses (I ≤ 7 × 107 W cm−2) followed by reverse saturable absorption at higher laser intensities. We report the optical limiting studies using these CQDs showing the suppression of propagated nanosecond radiation in the intensity range of 8 × 107–2 × 109 W cm−2. The role of nonline…

Approximation algorithm for constrained coupled-tasks scheduling problem

2014

International audience; We tackle the makespan minimization coupled-tasks problem in presence of compatibility constraints. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. In such context, we propose some complexity results according to several parameters and we design an efficient polynomial-time approximation algorithm.

Cracking the Code : The Impact of Orthographic Transparency and Morphological-Syllabic Complexity on Reading and Developmental Dyslexia

2019

Reading is an essential skill in modern societies, yet not all learners necessarily become proficient readers. Theoretical concepts (e.g., the orthographic depth hypothesis; the grain size theory) as well as empirical evidence suggest that certain orthographies are easier to learn than others. The present paper reviews the literature on orthographic transparency, morphological complexity, and syllabic complexity of alphabetic languages. These notions are elaborated to show that differences in reading acquisition reflect fundamental differences in the nature of the phonological recoding and reading strategies developing in response to the specific orthography to be learned. The present paper…

Recent advances in the electrochemical reduction of substrates involving N−O Bonds

2020

Synthesis of Polycyclic Indolines by Utilizing a Reduction/Cyclization Cascade Reaction

2021

European journal of organic chemistry 2021(45), 6097-6101 (2021). doi:10.1002/ejoc.202101191