Abstract: Operators such as unitary operators common in quantum mechanical applications may be approximated by a Trotter-like approximation. An operator may be decomposed and terms of the operator may be grouped, or assigned into levels. The levels may be scaled and applied at unique intervals of calculational steps. A quantum device may have circuitry for applying levels of the operator at the unique intervals.

Abstract: Systems and methods for language integration via function redirection are disclosed herein in connection with simulation of quantum computations on classical computers. A base class that all of the functions of a group will instantiate in their context may be defined. The functions may take arguments that may be passed to a member of the base class for dispatch. A dispatcher may be provided to analyze the current context. The dispatcher may perform any of a number of operations as a result, including, but not limited to, passing the arguments to the class instance for execution, returning the class instance directly or via a context holder, returning a new representation of the function for future execution via a context holder, or any other return type that may be desired.

Abstract: A quantum annealer simulator approximates unitary quantum dynamics of a quantum annealer on a non-quantum computing device such as a conventional computing device. The quantum annealer simulator may utilize algorithms that may efficiently approximate unitary time evolution of a quantum system, where the quantum system corresponds to a problem for which an optimized solution is sought.

Abstract: Disclosed are systems and methods for improving quantum computation simulation execution time by “growing” sets of small quantum gates into larger ones. Two approaches are described. In the first approach, sub-strings may be replaced by a single representative that may be used multiple times throughout the quantum circuit. In the second approach, nearby gates may be coalesced in an iterative fashion, to thereby build larger and larger gates. Results may be cached for re-use. Both of these approaches have proven effective and have gained typical simulation speed-ups of 1-2 orders of magnitude.

Abstract: A state (i.e., ket) of a set of qubits may be simulated via a classical computer. Ordering characteristics of the ket (i.e., the “current” permutation associated with the state) may be determined. An operator (which may be associated with a certain operation to perform on the ket) may be defined and simulated. Ordering characteristics of the operator (i.e., the “current” permutation associated with operator) may be determined. If the current permutations of the state and operator match, then the operation may be performed to generate a new ket. Alternatively, the operator may be permuted to match the permutation of the current state. Or the state may be permuted to match the current operator permutation. The operation may then be performed, and the state and permutation remembered for the next operation. The process may be repeated for each operation in the series.

Abstract: Operators such as unitary operators common in quantum mechanical applications may be approximated by a Trotter-like approximation. An operator may be decomposed and terms of the operator may be grouped, or assigned into levels. The levels may be scaled and applied at unique intervals of calculational steps. A quantum device may have circuitry for applying levels of the operator at the unique intervals.

Abstract: A quantum annealer simulator approximates unitary quantum dynamics of a quantum annealer on a non-quantum computing device such as a conventional computing device. The quantum annealer simulator may utilize algorithms that may efficiently approximate unitary time evolution of a quantum system, where the quantum system corresponds to a problem for which an optimized solution is sought.

Abstract: Systems and methods for language integration via function redirection are disclosed herein in connection with simulation of quantum computations on classical computers. A base class that all of the functions of a group will instantiate in their context may be defined. The functions may take arguments that may be passed to a member of the base class for dispatch. A dispatcher may be provided to analyze the current context. The dispatcher may perform any of a number of operations as a result, including, but not limited to, passing the arguments to the class instance for execution, returning the class instance directly or via a context holder, returning a new representation of the function for future execution via a context holder, or any other return type that may be desired.

Abstract: A state (i.e., ket) of a set of qubits may be simulated via a classical computer. Ordering characteristics of the ket (i.e., the “current” permutation associated with the state) may be determined. An operator (which may be associated with a certain operation to perform on the ket) may be defined and simulated. Ordering characteristics of the operator (i.e., the “current” permutation associated with operator) may be determined. If the current permutations of the state and operator match, then the operation may be performed to generate a new ket. Alternatively, the operator may be permuted to match the permutation of the current state. Or the state may be permuted to match the current operator permutation. The operation may then be performed, and the state and permutation remembered for the next operation. The process may be repeated for each operation in the series.

Abstract: Disclosed are systems and methods for improving quantum computation simulation execution time by “growing” sets of small quantum gates into larger ones. Two approaches are described. In the first approach, sub-strings may be replaced by a single representative that may be used multiple times throughout the quantum circuit. In the second approach, nearby gates may be coalesced in an iterative fashion, to thereby build larger and larger gates. Results may be cached for re-use. Both of these approaches have proven effective and have gained typical simulation speed-ups of 1-2 orders of magnitude.

Abstract: The subject disclosure relates to using structured query language constructs in non-structured query language domains. For example, through mathematical and logical transformation of concepts from a key, value pair domain associated with structured query language data structures to graphical-related data structures, the value originating in the structured query language domain can be modified for use in non-structured query language domains. This can open up options in analytics and can solve some of the problems associated with liner algebra.

