Abstract: Experiments suggest that the mathematically weakest non-abelian TQFT may be physically the most robust. Such TQFT's—the v=5/2 FQHE state in particular—have discrete braid group representations, so one cannot build a universal quantum computer from these alone. Time tilted interferometry provides an extension of the computational power (to universal) within the context of topological protection. A known set of universal gates has been realized by topologically protected methods using “time-tilted interferometry” as an adjunct to the more familiar method of braiding quasi-particles. The method is “time-tilted interferometry by quasi-particles.” The system is its use to construct the gates {g1, g2, g3}.

Abstract: Methods and systems for automated analysis of signaling link utilization are disclosed. A method for automatically analyzing signaling link utilization includes displaying signaling link utilization data to a user via a computer display device. User input regarding a portion of the link utilization data that the user desires to analyze is received. Signaling message data corresponding to the selected link utilization data is automatically extracted from a database. The signaling message data may be used to determine the cause of signaling link utilization problems.

Abstract: A quantum computer can only function stably if it can execute gates with extreme accuracy. “Topological protection” is a road to such accuracies. Quasi-particle interferometry is a tool for constructing topologically protected gates. Assuming the corrections of the Moore-Read Model for v=5/2's FQHE (Nucl. Phys. B 360, 362 (1991)) we show how to manipulate the collective state of two e/4-charge anti-dots in order to switch said collective state from one carrying trivial SU(2) charge, |1>, to one carrying a fermionic SU(2) charge |?>. This is a NOT gate on the {|1>, |?>} qubit and is effected by braiding of an electrically charged quasi particle ? which carries an additional SU(2)-charge. Read-out is accomplished by ?-particle interferometry.

Abstract: Apparatus and methods for performing quantum computations are disclosed. Such apparatus and methods may include identifying a first quantum state of a lattice having a system of quasi-particles disposed thereon, moving the quasi-particles within the lattice according to at least one predefined rule, identifying a second quantum state of the lattice after the quasi-particles have been moved, and determining a computational result based on the second quantum state of the lattice.

Abstract: Experiments suggest that the mathematically weakest non-abelian TQFT may be physically the most robust. Such TQFT's—the v=5/2 FQHE state in particular—have discrete braid group representations, so one cannot build a universal quantum computer from these alone. Time tilted interferometry provides an extension of the computational power (to universal) within the context of topological protection. A known set of universal gates has been realized by topologically protected methods using “time-tilted interferometry” as an adjunct to the more familiar method of braiding quasi-particles. The method is “time-tilted interferometry by quasi-particles.” The system is its use to construct the gates {g1, g2, g3}.

Abstract: A system and method for confidentially keyword searching information residing in a remote server processing system are disclosed. Briefly described, one embodiment is a method comprising receiving from a client system a keyword search request having at least one searchword; mapping a plurality of items to at least one of L bins using a function (H), the items residing in a dataset and comprised of item pairs (xi, pi), such that the item pairs are mapped to the bin H(xi); for the bins, defining at least one polynomial as a function of the items mapped into the bins; evaluating at least one of the polynomials at the searchword using an oblivious polynomial evaluation (OPE) protocol; and determining presence of at least one match between the searchword and one of the xi based upon the evaluation.

Abstract: A system and method for confidentially matching information among parties are disclosed. Briefly described, one embodiment is a method comprising receiving from a first party a list of items, determining an encrypted polynomial P(y) from the first party's list of items, communicating the encrypted polynomial P(y) to a second party, receiving from the second party a list of second items, evaluating the encrypted polynomial P(y) at points defined by the second party's list of items, such that an output is determined, determining an encrypted output, the encrypted output corresponding to the output, communicating the encrypted output to the first party, decrypting the received encrypted output and determining an intersection between the first list of items and the second list of items based upon decryption of the received encrypted output.

Abstract: Apparatus and methods for performing quantum computations are disclosed. Such apparatus and methods may include identifying a first quantum state of a lattice having a system of quasi-particles disposed thereon, moving the quasi-particles within the lattice according to at least one predefined rule, identifying a second quantum state of the lattice after the quasi-particles have been moved, and determining a computational result based on the second quantum state of the lattice.

