IP Library › Granted Patent US 12,386,609
Granted Patent B2
US 12,386,609 · App. 18/161,410 · Granted Aug 12, 2025

Superdense coding of software package deltas

Inventors: Leigh Griffin (Waterford, IE); Stephen Coady (Dublin, IE)
Assignee: Red Hat, Inc.
G06F8/658H04B10/70
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,386,609
App. No.
18/161,410
Granted
Aug 12, 2025
Kind
B2
Abstract

A package delta that identifies differences between a first software package and a second software package is accessed. It is determined that the package delta is to be securely communicated to a second quantum computing system upon the occurrence of a first condition. It is determined that the first condition has occurred. In response to determining that the first condition has occurred, the package delta is transferred to the second quantum computing system using superdense coding.

Claims (57)

1. A method comprising:

accessing, by a first quantum computing system (QCS), a package delta that identifies differences between a first software package and a second software package;

determining, by the first QCS, that the package delta is to be securely communicated to a second QCS upon an occurrence of a first condition;

determining, by the first QCS, that the first condition has occurred; and

in response to determining, by the first QCS, that the first condition has occurred, transferring, by the first QCS, the package delta to the second QCS using superdense coding, wherein transferring, by the first QCS, the package delta to the second QCS using superdense coding comprises:

determining a quantity of binary bits of the package delta, wherein the quantity of binary bits of the package delta comprises a pair of binary bits of the package delta;

determining a first set of qubits, wherein the first set of qubits is suitable for communicating values of the pair of binary bits of the package delta using superdense coding;

entangling each qubit in the first set of qubits with a corresponding qubit in a second set of qubits;

superdense coding each qubit in the first set of qubits with the pair of binary bits of the package delta; and

sending the first set of qubits to the second QCS.

2. The method of claim 1 wherein the first condition comprises a usage of a quantum channel between the first QCS and the second QCS is below a channel usage threshold.

3. The method of claim 1 wherein the first condition is a priority of the package delta.

4. The method of claim 1 wherein the first condition comprises a receipt of a request for the package delta from the second QCS.

5. The method of claim 1 further comprising:

receiving, by the first QCS, a first version of a software package;

subsequently receiving, by the first QCS, a second version of the software package; and

analyzing the first version of the software package and the second version of the software package to generate the package delta.

6. The method of claim 1 further comprising:

determining, by the first QCS, that the package delta is to be securely communicated to a third QCS upon an occurrence of a second condition;

determining, by the first QCS, that the second condition has occurred; and

in response to determining, by the first QCS, that the second condition has occurred, transferring, by the first QCS, the package delta to the third QCS using superdense coding.

7. The method of claim 1 wherein the second set of qubits is at the first QCS, and further comprising:

subsequent to entangling each qubit in the first set of qubits with the corresponding qubit in the second set of qubits, sending, by the first QCS to the second QCS, the second set of qubits.

8. The method of claim 1 wherein the second set of qubits is at the second QCS prior to being entangled with the first set of qubits.

9. The method of claim 1 wherein each qubit in the first set of qubits is entangled with the corresponding qubit in the second set of qubits prior to the occurrence of the first condition.

10. The method of claim 1 further comprising:

maintaining a sequence of the first set of qubits; and

sending, by the first QCS to the second QCS, the sequence of the first set of qubits.

11. A first quantum computing system (QCS) comprising:

a memory; and

a processor device coupled to the memory to:

access a package delta that identifies differences between a first software package and a second software package;

determine that the package delta is to be securely communicated to a second QCS upon an occurrence of a first condition;

determine that the first condition has occurred; and

in response to determining that the first condition has occurred, transfer the package delta to the second QCS using superdense coding, wherein transferring the package delta to the second QCS using superdense coding comprises:

determining a quantity of binary bits of the package delta, wherein the quantity of binary bits of the package delta comprises a pair of binary bits of the package delta;

determining a first set of qubits, wherein the first set of qubits is suitable for communicating values of the pair of binary bits of the package delta using superdense coding;

entangling each qubit in the first set of qubits with a corresponding qubit in a second set of qubits;

superdense coding each qubit in the first set of qubits with the pair of binary bits of the package delta; and

sending the first set of qubits to the second QCS.

