Abstract: A signal comprises a plurality of codewords associated with a set of codewords, each codeword comprising a plurality of symbols associated with a symbol constellation. Processing includes: mapping quantum states associated with symbols of a particular codeword of the signal to a plurality of input qubits, and applying quantum operations to the input qubits according to a quantum circuit for decoding the signal. The quantum operations comprise: controlled unitary multi-qubit operations performed on two or more qubits in a first set of qubits controlled based on two or more qubits in a second set of qubits, an initial quantum measurement performed on an initially measured qubit in the first set of qubits, at least one controlled unitary single-qubit operation performed on a post-measurement state associated with the initially measured qubit, and quantum operations that invert at least a portion of the operations in the plurality of controlled unitary multi-qubit operations.

Abstract: We disclose optical entanglement distribution in quantum networks based on a quasi-deterministic entangled photon pair source. Combining heralded photonic Bell pair generation with spectral mode conversion to interface with quantum memories eliminates switching losses due to multiplexing in the source. This zero-added-loss multiplexing (ZALM) Bell pair source is especially useful for the particularly challenging problem of long-baseline entanglement distribution via satellites and ground-based memories, where it unlocks additional advantages: (i) the substantially higher channel efficiency ? of downlinks versus uplinks with realistic adaptive optics, and (ii) photon loss occurring before interaction with the quantum memory—i.e., Alice and Bob receiving rather than transmitting—improve entanglement generation rate scaling by (?{square root over (?)}).

Abstract: Techniques described herein are directed to determining an effective tag for data assets. For instance, each tag associated with a data asset may be associated with certain attributes. Non-limiting examples for such attributes may include a confidence level associated with a source that applied the tag, an applied date at which the tag was applied to the data asset, and/or a hierarchical depth of the data asset to which the tag was applied, as well as additional and/or alternative types of attributes. When a request to determine a tag for a data asset is received, the attributes for all the tags applied to the data asset may be retrieved and/or analyzed to determine which of such tags effectively classifies the data asset. The determined effective tag may be returned to the requesting entity.

Abstract: Non-limiting examples of the present disclosure describe systems and methods for scanning of data for policy compliance. In one example, network data is evaluated to generate one or more groupings. A grouping may be based on file type of the network data. Data identification rules are applied to identify one or more data schemas from file data of a grouping. One or more policy rules that apply to content of the data schema may be determined. At least one file of the file data may be scanned to determine compliance with the one or more policy rules. A report of compliance with the one or more policy rules may be generated based on a result of a file scan. Other examples are also described.

Abstract: A system for scalable, fault-tolerant photonic quantum computing includes multiple optical circuits, multiple photon number resolving detectors (PNRs), a multiplexer, and an integrated circuit (IC). During operation, the optical circuits generate output states via Gaussian Boson sampling (GBS), and the PNRs generate qubit clusters based on the output states. The multiplexer multiplexes the qubit clusters and replaces empty modes with squeezed vacuum states, to generate multiple hybrid resource states. The IC stitches together the hybrid resource states into a higher-dimensional cluster state that includes states for fault-tolerant quantum computation.

Abstract: Techniques described herein are directed to determining an effective tag for data assets. For instance, each tag associated with a data asset may be associated with certain attributes. Non-limiting examples for such attributes may include a confidence level associated with a source that applied the tag, an applied date at which the tag was applied to the data asset, and/or a hierarchical depth of the data asset to which the tag was applied, as well as additional and/or alternative types of attributes. When a request to determine a tag for a data asset is received, the attributes for all the tags applied to the data asset may be retrieved and/or analyzed to determine which of such tags effectively classifies the data asset. The determined effective tag may be returned to the requesting entity.

Abstract: Techniques described herein are directed to determining an effective tag for data assets. For instance, each tag associated with a data asset may be associated with certain attributes. Non-limiting examples for such attributes may include a confidence level associated with a source that applied the tag, an applied date at which the tag was applied to the data asset, and/or a hierarchical depth of the data asset to which the tag was applied, as well as additional and/or alternative types of attributes. When a request to determine a tag for a data asset is received, the attributes for all the tags applied to the data asset may be retrieved and/or analyzed to determine which of such tags effectively classifies the data asset. The determined effective tag may be returned to the requesting entity.

Abstract: A platform that facilities preservation of user privacy with respect to location-based applications executing on mobile computing devices is described. The platform registers triggers that are set forth by location-based applications, where a trigger specifies one or more rules and includes a location constraint. The platform causes a sensor on the mobile computing device to output location data, and the platform determines if the trigger has been satisfied by comparing the location constraint with the location data. If the trigger is satisfied, the platform transmits a callback to the application. Accordingly, the application does not receive location data from the sensor.

Abstract: A method for cluster-state quantum computing method includes transforming a Gaussian graph state into a non-Gaussian percolated graph state by probabilistically subtracting one photon from each of a plurality of modes forming the Gaussian graph state. The method also includes determining cat-basis qubits of the non-Gaussian percolated graph state for which one photon was successfully subtracted from a corresponding one of the modes, and identifying in the non-Gaussian percolated graph state a renormalized graph of logical qubits connected by percolation highways. The logical qubits and percolation highways are formed from the cat-basis qubits. The renormalized graph and the non-Gaussian percolated graph state are outputted to a one-way quantum computer to implementing a quantum computing algorithm.

Abstract: A system for scalable, fault-tolerant photonic quantum computing includes multiple optical circuits, multiple photon number resolving detectors (PNRs), a multiplexer, and an integrated circuit (IC). During operation, the optical circuits generate output states via Gaussian Boson sampling (GBS), and the PNRs generate qubit clusters based on the output states. The multiplexer multiplexes the qubit clusters and replaces empty modes with squeezed vacuum states, to generate multiple hybrid resource states. The IC stitches together the hybrid resource states into a higher-dimensional cluster state that includes states for fault-tolerant quantum computation.

