# US 2026/0154596 A1 · Methods and systems for constrained optimization using subspace correction codes

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

- Number: US 2026/0154596 A1
- Document ID: US20260154596A1
- Status: Published application
- Kind: A1
- Application number: 18/750,946
- Filed: 2024-06-21
- Published: 2026-06-04
- Earliest claimed: 2023-06-22
- Assignees: Atom Computing Inc.
- Applicants: Atom Computing Inc.
- Inventors: Kelly Ann PAWLAK; Jeffrey EPSTEIN; Daniel CROW; Ming LI; Jonathan KING
- Web page: https://patentgrep.com/patent/US20260154596A1

## CPC

- G06N 10/20: Models of quantum computing, e.g. quantum circuits or universal quantum computers
- G06N 10/70: Quantum error correction, detection or prevention, e.g. surface codes or magic state distillation
- G06N 5/01: Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
- G06N 10/00: Quantum computing, i.e. information processing based on quantum-mechanical phenomena
- G06N 10/40: Physical realisations or architectures of quantum processors or components for manipulating qubits, e.g. qubit coupling or qubit control
- G06N 10/60: Quantum algorithms, e.g. based on quantum optimisation, quantum Fourier or Hadamard transforms
- 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
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

Systems, methods, computer-readable media, and techniques disclosed herein provide for preparing a solution to a problem comprising a constraint on a non-classical computer, comprising: (a) providing a state preparation operation, wherein the state preparation operation comprises at least a portion of an implementation of the problem comprising the constraint on the non-classical computer, wherein the state preparation operation is configured to evolve a quantum register to a solution state; (b) applying a constraint detection operation, the constraint detection operation comprising entangling an ancilla qubit with a set of data qubits; and (c) measuring the ancilla qubit to determine whether a constraint of the problem is satisfied.

## Claims

### Claim at position 1

-118. (canceled)

### Claim 119

A method for preparing a solution to a problem comprising a constraint on a non-classical computer, comprising:
(a) providing a state preparation operation, wherein said state preparation operation comprises at least a portion of an implementation of said problem comprising said constraint on said non-classical computer, wherein said state preparation operation is configured to evolve a quantum register to a solution state;
(b) applying a constraint detection operation, said constraint detection operation comprising entangling an ancilla qubit with a set of data qubits; and
(c) measuring said ancilla qubit to determine whether a constraint of said problem is satisfied.

### Claim 120 (depends on 119)

The method of claim 119, wherein said problem is a constrained optimization problem.

### Claim 121 (depends on 119)

The method of claim 119, wherein said state preparation operation is a unitary operation.

### Claim 122 (depends on 119)

The method of claim 119, wherein said ancilla qubit is one of a set of ancilla qubits, and wherein (c) further comprises measuring said set of ancilla qubits.

### Claim 123 (depends on 119)

The method of claim 119, wherein (c) further comprises measuring said set of data qubits.

### Claim 124 (depends on 119)

The method of claim 119, wherein said set of data qubits are comprised of logical qubits, physical qubits, or a combination thereof.

### Claim 125 (depends on 119)

The method of claim 119, wherein measuring said ancilla qubit at (c) comprises: (i) collapsing at least part of a wavefunction into a new wavefunction, and (ii) determining whether said new wavefunction satisfies said constraint.

### Claim 126 (depends on 119)

The method of claim 119, further comprising, subsequent to (c) outputting said solution state.

### Claim 127 (depends on 119)

The method of claim 119, wherein (c) further comprises determining, via a processor, whether said constraint of said problem is satisfied.

### Claim 128 (depends on 119)

The method of claim 119, wherein subsequent to (c), said method further comprises applying one or more recovery operations to said set of data qubits, and wherein measuring said ancilla qubit in (c) comprises an indication that said constraint is not satisfied by said set of data qubits.

### Claim 129 (depends on 128)

The method of claim 128, further comprising determining, via a processor, a sequence of said one or more recovery operations based on an extent to which said constraint is not satisfied.

### Claim 130 (depends on 128)

The method of claim 128, wherein said one or more recovery operations comprise preparing a superposition of states over all possible registers containing a single qubit or m qubits in a |1 computational state.

### Claim 131 (depends on 128)

