Alerta

SYSTEMS AND METHODS TO PERFORM INSTANTANEOUS QUBIT STATE READOUT IN A QUANTUM PROCESSOR

Resumen de: WO2026187636A2

Mid-anneal readout of qubits during can be used to characterize quantum processor dynamics. A method can comprise: initiating a state change of qubits; performing fast quantum annealing of detector rf-SQUIDs coupled thereto during the state change to capture instantaneous qubit states while experiencing observable quantum dynamics; and, reading out the instantaneous states. The detector rf-SQUIDs can be a subset of qubits or quantum flux parametrons, leveraging existing on-chip devices. Instantaneous states can be captured across a range of effective measurement bases through iterative modulation of polar and azimuthal angles by sweeping rf-SQUID body biases and annealing delay times.

AUTONOMOUS QUANTUM ERROR CORRECTION FOR SQUEEZED CAT CODES

Resumen de: US20260268198A1

0000 The present disclosure describes various methods, systems, and storage medium for performing a quantum operation on a qubit using an autonomous quantum error correction scheme. One method includes obtaining the qubit comprising a squeezed cat (SC) qubit encoded with quantum information; concatenating the qubit with a set of codes; engineering a dissipation corresponding to the concatenated qubit; and applying, according to the engineered dissipation, quantum error correction on the concatenated qubit to perform error correction on the encoded quantum information.

OBTAINING THE BEST NOISE FACTORS AND EXTRAPOLATOR TO BE USED IN QUANTUM ERROR MITIGATION

Resumen de: US20260268197A1

A method, system and computer program product for performing quantum error mitigation. A machine learning model is trained to predict the optimal noise factors and optimal extrapolator to be used in quantum error mitigation based on the quantum circuits, such as the structures of the quantum circuits, and the selections of different quantum hardware (e.g., noise profile of the selected quantum hardware). Based on the received structure of a quantum circuit and the selected quantum hardware, the optimal noise factors and the optimal extrapolator to be used in quantum error mitigation for the received quantum circuit to be run on the selected quantum hardware are identified using the trained machine learning model. Quantum error mitigation is then performed on the quantum circuit, such as the received quantum circuit, after the quantum circuit has been run on the selected quantum hardware using the identified optimal noise factors and optimal extrapolator.

A DISTRIBUTED COMPUTATIONAL NETWORK, A ROUTER, AND A METHOD OF ROUTING COMPUTATIONAL TASKS THEREIN

Resumen de: WO2026187229A1

A distributed computational network, a router and a method for computing heterogenous computational tasks therein, the network comprising a plurality of entities, wherein the entities comprise: - at least two servers configured to perform a computational task; - at least two routers configured for routing a computational task towards a server over a classical communication channel, wherein each router is further configured for establishing a quantum communication channel with at least one further router for enabling coordination of routing the computational tasks.

QUANTUM CIRCUIT APPROXIMATION

Resumen de: US20260268191A1

0000 A method, apparatus, and non-transitory computer readable medium comprising: obtaining an original quantum circuit comprising a plurality of quantum gates and qubits; selecting a target qubit; determining a set of segments for the target qubit based on 2-qubit gates operating on the target qubit. Further comprising: computing an optimized value of a target function comprising decision variables, each corresponding to a different segment, said computing comprising determining a value assignment for each decision variable; determining, for each segment, based on the value assignment for a corresponding decision variable, whether to perform magnitude approximation; and generating an approximated quantum circuit based on the determining.

CLIFFORD-IN-MEMORY MODULAR FAULT-TOLERANT QUANTUM COMPUTING ARCHITECTURE

Resumen de: WO2026185268A1

One or more systems, devices, computer program products and/or computer-implemented methods of use provided herein relate to modular fault-tolerant quantum computing. For example, a system can comprise a memory that can store computer executable components and a processor that can execute the computer executable components stored in the memory. The computer executable components can comprise an operation component that performs, on a quantum processor, stabilizer operations on logical qubits encoded in a quantum error correction code. The computer executable components can further comprise an execution component that performs, on the quantum processor, universal quantum operations on the logical qubits using the stabilizer operations, wherein the stabilizer operations consume magic state.

VERFAHREN, VORRICHTUNG, QUANTENCOMPUTER, COMPUTERPROGRAMM UND COMPUTERLESBARES SPEICHERMEDIUM ZUR ERHÖHUNG EINER KOHÄRENZZEIT WÄHREND EINER QUANTENBERECHNUNG

Resumen de: DE102025108884A1

