Do you want to publish a course? Click here

Every NAND formula of size N can be evaluated in time N^{1/2+o(1)} on a quantum computer

73   0   0.0 ( 0 )
 Added by Robert Spalek
 Publication date 2007
  fields Physics
and research's language is English




Ask ChatGPT about the research

For every NAND formula of size N, there is a bounded-error N^{1/2+o(1)}-time quantum algorithm, based on a coined quantum walk, that evaluates this formula on a black-box input. Balanced, or ``approximately balanced, NAND formulas can be evaluated in O(sqrt{N}) queries, which is optimal. It follows that the (2-o(1))-th power of the quantum query complexity is a lower bound on the formula size, almost solving in the positive an open problem posed by Laplante, Lee and Szegedy.



rate research

Read More

After recalling different formulations of the definition of supersymmetric quantum mechanics given in the literature, we discuss the relationships between them in order to provide an answer to the question raised in the title.
Single crystals of iridates are usually grown by a flux method well above the boiling point of the SrCl2 solvent. This leads to non-equilibrium growth conditions and dramatically shortens the lifetime of expensive Pt crucibles. Here, we report the growth of Sr2IrO4, Sr3Ir2O7 and SrIrO3 single crystals in a reproducible way by using anhydrous SrCl2 flux well below its boiling point. We show that the yield of the different phases strongly depends on the nutrient/solvent ratio for fixed soak temperature and cooling rate. Using this low-temperature growth approach generally leads to a lower temperature-independent contribution to the magnetic susceptibility than previously reported. Crystals of SrIrO3 exhibit a paramagnetic behavior that can be remarkably well fitted with a Curie-Weiss law yielding physically reasonable parameters, in contrast to previous reports. Hence, reducing the soak temperature below the solvent boiling point not only provides more stable and controllable growth conditions in contrast to previously reported growth protocols, but also extends considerably the lifetime of expensive platinum crucibles and reduces the corrosion of heating and thermoelements of standard furnaces, thereby reducing growth costs.
The O(N) model in 1+1 dimensions presents some features in common with Yang-Mills theories: asymptotic freedom, trace anomaly, non-petrurbative generation of a mass gap. An analytical approach to determine the termodynamical properties of the O(3) model is presented and compared to lattice results. Here the focus is on the pressure: it is shown how to derive the pressure in the CJT formalism at the one-loop level by making use of the auxiliary field method. Then, the pressure is compared to lattice results.
Let $R = k[w, x_1,..., x_n]/I$ be a graded Gorenstein Artin algebra . Then $I = ann F$ for some $F$ in the divided power algebra $k_{DP}[W, X_1,..., X_n]$. If $RI_2$ is a height one idealgenerated by $n$ quadrics, then $I_2 subset (w)$ after a possible change of variables. Let $J = I cap k[x_1,..., x_n]$. Then $mu(I) le mu(J)+n+1$ and $I$ is said to be generic if $mu(I) = mu(J) + n+1$. In this article we prove necessary conditions, in terms of $F$, for an ideal to be generic. With some extra assumptions on the exponents of terms of $F$, we obtain a characterization for $I = ann F$ to be generic in codimension four.
We present a quantum LDPC code family that has distance $Omega(N^{3/5}/operatorname{polylog}(N))$ and $tildeTheta(N^{3/5})$ logical qubits. This is the first quantum LDPC code construction which achieves distance greater than $N^{1/2} operatorname{polylog}(N)$. The construction is based on generalizing the homological product of codes to a fiber bundle.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا