Abstract: System and methods for processing data queries in hybrid data mesh architectures are disclosed. A method for processing data queries in hybrid data mesh architectures may include an in-memory query engine: (1) receiving, from a requestor, a data query to retrieve data; (2) parsing the data query into a parse tree; (3) converting the parse tree into a relational tree, wherein the relational tree is a tree representation of relational operators used to execute the data query; and (4) executing a data retrieval method selected from the group consisting of tree partitioning by cost and pruning using subtree replacement using a plurality of retrieval services to retrieve data from data stores identified by the data retrieval method.

Abstract: A method for removing uninterested attributes from multi-modality data may include: receiving, by a multi-modality attribute removal computer program executed by an electronic device, multi-modality data comprising a plurality of modalities from a data source, wherein data in each modality are related; receiving, by the multi-modality attribute removal computer program, an uninterested attribute in the multi-modality data to remove; training, by the multi-modality attribute removal computer program, a modality-focused encoder for each modality of the multi-modality data to remove the uninterested attribute using a removal loss and a retention loss for the respective modality; receiving, by the multi-modality attribute removal computer program, a multi-modality data set for processing; and processing, by the multi-modality attribute removal computer program, the multi-modality data set using the modality-focused encoders, wherein the processing results in a processed multi-modality data set with the uninterest

Abstract: A global partitioning-based method for anonymizing a dataset of biometric data may include an anonymization computer program: (1) receiving a value k representing a number of records to hide a biometric datum among, a value t that represents a t-closeness parameter for a t-close distribution, a weight parameter, and a first number of features to retain for determining an attribute of interest; (2) receiving the attribute of interest; (3) calculating a distribution of the attribute of interest in a biometric dataset; (4) splitting the biometric dataset into a plurality of k-sized clusters that satisfy the t-close distribution; (5) anonymizing each biometric datum in the plurality of k-sized clusters using a weighted average of landmarks for the biometric datums in k-sized clusters using the weight parameter; (6) adding each anonymized biometric datum into an anonymized biometric dataset; and (7) persisting the anonymized biometric dataset.

Abstract: A method for writing data to a cloud-based database for optimized cloud-based database query execution may include a table writer computer program executed by a local electronic device: (1) receiving table data comprising rows and columns, a schema for the table, and a primary-key for the table; (2) creating a footer for the table, the footer comprising the schema and the primary-key; (3) sorting the rows of the table data using the primary-key; (4) dividing the sorted columns of the table data into a plurality of datapages based on a datapage size; (5) identifying sparse indices for each datapage, wherein the sparse indices comprising a minimum value, a maximum value, a starting row index, an ending row index for each datapage; (6) writing each datapage to cloud storage; (7) inserting the sparse indices into the footer for the table data; and (8) writing the footer to cloud storage.

Abstract: Systems and techniques that facilitate precision-preserving qubit reduction based on spatial symmetries in fermionic systems are provided. In one or more embodiments, a symmetry component can generate a diagonalized second quantization representation of a spatial point group symmetry operation. The spatial point group symmetry operation can be associated with a molecule (e.g., a geometrical rotation, reflection, and/or inversion of a physical molecule that results in a new molecular orientation that is substantially the same as the original molecular orientation). In one or more embodiments, a transformation component can convert the diagonalized second quantization representation into a single Pauli string. In one or more embodiments, a tapering component can taper off qubits in a computational quantum algorithm that models properties of the molecule, based on the single Pauli string.

Abstract: A method for writing data to a cloud-based database for optimized cloud-based database query execution may include a table writer computer program executed by a local electronic device: (1) receiving table data comprising rows and columns, a schema for the table, and a primary-key for the table; (2) creating a footer for the table, the footer comprising the schema and the primary-key; (3) sorting the rows of the table data using the primary-key; (4) dividing the sorted columns of the table data into a plurality of datapages based on a datapage size; (5) identifying sparse indices for each datapage, wherein the sparse indices comprising a minimum value, a maximum value, a starting row index, an ending row index for each datapage; (6) writing each datapage to cloud storage; (7) inserting the sparse indices into the footer for the table data; and (8) writing the footer to cloud storage.

Abstract: A method includes measuring an amplitude of a state of a quantum circuit, the amplitude corresponding to a first location in an object database. In the embodiment, the method includes executing, using a classical processor and a first memory, a verification operation, responsive to measuring the amplitude, to verify a target object in the first location. In the embodiment, the method includes re-measuring a second amplitude of a second state of the quantum circuit, the second amplitude having undergone a first plurality of amplitude amplifications, the second amplitude corresponding to a second location in the object database, the second location being verified as the target object, and wherein a total number of the first plurality of amplitude amplifications being less than a square root of a set of objects in the object database.

Abstract: Systems and methods for concealing uninterested attributes in multi-attribute data using generative adversarial networks are disclosed.

Abstract: In an embodiment, a method includes measuring a first number of control qubits in a quantum algorithm, wherein a quantum circuit representation of the quantum algorithm includes a multiple-controlled-NOT gate. In an embodiment, a method includes measuring a second number of ancilla qubits in a quantum computer. In an embodiment, a method includes comparing the first number and the second number to determine an optimum compilation method for a quantum circuit. In an embodiment, a method includes compiling, in response to the comparison determining the second number is greater than one and less than the difference of the first number and 2, a quantum circuit from the quantum algorithm using a hybrid method.

