Abstract: A method includes detecting submission of a first quantum circuit for compilation, the first quantum circuit comprising a first set of quantum logic gates; generating a first gate index, the first gate index comprising an ordered table of a subset of the set of quantum logic gates, each quantum logic gate of the subset of quantum logic gates including a corresponding set of qubits acted on by the quantum logic gate; comparing the first gate index with a second gate index to determine a structural equality of the first quantum circuit and the second quantum circuit; and parameterizing, in response to determining a structural equality of the first quantum circuit and the second quantum circuit, a first set of parameters of a second set of quantum logic gates of the second quantum circuit with a second set of parameters of the first set of quantum logic gates.

Abstract: A method and system of protecting user sensitive information from an application program of a user device are provided. The application program to be installed is received on the user device. Permissions to resources of the user device for the application program are identified. For each permission, mapping the permission to one or more sections of a code of the application program. For each mapped section of the code, a recipient of user sensitive information facilitated by the permission is determined. For each recipient, it is determined whether the recipient should be restricted. Upon determining that the recipient should not be restricted, the user sensitive information facilitated by the permission is provided to the recipient. However, upon determining that the recipient should be restricted, alternate information to the recipient.

Abstract: Synthesizing sanitization code for applications based upon a probabilistic prediction model includes receiving a set of applications. The set of applications is partitioned into a first subset of applications and a second subset of applications. The first subset has one or more malicious payloads associated therewith, and the second subset has one or more non-malicious payloads associated therewith. A probabilistic prediction model is computed based upon the malicious payloads associated with the first subset of applications. One or more predicted malicious payloads are predicted from the probabilistic prediction model.

Abstract: A method for design optimization of a quantum circuit includes analyzing a first quantum circuit design based on at least one of a set of design criteria, wherein the first quantum circuit design includes a set of quantum logic gates, and wherein a design criterion in the set of design criteria includes changing a size of a matrix of transformations corresponding to a number of qubits employed in the first quantum circuit design. The embodiment further includes in the method modifying the first quantum circuit design into a transformed quantum circuit design, the modifying causing the transformed quantum circuit design to perform an operation implemented in the first quantum circuit design with a changed matrix of transformations.

Abstract: A group of remote devices executing an omnichannel application are coordinated from a network node. An omnichannel mediator coordinates formation of at least two of said remote devices into an omnichannel cloudlet. A component manager controls which of a plurality of components of said omnichannel application should optimally be placed on which individual devices of said omnichannel cloudlet and how data should flow to individual devices of said omnichannel cloudlet. A replication optimizer optimally coordinates data replication for the group of remote device.

Abstract: A method includes detecting submission of a first quantum circuit for compilation, the first quantum circuit comprising a first set of quantum logic gates; generating a first gate index, the first gate index comprising an ordered table of a subset of the set of quantum logic gates, each quantum logic gate of the subset of quantum logic gates including a corresponding set of qubits acted on by the quantum logic gate; comparing the first gate index with a second gate index to determine a structural equality of the first quantum circuit and the second quantum circuit; and parameterizing, in response to determining a structural equality of the first quantum circuit and the second quantum circuit, a first set of parameters of a second set of quantum logic gates of the second quantum circuit with a second set of parameters of the first set of quantum logic gates.

Abstract: A method for optimized quantum searching may include: creating, by a classical computer program, a quantum circuit that implements Grover's algorithm; identifying, by the classical computer program in a pre-transpile step, instances of Hadamard gates (H gates) and Pauli X-gates (X gates) and instances of X gates and H gates in the quantum circuit; replacing, by the classical computer program, the instances of the H gates and X gates with Rx(?/2) gates and the instances of the X gates and H gates with Rx(??/2) gates; implementing, by the classical computer program, a plurality of gates that implement a reflection about the mean in the quantum circuit; completing, by the classical computer program, transpiling the quantum circuit into a plurality of quantum instructions; sending, by the classical computer program, the quantum instructions to a quantum computer; and receiving, from the quantum computer, results of execution of the quantum instructions.

Abstract: A system and method whereby permission is accessed that is to be revoked for an application. The permission involves access to private data of a user via an API of an OS. It is determined, in the application, program point(s) involving access to the private data of the user via the API. For each selected one of the program point(s), code in the application is rewritten to replace a source statement, at the selected program point, that accesses the private data with another statement that allocates a mock object or value based on a type of an actual value returned by the source statement. The mock object or value does not expose the private data of the user. The application with the rewritten code is packaged as an output application able to be subsequently executed by the user, and is output for use by the user.

Abstract: Techniques for identifying computer program security access control violations using static program analysis are provided. In one example, a computer-implemented method comprises generating, by a device operatively coupled to a processor, a mathematical model of a computer program product, wherein the mathematical model defines data flows through nodes of the computer program product that reach a secure node corresponding to a secure resource. The computer implemented method further comprises evaluating, by the device, a security protocol of the computer program product using static program analysis of the mathematical model to determine whether any of the data flows provides access to the secure node without proceeding through one or more security nodes corresponding to the security protocol, wherein the one or more security nodes are included in the nodes of the computer program product.

