Ben-Gurion University of the Negev Research and Development Authority

Orbotech Limited

Daniel Berend

Shlomi Dolev

Ronen Brafman

Eyal Shlomo Shimony

Marina Kogan-Sadetsky

Shimon Cohen

Dor Bitan

A computer implemented method for encoding bits by qubits to perform information-theoretically secure quantum gate computation, according to which pairs of quantum bits consisting of a first qubit as an encoding of '0' and a second qubit as an encoding of “1” are randomly selected, such that the first and second qubits are orthogonal to each other as quantum states and are interchanged by a NOT gate. Each qubit rotating to a desired initial direction and then each rotated qubit is further rotated to its antipodal direction by applying a quantum NOT or CNOT gate to the each rotated qubit, without any knowledge about the desired direction. A unitary gate is further applied over the qubits, using an ancillary |0qubit that creates an equally weighted superposition of the qubits.

System and method for performing information—theoretically secure quantum gate computation and quantum key distribution, based on random rotation of qubits

A method for efficiently method for performing adaptive management of a cache with predetermined size and number of cells with different locations with respect to the top or bottom of the cache, for storing at different cells, data items to be retrieved upon request from a processor. A stream of requests for items, each of which has a temporal probability to be requested is received and the jump size is incremented on cache misses and decremented on cache hits by automatically choosing a smaller jump size and using a larger jump size when the probability of items to be requested is changed. The jump size represents the number of cells by which a current request is promoted in the cache, on its way from the bottom, in case of a cache hit, or from the outside in case of a cache miss, towards the top cell of the cache.

Method and system for performing adaptive cache management

Methods for optimizing the cost of executing a set of tests including finding the optimal ordering of the tests for some important cases such as set of tests having series-parallel structure with no statistical dependencies, and near-optimal orderings for the rest of the cases, such that the resources required for executing the tests are minimized.

Optimal test ordering in cascade architectures

Growing community of inventors

Beer Sheva, Israel

Daniel Berend