Abstract: A transaction management system manages transactions in a system environment by receiving and recording transaction records and generating a transaction report for a monitoring system. Reporting devices execute transactions within the environment and transmit transaction records describing those transactions to the transaction management system. The transaction management system receives the transaction records and records them to persistent memory. In doing so, the transaction management system is configured to generate an accurate transaction report for the transactions while the transaction reports are being written to persistent memory. To do so, the transaction management system generates a horizon time for reporting transaction records based on the transaction records recordation state and ingest time.

Abstract: A method includes obtaining first and second data sets to be reconciled and, using matching rules, identifying discrepancies between the data sets. The matching rules include at least one permutation key, where each permutation key identifies a subset of data to be grouped together in one of the data sets. Identifying the discrepancies includes attempting to match one or more first characteristics associated with the grouped subset of data in one of the data sets to one or more second characteristics associated with another of the data sets. The matching rules could involve multiple matching characteristics, and the matching rules could be generated using a metric to select the matching characteristics of the matching rules. The metric could be based on a combination of a number of matched data items and a number of matched groups of data items.

Abstract: A method includes obtaining data from multiple data sources using multiple data pipelines and receiving input from a user defining a geospatial search, where an interactive map allows the user to define a specified geographical area within the interactive map. The method also includes retrieving a portion of the data related to the specified geographical area and to properties within or associated with the specified geographical area. The method further includes analyzing the retrieved portion of the data using one or more machine learning models configured to generate analysis results associated with one or more properties. In addition, the method includes generating a user interface that graphically provides at least a portion of the analysis results to the user. The user interface allows the user to update the geospatial search and provides updated analysis results to the user.

Abstract: A method includes obtaining an input query at a retriever model, where the retriever model includes a reconfigurable sequence of one or more rankers selected from among a plurality of rankers. Each ranker is configured to identify a specified number of information chunks relevant to the input query. The method also includes providing one or more of the information chunks from the retriever model to a generative model. The method further includes using the generative model to create a response to the input query, where the response is based on the one or more information chunks. The plurality of rankers includes a bi-encoder, a cross-encoder, and a large language model (LLM)-ranker.

Abstract: A method for compliance with Know Your Customer (KYC) and other regulations includes a pseudonymous globally unique identifier stored on a blockchain that associates a pseudonymous first party address with a globally unique identifier representing the vetted identity of the owner of the address. The method also includes a trusted third party issuing a verifiable credential for a first pseudonymous party to a proposed transaction to a second pseudonymous party to the transaction.

Abstract: The described system provides a dual-model framework for data retrieval from complex data environments such as webpages on the internet. It combines a traditional similarity model that identifies relevant data from vast amounts of data and a large language model that delves deeper into the relevant data to uncover specifics. The models, in conjunction, provide a method for providing responses to structured queries about an entity. A source investigator receives a request for information about an entity alongside a set of keywords. A source datastore is identified for the entity and a similarity model is applied to the datastore to determine relevancy scores for data within. Data and/or nodes above a relevancy threshold are stored as relevant data. Then, using the large language model, the investigator generates responses to the structured queries based on the relevant data and provides responses to the user system.

Abstract: Systems, computer-implemented methods, and computer program products to facilitate estimation of quantum resources to calculate an expectation value of a stochastic process using a re-parameterization method are provided. According to an embodiment, a system can comprise a processor that executes computer executable components stored in memory. The computer executable components can comprise a re-parameterization component that applies a quantum fault-tolerant operation to a variationally prepared quantum state corresponding to a probability distribution to produce a quantum state corresponding to a target probability distribution. The computer executable components can further comprise an estimation component that estimates at least one defined criterion of a quantum computer to be used to compute an expectation value of a stochastic process associated with the target probability distribution.

Abstract: This disclosure relates to enhanced methods of operating quantum computing systems to perform amplitude estimation. More than that, the methods may be tuned to accommodate for specific noise levels (e.g., in given a quantum device). Embodiments also enable quantum computing systems to perform amplitude estimation faster than amplitude estimation algorithms performed using a classical (non-quantum) computer.

Abstract: An asynchronous approach to implementing a quantum algorithm can reduce dead time of a quantum information processing unit (QIPU). Multiple parameter sets are determined for a quantum program by a controller and the QIPU is instructed to execute the quantum program for the parameter sets. Results from each program execution are returned to the controller. After one or more results are received, the controller determines an updated parameter set while the QIPU continues executing the quantum program for the remaining parameter sets. The QIPU is instructed to execute the quantum program for the updated parameter set (e.g., immediately, after a current program execution, or after the remaining parameter sets are processed). This asynchronous approach can result in the QIPU having little or no dead time, and thus can make more efficient use of the QIPU.

Abstract: A system performs efficient domain name system (DNS) based global server load balancing. The system regularly monitors server health of servers that process requests directed to virtual servers. The update server health information is used to process DNS queries that request assignment of servers for processing requests directed to virtual servers. The system maintains metadata describing servers based on user requests associated with virtual servers. The system updates information stored in a database based on requests associated with a virtual server, for example, create, update, or delete information describing a virtual server. The system propagates the updated information to a plurality of data plane clusters. The system receives DNS queries and answers them based on the updated information describing the servers.

Abstract: A system performs efficient domain name system (DNS) based global server load balancing. The system regularly monitors server health of servers that process requests directed to virtual servers. The update server health information is used to process DNS queries that request assignment of servers for processing requests directed to virtual servers. The system maintains metadata describing servers based on user requests associated with virtual servers. The system updates information stored in a database based on requests associated with a virtual server, for example, create, update, or delete information describing a virtual server. The system propagates the updated information to a plurality of data plane clusters. The system receives DNS queries and answers them based on the updated information describing the servers.

Abstract: A system performs upgrade of a network that includes network devices that provide connectivity to servers. The system performs network upgrade by evaluating a set of upgrade criteria for each network device to determine whether to upgrade the device or delay upgrading the network device. Each upgrade criterion is based on a relation between the selected network device and other network devices currently being upgraded. After completing the upgrade, the system determines whether the network upgrade completed successfully. The system determines whether the network upgrade completed successfully by determining a pre-snapshot representing a state of the network before network upgrade and a post-snapshot representing a state of the network after network upgrade. The system compares the pre-snapshot and the post-snapshot to determine whether the network upgrade completed successfully.

Abstract: In a general aspect, a surface code syndrome measurement is performed on a superconducting quantum processing unit. In some implementations, the superconducting quantum processing unit is caused to apply a quantum error correction code including X-type and Z-type stabilizer check patches. Each of the X-type and Z-type stabilizer check patches includes a stabilizer check qubit device and data qubit devices of the superconducting quantum processing unit. Applying the quantum error correction code includes iteratively twirling the data qubit devices in a stabilizer check patch; and evolving the stabilizer check qubit device in the stabilizer check patch and the data qubit devices in the stabilizer check patch under an interaction Hamiltonian. The interaction Hamiltonian includes a plurality of terms interactions between the stabilizer check qubit device in the stabilizer check patch and a respective one of the data qubit devices in the stabilizer check patch.

Abstract: Described herein are quantum gradient algorithms that result in a quantum advantage over conventional methods. In an example, a quantum circuit is configured to implement a quantum gradient algorithm when executed on qubits of a quantum computing system. The quantum gradient algorithm includes a phase oracle OSƒm defined by a finite difference approximation with an order greater than zero, and a complexity of the quantum gradient algorithm scales as (?{square root over (k)}/?). The quantum circuit is repeatedly executed on qubits of a quantum computing system to determine a k-dimensional gradient of a function ƒ(x) within an error ? at point x0.