Abstract: A method may include obtaining a graph in which a first and a second node respectively represent a first and a second qubit. The method may include generating candidate paths between the first and second nodes along one or more edges, each candidate path specifying a path that arrives at a target edge between the first and second nodes. The method may include computing scores for a plurality of path pairs, a respective score indicating how efficiently a respective path pair routes the first node to the second node via the target edge. The score may be weighted based on an order in which operations of the quantum circuit are performed with earlier operations being weighted more heavily than later operations. The method may include selecting the path pair that corresponds to a highest score for routing the first node to the second node via the target edge.

Abstract: A method may include obtaining a quantum circuit that includes quantum bits (qubits) that are sparsely connected such that a particular qubit may not include a physical connection to other qubits. The method may include generating a graph representing the quantum circuit in which a qubit is represented as a node and a physical connection between two qubits is represented as an edge. The method may include assigning weight values to the edges based on a respective gate depth to generate a weighted graph. An individual gate depth may indicate how early a particular operation of the quantum circuit associated with a respective edge is scheduled to be performed by the quantum circuit. The method may include modeling the weighted graph as a Quadratic Assignment Problem (QAP) and determining an initial mapping of the qubits based on a solution to the QAP.

Abstract: According to an aspect of an embodiment, operations include receiving a dataset associated with a machine learning task, preparing an input quantum state based on the dataset, and preparing a VQC to function as a QNN. The operations further include executing operations comprising reading content of a state buffer as empty or including past information on parameters of the QNN, selecting parameter values based on the content, preparing an input for an optimizer network based on the parameter values, computing an output by applying the optimizer network on the input, updating the parameter values using the output, and obtaining a current cost function value based on the updated parameter values. The operations further include updating the state buffer using the current cost function value and the updated parameters values and training the QNN until the current cost function value is below a threshold.

Abstract: A method may include obtaining a graph dataset that represents a social network and includes a plurality of nodes. The method may include partitioning the graph dataset into a first node cluster and a second node cluster in which the first node cluster and the second node cluster each include one or more nodes from the graph dataset. The method may include identifying one or more first candidate influential nodes included in the first node cluster and one or more second candidate influential nodes included in the second node cluster. The method may include selecting one or more of the first candidate influential nodes and the second candidate influential nodes as influencer nodes and identifying a respective object included in the social network corresponding to each of the influencer nodes.

Abstract: According to an aspect of an embodiment, operations include receiving an input comprising a node-based graph associated with a real-world optimization problem and generating a sparse graph by removing a subset of edges from the node-based graph, The operations further include formulating operators of a quantum circuit on a quantum computer based on the sparse graph and formulating a cost function for the real-world optimization problem. The operations further include executing a set of operations which includes operating the quantum circuit on the quantum computer to generate a result, estimating a value of the cost function using the result, and updating parameters of the operators based on the value. The operations further include generating a final solution of the real-world optimization problem by repeating the execution of the set of operations using the updated parameters, until the estimated value of the cost function approaches a predefined threshold value.

Abstract: An imaging system including an image acquisition device, a light-field imaging arrangement including an optical meta-device operable to facilitate imaging of a light-field of a target scene, and a structured-light imaging arrangement including an optical meta-device operable to facilitate generation of structured-light to be provided to a target scene to facilitate imaging of the target scene. The light-field imaging arrangement and the structured-light imaging arrangement are operably coupled with the image acquisition device such that the imaging system is selectively operable in, at least, a light-field imaging mode for performing light-field imaging of the target scene and a structured-light imaging mode for performing structured-light imaging of the target scene. The optical meta-device of the light-field imaging arrangement and the optical meta-device of the structured-light imaging arrangement may be provided by the same optical meta-device.

Abstract: A method may include obtaining a set of tags and a set of items in which each item is pre-sorted into a cluster and each item corresponds to one or more tags. The method may include generating a bipartite graph that includes the set of tags as a first set of nodes and the clusters of items as a second set of nodes. Relationships between tags and items may be represented as edges between the first nodes and the second nodes. The bipartite graph may be modeled as a quadratic programming formulation, and cluster descriptor sets that each include one or more of the tags may be determined by solving the quadratic programming formulation of the bipartite graph, each of the cluster descriptor sets providing an explanation of how one or more clusters of items were pre-sorted. The method may include analyzing the items based on the luster descriptor sets.

Abstract: A method for breeding a new germplasm of clubroot-resistant orange-heading Chinese cabbage includes: (1) obtaining F1 by hybridizing orange-heading Chinese cabbage as a female parent and clubroot-resistant Chinese cabbage as a male parent, obtaining F2 by selfing F1 individual plants, planting F2 populations, and extracting DNA from the individual plants of F2; (2) observing horticultural traits of F2, and performing observation and statistics of head color phenotypic traits through cutting head; (3) performing PCR amplification with DNA of F2 using a dominant orange gene marker Br530 and a clubroot-resistant marker SC2930-T/SC2930Q, and identifying a genotype of the individual plants; (4) performing a comprehensive evaluation according to the results of marker detection and the observation of horticultural traits, selecting double-site homozygous clubroot-resistant orange-heading Chinese cabbage plants, and selfing the individual plants for 2 consecutive generations; and (5) obtaining a new germplasm of club

