# US 2026/0254625 A1 · Joint modular multiplicative inverse operations for active volume quantum computing

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

- Number: US 2026/0254625 A1
- Document ID: US20260254625A1
- Status: Published application
- Kind: A1
- Application number: 19/489,704
- Filed: 2024-06-13
- Published: 2026-08-27
- Earliest claimed: 2023-06-14
- Assignees: Psiquantum, Corp.
- Applicants: PsiQuantum, Corp.
- Inventors: Daniel Litinski
- Web page: https://patentgrep.com/patent/US20260254625A1

## CPC

- G06N 10/60: Quantum algorithms, e.g. based on quantum optimisation, quantum Fourier or Hadamard transforms
- H04L 9/0858: {Details about key distillation or coding, e.g. reconciliation, error correction, privacy amplification, polarisation coding or phase coding}
- 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/80: Quantum programming, e.g. interfaces, languages or software-development kits for creating or handling programs capable of running on quantum computers; Platforms for simulating or accessing quantum computers, e.g. cloud-based quantum computing
- 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 9/3066: {involving algebraic varieties, e.g. elliptic or hyper-elliptic curves}
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Systems, methods, and quantum circuits for utilizing a joint modular multiplicative inverse operation to perform quantum decryption. First and second private keys are determined by applying first and second series of quantum phase estimation circuits to first and second pluralities of qubits. The private keys are determined further based on public keys and a base point P. The first and second series of quantum phase estimation circuits include application of a joint modular multiplicative inverse circuit on a first qubit of the first plurality of qubits and a second qubit of the second plurality of qubits that calculates a modular multiplicative inverse of a modular product of a first value of the first qubit and a second value of the second qubit. The first and second private keys are stored in a non-transitory computer-readable memory medium.

## Claims

### Claim at position 1

1-29. (canceled)

### Claim 30

A method, comprising:
determining a first plurality of private keys based at least in part on an application of a first series of quantum phase estimation circuits to a first plurality of qubits, wherein the first plurality of private keys is determined further based at least in part on a first plurality of respective public keys and a base point P;
determining a second plurality of private keys based at least in part on an application of a second series of quantum phase estimation circuits to a second plurality of qubits, wherein the second plurality of private keys is determined further based at least in part on a second plurality of respective public keys and the base point P,
wherein applying the first and second series of quantum phase estimation circuits comprises:
applying at least one joint modular multiplicative inverse circuit on a first qubit of the first plurality of qubits and a second qubit of the second plurality of qubits, wherein the at least one joint modular multiplicative inverse circuit calculates a modular multiplicative inverse of a modular product of a first value of the first qubit and a second value of the second qubit; and
storing the first and second pluralities of private keys in a non-transitory computer-readable memory medium.

### Claim 31 (depends on 30)

The method of claim 30,
wherein applying the at least one joint modular multiplicative inverse circuit further comprises:
performing a modular multiplication of the first value and the second value;
performing a modular multiplication of the first value and the modular multiplicative inverse of the product of the first and second values to obtain a modular multiplicative inverse of the second value; and
performing a modular multiplication of the second value and the modular multiplicative inverse of the product of the first and second values to obtain a modular multiplicative inverse of the first value.

### Claim 32 (depends on 30)

The method of claim 30,
wherein the first and second pluralities of private keys are encrypted with elliptic curve cryptography (ECC).

### Claim 33 (depends on 30)

The method of claim 30,
wherein the first and second series of quantum phase estimation circuits and the joint modular multiplicative inverse circuit utilize an active-volume quantum computing architecture.

### Claim 34 (depends on 30)

The method of claim 30,
wherein determining the first and second pluralities of private keys further comprises:
applying the first and second series of quantum phase estimations circuits to determine approximations of the first and second pluralities of private keys, respectively; and
utilizing a brute force decryption method to determine the first and second pluralities of private key based on the approximations of the first and second pluralities of private keys, respectively.

### Claim 35 (depends on 30)

The method of claim 30,
wherein the first series of quantum phase estimation circuits comprises:
a first subcircuit, the method further comprising applying the first subcircuit to:
apply a series of unitary operators {UP, U2P, . . . , U2nP} to prepare a state |ψc, where c is an integer and n is a total number of bits of each private key of the first plurality of private keys; and
perform a first classical measurement to measure the integer c; and
a second subcircuit, the method further comprising applying the second subcircuit to:
apply a series of unitary operators {UQj, U2Qj, . . . U2nQj} a plurality of times for each of a plurality of values of j={1, . . . , m}, where m is a total number of private keys in the first plurality of private keys, to prepare a plurality of respective states |ψckj for j={1, . . . , m}; and
perform second classical measurements to measure the integers ck,
wherein kj for j={1, . . . , m} are the first plurality of private keys.

### Claim 36 (depends on 30)

The method of claim 30,
wherein the first and second series of quantum phase estimation circuits comprise respective subroutines to determine a value of a parameter λr when a first elliptic curve point P1 is equal to a second elliptic curve point P2.

### Claim 37 (depends on 30)

The method of claim 30,
wherein the first and second series of quantum phase estimation circuits are applied in parallel.