The method of claim 128, wherein said one or more recovery operations comprise applying a RESET operation; and a) shelving one or more qubits in said |0 state to said |clock 0 state, b) exciting said |clock 0 state with a pulse to said |ryd state for π√{square root over (N)} time, c) applying said Rydberg de-excitation beam to |clock 1; and d) deshelving all qubits from said clock states.

### Claim 132 (depends on 119)

The method of claim 119, wherein said constraint comprises a one-hot-encoding constraint.

### Claim 133 (depends on 132)

The method of claim 132, wherein (b) comprises applying a shelving pulse to said ancilla qubit to excite to a |clock 0 state; applying a multiphoton excitation to said set of logical qubits from a 1-in-n state to a 1-in-(n+1) Rydberg state; applying a Rydberg to |clock 1) pulse on said ancilla qubit; and deshelving said ancilla qubit.

### Claim 134 (depends on 119)

The method of claim 119, wherein said constraint comprises a m-in-n constraint.

### Claim 135 (depends on 134)

The method of claim 134, wherein (b) comprises applying a shelving pulse to said ancilla qubit to excite to a |clock 0 state; applying a multiphoton excitation to said set of logical qubits from an m-in-n state to a m-in-(n+ancilla) Rydberg state; applying a Rydberg to |clock 1 pulse on said ancilla qubit; and deshelving said ancilla qubit.

### Claim 136 (depends on 119)

The method of claim 119, wherein said constraint is an independent set constraint.

### Claim 137 (depends on 136)

The method of claim 136, wherein (b) comprises applying a Toffoli gate at an edge.

### Claim 138 (depends on 119)

The method of claim 119, wherein said constraint is a less than or equal to m-in-n constraint.

### Claim 139 (depends on 138)

The method of claim 138, wherein (b) comprises recursively for all m′ excitations greater than m:
applying a shelving pulse to said ancilla qubit to excite to a |clock 0 state; applying a multiphoton excitation to said set of logical qubits from an m-in-n state to a m-in-(n+ancilla) Rydberg state; applying a Rydberg to |clock 1 pulse on said ancilla qubit; and deshelving said ancilla qubit.

### Claim 140 (depends on 119)

The method of claim 119, wherein said method is integrated with an error correcting code.

### Claim 141 (depends on 119)

The method of claim 119, wherein said quantum register comprises neutral atom qubits.

### Claim 142 (depends on 119)

The method of claim 119, wherein said neutral atom qubits comprise strontium or ytterbium.

### Claim 143 (depends on 119)

The method of claim 119, wherein said quantum register comprises nuclear-spin qubits.

### Claim 144 (depends on 119)

The method of claim 119, wherein said constraint is an implied constraint.

### Claim 145 (depends on 119)

The method of claim 119, wherein said problem is configured to be solved on a non-classical computer.

### Claim 146 (depends on 119)

The method of claim 119, wherein said problem is a satisfiability problem.

### Claim 147 (depends on 119)

The method of claim 119, further comprising repeating operations (a) to (c) until a stopping criterion is met.

### Claim 148 (depends on 147)

The method of claim 147, wherein said stopping criterion comprises reaching a threshold number of iterations or a threshold change in said solution state.

### Claim 149

A non-classical computer operable to perform a constrained optimization on a non-using subspace correction, said non-classical computer comprising:
a quantum register comprising a set of qubits and an ancilla qubit;
a quantum circuit comprising:
(a) a state preparation unitary operation, wherein said state preparation unitary operation comprises at least a portion of an implementation of a constrained optimization problem, wherein said state preparation unitary operation is configured to evolve a quantum register to a solution state;
(b) a constraint detection operation, said constraint detection operation comprising entangling said ancilla qubit with said set of logical qubits; and
(c) a measurement of said ancilla qubit, wherein said measurement is indicative of whether a constraint of said constrained optimization problem is satisfied.

### Claim 150

A classical computer operably connected to a non-classical computer, said classical computer comprising instructions, which when executed, are configured to:
(a) provide a state preparation unitary operation, wherein said state preparation unitary operation comprises at least a portion of an implementation of a constrained optimization problem on said non-classical computer, wherein said state preparation unitary operation is configured to evolve a quantum register to a solution state;
(b) apply a constraint detection operation, said constraint detection operation comprising entangling an ancilla qubit with a set of logical qubits; and
(c) measure said ancilla qubit to determine whether a constraint of said constrained optimization problem is satisfied.
