US 11,934,479 B2
Quantum sparse Fourier transform
Tal Kachman, Haifa (IS); Mark S. Squillante, Greenwich, CT (US); Lior Horesh, North Salem, NY (US); Kenneth Lee Clarkson, Madison, NY (US); John A. Gunnels, Somers, NY (US); Ismail Yunus Akhalwaya, Emmarentia (SA); and Jayram Thathachar, Morgan Hill, CA (US)
Assigned to INTERNATIONAL BUSINESS MACHINES CORPORATION, Armonk, NY (US)
Filed by INTERNATIONAL BUSINESS MACHINES CORPORATION, Armonk, NY (US)
Filed on Oct. 7, 2020, as Appl. No. 17/065,277.
Prior Publication US 2022/0107989 A1, Apr. 7, 2022
Int. Cl. G06F 17/14 (2006.01); G06N 10/00 (2022.01)
CPC G06F 17/141 (2013.01) [G06N 10/00 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A method for performing sparse quantum Fourier transform computation, comprising:
defining a set of quantum circuits, each quantum circuit comprising a Hadamard gate and a single frequency rotation operator, said set of quantum circuits being equivalent to a quantum Fourier transform circuit;
constructing a subset of said quantum circuits in a quantum processor, said quantum processor having a quantum representation of a classical distribution loaded into a quantum state of said quantum processor;
executing said subset of said quantum circuits on said quantum state; and
performing a measurement in a frequency basis to obtain a frequency distribution corresponding to said quantum state.