US 12,236,319 B2
Quantum code with pairwise checks
Matthew Hastings, Seattle, WA (US); and Jeongwan Haah, Redmond, WA (US)
Assigned to Microsoft Technology Licensing, LLC, Redmond, WA (US)
Filed by Microsoft Technology Licensing, LLC, Redmond, WA (US)
Filed on Jun. 30, 2021, as Appl. No. 17/364,812.
Prior Publication US 2023/0027698 A1, Jan. 26, 2023
Int. Cl. G06N 10/70 (2022.01); H03M 13/11 (2006.01); G06N 10/00 (2022.01); H03M 13/00 (2006.01); H03M 13/39 (2006.01)
CPC G06N 10/70 (2022.01) [H03M 13/1102 (2013.01); H03M 13/1191 (2013.01); G06N 10/00 (2019.01); H03M 13/3944 (2013.01); H03M 13/611 (2013.01)] 17 Claims
OG exemplary drawing
 
1. A quantum computing system, comprising:
a plurality of gates;
a plurality of tetrons; and
a processing device coupled to apply a honeycomb code and identify an error based on the applied honeycomb code, wherein the honeycomb code is applied based on measurement of checks associated with respective honeycomb edge directions and connections of paired qubits defined by the plurality of tetrons that are adjacent as assigned to vertices of the honeycomb.