Abstract: An improved system and method for a personal communications server is provided. The system and method may provide seamless multi-functional wireless communications for different integrated applications desired by a user. To this end, a computing device with a telecommunications interface is provided for coupling to a mobile phone network. The computing device may be without an attached audio input and output device, but may include a network interface for coupling with an external audio input and output device to receive audio from the mobile phone network and/or to send audio to the mobile network. A computer with a network interface may also be coupled with the computing device to receive data from a mobile phone network and/or to send data to the mobile network.

Abstract: A semantic query may refer to a logical rule, where the rule is defined in terms of constituent expressions. In order to execute the semantic query efficiently, occurrences of the rule may be expanded by replacing the rule with its constituent expressions. Expansion may be performed repeatedly, until only grounded expressions remain. Expressions are grounded when they refer to tables or views that are represented in an underlying database. Once the rule has been reduced to grounded expressions, the semantic query processor may formulate a relational query in terms of the grounded expressions. If the relational query takes into account the various grounded expressions to which the rule reduces, then the portion of the semantic query that refers to the rule may be processed without an excessive number of round trips to the relational database.

Abstract: A semantic query may refer to a logical rule, where the rule is defined in terms of constituent expressions. In order to execute the semantic query efficiently, occurrences of the rule may be expanded by replacing the rule with its constituent expressions. Expansion may be performed repeatedly, until only grounded expressions remain. Expressions are grounded when they refer to tables or views that are represented in an underlying database. Once the rule has been reduced to grounded expressions, the semantic query processor may formulate a relational query in terms of the grounded expressions. If the relational query takes into account the various grounded expressions to which the rule reduces, then the portion of the semantic query that refers to the rule may be processed without an excessive number of round trips to the relational database.

Abstract: An improved system and method for a personal communications server is provided. The system and method may provide seamless multi-functional wireless communications for different integrated applications desired by a user. To this end, a computing device with a telecommunications interface is provided for coupling to a mobile phone network. The computing device may be without an attached audio input and output device, but may include a network interface for coupling with an external audio input and output device to receive audio from the mobile phone network and/or to send audio to the mobile network. A computer with a network interface may also be coupled with the computing device to receive data from a mobile phone network and/or to send data to the mobile network.

Abstract: Sector menus track a pointer's position as a pointing device is moved. Each sector menu is a geometric figure bounded by two radii and an included arc of a circle. Menu items are housed in segments formed from multiple radii cutting the sector menu. Users select menu items housed in segments by making a direction change from a trajectory course to pass over a desired menu item so as to invoke its operation. The sector menu lacks a segment, defining a devoid segment, which is oriented in a direction toward which the pointer is moving. Segments with different sizes are available to represent the likelihood that a user would choose a given operation in a corresponding menu item housed by a corresponding segment.

Abstract: Sector menus track a pointer's position as a pointing device is moved. Each sector menu is a geometric figure bounded by two radii and an included arc of a circle. Menu items are housed in segments formed from multiple radii cutting the sector menu. Users select menu items housed in segments by making a direction change from a trajectory course to pass over a desired menu item so as to invoke its operation. The sector menu lacks a segment, defining a devoid segment, which is oriented in a direction toward which the pointer is moving. Segments with different sizes are available to represent the likelihood that a user would choose a given operation in a corresponding menu item housed by a corresponding segment.

Abstract: An empathetic interface individualizes the interaction of a user and a computer. The empathetic interface educes user intentions to move or perform actions with a pointing device without the user having to objectively communicate in an explicit manner, such as manually moving the mouse from one location to another location or performing a user interface action. The user initiates a movement or an action and the empathetic interface completes the movement or the action.

Abstract: A method for automatically and intelligently scrolling handwritten ink entered into a computer device. The method detects when the user is on the last available line for writing, and starts a timer on each pen-up event or resets the timer on a pen-down event. An automatic scroll is performed after the writing on the last line has halted for more than a threshold amount of time. The threshold time may be variable based on criteria, such as the x-coordinate of the last writing, the writing speed of the user, the last character that was written, and the current zoom percentage of the display. The zoom percentage may also be used to determine the number of lines to scroll. New ink written after the automatic scrolling operation may be moved up to the scrolled ink, if the method determines that the user intended to write the new ink directly after the scrolled ink.

Abstract: A computer-readable medium includes computer-executable instruction for compressing data to form a compressed data stream for a restricted channel. Specifically, data is compressed to form code values and character values, and a mask is created that indicates the location of these code values and character values in the compressed data stream. Each mask constructed by the method is selected from a set of valid values that can pass through the restricted channel.