By regulating the expression of key microRNA molecules, sugar levels in leaves control the transition from the juvenile to the adult form in plants.

We achieve a quantum speed-up of fully polynomial randomized approximation schemes (FPRAS) for estimating partition functions that combine simulated annealing with the Monte-Carlo Markov Chain method and use non-adaptive cooling schedules. The improvement in time complexity is twofold: a quadratic reduction with respect to the spectral gap of the underlying Markov chains and a quadratic reducti...

Determining the shortest path from one node to another in a graph is probably the most popular question in graph theory. If the graph is non-negatively weighted, Dijkstra’s algorithm is the classic algorithm used to answer this question. Because of its breadth-first-search character, this algorithm usually spreads circularly around the source node of the search and hence the search space can be...

In theoretical quantum computer science, understanding where and how computational speed-ups occur while applying quantum properties is a primary goal. In this paper, we study such problem under the framework of Quantum Query Model and prove the significance of L1-norm in the simulation of a given quantum algorithm. This result is presented by upper-bounds for the quotient between optimal class...

Synthetic microswimmers are envisioned to be useful in numerous applications, many of which occur in tightly confined spaces. It is therefore important to understand how confinement influences swimmer dynamics. Here we study the motility of bimetallic microswimmers in linear and curved channels. Our experiments show swimmer velocities increase, up to 5 times, with the degree of confinement, and...

In this paper, we propose a novel technique for post-layout delay optimization. This technique identi es the Boolean space corresponding to late arriving transitions at the outputs of delay-critical subcircuits within the given circuit. There transitions are eliminated from the outputs by implementing the corresponding logic separately and merging them with the original circuit through some con...

During the last years, several speed-up techniques for Dijkstra’s algorithm have been published that maintain the correctness of the algorithm but reduce its running time for typical instances. They are usually based on a preprocessing that annotates the graph with additional information which can be used to prune or guide the search. Timetable information in public transport is a traditional a...

We introduce the Sync-Phase technique for software transactional memory. Time is divided into two different alternating phases: computation phases and commit (synchronization) phases. Transactions are only allowed to commit during a commit phase, which allows execution without validation (or the need for cache synchronization) during computation phases. Phases can be determined through time or ...

Quantum algorithms are known for providing more efficient solutions to certain computational tasks than any corresponding classical algorithm. Here we show that a single qudit is sufficient to implement an oracle based quantum algorithm, which can solve a black-box problem faster than any classical algorithm. For 2d permutation functions defined on a set of d elements, deciding whether a given ...

Delays in login can cause significant loss of revenue opportunities in financial trading applications. Such was the case for a foreign exchange deal management system, wherein the login step itself was very complex. The complexity arose from the need for synchronizing the front-end client workstation with the central back-end database as part of user login, and was further complicated by a larg...