Abstract: A system for scalable, fault-tolerant photonic quantum computing includes multiple optical circuits, multiple photon number resolving detectors (PNRs), a multiplexer, and an integrated circuit (IC). During operation, the optical circuits generate output states via Gaussian Boson sampling (GBS), and the PNRs generate qubit clusters based on the output states. The multiplexer multiplexes the qubit clusters and replaces empty modes with squeezed vacuum states, to generate multiple hybrid resource states. The IC stitches together the hybrid resource states into a higher-dimensional cluster state that includes states for fault-tolerant quantum computation.

Abstract: Described herein is a system and method for utilizing data flow analysis to perform data classification with respect to a source dataset and a generated derived dataset. A flow confidence for a field is calculated using an adaptive algorithm in accordance with the action performed and the derived dataset. An associated derived confidence for a particular tag is calculated in accordance with an associated confidence and the flow confidence. When the associated derived confidence is greater than or equal to a first threshold, the particular tag is copied to the derived dataset. In some embodiments, when the associated derived confidence is less than or equal to a second threshold, the particular tag is not copied to the derived dataset. Otherwise an action to be taken is identified. A response to the action is received and the adaptive algorithm is modified in accordance with the received response.

Abstract: According to one aspect of the present disclosure, a computing device is provided, including non-volatile memory storing a database including a plurality of database entries. The computing device may further include a processor configured to sort the plurality of database entries into a plurality of database entry length sets. For each database entry length set, each database entry included in the database entry length set may be within a predefined length range. For each database entry length set, the processor may be further configured to generate a probabilistic data structure based on the one or more database entries included in the database entry length set.

Abstract: A method includes sending a probe beam into a beam path that induces a lateral displacement to the probe beam. The probe beam includes a plurality of orthogonal spatial modes that are entangled with each other. The method also includes measuring a phase of each spatial mode from the plurality of orthogonal spatial modes in the probe beam at a detector disposed within a near field propagation regime of the probe beam. The method also includes estimating the lateral displacement of the probe beam based on a phase of each spatial mode from the plurality of spatial modes in the probe beam after the beam path.

Abstract: Non-limiting examples of the present disclosure describe systems and methods for scanning of data for policy compliance. In one example, network data is evaluated to generate one or more groupings. A grouping may be based on file type of the network data. Data identification rules are applied to identify one or more data schemas from file data of a grouping. One or more policy rules that apply to content of the data schema may be determined. At least one file of the file data may be scanned to determine compliance with the one or more policy rules. A report of compliance with the one or more policy rules may be generated based on a result of a file scan. Other examples are also described.

Abstract: A multilevel data lineage view system disclosed herein allows generating higher level data lineage views. An implementation of the multilevel data lineage view system is implemented using various computer process instructions including receiving information about a plurality of objects, wherein at least some of the objects are organized in a hierarchy, determining relations between at least some of these objects at a first level in the hierarchy, and inferring relationships between the objects at a second level in the hierarchy based on the relationships between the objects at the first level in the hierarchy based on a count of assets of constituent parts of the objects at the first level in the hierarchy, wherein the second level is above the first level in the hierarchy.

Abstract: Described herein is a system and method for inferring data relationships of a plurality of datasets. Data contents (and optionally metadata) of the plurality of datasets are scanned to extract features of each of the datasets. Features can be related to a structure of data, a profile of data within the dataset, and/or metadata of the dataset. Each feature has an associated weight. The datasets can be clustered into clusters based on at least some of the weighted features (e.g., based on a sim-hash or min-hash of the dataset). A precise similarity metric is computed between datasets in each cluster based on their weighted features. Datasets with precise similarity metrics above a threshold quantity are inferred to be being likely related. Information is provided regarding the inferred likely related datasets.

Abstract: Non-limiting examples of the present disclosure describe systems and methods for scanning of data for policy compliance. In one example, network data is evaluated to generate one or more groupings. A grouping may be based on file type of the network data. Data identification rules are applied to identify one or more data schemas from file data of a grouping. One or more policy rules that apply to content of the data schema may be determined. At least one file of the file data may be scanned to determine compliance with the one or more policy rules. A report of compliance with the one or more policy rules may be generated based on a result of a file scan. Other examples are also described.

Abstract: A “Data Transfer Tool” extracts, labels and stores user data or information that may be confined within application silos during user interaction with arbitrary apps. The Data Transfer Tool enables sharing of this otherwise siloed data shared across and between authorized apps. The Data Transfer Tool provides a task-centric approach to define and extract structured and semantically meaningful information from source applications by providing multiple semantic models that are individually tailored to particular source apps. The Data Transfer Tool applies an accessibility API or the like of the OS in combination with the semantic model for the source app to scrape user entered or selected data or information from the source app. The Data Transfer Tool enables and creates new user experiences and increases user efficiency when interacting with various apps by making the scraped data or information available to subscribing destination apps approved to receive that data or information.

Abstract: A method includes sending a probe beam into a beam path that induces a lateral displacement to the probe beam. The probe beam includes a plurality of orthogonal spatial modes that are entangled with each other. The method also includes measuring a phase of each spatial mode from the plurality of orthogonal spatial modes in the probe beam at a detector disposed within a near field propagation regime of the probe beam. The method also includes estimating the lateral displacement of the probe beam based on a phase of each spatial mode from the plurality of spatial modes in the probe beam after the beam path.