output
19972026
most citedTemperature and magnetic field dependent longitudinal spin relaxation in nitrogen-vacancy ensembles in diamond

419 citations

Showing 2011 · cs.CCShow all

6 papers · 2 filters

cs.CC2011★ 5 cited

Proving the power of postselection

Abuzer Yakaryilmaz, A. C. Cem Say

It is a widely believed, though unproven, conjecture that the capability of postselection increases the language recognition power of both probabilistic and quantum polynomial-time…

cs.CC2011★ 10 cited

New separation between and

Andris Ambainis, Xiaoming Sun

In this note we give a new separation between sensitivity and block sensitivity of Boolean functions: .

cs.CC2011

Tight bounds for the space complexity of nonregular language recognition by real-time machines

Abuzer Yakaryilmaz, A. C. Cem Say

We examine the minimum amount of memory for real-time, as opposed to one-way, computation accepting nonregular languages. We consider deterministic, nondeterministic and alternatin…

cs.CC2011★ 11 cited

Quantum counter automata

A. C. Cem Say, Abuzer Yakaryilmaz

The question of whether quantum real-time one-counter automata (rtQ1CAs) can outperform their probabilistic counterparts has been open for more than a decade. We provide an affirma…

cs.CC2011★ 9 cited

Finite state verifiers with constant randomness

Cem Say, Abuzer Yakaryilmaz

We give a new characterization of as the class of languages whose members have certificates that can be verified with small error in polynomial time by finite state m…

cs.CC2011★ 64 cited

Superiority of exact quantum automata for promise problems

Andris Ambainis, Abuzer Yakaryilmaz

In this note, we present an infinite family of promise problems which can be solved exactly by just tuning transition amplitudes of a two-state quantum finite automata operating in…