# US 2026/0088979 A1 · Encryption system and method for quantum annealers

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0088979 A1
- Document ID: US20260088979A1
- Status: Published application
- Kind: A1
- Application number: 18/933,689
- Filed: 2024-10-31
- Published: 2026-03-26
- Earliest claimed: 2024-09-26
- Assignees: Multiverse Computing S.L.
- Applicants: Multiverse Computing S.L.
- Inventors: Gentile Fabio; Mohammad Dib; Jaime Vallejo Benitez-Cano; Aser Cortines; Roman Orus
- Web page: https://patentgrep.com/patent/US20260088979A1

## CPC

- H04L 9/0852: {Quantum cryptography (transmission systems employing electromagnetic waves other than radio waves, e.g. light, infrared H04B10/00; wavelength-division multiplex systems H04J14/02; WDM arrangements H04J14/03)}
- H04L 63/0428: {wherein the data content is protected, e.g. by encrypting or encapsulating the payload}
- G06F 21/602: {Providing cryptographic facilities or services}
- G06F 21/606: {by securing the transmission between two devices or processes}
- G06N 3/044: Recurrent networks, e.g. Hopfield networks
- G06N 3/045: Combinations of networks
- G06N 3/08: Learning methods
- G06N 5/01: Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
- G06N 7/01: Probabilistic graphical models, e.g. probabilistic networks
- G06N 10/00: Quantum computing, i.e. information processing based on quantum-mechanical phenomena
- G06N 10/20: Models of quantum computing, e.g. quantum circuits or universal quantum computers
- G06N 10/60: Quantum algorithms, e.g. based on quantum optimisation, quantum Fourier or Hadamard transforms
- G06N 20/00: Machine learning
- G06N 20/20: Ensemble learning
- H04L 9/008: {involving homomorphic encryption}
- H04L 9/06: the encryption apparatus using shift registers or memories for block-wise {or stream} coding, e.g. DES systems {or RC4; Hash functions; Pseudorandom sequence generators}
- H04L 9/0825: {using asymmetric-key encryption or public key infrastructure [PKI], e.g. key signature or public key certificates}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A computer-implemented method for an encryption for secure communication between devices during quantum annealing or QUBO-based routines, which are executed on a quantum device with configurations determined or supported by at least one classical computing device, wherein the encryption and decryption of data are managed by the classical computing device, the method including, within a QUBO based routine that includes set of pre-trained weak learners that provide output for test values and weight adjustment process for these weak learners and after the discretized to model it as a QUBO; using different encoding depths for different weights with the assigning the weights randomly according to the correlation in between the weak learners with the registration of this encoding information; shuffling the order of the variables; converting the QUBO matrix; decrypting the data.

## Claims

### Claim 1

An encryption method for secure communication between devices during quantum annealing or QUBO-based routines, which are executed on a quantum device with configurations determined or supported by at least one classical computing device, wherein the encryption and decryption of data are managed by the classical computing device,
wherein, within a QUBO based routine that includes set of pre-trained weak learners that provide output for test values and weight adjustment process for these weak learners and after the discretized to model it as a QUBO;
to encrypt the weights of the weak learners, at least one of bellow step or combination more than one with storing combination order in at least one storage medium;
using different encoding depths for different weights with the assigning the weights according to the correlation in between the weak learners with the registration of this encoding information;
shuffling the order of the variables randomly with the registering this order information; and
converting the QUBO matrix, which is stored in at least one storage medium and generating a string which includes two different number whose length matches the solution space dimensionality and registering the strings with spin flipping these numbers; and
to decrypt the data which is received from at least one quantum device with encrypted by classical computing device before the transfer procedure using encoding information, order information, spin flipped result, combination order information or suitable combination of them according to the encryption.

### Claim 2 (depends on 1)

An encryption method for a computing system according to claim 1, wherein selection batches of weak learners and selects those weak learners that perform better to construct the final strong classifier with repeating with different values of regularization parameter with checking the error.

### Claim 3 (depends on 2)

An encryption method for a computing system according to claim 2, wherein, if the error of the entire candidate list increases its accuracy, searching and adding for weak learner candidates to be added to the list.

### Claim 4 (depends on 1)

An encryption method for a computing system according to claim 1, wherein converting the QUBO matrix, which is stored in at least one storage medium, into the equivalent Ising Hamiltonian with storing at least one storage medium, and generating a string which includes two different number whose length matches the solution space dimensionality and registering the strings with spin flipping these numbers to create private encryption key.

### Claim 5 (depends on 2)

A method according to the claim 2, further comprising changing the diagonal elements of the Ising Hamiltonian accordingly to the encryption key.

### Claim 6 (depends on 5)

A method according to claim 5, wherein, after converting the QUBO matrix and flipping the spins changing the signs of the weights of the weak learners according to the encryption key. Which created with registering the strings with spin flipping.

### Claim 7 (depends on 1)

A method according to claim 1, further comprising assigning weights according to correlation in between the weak learners and the ground truth.

### Claim 8 (depends on 5)

A method according to claim 5 wherein, after detecting the weak learners and encoding picked good weak learners to shallower/simplifier, which performs relatively well on the task at hand, and which has a strong correlation with the ground truth and encoding bad weak learners deeper.

### Claim 9 (depends on 1)

A method according to claim 1, wherein, after detecting the weak learners and encoding picked bad weak learners to deeper with longer strings, which has weaker correlation with the ground truth rather than good weak learners.

### Claim 10 (depends on 1)

A method according to claim 1, further comprising using a section of uncoupled (or weakly coupled) qubits holding random elements. To be compatible with the rest of the problem this partition needs to be uncoupled or very weakly couple with the rest of the problem and present a matrix sparsity matching the remaining part of the problem.

### Claim 11 (depends on 1)

A computer program product comprising instructions which, when the program is executed by at least one computing unit, cause the at least one computing unit to carry out a method according to claim 1.

### Claim 12 (depends on 10)

A computer-readable data carrier having stored there on a computer program product according to claim 10.

### Claim 13

An encryption system for secure communication between devices during quantum annealing or QUBO-based routines, which are executed on a quantum device with configurations determined or supported by at least one classical computing device according to the method that defined any of the above claims, the system comprising:
a main encoding module that uses different encoding depths for different weights with the assigning the weights randomly according to the correlation in between the weak learners with the registration of this encoding information on QUBO model;
a secondary encryption module that converts the QUBO matrix, which is stored in at least one storage medium and generating a string with at least one string generation module, with two different number whose length matches the solution space dimensionality and registers the strings that spin flipped with a flipping module;
a shuffling module that changes the order of the variables randomly with the registering this order information with a registration key;
wherein a decryption module decrypts of the data which is received from at least one quantum device with encrypted by classical computing device before the transfer procedure with using encoding information, order information, spin flipped result, combination order information or suitable combination of them according to the encryption.

### Claim 14 (depends on 13)

The system according to the claim 13, further comprising at least one classical computer that includes a processor that initialized the data and at least one quantum device that communicated the classical computer and includes at least one quantum processor as a computing unit.