Ein Verfahren zur Erhöhung einer Kohärenzzeit während einer Quantenberechnung mit mindestens zwei Qubits ist angegeben, wobei das Verfahren umfasst:- Anlegen eines Quantengatters an die mindestens zwei Qubits,- Anlegen einer Signalsequenz an die mindestens zwei Qubits zumindest während einer Evolutionszeit des Quantengatters, so dass die Kohärenzzeit der mindestens zwei Qubits während der Quantenberechnung erhöht wird, wobei- die Signalsequenz mindestens zwei Signalsequenzblöcke umfasst,- jeder Signalsequenzblock eine Amplitude und eine Phase aufweist,- mindestens zwei Phasen von aufeinanderfolgenden Signalsequenzblöcken voneinander verschieden sind, und- die Amplitude vorbestimmt ist, um Rabi-Oszillationen für die mindestens zwei Qubits zu induzieren, wobei die Rabi-Oszillationen eine verstimmte Frequenz haben, die nah-resonant mit einer Fallenfrequenz ist.Ferner werden eine Vorrichtung, ein Quantencomputer, ein Computerprogramm und ein computerlesbares Speichermedium angegeben.

DOUBLE TRANSMON COUPLERS FOR MEDIATING INTERACTIONS BETWEEN QUANTUM BITS

Resumen de: US20260268193A1

A device comprises a superconducting integrated circuit which comprises a tunable coupler. The tunable coupler comprises a first node, a second mode, a first transmon, a second transmon, and a flux-tunable inductive coupler. The first node is coupled to a first quantum bit, and the second node is coupled to a second quantum bit. The first transmon comprises a first Josephson junction, and the second transmon comprises a second Josephson junction. The flux-tunable inductive coupler comprises a superconducting loop that couples the first transmon and the second transmon. The superconducting loop comprises a third Josephson junction. The first Josephson junction, the second Josephson junction, and the third Josephson junction are coupled in series between the first node and the second node of the tunable coupler.

A GATE-CONTROLLED SUPERCURRENT-BASED NON-VOLATILE MEMORY DEVICE

Resumen de: WO2026184859A1

A gate-controlled supercurrent-based non-volatile memory device (10) comprising: a superconducting channel (12), wherein at least one superconducting parameter and/or state of the superconducting channel (12) is tunable by an applied gate voltage (VG); at least one gate electrode (14) configured to apply the gate voltage (VG) to tune the superconducting parameter and/or state; and a gate layer (16) with dielectric properties functionally positioned between the superconducting channel (12) and the gate electrode (14), wherein the gate layer (16) assumes one of at least two states, a first state representing a first memory state (S1) and a second state representing a second memory state (S0), wherein a value of the superconducting parameter and/or the superconducting state is changeable depending on the memory state (S1, S0), when applying the gate voltage (VG).

METHOD FOR USE IN SOLVING A FERMIONIC PROBLEM ON A QUANTUM COMPUTER, METHOD FOR SOLVING A FERMIONIC PROBLEM ON A QUANTUM COMPUTER, COMPUTER PROGRAM PRODUCT, DATA CARRIER AND COMPUTING SYSTEM

Resumen de: WO2026185115A1

The present invention is related to a method for use in solving a fermionic problem on a quantum computer, a method for solving a fermionic problem on a quantum computer, a computer program product and a computing system.

SPIN SQUEEZING IN NV CENTERS

Resumen de: WO2026188112A1

Described herein are methods of generation of metrologically useful many-body entanglement, for example, spin squeezing, in a solid-state spin ensemble.

QUANTUM CIRCUIT OPTIMIZATION METHOD, TRAINING DEVICE, TRAINING METHOD FOR PARTIAL QUANTUM CIRCUIT GENERATION DEVICE, AND QUANTUM CIRCUIT

Resumen de: WO2026186161A1

This quantum circuit optimization method includes: a step for generating a data input circuit; a step for calculating a residual pattern of output data of a target task by a main quantum circuit including the data input circuit; a step for generating a partial quantum circuit by using a partial quantum circuit generation device; a step for expanding the main quantum circuit by adding the generated partial quantum circuit to the end of the main quantum circuit; and a step for optimizing the main quantum circuit in a state where a parameter of the most-recently-added partial quantum circuit is set as an optimization target and where a parameter of a part other than the most-recently-added partial quantum circuit is set to have been optimized. The step for calculating the residual pattern, the step for generating the partial quantum circuit, the step for expanding the main quantum circuit, and the step for optimizing the main quantum circuit are repeated until a termination condition is satisfied.

IDENTIFYING AND CORRECTING ERRORS USING A BELIEF PROPAGATION DECODER WITH LOCAL EXPONENTIAL AVERAGING

Resumen de: WO2026185036A1

A method, system, and computer program product for identifying and correcting errors in a quantum system. A mixing parameter is applied to each variable node message or check node message of the belief propagation algorithm. Each mixing parameter applied to each variable node message/check node message may be different. The belief propagation algorithm is then run a fixed number of times with multiple sets of mixing parameters. Such mixing parameters may differ between runs of the belief propagation algorithm. After the completion of the runs of the belief propagation algorithm, one of the solutions (a decoded sequence of bits representing an error pattern that most likely generated the observed syndrome) outputted by the belief propagation decoder is selected based on a quality metric, such as the highest probability. In this manner, the belief propagation decoder can reliably decode quantum codes in an inexpensive manner while meeting the real-time requirement.