Abstract: The present invention provides a method for determining binding of a receptor to one or more ligands. The method consists of contacting a collective receptor variant population with one or more ligands and detecting binding of one or more ligands to the collective receptor variant population. The collective receptor variant population can be further divided into two or more subpopulations, one or more of the two or more subpopulations can be contacted with one or more ligands and one or more receptor variant subpopulations having binding activity to one or more ligands can be detected. The steps of dividing, contacting and detecting can be repeated one or more times. The invention also provides methods for identifying a receptor variant having optimal binding activity to one or more ligands. The invention additionally provides a method for determining binding of a ligand to one or more receptors.

Abstract: Apparatus and methods for performing quantum computations are disclosed. Such apparatus and methods may include identifying a first quantum state of a lattice having a system of quasi-particles disposed thereon, moving the quasi-particles within the lattice according to at least one predefined rule, identifying a second quantum state of the lattice after the quasi-particles have been moved, and determining a computational result based on the second quantum state of the lattice. A topological quantum computer encodes information in the configurations of different braids. The computer physically weaves braids in the 2D+1 space-time of the lattice, and uses this braiding to carry out calculations. A pair of quasi-particles, such as non-abelian anyons, can be moved around each other in a braid-like path. The quasi-particles can be moved as a result of a magnetic or optical field being applied to them, for example.

Abstract: Apparatus and methods for performing quantum computations are disclosed. Such quantum computational systems may include quantum computers, quantum cryptography systems, quantum information processing systems, quantum storage media, and special purpose quantum simulators.

Abstract: Apparatus and methods for performing quantum computations are disclosed. Such apparatus and methods may include identifying a first quantum state of a lattice having a system of quasi-particles disposed thereon, moving the quasi-particles within the lattice according to at least one predefined rule, identifying a second quantum state of the lattice after the quasi-particles have been moved, and determining a computational result based on the second quantum state of the lattice. Various platforms can be used to physically implement such a quantum computer. Platforms include an optical lattice, a Josephson junction array, a quantum dot, and a crystal structure. Each platform comprises an appropriate array of associated sites that can be used to approximate a desired Kagome geometry. A charge controller is desirably electrically coupled to the platform so that the array may be manipulated as desired.

Abstract: Apparatus and methods for performing quantum computations are disclosed. Such apparatus and methods may include identifying a first quantum state of a lattice having a system of quasi-particles disposed thereon, moving the quasi-particles within the lattice according to at least one predefined rule, identifying a second quantum state of the lattice after the quasi-particles have been moved, and determining a computational result based on the second quantum state of the lattice.

Abstract: Apparatus and methods for performing quantum computations are disclosed. Such apparatus and methods may include identifying a first quantum state of a lattice having a system of quasi-particles disposed thereon, moving the quasi-particles within the lattice according to at least one predefined rule, identifying a second quantum state of the lattice after the quasi-particles have been moved, and determining a computational result based on the second quantum state of the lattice.

Abstract: Database-driven methods and systems for database driven real time call tracing are disclosed. Signaling messages are copied from signaling link interface modules. The copied messages are sent to a database. A server located remotely from the database sends a query to the database for a real time call trace. The database is searched for messages that match the search criteria. If no messages are located in the historical data stored in the database, data entering the database is analyzed in real time.

Abstract: Database-driven methods and systems for database driven real time call tracing are disclosed. Signaling messages are copied from signaling link interface modules. The copied messages are sent to a database. A server located remotely from the database sends a query to the database for a real time call trace. The database is searched for messages that match the search criteria. If no messages are located in the historical data stored in the database, data entering the database is analyzed in real time.

Abstract: A system for collecting and processing SS7 message signaling units (MSUs) includes a network interface for copying MSUs from an SS7 signaling link or a TCP/IP signaling link. A call detail record generator communicates with the link interface to receive the copied MSUs and parse the MSUs to extract desired parameters from the MSUs. An application interface kit received commands from an application to control the flow of MSU parameters to the application in real time.