# US 2024/0256934 A1 · Entangling photonic graphs

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

- Number: US 2024/0256934 A1
- Document ID: US20240256934A1
- Status: Published application
- Kind: A1
- Application number: 18/299,819
- Filed: 2023-04-13
- Published: 2024-08-01
- Earliest claimed: 2021-04-27
- Assignees: Quantum Source Labs Ltd.; Yeda Research and Development Co. Ltd.
- Applicants: Quantum Source Labs Ltd.; Yeda Research and Development Co. Ltd.
- Inventors: Gil SEMO; Ziv AQUA; Oded MELAMED; Dan CHARASH; Serge ROSENBLUM; Barak DAYAN
- Web page: https://patentgrep.com/patent/US20240256934A1

## CPC

- G06N 10/20: Models of quantum computing, e.g. quantum circuits or universal quantum computers
- G06N 10/40: Physical realisations or architectures of quantum processors or components for manipulating qubits, e.g. qubit coupling or qubit control
- G21K 5/00: Irradiation devices (discharge tubes for irradiating H01J37/00)
- H10D 48/383: {Quantum effect devices, e.g. of devices using quantum reflection, diffraction or interference effects}
- H10H 20/812: within the light-emitting regions, e.g. having quantum confinement structures
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G21K: HANDLING OF PARTICLES OR IONISING RADIATION NOT OTHERWISE PROVIDED FOR; IRRADIATION DEVICES; GAMMA RAY OR X-RAY MICROSCOPES
- H10D: INORGANIC ELECTRIC SEMICONDUCTOR DEVICES
- H10H: INORGANIC LIGHT-EMITTING SEMICONDUCTOR DEVICES HAVING POTENTIAL BARRIERS

## Abstract

A quantum computing method includes initializing a state of a resonator-coupled quantum emitter, receiving at least two photonic graph states, selecting at least one photon from each graph state, feeding the selected photons through an entangling gate via the resonator-coupled quantum emitter, and disentangling the resonator-coupled quantum emitter from the selected photons. Each of the at least two photonic graph states contains at least two photons. The disentangling includes at least one of detecting the state of the resonator-coupled quantum emitter or mapping the state of the resonator-coupled quantum emitter to a state of an additional photon.

## Claims

### Claim at position 1

1-60. (canceled)

### Claim 61

A quantum computing method, comprising:
initializing a state of a resonator-coupled quantum emitter;
receiving at least two photonic graph states, each of the at least two photonic graph states containing at least two photons;
selecting at least one photon from each graph state;
feeding the selected photons through an entangling gate via the resonator-coupled quantum emitter; and
disentangling the resonator-coupled quantum emitter from the selected photons, wherein disentangling includes at least one of detecting the state of the resonator-coupled quantum emitter or mapping the state of the resonator-coupled quantum emitter to a state of an additional photon.

### Claim 62 (depends on 61)

The method of claim 61, wherein the entangling gate is one of a controlled-Z gate (CZ gate), a controlled NOT gate (CNOT gate), a square root of a SWAP gate, or an imaginary SWAP gate (iSWAP gate).

### Claim 63 (depends on 61)

The method of claim 61, wherein feeding the selected photons through an entangling gate occurs sequentially.

### Claim 64 (depends on 61)

The method of claim 61, wherein the mapping is achieved by applying a SWAP gate on the quantum emitter and an additional photon.

### Claim 65 (depends on 61)

The method of claim 61, wherein the initialized state of the resonator-coupled quantum emitter is an equal superposition of two ground states.

### Claim 66 (depends on 61)

The method of claim 61, wherein the quantum emitter includes a stationary qubit capable of interacting with photons.

### Claim 67 (depends on 61)

The method of claim 61, wherein the quantum emitter includes a superconducting qubit.

### Claim 68 (depends on 61)

The method of claim 61, wherein the quantum emitter includes a quantum dot.

### Claim 69 (depends on 61)

The method of claim 61, wherein the quantum emitter includes an atom that is neutral.

### Claim 70 (depends on 61)

The method of claim 61, wherein the quantum emitter includes an atom that is an ion.

### Claim 71 (depends on 61)

The method of claim 61, wherein the quantum emitter includes a rubidium atom or a cesium atom.

### Claim 72 (depends on 61)

The method of claim 61, wherein the quantum emitter includes at least one of Strontium, Erbium, Ytterbium, Calcium, Barium, Beryllium, or Magnesium atom.

### Claim 73

A quantum computing system, comprising:
a resonator-coupled quantum emitter;
a plurality of switches; and
at least one processor configured to control the plurality of switches to:
initialize a state of the resonator-coupled quantum emitter;
receive at least two photonic graph states, each of the at least two photonic graph states containing at least two photons;
select at least one photon from each graph state;
feed the selected photons through an entangling gate via the resonator-coupled quantum emitter; and
disentangle the resonator-coupled quantum emitter from the selected photons, wherein disentangling includes at least one of detecting the state of the resonator-coupled quantum emitter or mapping the state of the resonator-coupled quantum emitter to a state of an additional photon.

### Claim 74 (depends on 73)

The system of claim 73, wherein the entangling gate is one of a controlled-Z gate (CZ gate), a controlled NOT gate (CNOT gate), a square root of a SWAP gate, or an imaginary SWAP gate (iSWAP gate).

### Claim 75 (depends on 73)

The system of claim 73, wherein feeding the selected photons through an entangling gate occurs sequentially.

### Claim 76 (depends on 73)

The system of claim 73, wherein the mapping is achieved by applying a SWAP gate on the quantum emitter and an additional photon.

### Claim 77 (depends on 73)

The system of claim 73, wherein the initialized state of the resonator-coupled quantum emitter is an equal superposition of two ground states.

### Claim 78 (depends on 73)

The system of claim 73, wherein the quantum emitter includes a stationary qubit capable of interacting with photons.

### Claim 79 (depends on 73)

The system of claim 73, wherein the quantum emitter includes one of a superconducting qubit, a quantum dot, or an atom.

### Claim 80

A non-transitory computer-readable medium including instructions that, when executed by at least one processor, cause the at least one processor to carry out a quantum computing method, comprising:
initializing a state of a resonator-coupled quantum emitter;
receiving at least two photonic graph states, each of the at least two photonic graph states containing at least two photons;
selecting at least one photon from each graph state;
feeding the selected photons through an entangling gate via the resonator-coupled quantum emitter; and
disentangling the resonator-coupled quantum emitter from the selected photons, wherein disentangling includes at least one of detecting the state of the resonator-coupled quantum emitter or mapping the state of the resonator-coupled quantum emitter to a state of an additional photon.

### Claim at position 22

81-120. (canceled)