Abstract: Techniques for facilitating incremental static program analysis based on machine learning techniques are provided. In one example, a system comprises a feature component that, in response to an update to a computer program, generates feature vector data representing the update, wherein the feature vector data comprises feature data representing a feature of the update derived from an abstract state of the computer program, and wherein the abstract state is based on a mathematical model of the computer program that is generated in response to static program analysis of the computer program. The system can further comprise a machine learning component that employs a classifier algorithm to identify an affected portion of the mathematical model that is affected by the update. The system can further comprise an incremental analysis component that incrementally applies the static program analysis to the computer program based on the affected portion.

Abstract: A method for quantum computing-assisted portfolio selection may include a classical computer program: (1) receiving a plurality of asset selection parameters for an asset portfolio; (2) initializing a current selection of assets from a plurality of available assets; (3) setting a risk upper bound value to a risk upper bound initial value, and a risk lower bound value to a risk lower bound initial value; (4) instructing a quantum computer to solve a first sub-problem; (5) calculating an objective functional value; (6) setting the risk upper bound value to the objective functional value; (7) instructing the quantum computer to determine a new selection of assets by solving a second sub-problem using a second quantum algorithm; and (8) returning an optimal portfolio selection.

Abstract: Approaches presented herein enable fault detection. More specifically, implementation code of one or more functions is identified from source code. The implementation code of the one or more functions is converted to corresponding Abstract Syntax Trees (ASTs). The implementation code of the one or more functions is represented as a first plurality of sets of AST paths over the ASTs. Classification results for the one or more functions are generated with a classifier based on the first plurality of sets of AST paths for the implementation code of the one or more functions. Each of the classification results indicates a probability of having at least one fault in a corresponding function of the one or more functions. Fault detection results of the source code are generated based on the classification results.

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: Quantum branch-and-bound algorithms with heuristics are disclosed. A method may include: receiving a branch and bound problem; setting an upper bound, a best bound, an incumbent, and a counter i; executing a subtree estimation procedure that returns branch_m that represents a tree of size m; determining branch_i and cost_i for branch_m; setting cost_feas to a value COST(N) for feasible nodes N, and to +? for unfeasible nodes; instructing a quantum computer to execute a QuantumMinimumLeaf procedure to get a node N and setting incumbent? to COST(N); instructing the quantum computer to execute the QuantumMinimumLeaf procedure to get a node N? and to setting best bound? to equal COST(N?); and returning the node N when an absolute value of a difference between a minimum of incumbent and incumbent? and a minimum of best bound and best bound? is less than the approximation margin.

Abstract: Systems and methods for quantum computing-based summarization are disclosed. A method for quantum computing-based summarization may include a classical computer program: receiving a document having a plurality of sentences; receiving a summary parameter that represents a subset of the plurality of sentences to include in a summary of the document; generating a vector for each sentence; calculating a centrality value for each vector; calculating a similarity value to other vectors for each vector; creating a cost function using the similarity values, the centrality values, a number of the plurality of sentences in the document, and the summary parameter; instructing a quantum computer to optimize the cost function using a quantum algorithm; receiving a dictionary comprising a plurality of distributions of the plurality of sentences and a probability for each distribution; and generating a summary comprising a subset of the plurality sentences based on a distribution having a highest probability.

Abstract: A method for implementing all-to-all connectivity in gate-based quantum computers may include a classical computer program: receiving an optimization problem; constructing a problem Hamiltonian by assigning a qubit to each interactions between pairs of variables; associating each of the assigned qubits to a physical qubit in a physical qubit grid; assigning readout physical qubits in the physical qubit grid to neighbors of the associated physical qubits; instructing the quantum computer to apply a driving Hamiltonian and the problem Hamiltonian to the physical qubit grid; instructing the quantum computer to apply CNOT gates between associated physical qubits on edges of each triangle and square in the physical qubit grid and the readout physical qubits in centers of the triangles and squares; instructing the quantum computer to measure the readout physical qubits; and determining that the measurements of all readout physical indicates that parities between the physical qubits are enforced.

Abstract: A method for calculating excited state properties of a molecular system using a hybrid classical-quantum computing system includes determining, using a quantum processor and memory, a ground state wavefunction of a combination of quantum logic gates. In an embodiment, the method includes forming a set of excitation operators. In an embodiment, the method includes forming a set of commutators from the set of excitation operators and a Hamiltonian operator. In an embodiment, the method includes mapping the set of commutators onto a set of qubit states, the set of qubit states corresponding to a set of qubits of the quantum processor. In an embodiment, the method includes evaluating, using the quantum processor and memory, the set of commutators. In an embodiment, the method includes causing a quantum readout circuit to measure an excited state energy from the set of computed commutators.

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: From a quantum program a first mutant is generated using a processor and a memory, where the first mutant is a randomly-generated transformation of the quantum program. A quality score, a correctness distance, and a probability of acceptance corresponding to the first mutant are computed. An acceptance corresponding to the first mutant is determined according to the probability of acceptance. Upon determining that an acceptance of the first mutant corresponding to the probability of acceptance exceeds an acceptance threshold, the quantum program is replaced with the first mutant. Upon determining that the quality score exceeds a storage threshold and that the correctness distance is zero, the first mutant is stored. These actions are iterated until reaching an iteration limit.

Abstract: Systems and methods for wayfinding in hazardous environments are disclosed. In one embodiment, a method for wayfinding in a hazardous environment may include: (1) receiving, at an emergency response computer program executed by an electronic device, a plurality of real time streams of data, each real time stream of data from a sensing device in an area; (2) detecting, by the emergency response computer program, an alarm condition in the area based on the real-time streams of data; (3) determining, by the emergency response computer program, that the alarm condition satisfies an alarm condition rule; (4) calculating, by the emergency response computer program, a plurality of routes to an egress point from the area; and (5) controlling, by the emergency response computer program, a digital signage in the area to display one of the plurality of routes the egress point.