### Claim 38 (depends on 30)

The method of claim 30,
wherein the first and second series of quantum phase estimation circuits utilize an active volume quantum computing architecture.

### Claim 39

A quantum circuit, comprising:
a first series of quantum phase estimation circuits configured to receive as input a first plurality of qubits and output a first plurality of private keys, wherein the first plurality of private keys is output based at least in part on a first plurality of respective public keys and a base point P,
a second series of quantum phase estimation circuits configured to receive as input a second plurality of qubits and output a second plurality of private keys, wherein the second plurality of private keys is output based at least in part on a second plurality of respective public keys and the base point P; and
at least one joint modular multiplicative inverse circuit configured to receive as input a first qubit of the first plurality of qubits and a second qubit of the second plurality of qubits, wherein the at least one joint modular multiplicative inverse circuit is configured to calculate a modular multiplicative inverse of a modular product of a first value of the first qubit and a second value of the second qubit.

### Claim 40 (depends on 39)

The quantum circuit of claim 39,
wherein the at least one joint modular multiplicative inverse circuit is configured to:
perform a modular multiplication of the first value and the second value;
perform a modular multiplication of the first value and the modular multiplicative inverse of the product of the first and second values to obtain a modular multiplicative inverse of the second value; and
perform a modular multiplication of the second value and the modular multiplicative inverse of the product of the first and second values to obtain a modular multiplicative inverse of the first value.

### Claim 41 (depends on 39)

The quantum circuit of claim 39,
wherein the first and second pluralities of private keys are encrypted with elliptic curve cryptography (ECC).

### Claim 42 (depends on 39)

The quantum circuit of claim 39,
wherein the first and second series of quantum phase estimation circuits and the joint modular multiplicative inverse circuit utilize an active-volume quantum computing architecture.

### Claim 43 (depends on 39)

The quantum circuit of claim 39,
wherein the first series of quantum phase estimation circuits comprises:
a first subcircuit, wherein the first subcircuit is configured to:
apply a series of unitary operators {UP, U2P, . . . , U2nP} to prepare a state |ψc, where c is an integer and n is a total number of bits of each private key of the first plurality of private keys; and
perform a first classical measurement to measure the integer c; and
a second subcircuit, wherein the second subcircuit is configured to:
apply a series of unitary operators {UQj, U2Qj, . . . U2nQj} a plurality of times for each of a plurality of values of j={1, . . . , m}, where m is a total number of private keys in the first plurality of private keys, to prepare a plurality of respective states |ψckj for j={1, . . . , m}; and
perform second classical measurements to measure the integers ckj wherein kj for j={1, . . . , m} are the first plurality of private keys.

### Claim 44 (depends on 39)

The quantum circuit of claim 39,
wherein the first and second series of quantum phase estimation circuits comprise respective subcircuits to determine a value of a parameter λr when a first elliptic curve point P1 is equal to a second elliptic curve point P2.

### Claim 45 (depends on 39)

The quantum circuit of claim 39,
wherein the first and second series of quantum phase estimation circuits are configured to be applied in parallel.

### Claim 46 (depends on 39)

The quantum circuit of claim 39,
wherein the quantum circuit implements an active volume quantum computing architecture.

### Claim 47 (depends on 39)

The quantum circuit of claim 39,
wherein, in determining the first and second pluralities of private keys, the first and second series of quantum phase estimation circuits are further configured to:
determine approximations of the first and second pluralities of private keys, respectively; and
utilize a brute force decryption method to determine the first and second pluralities of private key based on the approximations of the first and second pluralities of private keys, respectively.

### Claim 48

A non-transitory computer-readable memory medium comprising program instructions that, when executed by a processor, cause a quantum computing system to:
determine a first plurality of private keys based at least in part on an application of a first series of quantum phase estimation circuits to a first plurality of qubits, wherein the first plurality of private keys is determined further based at least in part on a first plurality of respective public keys and a base point P,
determine a second plurality of private keys based at least in part on an application of a second series of quantum phase estimation circuits to a second plurality of qubits, wherein the second plurality of private keys is determined further based at least in part on a second plurality of respective public keys and the base point P;
wherein, in applying the first and second series of quantum phase estimation circuit, the program instructions are executable to cause the quantum computing system to:
apply at least one joint modular multiplicative inverse circuit on a first qubit of the first plurality of qubits and a second qubit of the second plurality of qubits, wherein the at least one joint modular multiplicative inverse circuit calculates a modular multiplicative inverse of a modular product of a first value of the first qubit and a second value of the second qubit; and
store the first and second pluralities of private keys in the non-transitory computer-readable memory medium.

### Claim 49 (depends on 48)

The non-transitory computer-readable memory medium of claim 48, wherein, in applying the at least one joint modular multiplicative inverse circuit, the program instructions are executable to cause the quantum computing system to:
perform a modular multiplication of the first value and the second value;
perform a modular multiplication of the first value and the modular multiplicative inverse of the product of the first and second values to obtain a modular multiplicative inverse of the second value; and
perform a modular multiplication of the second value and the modular multiplicative inverse of the product of the first and second values to obtain a modular multiplicative inverse of the first value.