Abstract: A method of solving a large scale combinatorial optimization problem including inputting, via at least one processor, an objective function and an initial solution as a mapping from a plurality of n nodes, randomly clustering the plurality of nodes into k clusters of n/k nodes each, for each cluster of the k clusters, assigning binary variables to denote each possible permutation of a label set within the cluster, determining that there are u=k2 variables if k>2, and u=1 variables if k=2, expressing the objective function in terms of the un/k variables, solving the objective function in terms of the un/k variables using a Quadratic Unconstrained Binary Optimization (QUBO) solver to obtain an updated solution, determining whether a convergence criteria is satisfied for the updated solution, and upon a determination that a convergence criteria is satisfied, outputting the updated solution to the objective function.

Abstract: Systems and methods for integrating cameras and phased array antennas for use in electronic toll charge (ETC) are disclosed. In one aspect, an ETC system includes a camera including a lens and configured to capture an image indicative of a position of a vehicle and a plurality of antennas formed in a ring around the lens of the camera. The system further includes control circuitry configured to: determine the position of the vehicle based on the image captured by the camera, adjust the antennas for beamforming based on the position of the vehicle, and wirelessly communicate with an on board device (OBU) of the vehicle via the beamforming provided by the adjusted antennas.

Abstract: Systems and methods for integrating cameras and phased array antennas for use in electronic toll charge (ETC) are disclosed. In one aspect, an ETC system includes a camera including a lens and configured to capture an image indicative of a position of a vehicle and a plurality of antennas formed in a ring around the lens of the camera. The system further includes control circuitry configured to: determine the position of the vehicle based on the image captured by the camera, adjust the antennas for beamforming based on the position of the vehicle, and wirelessly communicate with an on board device (OBU) of the vehicle via the beamforming provided by the adjusted antennas.

Abstract: A robot for testing lower limb performance of a spacesuit includes a pressure maintaining box, an air circulation component, an air cooling unit, heat radiating hose components, and two mechanical legs. The air cooling unit is connected with the pressure maintaining box; the air circulation component is arranged in the pressure maintaining box; the mechanical legs are installed on the pressure maintaining box, and the heat radiating hose components are arranged in the mechanical legs; air in the pressure maintaining box is cooled through the air cooling unit and delivered into the heat radiating hose components through the air circulation component; each mechanical leg comprises a thigh, a knee joint component, a shank, an ankle joint component and a foot; the thigh is connected with the shank through the knee joint component; the shank is connected with the foot through the ankle joint component.

Abstract: The present invention relates to the technical field of spacesuit performance tests, and in particular to a robot for testing lower limb performance of a spacesuit, comprising a pressure maintaining box, an air circulation component, an air cooling unit, heat radiating hose components and two mechanical legs.

Abstract: A method of solving a large scale combinatorial optimization problem including inputting, via at least one processor, an objective function and an initial solution as a mapping from a plurality of n nodes, randomly clustering the plurality of nodes into k clusters of n/k nodes each, for each cluster of the k clusters, assigning binary variables to denote each possible permutation of a label set within the cluster, determining that there are u=k2 variables if k>2, and u=1 variables if k=2, expressing the objective function in terms of the un/k variables, solving the objective function in terms of the un/k variables using a Quadratic Unconstrained Binary Optimization (QUBO) solver to obtain an updated solution, determining whether a convergence criteria is satisfied for the updated solution, and upon a determination that a convergence criteria is satisfied, outputting the updated solution to the objective function.

Abstract: Athermal arrayed waveguide grating wavelength division multiplexers applicable to a relatively wide temperature range. One athermal arrayed waveguide grating wavelength division multiplexer includes a base board including an arrayed waveguide grating chip, wherein the base board and the arrayed waveguide grating chip are divided into a first portion and a second portion through at least one division plane; and a sliding deflection component positioned on the base board including a first end and a second end which are respectively fixed on the first portion and the second portion, the sliding deflection component including: a telescopic rod having a length that changes with temperature variation, a first sidewall and a second sidewall positioned at two ends of the telescopic rod, respectively, and a first deflection limiting piece fixed on one side of the telescopic rod.

Abstract: Athermal arrayed waveguide grating wavelength division multiplexers applicable to a relatively wide temperature range. One athermal arrayed waveguide grating wavelength division multiplexer includes a base board including an arrayed waveguide grating chip, wherein the base board and the arrayed waveguide grating chip are divided into a first portion and a second portion through at least one division plane; and a sliding deflection component positioned on the base board including a first end and a second end which are respectively fixed on the first portion and the second portion, the sliding deflection component including: a telescopic rod having a length that changes with temperature variation, a first sidewall and a second sidewall positioned at two ends of the telescopic rod, respectively, and a first deflection limiting piece fixed on one side of the telescopic rod.