Abstract: A computer-implemented method is disclosed for mapping a dataset from a Hilbert space of a given dimension to a Hilbert space of a different dimension, the method comprising obtaining a dataset, for each data sample of the dataset, for a plurality of episodes, generating an encoded sample; configuring an adiabatic quantum device by embedding each encoded sample into a q-body Hamiltonian H representative of an adiabatic quantum device, causing the adiabatic quantum device to evolve from an initial state to a final state; and performing a projective measurement along z axis at the final state to determine the value of each qubit; generating a corresponding binary vector representative of the given data sample in a transformed Hilbert space using the determined value of each qubit at each episode and providing a mapped dataset comprising each of the generated corresponding binary vectors.

Abstract: The method comprises registering at least one of an internet protocol (IP) address and a media access control (MAC) address of the security devices, generating a plurality of public key and private key pairs, encrypting and storing private keys comprised in the plurality of public key and private key pairs using a master key provided from a master key management unit, selecting any one of a plurality of public key and private key pairs when the access of the security device is approved and providing a certificate comprising the selected public key to the security device, receiving a symmetric key encrypted with the public key of the certificate from the security device, and decrypting the private key using the master key provided from the master key management unit.

Abstract: A method is disclosed for solving the Lagrangian dual of a constrained binary quadratic programming problem. The method comprises obtaining a constrained quadratic binary programming problem; until a convergence is detected, iteratively, performing a Lagrangian relaxation of the constrained quadratic binary programming problem to provide an unconstrained quadratic binary programming problem, providing the unconstrained quadratic binary programming problem to a quantum annealer, obtaining from the quantum annealer at least one corresponding solution, using the at least one corresponding solution to generate a new approximation for the Lagrangian dual bound; and providing a corresponding solution to the Lagrangian dual of the constrained binary quadratic programming problem after convergence.

Abstract: Provided is a security authentication method of a network video recorder (NVR) including assigning a terminal unique index to each of pseudo-random functions included in a pseudo-random function set using terminal information; transmitting a session key having a predetermined expiry time and the pseudo-random function set with the assigned terminal unique index to a terminal; calculating a first terminal unique index for authenticating a first message using a predetermined bitstream of the first message received from the terminal; selecting a first pseudo-random function for authenticating the first message using the calculated first terminal unique index; generating a first independent private key of the terminal for authenticating the first message by inputting the session key and a MAC address of the terminal to the first pseudo-random function; and generating a message authentication code for the first message using the first independent private key and authenticating the first message.

Abstract: A method is disclosed for determining a conformation of a molecule on at least one degree of freedom to optimize according to at least one molecular objective function, the method comprising generating using at least one corresponding degree of freedom to optimize a connected rigid bodies representation for the molecule by identifying a plurality of groups of atoms, generating a data structure representative of the connected rigid bodies representation generating at least one neighborhood for each generated neighborhood of the at least one generated neighborhoods, generating a corresponding binary optimization problem using the data structure, providing the generated corresponding binary optimization problem to a high-performance binary optimizer, obtaining a solution from the high-performance binary optimizer; and providing at least one corresponding solution.

Abstract: A method and a system are disclosed for solving a mixed-integer programming problem, the method comprising obtaining an indication of a mixed-integer programming optimization problem; until a performance criterion is met: providing the mixed-integer programming optimization problem to an optimization oracle adapted for solving the mixed-integer programming optimization problem using a feasibility pump technique and comprising an optimization solver, initializing parameters of an optimization oracle and an initial solution pair, the parameters comprising Monte-Carlo simulation parameters, a list of neighborhood functions and a measure of fractionality, and performing iterative calls to the optimization solver until a stopping condition is met; and providing at least one corresponding solution obtained from the optimization solver.

Abstract: A method is disclosed for solving the Lagrangian dual of a constrained binary quadratic programming problem. The method comprises obtaining a constrained quadratic binary programming problem; until a convergence is detected, iteratively, performing a Lagrangian relaxation of the constrained quadratic binary programming problem to provide an unconstrained quadratic binary programming problem, providing the unconstrained quadratic binary programming problem to a quantum annealer, obtaining from the quantum annealer at least one corresponding solution, using the at least one corresponding solution to generate a new approximation for the Lagrangian dual bound; and providing a corresponding solution to the Lagrangian dual of the constrained binary quadratic programming problem after convergence.

Abstract: A method and a system are disclosed for displaying data representative of a large dataset. The method comprises the use of a processing device for receiving the dataset comprising a plurality of data points of dimension m; reducing the dimension m of at least one data point of the plurality of data points to a dimension selected from a group consisting of two (2) and three (3) if the dimension of the at least one data point is greater than or equal to three (3); generating at least one data cluster, each data cluster comprising a given number of data points; determining a set of representative data points for each generated at least one data cluster, each representative data point of a given set for representing a region of a corresponding given data cluster comprising a plurality of adjacent data points and displaying in a user interface the determined at least one set of representative data points of the at least one corresponding generated data cluster.

Abstract: A method and a system are disclosed for identifying at least one community, the method comprising providing an indication of a graph, the graph comprising a plurality of nodes and edges, wherein each node is representative of a given element and each edge is representative of a relationship between two given elements; providing a metric indicative of an underlying community detection algorithm; obtaining an indication of an upper bound value for a given maximum number of communities to identify; encoding each node using a one-hot encoding method and the indication of an upper bound value; generating a quadratic unconstrained binary optimization problem using the metric and the encoded nodes; providing the generated quadratic unconstrained binary optimization problem to an optimization oracle and obtaining a solution.