FUNCTION GENERATING DEVICE, INFORMATION PROCESSING SYSTEM, FUNCTION GENERATIMG METHOD, INFORMATION PROCESSING METHOD, AND RECORDING MEDIUM

Resumen de: WO2026185936A1

This function generating device is provided with a function generating means for generating a function, such that: for values of the plurality of binary variables for which a value of an integer function using the plurality of binary variables falls within a function value range, the function value is 0; and for values of the plurality of binary variables for which the value of the integer function does not fall within the function value range, the function value is a value of a predetermined one of a positive sign and a negative sign. The function value range is within a range that has been obtained as the range of values of the integer function.

ERROR MITIGATION FOR QUANTUM COMPUTING

Resumen de: AU2025426849A1

One example aspect of the present disclosure is directed to a method for operating a quantum computing system (QCS) that includes a set of qubits. The method includes generating a set of noisy data by repeatably measuring a noisy observable of a quantum circuit operating on the set of qubits. The set of noisy data and the noisy observable are subject to noise associated with the quantum circuit and each datapoint of the set of noisy data is associated with an eigenvalue of the noisy observable. The noisy data is modeled as a hybrid distribution, which includes a combination of a noiseless distribution and a noise-only distribution. Each datapoint of the set of noisy data is assumed to have a hidden label as coming from either the noiseless distribution or the noise-only distribution. This label is estimated for each datapoint, based on the eigenvalue associated with the datapoint, and a constructed model for any of the hybrid distribution, the noise-only distribution, and the noiseless distribution. This may require additional data to be taken from the QCS to model the noise-only distribution. A target quantity is determined based on either the model for the noiseless distribution or the datapoints combined with their attached labels.

RESONATOR TUNING

Resumen de: US20260269803A1

A method for exciting a resonator at an estimated resonance frequency of the resonator comprises: (a) varying a frequency of an input signal applied to the resonator while recording an output signal from the resonator; (b) for each of a series of frequency values of the input signal, computing noise-filtered, complex first and second derivatives of a ratio of the output signal to the input signal; (c) for each of the series of frequency values of the input signal, computing a real part of a dot product of the complex first and second derivatives as vectors projected onto a complex plane; and (d) exciting the resonator an excitation frequency where the real part vanishes.

QUANTUM CIRCUITS FOR UNITARY EVOLUTION OF LOW-ENERGY STATES

Resumen de: AU2025261035A1

Methods, systems, and apparatus for Hamiltonian simulation of low-energy initial quantum states. In one aspect, a quantum circuit that performs unitary time evolution for a Hamiltonian is determined. The Hamiltonian is mapped to a corresponding gap-amplifiable Hamiltonian with a low energy subspace, the gap-amplifiable Hamiltonian comprising one or more matrices, where each matrix comprises a respective block encoding that is dependent on a parameter λ. An intermediate Hamiltonian is determined, where eigenvalues of the intermediate Hamiltonian are the same as eigenvalues of a square root of the gap-amplifiable Hamiltonian. A block encoding of the intermediate Hamiltonian divided by the square root of λ is determined. A filter is applied to the block encoding to obtain a polynomial approximation of the unitary time evolution operator for the Hamiltonian. The quantum circuit is applied to an initial state that is supported in the low-energy subspace.

EXPONENTIAL QUANTUM ADVANTAGE FOR MEASURING FERMIONIC OPERATORS

Resumen de: AU2025214821A1

Method, systems, and apparatus for measuring fermionic operators. In one aspect, a method includes obtaining an input comprising k-body Majorana operators, a predefined precision, and copies of a tensor product of a quantum state and the quantum state. For each Majorana operator, a basis to measure the Majorana operator in is determined. The input is processed to obtain expectation values that correspond to the Majorana operators. A graph is constructed by, for each non-zero expectation value, adding a vertex to the graph that represents a Majorana operator that corresponds to the non-zero expectation value and adding edges between vertices in the graph that represent anticommuting Majorana operators. A vertex coloring algorithm is applied to the graph. For a color that corresponds to the Majorana operator, a simultaneous eigenbasis of Majorana operators in the graph with the color is determined. The Majorana operator is measured in the determined basis.

ARTIFICIAL INTELLIGENCE (AI) AND SOFTWARE DEFINED NETWORK (SDN)-ENABLED QUANTUM SIGNALING ENTANGLEMENT DISTRIBUTION

Resumen de: US20260269954A1

