output
20022013
most citedQuantum Computing

3.6k citations

Showing 2010Show all

113 papers · 1 filter

quant-ph20102 cited

Model-Checking Linear-Time Properties of Quantum Systems

Mingsheng Ying, Yangjia Li, Nengkun Yu +1

We define a formal framework for reasoning about linear-time properties of quantum systems in which quantum automata are employed in the modeling of systems and certain closed subs…

cs.FL20102 cited

The growth function of S-recognizable sets

Emilie Charlier, Narad Rampersad

A set is S-recognizable for an abstract numeration system S if the set $\rep_S(X)$ of its representations is accepted by a finite automaton. We show that the…

cond-mat.str-el20101 cited

Mott Insulators in a Fully-Frustrated Bose Hubbard Model on the Honeycomb Lattice

Stephen Inglis, Roger G. Melko

We examine the effects of quantum fluctuations on a classical spin liquid state in the fully-frustrated honeycomb lattice Bose Hubbard model using quantum Monte Carlo simulations.…

q-bio.TO201015 cited

Quantitative model for efficient temporal targeting of tumor cells and neovasculature

M. Kohandel, C. A. Haselwandter, M. Kardar +2

The combination of cytotoxic therapies and anti-angiogenic agents is emerging as a most promising strategy in the treatment of malignant tumors. However, the timing and sequencing…

cs.FL20102 cited

Quotient Complexity of Star-Free Languages

Janusz Brzozowski, Bo Liu

The quotient complexity, also known as state complexity, of a regular language is the number of distinct left quotients of the language. The quotient complexity of an operation is…

math.CO2010

Packing directed circuits exactly

Bertrand Guenin, Robin Thomas

We give an "excluded minor" and a "structural" characterization of digraphs D that have the property that for every subdigraph H of D, the maximum number of disjoint circuits in H…