Abstract: A method and system are disclosed for performing real-time analytics on a plurality of data streams, the method comprising obtaining a plurality of data streams; accumulating real-time changes of the obtained plurality of data streams in a buffer unit to provide a buffered data portion; monitoring the buffered data portion for determining a calculation event, wherein the calculation event is based on a strategy based on observing given features in the buffered data portion; upon detection of the calculation event, generating an optimization problem indicative of the real-time analytics to be performed on one of given data portions of the plurality of data streams and a data structure generated using given data portions of the plurality of data streams; transforming the generated optimization problem into an optimization problem suitable for an optimization oracle; providing the transformed generated optimization problem to the optimization oracle; obtaining at least one solution from the optimization oracle;

Abstract: A computing system and a method are disclosed for enabling a processing device to remotely access a computing platform over a network, wherein the computing platform comprises at least one physics-inspired computer simulator comprising tunable parameters, the computing system comprising a communications interface configured to receive a request, wherein the request comprises at least one computational task to process using at least one physics-inspired computer simulator comprising tunable parameters; a control unit operatively connected to the communications interface and to the at least one physics-inspired computer simulator comprising tunable parameters, the control unit configured to translate the request into instructions for the at least one physics-inspired computer simulator deliver the instructions to the at least one physics-inspired computer simulator to perform the at least one computational task, receive at least one corresponding solution; and a memory operatively connected to the to the contro

Abstract: A method for estimating a thermodynamic property of a quantum Ising model with transverse field is disclosed.

Abstract: A method and a system are disclosed for solving a mixed-integer programming problem, the method comprising obtaining an indication of a mixed-integer programming optimization problem; until a performance criterion is met: providing the mixed-integer programming optimization problem to an optimization oracle adapted for solving the mixed-integer programming optimization problem using a feasibility pump technique and comprising an optimization solver, initializing parameters of an optimization oracle and an initial solution pair, the parameters comprising Monte-Carlo simulation parameters, a list of neighborhood functions and a measure of fractionality, and performing iterative calls to the optimization solver until a stopping condition is met; and providing at least one corresponding solution obtained from the optimization solver.

Abstract: A method and a system are disclosed for estimating a trace operator to be used in a machine learning task. The method comprises obtaining an indication of a pair of points; constructing a quantum circuit comprising a single control qubit and a plurality of register qubits using the obtained pair of points, the constructing comprising receiving an encoding pattern and an architecture of a quantum circuit, encoding the pair of points into the plurality of register qubits, initializing the quantum circuit, and compiling the quantum circuit for a quantum device; evolving the quantum circuit on the quantum device; obtaining an indication of at least one measurement on the single control qubit of the corresponding quantum circuit; determining an indication of an estimated trace of the unitary operator representing the plurality of register qubits using the obtained indication of at least one measurement on the single control qubit and providing the indication of the estimated trace of the unitary operator.

Abstract: A method and a system are disclosed for solving a dynamic programming problem using a quantum computer. The method comprises receiving an indication of a dynamic programming problem, the dynamic programming problem comprising a plurality of transition kernels, receiving data representative of the dynamic programming problem, generating at least one oracle for the transition kernels of the dynamic programming problem, until a stopping criterion is met determining at least one linear programming problem for the dynamic programming problem, solving the at least one linear programming problem using a quantum computer comprising the generated at least one oracle to determine at least one solution, and providing the determined at least one solution; and providing a solution to the dynamic programming problem.

Abstract: The present disclosure provides methods, systems, and media for allowing access to quantum ready and/or quantum enabled computers in a distributed computing environment (e.g., the cloud). Such methods and systems may provide optimization and computational services on the cloud. Methods and systems of the present disclosure may enable quantum computing to be relatively and readily scaled across various types of quantum computers and users at various locations, in some cases without the need for users to have a deep understanding of the resources, implementation or the knowledge that may be required for solving optimization problems using a quantum computer. Systems provided herein may include user interfaces that enable users to perform data analysis in a distributed computing environment while taking advantage of quantum technology in the backend.

Abstract: The present disclosure provides methods, systems, and media for quantum computing, including allowing access to quantum ready and/or quantum enabled computers in a distributed computing environment (e.g., the cloud). Such methods and systems may provide optimization and computational services. Methods and systems of the present disclosure may enable quantum computing to be relatively and readily scaled across various types of quantum computers and users at various locations, in some cases without the need for users to have a deep understanding of the resources, implementation or the knowledge that may be required for solving optimization problems using a quantum computer. Systems provided herein may include user interfaces that enable users to perform data analysis in a distributed computing environment while taking advantage of quantum technology in the backend.

Abstract: Described herein are methods, systems, and media for generating a quantum-ready or quantum-enabled software development kit (SDK) for a quantum computing system. Such methods may comprise accepting user input from an application at an application interface, which application is executed on a digital computer, and implementing one or more algorithms, at an algorithms layer, that may be solved heuristically or exactly depending on the requirements of the user input. The one or more algorithms may abstract away a complexity of the application; transforming the one or more algorithms from the application space into the one or more instructions in polynomial unconstrained binary optimization (PUBO) form. The one or more instruction may be executed in PUBO form at the common interface solver layer.

Abstract: A method is disclosed for determining a conformation of a molecule on at least one degree of freedom to optimize according to at least one molecular objective function, the method comprising generating using at least one corresponding degree of freedom to optimize a connected rigid bodies representation for the molecule by identifying a plurality of groups of atoms, generating a data structure representative of the connected rigid bodies representation generating at least one neighborhood for each generated neighborhood of the at least one generated neighborhoods, generating a corresponding binary optimization problem using the data structure, providing the generated corresponding binary optimization problem to a high-performance binary optimizer, obtaining a solution from the high-performance binary optimizer; and providing at least one corresponding solution.