Aspects of the subject disclosure may include, for example, receiving artificial intelligence (AI) analytics from a generative AI system, and based on the AI analytics, causing a software defined network (SDN) controller to identify a signaling path over a quantum signaling network, thereby enabling selection of a determined suitable path for quantum entanglement distribution. Other embodiments are disclosed.

QUANTUM DEVICE

Resumen de: US20260268195A1

A quantum device includes a quantum bit element that includes a first diamond crystal layer having a first center point and having a shape extending in four directions from the first center point, a second diamond crystal layer having a second center point and having a shape extending in four directions from the second center point, and a color center present in one of the first diamond crystal layer and the second diamond crystal layer, the first diamond crystal layer and the second diamond crystal layer being stacked so that at least parts of the first center point and the second center point overlap each other, a first optical waveguide connected to each of four first ends of the first diamond crystal layer, and a second optical waveguide connected to each of four second ends of the second diamond crystal layer.

CLASSICAL-QUANTUM HYBRID APPROACH TO MULTI-HOP ROUTING IN CARGO LOGISTICS

Resumen de: AU2025235576A1

An optimal route can be determined for delivering an item through a logistics system where vehicles have multiple stops when traveling along routes. The optimal route is determined using a hybrid system employing a classical computing device and a quantum annealer. The classical device reduces the search space that allows the quantum annealer to determine a more optimal solution. In an aspect, a routing graph comprising nodes and edges is populated from routes of vehicles, where the nodes identify locations and the edges represent routing data. At least a portion of the nodes and edges is removed to form a refined routing graph. For an origin–destination input, the refined routing graph can be filtered according to a first set of routing constraints to form a reduced route search space. A quantum annealer is invoked according to an objective and a different second set of routing constraints.

INTEGRATED PULSE OPTIMIZER AND SIMULATOR FOR HIGH-FIDELITY TWO-QUBIT GATES ON TRAPPED IONS

Resumen de: US20260268189A1

Technologies for simulating and optimizing electromagnetic pulses are disclosed herein. A quantum computing system generates, based on a specification of one or more system parameters, one or more control values, and one or more noise offsets, a controlled environment for a quantum computing system. The quantum computing system simulates, as a function of the control values, one or more pulses within the controlled environment. One or more candidate pulses are identified based on an evaluation of the simulated pulses. A sequence comprising properties of at least one of the candidate pulses is returned.

QUANTUM BIT ARRAY AND METHOD OF CONTROLLING QUANTUM BIT

Resumen de: US20260268192A1

In a dynamic resonance frequency changing method, there is a problem in phase tracking, and there is a concern that an error of a single-qubit gate occurs. The solution is a method of controlling a quantum bit that controls a spin state of a quantum bit formed by a charge trapped in a semiconductor device. The method includes: when controlling a spin state of a quantum bit formed by a target charge specified by a first line and a second line formed in the semiconductor device, executing a first step of measuring at least one of a current and a charge amount flowing through the first line and the second line; and executing a second step of controlling at least one of the current and the charge amount flowing through the first line and the second line based on a measurement result of the first step.

Parallel Cross Entropy Benchmarking

Resumen de: US20260268187A1

Methods, systems and apparatus for benchmarking quantum computing hardware. In one aspect, a method includes defining an initial circuit configured to operate on an array of qubits, wherein the initial circuit comprises multiple instances of the two-qubit gate, wherein each instance of the two-qubit gate performs a same operation on a respective pair of neighboring qubits in the array; partitioning the initial circuit into multiple layers, wherein instances of the two-qubit gate in a respective layer can be implemented in parallel; for each of the multiple layers: constructing benchmarking circuits for the layer, wherein each benchmarking circuit for the layer comprises one or more cycles of quantum gates, each cycle comprising: the layer of instances of the two-qubit gate, and a plurality of single qubit gates; implementing the constructed benchmarking circuits to obtain experimental benchmarking data; and adjusting control parameters of the control model using the experimental benchmarking data.

PREPARING SUPERPOSITIONS OF COMPUTATIONAL BASIS STATES ON A QUANTUM COMPUTER

Nº publicación: US20260268196A1 10/09/2026

Solicitante:

GOOGLE LLC [US]
Google LLC

Resumen de: US20260268196A1

0000 Methods, systems and apparatus for preparing arbitrary superposition quantum states of a quantum register on a quantum computer, the quantum state comprising a superposition of L computational basis states. In one aspect, a register of log L qubits is prepared in a weighted sum of register basis states, where each register basis state indexes a corresponding quantum state computational basis state, and the amplitude of each register basis state in the weighted sum of register basis states is equal to the amplitude of the corresponding computational basis state in the superposition of L computational basis states. A unitary transformation that maps the register basis states to the corresponding L computational basis states is then implemented, including, for each index 1 to L, controlling, by the register of log L qubits, transformation of the quantum system register state for the index to the corresponding computational basis state for the index.