A quantum computing device comprises at least one quantum register including a plurality of logical qubits. A compression engine is coupled to each logical qubit of the plurality of logical qubits. Each compression engine is configured to compress syndrome data. A decompression engine is coupled to each compression engine. Each decompression engine is configured to receive compressed syndrome data, decompress the received compressed syndrome data, and route the decompressed syndrome data to a decoder block.
Legal claims defining the scope of protection, as filed with the USPTO.
2. The quantum computing device of claim 1, wherein at least one of the compression engines are configured to compress the syndrome data using dynamic zero compression.
3. The quantum computing device of claim 1, wherein at least one of the compression engines are configured to compress the syndrome data using sparse representation.
4. The quantum computing device of claim 1, wherein at least one of the compression engines are configured to compress the syndrome data using geometry-based compression.
5. The quantum computing device of claim 1, wherein the plurality of logical qubits are divided into two or more sectors, and wherein a first sector of the one or more sectors is coupled to a first type of compression engine configured to compress syndrome data using a first type of compression, and a second sector of the one or more sectors is coupled to a second type of compression engine configured to compress syndrome data using a second type of compression.
6. The quantum computing device of claim 1, wherein the compression engine is configured to operate at a higher temperature than the quantum register.
7. The quantum computing device of claim 6, wherein the decompression engine and decoder blocks are configured to operate at a higher temperature than the compression engine.
8. The quantum computing device of claim 1, wherein each decompression engine routes decompressed syndrome data to a Graph-Generator module of the decoder block.
9. The quantum computing device of claim 1, wherein the decompressed syndrome data includes at least X syndrome data and Z syndrome data.
10. The quantum computing device of claim 1, wherein the plurality of logical qubits includes l logical qubits, and wherein the quantum computing device comprises a set of d decoder blocks, where d<l.
12. The method of claim 11, wherein at least one of the compression engines is configured to compress the syndrome data using dynamic zero compression.
13. The method of claim 11, wherein at least one of the compression engines is configured to compress the syndrome data using sparse representation.
14. The method of claim 11, further comprising operating the compression engine at a higher temperature than the quantum register.
15. The method of claim 14, further comprising operating the decompression engine and decoder blocks at a higher temperature than the compression engine.
16. The method of claim 11, wherein each decompression engine routes decompressed syndrome data to a Graph-Generator module of the decoder block.
17. The method of claim 11, wherein the quantum computing device comprises a set of d decoder blocks, where d<2*l.
20. The method of claim 18, wherein the number of regions is determined based on an expected number of data blocks that contain trivial syndromes.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
November 18, 2019
August 9, 2022
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.