12. The first quantum computing system (QCS) of claim 11 wherein the second set of qubits is at the first QCS, and wherein the processor device is further to:

subsequent to entangling each qubit in the first set of qubits with the corresponding qubit in the second set of qubits, send, to the second QCS, the second set of qubits.

13. The first quantum computing system (QCS) of claim 11 wherein the second set of qubits is at the second QCS prior to being entangled with the first set of qubits.

14. The first quantum computing system (QCS) of claim 11 wherein each qubit in the first set of qubits is entangled with the corresponding qubit in the second set of qubits prior to the occurrence of the first condition.

15. A non-transitory computer-readable storage medium that stores executable instructions to cause a processor device of a first quantum computing system (QCS) to:

access a package delta that identifies differences between a first software package and a second software package;

determine that the package delta is to be securely communicated to a second QCS upon an occurrence of a first condition;

determine that the first condition has occurred; and

in response to determining that the first condition has occurred, transfer the package delta to the second QCS using superdense coding, wherein transferring the package delta to the second QCS using superdense coding comprises:

determining a quantity of binary bits of the package delta, wherein the quantity of binary bits of the package delta comprises a pair of binary bits of the package delta;

determining a first set of qubits, wherein the first set of qubits is suitable for communicating values of the pair of binary bits of the package delta using superdense coding;

entangling each qubit in the first set of qubits with a corresponding qubit in a second set of qubits;

superdense coding each qubit in the first set of qubits with the pair of binary bits of the package delta; and

sending the first set of qubits to the second QCS.

16. The non-transitory computer-readable storage medium of claim 15 wherein the second set of qubits is at the first QCS, and wherein the executable instructions further cause the processor device of the first QCS to:

subsequent to entangling each qubit in the first set of qubits with the corresponding qubit in the second set of qubits, send, to the second QCS, the second set of qubits.

17. The non-transitory computer-readable storage medium of claim 15 wherein the second set of qubits is at the second QCS prior to being entangled with the first set of qubits.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 30, 2023
From: GRIFFIN, LEIGH; COADY, STEPHEN
To: RED HAT, INC.
Reel/Frame 062532/0566 →
Continuity (1)
Related Publication 20240256270A1 · Aug 1, 2024
References Cited (20)
US 8370829B2 · Ferris et al. · 2013 [cited by applicant]
US 10756826B1 · Coady et al. · 2020 [cited by applicant]
US 11133823B2 · Griffin et al. · 2021 [cited by applicant]
US 11360924B1 · Griffin et al. · 2022 [cited by applicant]
US 20030220944A1 · Lyman Schottland · 2003 [cited by examiner]
US 20050289533A1 · Wang · 2005 [cited by examiner]
US 20060112113A1 · Gu · 2006 [cited by examiner]
US 20070234343A1 · Gouge · 2007 [cited by examiner]
US 20200201655A1 · Griffin · 2020 [cited by examiner]
US 20200366316A1 · Griffin · 2020 [cited by examiner]
US 20210273792A1 · Coady · 2021 [cited by examiner]
US 20210398008A1 · Griffin · 2021 [cited by examiner]
US 20220051121A1 · Griffin · 2022 [cited by examiner]
US 20220237146A1 · Griffin · 2022 [cited by examiner]
US 20220269976A1 · Wang · 2022 [cited by examiner]
US 20220308966A1 · Coady et al. · 2022 [cited by applicant]
US 20230370254A1 · McCarty · 2023 [cited by examiner]
Kowalewski, Marcus, et al., “Sustainable Packaging of Quantum Chemistry Software with the Nix Package Manager,” Int. J. Quantum Chem., 122, e26872, http://arxiv.org/abs/2110.05163v2, Dec. 16, 2021, 15 pages. [cited by applicant]
Weder, Benjamin, et al., “Hybrid Quantum Applications Need Two Orchestrations in Superposition: A Software Architecture Perspective,” 2021 IEEE International Conference on Web Services (ICWS), doi: 10.1109/ICWS53863.202… [cited by applicant]
Zhukov, A.A., et al., “Quantum communication protocols as a benchmark for programmable quantum computers,” Quantum Information Processing (2019) 18:31, https://doi.org/10.1007/s11128-018-2144-y, Dec. 6, 2018, 23 pages. [cited by applicant]