Absstract of: EP4575843A1
A system and method for minimizing an objective function with constraints using an optimal tensor network configuration with symmetries are provided. The system comprises a non-transitory computer-readable memory and a processor in communication with the memory storing program instructions. The program instructions, when executed by a processor, causes the processor to: receive an objective function and one or more constraints for optimization; generate a time evolution block decimation (TEBD) process based on the objective function without the one or more constraints: generate a tensor network based on the objective function with symmetries to satisfy the one or more constraints; and find the optimal tensor network that optimizes the objective function using the TEBD process. Generating the tensor network may include applying the symmetries to transform the objective function into an unconstrained quadratic unconstrained binary optimization (QUBO) model.
Absstract of: FR3171297A1
Dispositif (1) pour réaliser un service, le dispositif (1) comprenant : une pluralité (4) de modules cryptographiques configurés pour réaliser chacun le service, la pluralité de modules cryptographiques comprenant un module cryptographique pré-quantique (4a) et un deuxième module cryptographique (4b) ; et un module de sélection (6) configuré pour obtenir un identifiant associé à une entité (E) qui demande le service, sélectionner un module cryptographique dans la pluralité (4) de modules cryptographiques d’après l’identifiant, et causer une réalisation du service à l’aide du module cryptographique sélectionné. Figure pour l’abrégé : Fig. 1
Absstract of: US20260203633A1
0000 A method of using a quantum-based system for outputting a variable for use with a first problem. A set of parameters is determined, for a second problem, for running the quantum-based system. The set of parameters are associated with at least one or more variables of the version of the second problem and enable the quantum-based system to output a plurality of solutions to the second problem. Each of the plurality of solutions is associated with a common set of quantum states of the quantum-based system and a different value of at least one of the said the variables of the second problem. The quantum-based system is run using at least the determined set of parameters to identify a set of one or more of the qubits corresponding to at least one of the solutions to the second problem. At least one solution to the second problem is determined to be a new variable for the first problem. The new variable is output for use with the version of the first problem.
Absstract of: US20260203626A1
0000 The invention refers to an apparatus 810 for generating control signals for measuring states of quantum elements of a quantum computer 830. A providing unit 811 provides a problem description. A transformation unit 812 transforms the problem description into a quantum mechanical representation The transformation comprises determining unitary transformations that rotate operators representing observables to be measured into bases that lead to a pure occupation number representation. A translation unit 813 translates the quantum mechanical representation into a sequence of quantum operations comprising unitary transformation operations to be applied to quantum elements. The translating comprises determining the unitary transformation operations based on the determined unitary transformations. A generation unit 814 generates signals for controlling the application of the determined sequence of quantum operations to the quantum computer such that the quantum mechanical representation of the problem is prepared and the observables indicative of the solution of the problem are measured.
Absstract of: US20260203624A1
Various embodiments of the teachings herein include methods for processing a quantum sensor signal of a quantum sensor. An example includes: obtaining a quantum sensor signal including a quantum-physical superposition state with the quantum sensor; and processing the superposition state without prior reduction with quantum information processing.
Absstract of: US20260200090A1
0000 A dynamic vision system for a robotic system includes an optical assembly including a lens containing a liquid. The lens is deformable to generate variable focus for the lens. The optical assembly is configured to capture optical data. A robotic system is configured to simulate human or animal species capabilities having a control system configured to adjust one or more optical parameters. The one or more optical parameters modify the variable focus of the lens while the optical assembly captures current optical data relating to the robotic system. A processing system is configured to train a machine learning model to recognize an object relating to the robotic system from training data generated from the optical data captured by the optical assembly. The optical data includes the current optical data relating to the robotic system.
Absstract of: US20260203631A1
0000 A superconducting integrated circuit has a first superconducting device with a first superconducting loop, where the first superconducting loop has a first superconducting trace in a first layer of the superconducting integrated circuit, and a second superconducting device with a second superconducting loop, where the second superconducting loop has a second superconducting trace in a second layer. The first superconducting loop crosses the second superconducting loop in a crossing region. At least a portion of each of the first and the second superconducting trace inside the crossing region is narrower than at least a portion of each of the traces outside the crossing region, and follows a respective circuitous path which is inductively proximate to at least a portion of the other path.
Absstract of: US20260203630A1
Circuitry of a pulse generation program compiler is operable to parse pulse generation program source code comprising a declaration of a non-stream variable, a declaration of a stream variable, and one or more stream processing statements that reference the stream variable. The circuitry of the pulse generation program compiler is operable to generate, based on the declaration of the non-stream variable, machine for execution by a quantum controller and a quantum orchestration server.
Absstract of: WO2026151912A1
This patent document is generally related to implementations of embodiments of a hybrid cryogenic electronic architecture based on complementary metal-oxide-semiconductor (CMOS) technology where CMOS circuitry and CMOS memory are partially included in a cryogenic electronic control module adjacent to quantum bit circuits by using single flux quantum (SFQ) circuitry to interface between the quantum bit circuits and the CMOS circuitry.
Absstract of: AU2025283649A1
METHOD AND SYSTEM TO ESTIMATE RISK FOR A SOFTWARE APPLICATION DUE TO QUANTUM THREAT Conventional risk estimation techniques perform dynamic analysis of application or 5 use models which require training data. Present disclosure provides method and system to estimate risk for a software application due to quantum threat by static analysis. A set of records pertaining to the application is received and parsed to obtain application, crypto and platform parameters. In addition, list of quantum vulnerable algorithms, number of Qubits required to break a cryptographic algorithm used by the application 10 and a current Qubit number are also received. Then, value of Quantum Day is determined based on the current Qubit number and the number of Qubits required to break the cryptographic algorithm used by the application. Further, SOD (Severity, Occurrence, Detection) scores are calculated for each parameter, and they are multiplied to determine Risk Priority Number (RPN) for each parameter. Finally, RPNs 15 of all parameters are summed up to estimate overall risk of the application. To be published with FIG. 3 ec e c 1. Populate Rules Rules and detection Recommendation APIsrepository System Code parser 2.Code Repo Host Risk 4. List of APIs App Analyzer to be replaced, Code Modified Code Replacer App Testing 6. After testing is successful App ec e c u l e s a n d d e t e c t i o n e c o m m e n d a t i o n s o s t p p
Absstract of: US20260203565A1
0000 A multi-tile CASCADE fabric for large-scale neural-network inference is disclosed. Multiple CASCADE tiles, each implementing a column-oriented compute array, perform local accumulation of partial sums within columns and output only completed column sums. The tiles communicate through an inter-tile network that transfers completed results rather than intermediate partial sums, greatly reducing bandwidth and enabling near-linear scaling of throughput. Activation values are broadcast synchronously to all tiles, and a hierarchical aggregation structure combines completed column sums into final layer outputs. The architecture maintains the CASCADE principle of column-confined accumulation across tiles, chips, and racks while minimizing power and communication overhead.
Absstract of: US20260203635A1
The present disclosure provides an apparatus and method for probabilistic model checking for time-bounded properties using quantum computing. In the present disclosure, a computing device for quantum probabilistic model checking is configured to convert a probabilistic model checking setting into a quantum circuit that acts on an initial state for multiple qubits and a single qubit of quantum amplitude estimation, and to estimate a probability that a time-bounded property is satisfied by utilizing the quantum amplitude.
Absstract of: US20260203632A1
0000 A system and method include reformulating an optimization program as a QUBO model, inputting the QUBO model into at least one quantum computing solver, receiving at least one first intermediate solution from the at least one quantum computing solver, and inputting the at least one first intermediate solution into a heuristic solver. The heuristic solver solves the at least one first intermediate solution by defining a subproblem based on the at least one first intermediate solution and iteratively solving the subproblem until a termination criterion is reached to compute at least one second intermediate solution. The at least one second intermediate solution is input into a nonquantum computing solver, which uses the at least one second intermediate solution as a starting point to continue solving the optimization program, and outputs an optimal solution to the optimization program.
Absstract of: WO2026150423A1
According to an embodiment, a quantum circuit including first quantum gates is created. First parameters of first quantum gates are determined, based on a classical hardware. A precision level associated with the quantum circuit is determined and operations are executed based on the precision level. The operations include adding second quantum gates to the quantum circuit, based on the precision level. First parameter gradients of the first quantum gates are determined, based on the classical hardware and a quantum hardware. The first parameters are updated, based on the first parameter gradients, using the classical hardware. Second parameter gradients of the second quantum gates are determined, based on the quantum hardware. The second parameters are updated based on the second parameter gradients, using the classical hardware. Optimized parameters of the quantum circuit are obtained by iteratively executing the operations based on the precision level.
Absstract of: US20260203124A1
0000 A computing platform may receive a program execution request for execution across a distributed computing environment. The computing platform may identify a complexity of the program execution request, and may generate corresponding qubit values. The computing platform may input the qubit values into a quantum multi objective optimization engine, configured to output, using quantum superposition and entanglement, and based on the qubit values, candidate solutions, and where each of the candidate solutions may be a potential resource allocation for processing the program execution request. The computing platform may score the candidate solutions based on one or more objectives. The computing platform may select, based on the scoring, a candidate solution. The computing platform may generate, based on the candidate solution, a resource allocation script. The computing platform may execute the resource allocation script to process the program execution request using a resource allocation corresponding to the candidate solution.
Absstract of: US20260203625A1
The present disclosure relates to a computer language and code for software application development, data compression, and memory devices for use with conventional, optical, hybrid electro-optical and quantum computers.
Absstract of: US20260203636A1
0000 A method for planning physical observation tasks in a space-air-ground integrated sensor network includes: obtaining capability data of available space-air-ground sensors, discretizing a spatiotemporal range of a monitoring scenario, and establishing spatial, temporal, and spatiotemporal mapping relationships between discretized spatiotemporal locations and sensor capabilities; performing quantum encoding on the spatiotemporal locations, sensors, and observation capabilities, and executing a quantum entanglement operation based on the constructed three types of mapping relationships, to build a unified quantum state representation of the spatiotemporal observation capabilities of the space-air-ground sensors; for a specific computation requirement, constructing a corresponding quantum operator and applying a quantum algorithm to perform efficient computation and measurement on the unified quantum state representation to obtain a computation result, thereby enabling scheduling of the space-air-ground integrated sensor network. The inherent bottlenecks in representing and computing spatiotemporal observation capabilities in the classical computation framework are resolved.
Absstract of: WO2026152135A1
Provided herein are techniques for applying batched fault-tolerant quantum operations, wherein the same logical gate is applied across multiple quantum code blocks in parallel, in a neutral atom quantum information processing system. Techniques described herein leverage error correction, code switching, and addressable Clifford gates during operation of the quantum computer. To implement the batched application of logical quantum operations, the quantum information processing system described herein uses transversal operations (e.g., checks and measurements) and ancilla blocks configured to interact with logical code blocks. These high-rate operation techniques enable high-fidelity quantum computing with reduced computational overhead.
Absstract of: WO2026150832A1
An independence test adjustment method according to the present disclosure uses a kernel method, wherein a kernel to be used in an independence test is selected on the basis of the value of an independence index calculated in accordance with data to be subjected to the independence test and the kernel to be used.
Absstract of: WO2026151382A1
A method of quantum probability estimation of an event in a stochastic process is provided. The stochastic process is modelled based on a finite state-machine model. A classical predictive model for the event is modelled based on the stochastic process and includes a set of states and a set of state transition matrices associated with the finite state-machine model. The method includes: generating a circuit description of a quantum state-preparation operator based on a past observation sequence of the stochastic process and the set of state transition matrices of the classical predictive model; generating a circuit description of a quantum search operator based on the circuit description of the quantum state-preparation operator and an event indication function, whereby the event indication function is configured to indicate whether the event is to occur with respect to the future sequence of the stochastic process; generating a plurality of circuit descriptions for a plurality of measurement quantum circuits, respectively, for compiling the plurality of measurement quantum circuits on a quantum computer, whereby each circuit description of the measurement quantum circuit is generated based on the circuit description of the quantum state-preparation operator and the circuit description of the quantum search operator; for each of the plurality of circuit descriptions of the plurality of measurement quantum circuits: compiling the circuit description of the measurement quantum
Absstract of: WO2026152033A1
A quantum processor chip is disclosed including a multi-layer photonic routing network. In one example, quantum node cores are arranged in slanted columns, and the arrangement may be derived at least in part from projecting a three-dimensional dual helix arrangement into two dimensions. The multi-layer photonic routing network provides different node-to-node connections on each layer, thereby enhancing the overall number of node-to-node connections while minimizing waveguide crossings and reducing cross talk. Disclosed embodiments employ vertical optical couplers and programmable photonic routers to flexibly route photonic signals between nodes. In some embodiments, integrated entanglement and qudit hardware regions may be provided. The architecture supports dynamic fallback routing, scalable control, and is compatible with various quantum technologies, enabling robust, high-fidelity quantum information processing within a compact footprint.
Absstract of: JP2026118620A
【課題】実施形態に係るシステムは、工場ロボットのメンテナンスやパフォーマンス評価を効率化することを目的とする。【解決手段】実施形態に係るシステムは、収集部と、評価部と、提案部と、評価提供部とを備える。収集部は、工場ロボットの稼働データ、メンテナンス履歴、エラー記録を収集する。評価部は、収集部によって収集されたデータを分析し、ロボットのパフォーマンス評価を行う。提案部は、評価部によって得られた評価結果に基づいてメンテナンスの必要性や改善点を提案する。評価提供部は、提案部によって提案された改善点に基づいて第三者視点からの評価を提供する。【選択図】図1
Absstract of: JP2026118890A
【課題】様々なタイプの制約に対して組合せ最適化問題を効率的に解く。【解決手段】量子計算システムは、量子コンピュータと古典コンピュータによって、制約を有する組合せ最適化問題をイジングモデルによって解く。量子コンピュータは、第1パラメータ及び第2パラメータでそれぞれ指定される第1演算子及び第2演算子を有するとともに、元の量子ビットで表されるヒルベルト空間のうち制約を満たす解で表される制約充足空間HFと元の量子ビットよりも少ない量子ビットで表される圧縮空間Hcsとの間の写像を表すユニタリー演算子Ucsを有し、圧縮空間Hcsでの量子ビットの量子状態|φ〉を生成し、量子状態の確率分布を生成する。古典コンピュータは、確率分布に基づいてイジングモデルのエネルギー期待値を計算し、エネルギー期待値が小さくなるように第1パラメータ及び第2パラメータを更新する。【選択図】図3
Absstract of: JP2026117571A
【課題】実施形態に係るシステムは、製造プロセスを効率化することを目的とする。【解決手段】実施形態に係るシステムは、学習部と、ブラッシュアップ部と、合意形成部とを備える。学習部は、各ロボットにAIエージェントを作成し、事前に製造プロセスを学習させる。ブラッシュアップ部は、学習部によって学習された製造プロセスをエージェント間で共有し、製造工程の一次ブラッシュアップを行う。合意形成部は、ブラッシュアップ部によってブラッシュアップされた製造工程に基づいて、複数のエージェント間で対応し、総意がとれたらアウトプットを得る。【選択図】図1
Nº publicación: JP2026117464A 16/07/2026
Applicant:
ソフトバンクグループ株式会社
Absstract of: JP2026117464A
【課題】実施形態に係るシステムは、工場内のロボットの配置とタスク割り当てを最適化することを目的とする。【解決手段】実施形態に係るシステムは、収集部と、評価部と、提案部と、最適化部とを備える。収集部は、工場内のロボットのスキル情報および過去のパフォーマンスデータを収集する。評価部は、収集部によって収集されたデータを多角的に評価する。提案部は、評価部によって得られた評価結果に基づいて各生産ラインのニーズに最適なロボット配置とタスク割り当てをリアルタイムで提案する。最適化部は、提案部によって提案された配置結果をもとに継続的な最適化を行う。【選択図】図1