Abstract: A computer system performs tracking of security context for confidential or untrusted values input from sources in an executing application to sinks in the executing application. The security context includes indications of sources and declassifier methods corresponding to the values and has been previously defined prior to the tracking. Prior to release of a selected confidential or untrusted value by a sink in the executing application, security context is fetched for the selected confidential or untrusted value. A selected declassifier method is caused to be used on the selected confidential or untrusted value prior to release of the selected confidential or untrusted value to the sink. The selected declassifier method obfuscates the selected confidential or untrusted value and is selected based on the security context for the selected confidential or untrusted value. The obfuscated confidential or untrusted value is caused to be released to the sink in the executing application.

Abstract: A group of remote devices executing an omnichannel application are coordinated from a network node. An omnichannel mediator coordinates formation of at least two of said remote devices into an omnichannel cloudlet. A component manager controls which of a plurality of components of said omnichannel application should optimally be placed on which individual devices of said omnichannel cloudlet and how data should flow to individual devices of said omnichannel cloudlet. A replication optimizer optimally coordinates data replication for the group of remote device.

Abstract: A group of remote devices executing an omnichannel application are coordinated from a network node. An omnichannel mediator coordinates formation of at least two of said remote devices into an omnichannel cloudlet. A component manager controls which of a plurality of components of said omnichannel application should optimally be placed on which individual devices of said omnichannel cloudlet and how data should flow to individual devices of said omnichannel cloudlet. A replication optimizer optimally coordinates data replication for the group of remote device.

Abstract: A system and a method for verifying a randomness of an intended random number is provided. The method includes: accessing the intended random number; converting the intended random number into a bitmap image; analyzing the bitmap image with reference to a predetermined model; and using a result of the analyzing to determine whether the intended random number is a true random number or a pseudorandom number. The analysis of the bitmap image may be performed by using a machine learning image classification technique with respect to a model that is trained by using white noise images.

Abstract: Techniques regarding quantum algorithm concatenation are provided. For example, one or more embodiments described herein can comprise a system, which can comprise a memory that can store computer executable components. The system can also comprise a processor, operably coupled to the memory, and that can execute the computer executable components stored in the memory. The computer executable components can comprise a concatenation component, operatively coupled to the processor, that can concatenate a first quantum algorithm and a second quantum algorithm by using an output of the first quantum algorithm as an initial parameter in the second quantum algorithm.

Abstract: Facilitating code re-use includes receiving a first design document. The first user design document specifies a graphical layout of a first set of user interface elements of a user interface of a first application. First source code associated with the design document is received. The first source code is configured to implement the first set of user interface elements of the user interface. A processor extracts the first set of user interface elements from the first user interface design document. A first portion of the first source code corresponding to a first user interface element of the first set of user interface elements is identified. The first portion of the first source code is encapsulated into a module to enable re-use of the portion of the source code in a second application.

Abstract: A security verification system and method that includes outputting a list of potential dataflow vulnerabilities as a first output from inputting a subject program and security specification, mapping candidate vulnerabilities to a user interface (UI) entry point and payload from the output of the list of potential dataflow vulnerabilities to provide a second output, and performing directed testing of the second output.

Abstract: A method, system and apparatus for source code auto-suggestion, including receiving and processing source code from a source code repository, extracting one or more features from the source code received from the source code repository, extracting one or more features from the source code within a development environment, comparing the one or more features from the source code received from the source code repository with the one or more features extracted from the source code within the development environment, and providing a segment of source code from the received and processed source code repository according to a similarity to the source code within the development environment.

Abstract: Techniques regarding an iterative energy-scaled variational quantum eigensolver process are provided. For example, one or more embodiments described herein can comprise a system, which can comprise a memory that can store computer executable components. The system can also comprise a processor, operably coupled to the memory, and that can execute the computer executable components stored in the memory. The computer executable components can comprise a read-out component that determines a ground state energy value of a quantum Hamiltonian by employing a variational quantum eigensolver (VQE) algorithm, wherein VQE algorithm utilizes a symmetry that emerges at an energy scale of the quantum Hamiltonian.

Abstract: A method for detecting malicious code fragments based on data-flow isolation is provided. The method may include isolating data flows associated with a computing program for a user device. The method may further include mapping steps for the isolated data flow to modules associated with the computing program and the user device. The method may further include comparing the mapped steps to determine connections between the isolated data flows. The method may further include, based on the comparison of the mapped steps and the modules, determining whether the isolated data flows comprise malicious data flow deviations. The method may also include, in response to the determination that the isolated data flows comprise malicious data flow deviations, determining whether the computer program is malicious by weighing security risks associated with the malicious data flow deviations based on security risk factors.

Abstract: Systems and methods that address an optimized method in the area of optimization by showing how to generate Ising Hamiltonians automatically for a large class of optimization problems specially handling the constraints. The innovation facilitates qubit reduction in connection with an optimization problem by representing respective integer variables as linear sums of binary variables, wherein depending on the representation, additional equality constraints are provided. Additional slack variables are introduced to change inequality constraints to equality constraints. Based on the equality constraints, an unconstrained pseudo-boolean optimization problem is created. The pseudo-boolean optimization problem is quadratized to generate a quadratic pseudo-boolean function (QPBF) and the number of variables in the QPBF is reduced to facilitate qubit reduction. This results in an automated, problem instance dependent qubit reduction procedure.